An iterated local search heuristic for the split delivery vehicle routing problem

Computers and Operations Research

Volumn 53, Issue , 2015, Pages 234-249

  Silva, Marcos Melo ^a   Subramanian, Anand ^b   Ochi, Luiz Satoru ^a  

^a FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

^b FEDERAL UNIVERSITY OF PARAÍBA   (Brazil)

Author keywords

Iterated local search; Metaheuristics; Split deliveries; Vehicle routing

Indexed keywords

BENCHMARKING; HEURISTIC ALGORITHMS; NETWORK ROUTING; VEHICLE ROUTING; VEHICLES;

CAPACITATED VEHICLE ROUTING PROBLEM; COMPUTATIONAL EXPERIMENT; ITERATED LOCAL SEARCH; META HEURISTICS; MULTISTART; SPLIT DELIVERY; SPLIT DELIVERY VEHICLE ROUTING;

ROUTING ALGORITHMS;

EID: 85000059488     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2014.08.005     Document Type: Article

References (38)

1. Aleman RE, Hill RR. A tabu search with vocabulary building approach for the vehicle routing problem with split demands. Int J Metaheurist 2010;1(1):55-80.
2. Aleman RE, Zhang X, Hill RR. A ring-based diversification scheme for routing problems. Int J Math Oper Res 2009;1(1):163-90.
3. Aleman RE, Zhang X, Hill RR. An adaptive memory algorithm for the split delivery vehicle routing problem. J Heurist 2010;16(3):441-73.
4. Ambrosino D, Sciomachen A. A food distribution network problem: a case study. IMA J Manag Math 2007;18(1):33-53.
5. Archetti C, Bianchessi N, Speranza MG. A column generation approach for the split delivery vehicle routing problem. Networks 2011;58(4):241-54.
6. Archetti C, Feillet D, Gendreau M, Speranza MG. Complexity of the VRP and SDVRP. Transp Res Part C: Emerg Technol 2011;19(5):741-50.
7. Archetti C, Mansini R, Speranza MG. Complexity and reducibility of the skip delivery problem. Transp Sci 2005;39(2):182-7.
8. Archetti C, Speranza MG. Vehicle routing problems with split deliveries. Int Trans Oper Res 2012;19(1-2):3-22.
9. Archetti C, Speranza MG, Hertz A. A tabu search algorithm for the split delivery vehicle routing problem. Transp Sci 2006;40(1):64-73.
10. Archetti C, Speranza MG, Savelsbergh MWP. An optimization-based heuristic for the split delivery vehicle routing problem. Transp Sci 2008;42(1):22-31.
11. Belenguer JM, Martinez MC, Mota E. A lower bound for the split delivery vehicle routing problem. Oper Res 2000;48(5):801-10.
12. Belfiore P, Yoshizaki HTY. Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil. Eur J Oper Res 2009;199(3):750-8.
13. Boudia M, Prins C, Reghioui M. An effective memetic algorithm with population management for the split delivery vehicle routing problem. In: Bartz-Beielstein T, Blesa Aguilera M, Blum C, Naujoks B, Roli A, Rudolph G, et al., editors. Hybrid metaheuristics. Lecture notes in computer science, vol. 4771. Berlin, Heidelberg: Springer; 2007. p. 16-30.
14. Campos V, Corberán A, Mota E. A scatter search algorithm for the split delivery vehicle routing problem. In: Fink A, Rothlauf F, editors. Advances in computational intelligence in transport, logistics, and supply chain management studies in computational intelligence, vol. 144. Berlin, Heidelberg: Springer; 2008. p. 137-52.
15. Chen S, Golden B, Wasil E. The split delivery vehicle routing problem: applications, algorithms, test problems, and computational results. Networks 2007;49(4):318-29.
16. Croes GA. A method for solving traveling-salesman problems. Oper Res 1958;6(6):791-812.
17. Derigs U, Li B, Vogel U. Local search-based metaheuristics for the split delivery vehicle routing problem. J Oper Res Soc 2010;61(9):1356-64.
18. Dongarra JJ. Performance of various computers using standard linear equations software. Technical report CS-89-85. Computer Science Department, University of Tennessee; 2011.
19. Dror M, Laporte G, Trudeau P. Vehicle routing with split deliveries. Discret Appl Math 1994;50(3):239-54.
20. Dror M, Trudeau P. Savings by split delivery routing. Transp Sci 1989;23(2):141-5.
21. Dror M, Trudeau P. Split delivery routing. Naval Res Logist 1990;37(3):383-402.
22. Gendreau M, Hertz A, Laporte G. A tabu search heuristic for the vehicle routing problem. Manag Sci 1994;40(10):1276-90.
23. Glover F, Rego C. Ejection chain and filter-and-fan methods in combinatorial optimization. 4OR 2006;4(4):263-96.
24. Gulczynski D, Golden B, Wasil E. The split delivery vehicle routing problem with minimum delivery amounts. Transp Res Part E: Logist Transp Rev 2010;46(5):612-26.
25. Hansen P, Mladenović N, Moreno-Pérez JA. Variable neighbourhood search: methods and applications. Ann Oper Res 2010;175(1):367-407.
26. Jin M, Liu K, Bowden RO. A two-stage algorithm with valid inequalities for the split delivery vehicle routing problem. Int J Prod Econ 2007;105(1):228-42.
27. Jin M, Liu K, Eksioglu B. A column generation approach for the split delivery vehicle routing problem. Oper Res Lett 2008;36(2):265-70.
28. Moreno L, deAragão MP, Uchoa E. Improved lower bounds for the split delivery vehicle routing problem. Oper Res Lett 2010;38(4):302-6.
29. Or I. Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking [Thesis]. Northwestern University; 1976.
30. Penna PHV, Subramanian A, Ochi LS. An iterated local search heuristic for the heterogeneous fleet vehicle routing problem. J Heurist 2013;19(2):201-32.
31. Reinelt G. TSPLIB - a traveling salesman problem library. INFORMS J Comput 1991;3(4):376-84.
32. Sierksma G, Tijssen GA. Routing helicopters for crew exchanges on off-shore locations. Ann Oper Res 1998;76(0):261-86.
33. Silva MM, Subramanian A, Vidal T, Ochi LS. A simple and effective metaheuristic for the minimum latency problem. Eur J Oper Res 2012;221(3):513-20.
34. Song SH, Lee KS, Kim GS. A practical approach to solving a newspaper logistics problem using a digital map. Comput Ind Eng 2002;43(1-2):315-30.
35. Subramanian A, Battarra M. An iterated local search algorithm for the travelling salesman problem with pickups and deliveries. J Oper Res Soc 2013;64(3):402-9.
36. Subramanian A, Drummond L, Bentes C, Ochi L, Farias R. A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery. Comput Oper Res 2010;37(11):1899-911.
37. Wilck IV J, Cavalier T. A construction heuristic for the split delivery vehicle routing problem. Am J Oper Res 2012;2(2):153-62.
38. Wilck IV J, Cavalier T. A genetic algorithm for the split delivery vehicle routing problem. Am J Oper Res 2012;2(2):207-16.