2026-07-20T14:47:08Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:4250 2024-03-06T10:29:21Z ddc:004 open_access

Column Generation for Bi-Objective Vehicle Routing Problems with a Min-Max Objective Sarpong, Boadu Mensah Artigues, Christian Jozefowiez, Nicolas Multi-objective optimization column generation integer programming vehicle routing Column generation has been very useful in solving single objective vehicle routing problems (VRPs). Its role in a branch-and-price algorithm is to compute a lower bound which is then used in a branch-and-bound framework to guide the search for integer solutions. In spite of the success of the method, only a few papers treat its application to multi-objective problems and this paper seeks to contribute in this respect. We study how good lower bounds for bi-objective VRPs in which one objective is a min-max function can be computed by column generation. A way to model these problems as well as a strategy to effectively search for columns are presented. We apply the ideas to two VRPs and our results show that strong lower bounds for this class of problems can be obtained in "reasonable" times if columns are intelligently managed. Moreover, the quality of the bounds obtained from the proposed model are significantly better than those obtained from the corresponding "standard" approach. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Boadu Mensah Sarpong and Christian Artigues and Nicolas Jozefowiez 2013 Is Part Of OASIcs, Volume 33, 13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (2013) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.ATMOS.2013.137 urn:nbn:de:0030-drops-42500 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2013.137 eng https://creativecommons.org/licenses/by/3.0/legalcode