Optimal solutions for routing problems with profits

In this paper, we present a branch-and-price algorithm to solve two well-known vehicle routing problems with profits, the Capacitated Team Orienteering Problem and the Capacitated Profitable Tour Problem. A restricted master heuristic is applied at each node of the branch-and-bound tree in order to obtain primal bound values. In spite of its simplicity, the heuristic computes high quality solutions. Several unsolved benchmark instances have been solved to optimality.

[1]  Éric D. Taillard,et al.  A heuristic column generation method for the heterogeneous fleet VRP , 1999, RAIRO Oper. Res..

[2]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[3]  Nicos Christofides,et al.  An algorithm for the resource constrained shortest path problem , 1989, Networks.

[4]  Alain Hertz,et al.  The split delivery capacitated team orienteering problem , 2010, Networks.

[5]  Maria Grazia Speranza,et al.  A column generation approach for the split delivery vehicle routing problem , 2011, Networks.

[6]  Ruslan Sadykov,et al.  Column Generation based Primal Heuristics , 2010, Electron. Notes Discret. Math..

[7]  Nicos Christofides,et al.  The vehicle routing problem , 1976, Revue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle.

[8]  Michel Gendreau,et al.  Traveling Salesman Problems with Profits , 2005, Transp. Sci..

[9]  Giovanni Righini,et al.  Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints , 2006, Discret. Optim..

[10]  Timo Berthold.  Primal Heuristics for Mixed Integer Programs , 2006 .

[11]  Giovanni Righini,et al.  New dynamic programming algorithms for the resource constrained elementary shortest path problem , 2008 .

[12]  Harvey M. Salkin,et al.  A set-partitioning-based exact algorithm for the vehicle routing problem , 1989, Networks.

[13]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

[14]  François Vanderbeck,et al.  On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm , 2000, Oper. Res..

[15]  Alain Hertz,et al.  The capacitated team orienteering and profitable tour problems , 2007, J. Oper. Res. Soc..

[16]  Giovanni Righini,et al.  New dynamic programming algorithms for the resource constrained elementary shortest path problem , 2008, Networks.