Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Multiple Periods Vehicle Routing Problems: A Case Study

  • Conference paper
  • First Online:
Evolutionary Computation in Combinatorial Optimization (EvoCOP 2019)

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

  • 590 Accesses

Abstract

In this paper, we consider a challenging problem faced by a hygiene services company. The problem consists of planning and routing a set of customers over a 3-month horizon period where multiple frequencies of visits can be required simultaneously by each single customer. The objective is then threefold: (1) balancing workload between vehicles (agents) (2) minimizing number of visits to the same customer (3) minimizing total routing costs. In this context, a routing plan must be prepared for the whole horizon, taking into account all constraints of the problem. We model the problem using a decomposition approach of planning horizon, namely, weeks planning and days planning optimization. We propose an adaptive large neighborhood search with several operators for routing phase of solving approach. To evaluate the performance of the solving approach we solve an industrial instance with more than 6000 customers and 69951 requests of visits. The results show an excellent performance of the solving approach in terms of solution quality compared with the existing plan used by the hygiene services company.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Similar content being viewed by others

Change history

  • 04 November 2021

    In the originally published version the indexes of some variables in Section 4.1, including Constraint (5) of the model, include a wrong offset of one position. Some errors occurred in notations of variable indexes in Constraint (5) conditions of the model in Section 4.1, together with some ambiguities that may lead to misunderstanding for the reader. This was corrected in the updated version.

References

  1. Nuortio, T., Kytöjoki, J., Niska, H., Bräysy, O.: Improved route planning and scheduling of waste collection and transport. Expert Syst. Appl. 30(2), 223–232 (2006)

    Article  Google Scholar 

  2. Matos, A.C., Oliveira, R.C.: An experimental study of the ant colony system for the period vehicle routing problem. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 286–293. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-28646-2_26

    Chapter  Google Scholar 

  3. Coene, S., Arnout, A., Spieksma, F.C.R.: On a periodic vehicle routing problem. J. Oper. Res. Soc. 61(12), 1719–1728 (2010)

    Article  Google Scholar 

  4. Ronen, D., Goodhart, C.A.: Tactical store delivery planning. J. Oper. Res. Soc. 59(8), 1047–1054 (2008)

    Article  Google Scholar 

  5. An, Y.J., Kim, Y.D., Jeong, B.J., Kim, S.D.: Scheduling healthcare services in a home healthcare system. J. Oper. Res. Soc. 63(11), 1589–1599 (2012)

    Article  Google Scholar 

  6. Blakeley, F., Argüello, B., Cao, B., Hall, W., Knolmajer, J.: Optimizing periodic maintenance operations for Schindler elevator corporation. Interfaces 33(1), 67–79 (2003)

    Article  Google Scholar 

  7. Campbell, A.M., Wilson, J.H.: Forty years of periodic vehicle routing. Networks 63(3), 276–276 (2014)

    Article  MathSciNet  Google Scholar 

  8. Beltrami, E.J., Bodin, L.D.: Networks and vehicle routing for municipal waste collection. Networks 4(1), 65–94 (1974)

    Article  Google Scholar 

  9. Russell, R., Igo, W.: An assignment routing problem. Networks 9(1), 1–17 (1979)

    Article  Google Scholar 

  10. Christofides, N., Beasley, J.E.: The period routing problem. Networks 14(2), 237–256 (1984)

    Article  Google Scholar 

  11. Russell, R.A., Gribbin, D.: A multiphase approach to the period routing problem. Networks 21(7), 747–765 (1991)

    Article  Google Scholar 

  12. Cordeau, J.F., Gendreau, M., Laporte, G.: A tabu search heuristic for periodic and multi-depot vehicle routing problems. Netw. Int. J. 30(2), 105–119 (1997)

    MATH  Google Scholar 

  13. Cordeau, J.F., Laporte, G., Mercier, A.: A unified tabu search heuristic for vehicle routing problems with time windows. J. Oper. Res. Soc. 52(8), 928–936 (2001)

    Article  Google Scholar 

  14. Francis, P., Smilowitz, K., Tzur, M.: The period vehicle routing problem with service choice. Transp. Sci. 40(4), 439–454 (2006)

    Article  Google Scholar 

  15. Alegre, J., Laguna, M., Pacheco, J.: Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts. Eur. J. Oper. Res. 179(3), 736–746 (2007)

    Article  Google Scholar 

  16. Mourgaya, M., Vanderbeck, F.: Column generation based heuristic for tactical planning in multi-period vehicle routing. Eur. J. Oper. Res. 183(3), 1028–1041 (2007)

    Article  MathSciNet  Google Scholar 

  17. Hemmelmayr, V.C., Doerner, K.F., Hartl, R.F.: A variable neighborhood search heuristic for periodic routing problems. Eur. J. Oper. Res. 195(3), 791–802 (2009)

    Article  Google Scholar 

  18. Vidal, T., Crainic, T.G., Gendreau, M., Lahrichi, N., Rei, W.: A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Oper. Res. 60(3), 611–624 (2012)

    Article  MathSciNet  Google Scholar 

  19. Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40(4), 455–472 (2006)

    Article  Google Scholar 

  20. Ropke, S., Pisinger, D.: A unified heuristic for a large class of vehicle routing problems with backhauls. Eur. J. Oper. Res. 171(3), 750–775 (2006)

    Article  MathSciNet  Google Scholar 

  21. Bellmore, M., Nemhauser, G.L.: The traveling salesman problem: a survey. Oper. Res. 16(3), 538–558 (1968)

    Article  MathSciNet  Google Scholar 

  22. Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2), 498–516 (1973)

    Article  MathSciNet  Google Scholar 

  23. Google: Distance matrix API. https://developers.google.com/maps/documentation/distance-matrix/start. Accessed 30 Oct 2018

Download references

Author information

Authors and Affiliations

  1. Universiy of Lorraine - LORIA UMR 7503, Campus Scientifique, 615 Rue du Jardin-Botanique, 54506, Vandoeuvre-les-Nancy, France

    Bilal Messaoudi & Ammar Oulamara

  2. Antsway SA, ARTEM - 92, Rue du Sergent Blandan, 54042, Nancy Cedex, France

    Bilal Messaoudi & Nastaran Rahmani

Authors
  1. Bilal Messaoudi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ammar Oulamara
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nastaran Rahmani
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bilal Messaoudi .

Editor information

Editors and Affiliations

  1. University of Lille, Lille, France

    Arnaud Liefooghe

  2. University of Coimbra, Coimbra, Portugal

    Luís Paquete

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Messaoudi, B., Oulamara, A., Rahmani, N. (2019). Multiple Periods Vehicle Routing Problems: A Case Study. In: Liefooghe, A., Paquete, L. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2019. Lecture Notes in Computer Science(), vol 11452. Springer, Cham. https://doi.org/10.1007/978-3-030-16711-0_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-16711-0_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-16710-3

  • Online ISBN: 978-3-030-16711-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation