Skip to main content

An Effective Memetic Algorithm with Population Management for the Split Delivery Vehicle Routing Problem

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 4771)

Abstract

This paper studies the Split Delivery Vehicle Routing problem (SDVRP), a variant of the VRP in which multiple visits to customers are allowed. This NP-hard problem is solved by a recent metaheuristic called Memetic Algorithm with Population Management or MA|PM (Sörensen, 2003). It consists in a genetic algorithm, combined with a local search procedure for intensification and a distance measure to control population diversity. Special moves dedicated to split deliveries are introduced in the local search. This solution approach is evaluated and compared with the tabu search algorithm of Archetti et al. (2006) and with lower bounds designed by Belenguer et al. (2000). Our method outperforms the tabu search both in solution quality and running time. On a set of 49 instances, it improves the best-known solution 32 times. The savings obtained confirm the interest and the power of the MA|PM.

Keywords

  • Split delivery vehicle routing problem
  • Memetic algorithm
  • Distance measure

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-540-75514-2_2
  • Chapter length: 15 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   69.99
Price excludes VAT (USA)
  • ISBN: 978-3-540-75514-2
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   89.99
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    CrossRef  Google Scholar 

  2. Archetti, C., Savelsbergh, M.W.P., Speranza, M.G.: Worst-case analysis for split delivery vehicle routing problems. Transportation Science 40(2), 226–234 (2006)

    CrossRef  Google Scholar 

  3. Archetti, C., Savelsbergh, M.W.P., Speranza, M.G.: To split or not to split: that is the question. Transportation Research Economics (to appear)

    Google Scholar 

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

    MATH  CrossRef  MathSciNet  Google Scholar 

  5. Campos, V., Martí, R., Laguna, M.: Context-independent scatter search and tabu search for permutation problems. INFORMS Journal on Computing 17, 111–122 (2005)

    CrossRef  MathSciNet  Google Scholar 

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

    CrossRef  Google Scholar 

  7. Cordeau, J.F., Gendreau, M., Hertz, A., Laporte, G., Sormany, J.S.: New heuristics for the vehicle routing problem. In: Langevin, A., Riopel, D. (eds.) Logistic systems: design and optimization, pp. 279–298. Wiley, Chichester (2005)

    CrossRef  Google Scholar 

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

    MATH  CrossRef  MathSciNet  Google Scholar 

  9. Dror, M., Trudeau, P.: Savings by split delivery routing. Transportation Science 23, 141–145 (1989)

    MATH  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  11. Feillet, D., Dejax, P., Gendreau, M., Gueguen, C.: Vehicle routing with time windows and split deliveries. In: Proceedings of Odysseus 2003, Palermo (May 2003)

    Google Scholar 

  12. Frizzell, P.W., Giffin, J.W.: The split delivery vehicle scheduling problem with time windows and grid network distances. Computers and Operations Research 22(6), 655–667 (1995)

    MATH  CrossRef  Google Scholar 

  13. Fukasawa, R., Lysgaard, J., de Aragão, M.P., Reis, M., Uchoa, E., Werneck, R.F.: Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Mathematical Programming 106, 491–511 (2006)

    MATH  CrossRef  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  15. Gillett, B.E., Miller, L.R.: A heuristic algorithm for the vehicle dispatch problem. Operations Research 22, 340–349 (1974)

    MATH  Google Scholar 

  16. Moscato, P.: Memetic algorithms: a short introduction. In: Corne, D., Dorigo, M., Glover, F. (eds.) New ideas in optimization, pp. 219–234. McGraw-Hill, New York (1999)

    Google Scholar 

  17. Mullaseril, P.A., Dror, M., Leung, J.: Split-delivery routing heuristics in livestock feed distribution. Journal of Operational Research Society 48, 107–116 (1997)

    MATH  CrossRef  Google Scholar 

  18. Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Computers and Operations Research 31, 1985–2002 (2004)

    MATH  CrossRef  MathSciNet  Google Scholar 

  19. Prins, C., Sevaux, M., Sörensen, K.: A genetic algorithm with population management (GA|PM) for the CARP. In: 5th Triennal Symposium on Transportation Analysis (Tristan V), Le Gosier, Guadeloupe (2004)

    Google Scholar 

  20. Reinelt, G.: Tsplib-travelling salesman problem library. ORSAJ. Comput. 3, 376–384 (1991)

    MATH  Google Scholar 

  21. Sörensen, K.: A framework for robust and flexible optimisation using metaheuristics with applications in supply chain design. PhD thesis, University of Antwerp, Belgium (2003)

    Google Scholar 

  22. Sörensen, K., Sevaux, M.: MA|PM: memetic algorithms with population management. Computers and Operations Research 33, 1214–1225 (2006)

    MATH  CrossRef  Google Scholar 

  23. Toth, P., Vigo, D.: The vehicle routing problem. SIAM, Philadelphia (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Boudia, M., Prins, C., Reghioui, M. (2007). An Effective Memetic Algorithm with Population Management for the Split Delivery Vehicle Routing Problem. In: , et al. Hybrid Metaheuristics. HM 2007. Lecture Notes in Computer Science, vol 4771. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75514-2_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75514-2_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75513-5

  • Online ISBN: 978-3-540-75514-2

  • eBook Packages: Computer ScienceComputer Science (R0)