A column generation approach for a multi-attribute vehicle routing problem

European Journal of Operational Research

Volumn 241, Issue 3, 2015, Pages 888-906

  Dayarian, Iman ^a,b   Crainic, Teodor Gabriel ^b,d   Gendreau, Michel ^c,d   Rei, Walter ^b,d  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b UNIVERSITÉ DU QUÉBEC À MONTRÉAL   (Canada)

^c ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

^d INTERUNIVERSITY RESEARCH CENTRE ON ENTERPRISE NETWORKS   (Canada)

Author keywords

Branch and price; Dairy transportation problem; Heterogeneous fleet; Multi attribute vehicle routing problem; Multiple depots

Indexed keywords

COMPUTATIONAL EFFICIENCY; INTEGER PROGRAMMING; LINEAR PROGRAMMING; VEHICLE ROUTING; VEHICLES;

BRANCH AND PRICE; HETEROGENEOUS FLEET; MULTIPLE DEPOT; TRANSPORTATION PROBLEM; VEHICLE ROUTING PROBLEMS;

FLEET OPERATIONS;

EID: 84916618474     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2014.09.015     Document Type: Article

References (25)

1. Baldacci R.; and Mingozzi A. A unified exact method for solving different classes of vehicle routing problems Mathematical Programming 120 2 2009 347 380
2. Baldacci R.; Mingozzi A.; and Roberti R. New route relaxation and pricing strategies for the vehicle routing problem Operations Research 59 2011 1269 1283
3. Baldacci R.; Mingozzi A.; and Roberti R. New state-space relaxations for solving the traveling salesman problem with time windows INFORMS Journal on Computing 24 3 2011 356 371
4. Bettinelli A.; Ceselli A.; and Righini G. A branch-and-cut-and-price algorithm for the multi-depot heterogeneous vehicle routing problem with time windows Transportation Research Part C: Emerging Technologies 19 5 2011 723 740
5. Boland N.; Dethridge J.; and Dumitrescu I. Accelerated label setting algorithms for the elementary resource constrained shortest path problem Operations Research Letters 34 1 2006 58 68
6. Clarke G.; and Wright J.W. Scheduling of vehicles from a central depot to a number of delivery points Operations Research 12 4 1964 568 581
7. Cordeau J.-F.; Gendreau M.; and Laporte G. A tabu search heuristic for periodic and multi-depot vehicle routing problems Networks 30 2 1997 105 119
8. Dantzig G.B.; and Ramser J.H. The truck dispatching problem Management Science 6 1 1959 80 91
9. Desaulniers G.; Lessard F.; and Hadjar A. Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows Transportation Science 42 3 2008 387 404
10. Desrochers M. An algorithm for the shortest path problem with resource constraints Technical Report G-88-27 1988 GERAD
11. Desrochers M.; Desrosiers J.; and Solomon M. A new optimization algorithm for the vehicle routing problem with time windows Operations Research 40 1992 342 354
12. Dror M. Note on the complexity of the shortest path models for column generation in VRPTW Operations Research 42 1994 977 978
13. Feillet D.; Dejax P.; Gendreau M.; and Gueguen C. An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems Networks 44 3 2004 216 229
14. Gélinas S.; Desrochers M.; Desrosiers J.; and Solomon M.M. A new branching strategy for time constrained routing problems with application to backhauling Annals of Operations Research 61 1995 91 109
15. Hartl R.F.; Hasle G.; and Janssens G.K. Special issue on rich vehicle routing problems Central European Journal of Operations Research 14 2 2006 103 104
16. Irnich S.; and Villeneuve D. The shortest path problem with resource constraints and k-cycle elimination for k > =3 INFORMS Journal on Computing 18 3 2006 391 406
17. Kohl N.; Desrosiers J.; Madsen O.B.G.; Solomon M.M.; and Soumis F. 2-path cuts for the vehicle routing problem with time windows Transportation Science 33 1 1999 101 116
18. Kohl N.; and Madsen O.B.G. An optimization algorithm for the vehicle routing problem with time windows based on lagrangian relaxation Operations Research 45 3 1997 395 406
19. Lahrichi N.; Crainic T.G.; Gendreau M.; Rei W.; and Rousseau L. Strategic analysis of the dairy transportation problem Journal of Operations Research Society 2013 http://dx.doi.org/10.1057/jors.2013.147
20. Lübbecke M.E.; and Desrosiers J. Selected topics in column generation Operations Research 53 2005 1007 1023
21. Martinelli R.; Pecin D.; and Poggi M. Efficient elementary and restricted non-elementary route pricing European Journal of Operational Research 239 1 2014 102 111 http://dx.doi.org/10.1016/j.ejor.2014.05.005
22. Righini G.; and Salani M. Dynamic programming algorithms for the elementary shortest path problem with resource constraints Electronic Notes in Discrete Mathematics 17 2004 247 249
23. Righini G.; and Salani M. Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming Computers & Operations Research 36 4 2009 1191 1203
24. Solomon M.M. On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints Networks 16 2 1986 161 174
25. Toth P.; and Vigo D. The vehicle routing problem vol. 9 2002 Society for Industrial and Applied Mathematics