Skip to main content
SpringerLink
Log in

VRPTW: From Mathematical Models to Computing Science Tools

  • Conference paper
  • First Online:
Mathematical Control and Numerical Applications (JANO'13 2021)

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 372))

Included in the following conference series:

  • 268 Accesses

Abstract

This paper provides effective methodologies intended to improve the behaviour of the Adaptive Large Neighborhood Search algorithm (ALNS), when solving the vehicle routing problem with time windows. The main challenge is to obtain a reduced real-time solution without compromising the quality of the solution specially for large instances. In this context, we present four distinct methodologies to deal with the problem on its deterministic and robust structure. In order to evaluate these methods, numerical experiments and comparisons using different instance sizes are provided.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 119.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 159.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 159.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. G. Dantzig, J. Ramser, The truck dispatching problem. Manag. Sci. 6, 80–91 (1959)

    Article  MathSciNet  Google Scholar 

  2. G. Clarke, J.R. Wright, Scheduling of vehicle routing problem from a central depot to a number of delivery points. Oper. Res. 12, 568–581 (1964)

    Article  Google Scholar 

  3. O. Bräysy, M. Gendreau, Vehicle routing Problem with time windows. Part II: metaheuristics. J. Transp. Sci. 39, 119–139 (2005)

    Google Scholar 

  4. B. Kallehauge, J. Larsen, O.B. Madsen, M.M. Solomon, Vehicle routing problem with time windows. Column Gener. 1, 67–98 (2005)

    Google Scholar 

  5. M. Dror, P. Trudeau, Stochastic vehicle routing with modified savings algorithm. Eur. J. Oper. Res. 23, 228–235 (1986)

    Article  MathSciNet  Google Scholar 

  6. M. Dror, G. Laporte, F.V. Louveaux, Vehicle routing with stochastic demands and restricted failures. ZOR-Model. Oper. Res. 37, 183–273 (1993)

    Google Scholar 

  7. M. Gendreau, G. Laporte, R. Séguin, Stochastic vehicle routing. Eur. J. Oper. Res. 88, 3–12 (1996)

    Google Scholar 

  8. M. Nasri, A. Metrane, I. Hafidi, A. Jamali, A robust approach for solving a vehicle routing problem with time windows with uncertain service and travel times. Int. J. Ind. Eng. Comput. 11, 1–16 (2020)

    Google Scholar 

  9. L. Wu, M. Hifi, H. Bederina, A new robust criterion for the vehicle routing problem with uncertain travel time. Comput. Ind. Eng. 112, 607–615 (2017)

    Article  Google Scholar 

  10. S. Røpke, PALNS-A software framework for parallel large neighborhood search. in 8th Metaheuristic International Conference CDROM, Metaheuristic International Conference (Hamburg, Germany, 2009)

    Google Scholar 

  11. S. Røpke, D. Pisinger, An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40, 455–472 (2006)

    Article  Google Scholar 

  12. P. Shaw, Using constraint programming and local search methods to solve vehicle routing problems. in International conference on principles and practice of constraint programming (Springer, Berlin, 1998), p. 1520

    Google Scholar 

  13. M. Nasri, A. Metrane, I. Hafidi, A modified ALNS algorithm for vehicle routing problems with time windows. J. Phys. Conf. Ser. 1743, (2021)

    Google Scholar 

  14. J. Drake, E. Özcan, E. Burke, An improved choice function heuristic selection for cross domain heuristic search. Lect Notes Comput Sci 7492, 307–316 (2012)

    Article  Google Scholar 

  15. O. Bräysy, M. Gendreau, Vehicle routing problem with time windows. Part I: route construction and local search algorithms. J. Transp. Sci. 39, 104–118 (2005)

    Google Scholar 

  16. M. Solomon, Algorithms for the vehicle routing and scheduling problem with time window constraints. Oper. Res. J. 35, 254–265 (1987)

    Article  MathSciNet  Google Scholar 

  17. M. Diana, M. Dessouky, A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows. Transp Res Part B Methodol 38, 539–557 (2004)

    Article  Google Scholar 

  18. M. Nasri, I. Hafidi, A. Metrane, Multithreading parallel robust approach for the VRPTW with uncertain service and travel times. Symmetry 13, 36 (2020)

    Article  Google Scholar 

  19. H. Gehring, J. Homberger, A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows. in Proceedings of EUROGEN’99, pp. 57–64 (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National School of Applied Sciences Khouribga, Sultan Moulay Slimane University, 23052, Beni-Mellal, Morocco

    Nasri Mehdi, Metrane Abdelmoutaib & Hafidi Imad

Authors
  1. Nasri Mehdi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Metrane Abdelmoutaib
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hafidi Imad
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nasri Mehdi .

Editor information

Editors and Affiliations

  1. Laboratoire de Mathématiques Jean Leray, Université de Nantes, Nantes Cedex 3, France

    Abdeljalil Nachaoui

  2. Département Mathématiques, Université Cadi Ayyad, Marrakech, Morocco

    Abdelilah Hakim

  3. FST Béni Mellal, Université Sultan Moulay Slimane, Béni Mellal, Morocco

    Amine Laghrib

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Mehdi, N., Abdelmoutaib, M., Imad, H. (2021). VRPTW: From Mathematical Models to Computing Science Tools. In: Nachaoui, A., Hakim, A., Laghrib, A. (eds) Mathematical Control and Numerical Applications. JANO'13 2021. Springer Proceedings in Mathematics & Statistics, vol 372. Springer, Cham. https://doi.org/10.1007/978-3-030-83442-5_2

Download citation

Publish with us

Policies and ethics

Search

Navigation