Skip to main content
Log in

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

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

The Split Delivery Vehicle Routing Problem (SDVRP) is a variant of the classical Capacitated Vehicle Routing Problem where multiple visits to each customer are allowed. It is an NP-hard problem where exact solutions are difficult to obtain in a reasonable time. This paper shows a tabu search heuristic with granular neighborhood called Randomized Granular Tabu Search that uses a tabu search technique in a bounded neighborhood (granular) defined by the most promising arcs and introduces some new local operators in the local granular tabu search. The algorithm also uses a random selection of the move to be introduced at the current solution. In addition, the local search procedures can explore infeasible neighborhoods in terms of vehicle capacity. These two ideas help to escape from local optima. After the local search process, the algorithm solves one traveling salesman problem per route to improve the solution. Finally, a computational study shows that the proposed method improves many of the best-known solutions for the benchmark instances of the SDVRP literature.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Archetti, C., & Speranza, M. (2004). Vehicle routing in the 1-skip collection problem. Journal of the Operational Research Society, 55(7), 717–727.

    Article  Google Scholar 

  • 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.

    Chapter  Google Scholar 

  • Archetti, C., & Speranza, M. (2011). Vehicle routing problems with split deliveries. International Transactions in Operational Research, 19(1–2), 3–22

    Google Scholar 

  • Archetti, C., Savelsbergh, M., & Speranza, M. (2006a). Worst-case analysis for split delivery vehicle routing problems. Transportation Science, 40(2), 226–234.

    Article  Google Scholar 

  • Archetti, C., Speranza, M., & Hertz, A. (2006b). A tabu search algorithm for the split delivery vehicle routing problem. Transportation Science, 40(1), 64–73.

    Article  Google Scholar 

  • Archetti, C., Savelsbergh, M., & Speranza, M. (2008). An optimization-based heuristic for the split delivery vehicle routing problem. Transportation Science, 42(1), 22–31.

    Article  Google Scholar 

  • Archetti, C., Bianchessi, N., & Speranza, M. (2011). A column generation approach for the split delivery vehicle routing problem. Networks, 58(4), 241–254.

    Article  Google Scholar 

  • Belenguer, J., Martinez, M., & Mota, E. (2000). A lower bound for the split delivery vehicle routing problem. Operations Research, 48(5), 801–810.

    Article  Google Scholar 

  • 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.

    Chapter  Google Scholar 

  • 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.

    Chapter  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Clarke, G., & Wright, J. (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12(4), 568–581.

    Article  Google Scholar 

  • Desaulniers, G. (2010). Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows. Operations Research, 58(1), 179–192.

    Article  Google Scholar 

  • Dror, M., & Trudeau, P. (1989). Saving by split delivery routing. Transportation Science, 23(2), 141–145.

    Article  Google Scholar 

  • Dror, M., & Trudeau, P. (1990). Split delivery routing. Naval Research Logistics, 37, 383–402.

    Article  Google Scholar 

  • Dror, M., Laporte, G., & Trudeau, P. (1994). Vehicle routing with split deliveries. Discrete Applied Mathematics, 50(3), 239–254.

    Article  Google Scholar 

  • Gendreau, M., Hertz, A., & Laporte, G. (1992). New insertion and postoptimization procedures for the traveling salesman problem. Operations Research, 40(6), 1086–1094.

    Article  Google Scholar 

  • Gendreau, M., Hertz, A., & Laporte, G. (1994). A tabu search heuristic for the vehicle routing problem. Management Science, 40, 1276–1290.

    Article  Google Scholar 

  • 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.

  • Glover, F., & Laguna, M. (2001). Tabu search. Norwell: Kluwer Academic.

    Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Sierksma, G., & Tijssen, G. (1998). Routing helicopters for crew exchanges on off-shore locations. Annals of Operations Research, 76(0), 261–286.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

Download references

Acknowledgements

Leonardo Berbotto and Francisco J. Nogales are supported by the Spanish Government through project MTM2010-16519. The research of Sergio García was funded by Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica (I+D+I) (Project MTM2009-14039-C06-04 and RDEF funds) and Fundación Séneca (Project 08716/PI/08).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Leonardo Berbotto.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Berbotto, L., García, S. & Nogales, F.J. A Randomized Granular Tabu Search heuristic for the split delivery vehicle routing problem. Ann Oper Res 222, 153–173 (2014). https://doi.org/10.1007/s10479-012-1282-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-012-1282-3

Keywords

Navigation