  The article presents a study on the biobjective inventory routing problem.
Contrary to most previous research, the problem is treated as a true
multi-objective optimization problem, with the goal of identifying
Pareto-optimal solutions. Due to the hardness of the problem at hand, a
reference point based optimization approach is presented and implemented into
an optimization and decision support system, which allows for the computation
of a true subset of the optimal outcomes. Experimental investigation involving
local search metaheuristics are conducted on benchmark data, and numerical
results are reported and analyzed.
