New route relaxation and pricing strategies for the vehicle routing problem

Operations Research

Volumn 59, Issue 5, 2011, Pages 1269-1283

  Baldacci, Roberto ^a   Mingozzi, Aristide ^a   Roberti, Roberto ^b  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CAPACITATED VEHICLE ROUTING PROBLEM; DUAL SOLUTIONS; EXACT ALGORITHMS; EXACT METHODS; GENERATION ALGORITHM; LP-RELAXATION; NEW STRATEGY; OPTIMAL SOLUTIONS; PRICING PROBLEMS; PRICING STRATEGY; RUNNING TIME; SET PARTITIONING; STATE-OF-THE-ART ALGORITHMS; SUBJECT CLASSIFICATION; TIME WINDOWS; VALID INEQUALITY; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS; VEHICLE ROUTING PROBLEMS;

ALGORITHMS; INTEGER PROGRAMMING; NETWORK ROUTING; OPTIMIZATION; ROUTING ALGORITHMS; VEHICLE ROUTING; VEHICLES;

PROBLEM SOLVING;

EID: 81455135706     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1110.0975     Document Type: Article

References (26)

1. Augerat, P., J. M. Belenguer, E. Benavent, A. CorberKan, D. Naddef, G. Rinaldi. 1995. Computational results with a branch and cut code for the capacitated vehicle routing problem. Technical Report 1 RR949-M, ARTEMIS-IMAG, Grenoble, France.
2. Baldacci, R., L. D. Bodin, A. Mingozzi. 2006. The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem. Comput. Oper. Res. 33(9) 2667-2702. (Pubitemid 43102512)
3. Baldacci, R., N. Christofides, A. Mingozzi. 2008. An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Math. Programming 115(2) 351-385.
4. Baldacci, R., E. Hadjiconstantinou, A. Mingozzi. 2004. An exact algorithm for the capacitated vehicle routing problem based on a twocommodity network flow formulation. Oper. Res. 52(5) 723-738.
5. Baldacci, R., E. Bartolini, A. Mingozzi, R. Roberti. 2010. An exact solution framework for a broad class of vehicle routing problems. Comput. Management Sci. 7(3) 229-268.
6. Boschetti, M. A., A. Mingozzi, S. Ricciardelli. 2008. A dual ascent procedure for the set partitioning problem. Discrete Optim. 5(4) 735-747.
7. Chabrier, A. 2006. Vehicle routing problem with elementary shortest path based column generation. Comput. Oper. Res. 33(10) 2972-2990. (Pubitemid 43199835)
8. Christofides, N., A. Mingozzi, P. Toth. 1981. Exact algorithms for the vehicle routing problem based on spanning tree and shortest path relaxation. Math. Programming 10(1) 255-280.
9. CPLEX. 2009. IBM ILOG CPLEX 12.1 callable library. ILOG.
10. Danna, E., C. Le Pape. 2005. Accelerating branch-and-price with local search: A case study on the vehicle routing problem with time windows. G. Desaulniers, J. Desrosiers, M. M. Solomon, eds. Column Generation. Springer, New York, 90-130.
11. Desaulniers, G., A. Hadjar, F. Lessard. 2008. Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows. Transportation Sci. 42(3) 387-404.
12. Desrochers, M., J. Desrosiers, M. M. Solomon. 1992. A new optimization algorithm for the vehicle-routing problem with time windows. Oper. Res. 40(2) 342-354.
13. Feillet, D., P. Dejax, M. Gendreau, C. Gueguen. 2004. An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems. Networks 44(3) 216-229. (Pubitemid 39301560)
14. Fukasawa, R., H. Longo, J.Lysgaard,M.Poggi de Aragão,M.Reis, E. Uchoa, R. F. Werneck. 2006. Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math. Programming 106(3) 491-511.
15. Gendreau, M., A. Hertz, G. Laporte. 1994. A tabu search heuristic for the vehicle routing problem. Management Sci. 40(10) 1276-1290.
16. Irnich, S., D. Villeneuve. 2006. The shortest-path problem with resource constraints and k-cycle elimination for k 3/4 3. INFORMS J. Comput. 18(3) 391-406. (Pubitemid 44376263)
17. Jepsen, M., B. Petersen, S. Spoorendonk, D. Pisinger. 2008. Subset-row inequalities applied to the vehicle-routing problem with time windows. Oper. Res. 56(2) 497-511.
18. Kohl, N., O. B. G. Madsen. 1997. An optimization algorithm for the vehicle routing problem with time windows based on Lagrangian relaxation. Oper. Res. 45(3) 395-406. (Pubitemid 127684717)
19. Kohl, N., J. Desrosiers, O. B. G. Madsen, M. M. Solomon, F. Soumis. 1999. 2-path cuts for the vehicle routing problem with time windows. Transportation Sci. 33(1) 101-116. (Pubitemid 129723026)
20. Lysgaard, J., A. N. Letchford, R. W. Eglese. 2004. A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Programming Ser. A 100(2) 423-445. (Pubitemid 40878095)
21. Mingozzi, A., N. Christofides, E. A. Hadjiconstantinou. 1994. An exact algorithm for the vehicle routing problem based on the set partitioning formulation. Technical report, University of Bologna, Bologna, Italy.
22. Pisinger, D., S. Ropke. 2007. A general heuristic for vehicle routing problems. Comput. Oper. Res. 34(8) 2403-2435. (Pubitemid 46073431)
23. Righini, G., M. Salani. 2008. New dynamic programming algorithms for the resource constrained elementary shortest path problem. Networks 51(3) 155-170.
24. Ropke, S. 2005. Heuristic and exact algorithms for vehicle routing problems. Ph.D. thesis, Computer Science Department, University of Copenhagen (DIKU), Copenhagen.
25. Ropke, S. 2010. Private communication.
26. Solomon, M. M. 1987. Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2) 254-265.