Branch-and-cut algorithms for the split delivery vehicle routing problem

European Journal of Operational Research

Volumn 238, Issue 3, 2014, Pages 685-698

  Archetti, Claudia ^a   Bianchessi, Nicola ^a   Speranza, M Grazia ^a  

^a UNIVERSITY OF BRESCIA   (Italy)

Author keywords

Branch and cut; Split Delivery Vehicle Routing Problem

Indexed keywords

ALGORITHMS; BENCHMARKING; INTEGER PROGRAMMING; NETWORK ROUTING;

BRANCH-AND-CUT; BRANCH-AND-CUT ALGORITHMS; COMPUTATIONAL RESULTS; FEASIBLE SOLUTION; LOWER BOUNDS; NEW APPROACHES; OPTIMALITY; SPLIT DELIVERY VEHICLE ROUTING;

ROUTING ALGORITHMS;

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

References (20)

1. R. Aleman, and R. Hill A tabu search with vocabulary building approach for the vehicle routing problem with split demands International Journal of Metaheuristics 1 2010 55 80
2. R. Aleman, X. Zhang, and R. Hill An adaptive memory algorithm for the split delivery vehicle routing problem Journal of Heuristics 16 2008 441 473
3. R. Aleman, X. Zhang, and R. Hill A ring-based diversification scheme for routing problems International Journal of Mathematics in Operational Research 1 2009 163 190
4. C. Archetti, N. Bianchessi, and M.G. Speranza A column generation approach for the split delivery vehicle routing problem Networks 58 2011 241 254
5. C. Archetti, A. Hertz, and M.G. Speranza A tabu search algorithm for the split delivery vehicle routing problem Transportation Science 40 2006 64 73
6. C. Archetti, M.W.P. Savelsbergh, and M.G. Speranza Worst-case analysis for split delivery vehicle routing problems Transportation Science 40 2006 226 234
7. C. Archetti, M.W.P. Savelsbergh, and M.G. Speranza An optimization-based heuristic for the split delivery vehicle routing problem Transportation Science 42 2008 21 22
8. C. Archetti, and M.G. Speranza Vehicle routing problems with split deliveries International Transactions in Operational Research 39 2012 3 22
9. J.M. Belenguer, M.C. Martinez, and E. Mota A lower bound for the split delivery vehicle routing problem Operations Research 48 2000 801 810 (Pubitemid 32069966)
10. L. Berbotto, S. García, and F.J. Nogales A randomized granular tabu search heuristic for the split delivery vehicle routing problem Annals of Operations Research 2013 10.1007/s10479-012-1282-3
11. M. Boudia, C. Prins, and M. Reghioui An effective memetic algorithm with population management for the split delivery vehicle routing problem Proceedings of the 4th international conference on hybrid metaheuristics, HM'07 2007 Springer Berlin 16 30
12. Boykov, Y., Kolmogorov, V. (2004). An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. In IEEE transactions on pattern analysis and machine intelligence (PAMI).
13. S. Chen, B. Golden, and E. Wasil The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results Networks 49 2007 318 329 (Pubitemid 47324738)
14. N. Christofides, A. Mingozzi, and P. Toth The vehicle routing problem 1979 Wiley Chichester 315 338
15. G. Desaulniers Branch-and-price-and-cut for the split delivery vehicle routing problem with time windows Operations Research 58 2010 179 192
16. M. Dror, and P. Trudeau Savings by split delivery routing Transportation Science 23 1989 141 145
17. M. Dror, and P. Trudeau Split delivery routing Naval Research Logistics 37 1990 383 402
18. R.W. Floyd Algorithm 97 Communications of the ACM 5 1962 345
19. L. Moreno, M. Poggi de Aragão, and E. Uchoa Improved lower bounds for the split delivery vehicle routing problem Operations Research Letters 38 2010 302 306
20. T.K. Ralphs, L. Kopman, W.R. Pulleyblank, and L.E. Trotter On the capacitated vehicle routing problem Mathematical Programming 94 2003 343 359