An Exact Column Generation-Based Algorithm for Bi-objective Vehicle Routing Problems

We propose a new exact method for bi-objective vehicle routing problems where edges are associated with two costs. The method generates the minimum complete Pareto front of the problem by combining the scalarization of the objective function and the column generation technique. The aggregated objective allows to apply the exact algorithm for the mono-objective vehicle routing problem of Baldacci et al. (2008). The algorithm is applied to a bi-objective VRP with time-windows. Computational results are compared with a classical bi-objective technique. The results show the pertinence of the new method, especially for clustered instances.

[1]  Michel Gendreau,et al.  An exact epsilon-constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits , 2009, Eur. J. Oper. Res..

[2]  M. Balinski,et al.  On an Integer Program for a Delivery Problem , 1964 .

[3]  Martin W. P. Savelsbergh,et al.  The Triangle Splitting Method for Biobjective Mixed Integer Programming , 2014, IPCO.

[4]  Sophie N. Parragh,et al.  Branch-and-bound for bi-objective integer programming , 2018, INFORMS J. Comput..

[5]  Nicolas Jozefowiez,et al.  Multi-objective vehicle routing problems , 2008, Eur. J. Oper. Res..

[6]  Matthias Ehrgott,et al.  A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem , 2015, Eur. J. Oper. Res..

[7]  Melih Özlen,et al.  Multi-objective integer programming: A general approach for generating all non-dominated solutions , 2009, Eur. J. Oper. Res..

[8]  Rui Dai,et al.  A two-stage approach for bi-objective integer linear programming , 2018, Oper. Res. Lett..

[9]  Martin W. P. Savelsbergh,et al.  A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method , 2015, INFORMS J. Comput..

[10]  Nicos Christofides,et al.  An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts , 2008, Math. Program..

[11]  A. M. Geoffrion.  Proper efficiency and the theory of vector maximization , 1968 .

[12]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .