A Randomized Granular Tabu Search heuristic for the split delivery vehicle routing problem

Annals of Operations Research

Volumn 222, Issue 1, 2014, Pages 153-173

  Berbotto, Leonardo ^a   García, Sergio ^a   Nogales, Francisco J ^a  

^a UNIVERSIDAD CARLOS III DE MADRID   (Spain)

Author keywords

Granular neighborhood; Split deliveries; Tabu search; Vehicle routing problem

Indexed keywords

EID: 84872050262     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-012-1282-3     Document Type: Article

References (30)

1. Aleman, R., & Hill, R. (2010). A tabu search with vocabulary building approach for the vehicle routing problem with split demands. International Journal of Metaheuristics, 1(1), 55–80.
2. Aleman, R., Zhang, X., & Hill, R. (2008). An adaptive memory algorithm for the split delivery vehicle routing problem. Journal of Heuristics, 16(3), 441–473.
3. Aleman, R., Zhang, X., & Hill, R. (2009). A ring-based diversification scheme for routing problems. International Journal of Mathematics in Operational Research, 1(1), 163–190.
4. Archetti, C., & Speranza, M. (2004). Vehicle routing in the 1-skip collection problem. Journal of the Operational Research Society, 55(7), 717–727.
5. Archetti, C., & Speranza, M. (2008). The split delivery vehicle routing problem: a survey. In B. Golden, S. Raghavan, & E. Wasil (Eds.), The vehicle routing problem. Latest advances and new challenges (pp. 103–122). Berlin: Springer.
6. Archetti, C., & Speranza, M. (2011). Vehicle routing problems with split deliveries. International Transactions in Operational Research, 19(1–2), 3–22
7. Archetti, C., Savelsbergh, M., & Speranza, M. (2006a). Worst-case analysis for split delivery vehicle routing problems. Transportation Science, 40(2), 226–234.
8. Archetti, C., Speranza, M., & Hertz, A. (2006b). A tabu search algorithm for the split delivery vehicle routing problem. Transportation Science, 40(1), 64–73.
9. Archetti, C., Savelsbergh, M., & Speranza, M. (2008). An optimization-based heuristic for the split delivery vehicle routing problem. Transportation Science, 42(1), 22–31.
10. Archetti, C., Bianchessi, N., & Speranza, M. (2011). A column generation approach for the split delivery vehicle routing problem. Networks, 58(4), 241–254.
11. Belenguer, J., Martinez, M., & Mota, E. (2000). A lower bound for the split delivery vehicle routing problem. Operations Research, 48(5), 801–810.
12. Boudia, M., Prins, C., & Reghioui, M. (2007). An effective memetic algorithm with population management for the split delivery vehicle routing problem. In Proceedings of the 4th international conference on hybrid metaheuristics, HM’07 (pp. 16–30). Berlin: Springer.
13. Campos, V., Corberán, A., & Mota, E. (2008). A scatter search algorithm for the split delivery vehicle routing problem. In A. Fink & F. Rothlauf (Eds.), Advances in computational intelligence in transport, logistics, and supply chain management (pp. 137–152). Berlin: Springer.
14. Chen, S., Golden, B., & Wasil, E. (2007). The split delivery vehicle routing problem: applications, algorithms, test problems, and computational results. Networks, 49(4), 318–329.
15. Clarke, G., & Wright, J. (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12(4), 568–581.
16. Desaulniers, G. (2010). Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows. Operations Research, 58(1), 179–192.
17. Dror, M., & Trudeau, P. (1989). Saving by split delivery routing. Transportation Science, 23(2), 141–145.
18. Dror, M., & Trudeau, P. (1990). Split delivery routing. Naval Research Logistics, 37, 383–402.
19. Dror, M., Laporte, G., & Trudeau, P. (1994). Vehicle routing with split deliveries. Discrete Applied Mathematics, 50(3), 239–254.
20. Gendreau, M., Hertz, A., & Laporte, G. (1992). New insertion and postoptimization procedures for the traveling salesman problem. Operations Research, 40(6), 1086–1094.
21. Gendreau, M., Hertz, A., & Laporte, G. (1994). A tabu search heuristic for the vehicle routing problem. Management Science, 40, 1276–1290.
22. Gendreau, M., Dejax, P., Feillet, D., & Gueguen, C. (2006). Vehicle routing problem with time windows and split deliveries (Technical Report, 2006-851). Laboratoire d’Informatique. d’Avignon.
23. Glover, F., & Laguna, M. (2001). Tabu search. Norwell: Kluwer Academic.
24. Ho, S., & Haugland, D. (2004). A tabu search heuristic for the vehicle routing problem with time windows and split deliveries. Computers & Operations Research, 31(12), 1947–1964.
25. Jin, M., Liu, K., & Bowden, R. (2007). A two-stage algorithm with valid inequalities for the split delivery vehicle routing problem. International Journal of Production Economics, 105(1), 228–242.
26. Jin, M., Liu, K., & Eksioglu, B. (2008). A column generation approach for the split delivery vehicle routing problem. Operations Research Letters, 36(2), 265–270.
27. Miller, C. E., Tucker, A. W., & Zemlin, R. A. (1960). Integer programming formulation of traveling salesman problems. Journal of the Association for Computing Machinery, 7(4), 326–329.
28. Mullaseril, P., Dror, M., & Leung, J. (1997). Split delivery routing heuristics in livestock feed distribution. Journal of the Operational Research Society, 48(2), 107–116.
29. Sierksma, G., & Tijssen, G. (1998). Routing helicopters for crew exchanges on off-shore locations. Annals of Operations Research, 76(0), 261–286.
30. Toth, P., & Vigo, D. (2003). The granular tabu search and its application to the vehicle-routing problem. INFORMS Journal on Computing, 15(4), 333–346.