Column Generation for Bi-Objective Vehicle Routing Problems with a Min-Max ObjectiveReportar como inadecuado

Column Generation for Bi-Objective Vehicle Routing Problems with a Min-Max Objective - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

1 LAAS-MOGISA LAAS - Laboratoire d-analyse et d-architecture des systèmes Toulouse

Abstract : 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.

Keywords : Multi-objective optimization column generation integer programming vehicle routing

Autor: Boadu Mensah Sarpong - Christian Artigues - Nicolas Jozefowiez -



Documentos relacionados