Abstract
The article presents a study on a biobjective generalization of the inventory routing problem, an important optimization problem found in logistical networks in which aspects of inventory management and vehicle routing intersect. A compact solution representation and a heuristic optimization approach are presented, and experimental investigations involving novel benchmark instances are carried out. As the investigated problem is computationally very demanding, only a small subset of solutions can be computed within reasonable time. Decision support is nevertheless obtained by means of a set of reference points, which guide the search towards the Pareto-front. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Geiger, M. J., & Sevaux, M. (2011). The biobjective inventory routing problem - Problem solution and decision support. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6701 LNCS, pp. 365–378). https://doi.org/10.1007/978-3-642-21527-8_41
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
