Skip to main content
SpringerLink
Log in

A Hybrid Large Neighborhood Search for Dynamic Vehicle Routing Problem with Time Deadline

  • Conference paper
  • First Online:
Book cover Combinatorial Optimization and Applications

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

Abstract

In order to consider the customer’s real-time requests and service time deadline, this paper studies the dynamic vehicle routing problem with time deadline (DVRPTD), and proposes a hybrid large neighborhood search (HLNS) algorithm. This strategy divides the working interval into multiple equal time slices, so DVRPTD is decomposed into a sequence of static problems. We use an insert heuristic to incorporate new requests into the current solution and a large neighborhood search algorithm (LNS) with various remove and re-insert strategies to optimize at the end of each time slice. The computational results of 22 benchmarks ranging from 50 up to 385 customers prove the superiority of our algorithm comparing with those existing ones .

H. Huang—This work was financially supported by National Natural Science Foundation of China with Grant No. 11371004 and Shenzhen Strategic Emerging Industries Program with Grant No. ZDSY20120613125016389.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manag. Sci. 6(1), 80–91 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  2. Wilson, N.H.M., Colvin, N.J.: Computer control of the Rochester dial-a-ride system. Massachusetts Institute of Technology. Center for Transportation Studies (1977)

    Google Scholar 

  3. Psaraftis, H.N.: A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transp. Sci. 14(2), 130–154 (1980)

    Article  Google Scholar 

  4. Psaraftis, H.N.: Dynamic vehicle routing: status and prospects. Ann. Oper. Res. 61(1), 143–164 (1995)

    Article  MATH  Google Scholar 

  5. Khouadjia, M.R., Alba, E., Jourdan, L., Talbi, E.-G.: Multi-swarm optimization for dynamic combinatorial problems: a case study on dynamic vehicle routing problem. In: Dorigo, M., Birattari, M., Di Caro, G.A., Doursat, R., Engelbrecht, A.P., Floreano, D., Gambardella, L.M., Groß, R., Şahin, E., Sayama, H., Stützle, T. (eds.) ANTS 2010. LNCS, vol. 6234, pp. 227–238. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  6. Gendreau, M., Guertin, F., Potvin, J.Y., et al.: Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. Transp. Res. Part C, Emerg. Technol. 14(3), 157–174 (2006)

    Article  Google Scholar 

  7. Beaudry, A., Laporte, G., Melo, T., et al.: Dynamic transportation of patients in hospitals. OR Spectrum 32(1), 77–107 (2010)

    Article  MATH  Google Scholar 

  8. Ferrucci, F., Bock, S., Gendreau, M.: A pro-active real-time control approach for dynamic vehicle routing problems dealing with the delivery of urgent goods. Eur. J. Oper. Res. 225(1), 130–141 (2013)

    Article  Google Scholar 

  9. Alvarenga, G.B., De Abreu, Silva, R.M., Mateus, G.R.: A hybrid approach for the dynamic vehicle routing problem with time windows. In: Fifth International Conference on Hybrid Intelligent Systems, HIS 2005, 7 p. IEEE (2005)

    Google Scholar 

  10. Meidan, L., Yehua, S., Jing, W., et al.: Insertion heuristic algorithm for dynamic vehicle routing problem with time window. In: 2010 2nd International Conference on Information Science and Engineering (ICISE), pp. 3789–3792. IEEE (2010)

    Google Scholar 

  11. Hong, L.: An improved LNS algorithm for real-time vehicle routing problem with time windows. Comp. Oper. Res. 39(2), 151–163 (2012)

    Article  MATH  Google Scholar 

  12. Kilby, P., Prosser, P., Shaw, P.: Dynamic VRPs: a study of scenarios. University of Strathclyde Technical report, pp. 1–11 (1998)

    Google Scholar 

  13. Montemanni, R., Gambardella, L.M., Rizzoli, A.E., et al.: Ant colony system for a dynamic vehicle routing problem. Comb. Optim. 10(4), 327–343 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  14. Elhassania, M., Jaouad, B., Ahmed, E.A.: Solving the dynamic vehicle routing problem using genetic algorithms. In: 2014 International Conference on Logistics and Operations Management (GOL), pp. 62–69. IEEE (2014)

    Google Scholar 

  15. Elhassania, M.J., Jaouad, B., Ahmed, E.A.: A new hybrid algorithm to solve the vehicle routing problem in the dynamic environment. Int. J. Soft Comput. 8(5), 327–334 (2013)

    Google Scholar 

  16. Pillac, V., Gendreau, M., Guret, C., et al.: A review of dynamic vehicle routing problems. Eur. J. Oper. Res. 225(1), 1–11 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  17. Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12(4), 568–581 (1964)

    Article  Google Scholar 

  18. Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417–431. Springer, Heidelberg (1998)

    Chapter  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. Fisher, M.L., Jaikumar, R.: A generalized assignment heuristic for vehicle routing. Netw. 11(2), 109–124 (1981)

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

  22. Taillard, É.: Parallel iterative search methods for vehicle routing problems. Netw. 23(8), 661–673 (1993)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Harbin Institute of Technology Shenzhen Graduate School, Shenzhen, China

    Dan Yang, Xiaohan He, Liang Song, Hejiao Huang & Hongwei Du

  2. Shenzhen Key Laboratory of Internet Information Collaboration, Shenzhen, China

    Dan Yang, Xiaohan He, Liang Song, Hejiao Huang & Hongwei Du

Authors
  1. Dan Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiaohan He
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Liang Song
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Hejiao Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Hongwei Du
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hejiao Huang .

Editor information

Editors and Affiliations

  1. Dept. of Mathematics and Computer Science, Marywood University, Scranton, Pennsylvania, USA

    Zaixin Lu

  2. North Carolina Central University, Durham, North Carolina, USA

    Donghyun Kim

  3. University of Texas at Dallas, Richardson, Texas, USA

    Weili Wu

  4. Texas Southern University, Houston, Texas, USA

    Wei Li

  5. University of Texas at Dallas, Richardson, Texas, USA

    Ding-Zhu Du

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Yang, D., He, X., Song, L., Huang, H., Du, H. (2015). A Hybrid Large Neighborhood Search for Dynamic Vehicle Routing Problem with Time Deadline. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, DZ. (eds) Combinatorial Optimization and Applications. Lecture Notes in Computer Science(), vol 9486. Springer, Cham. https://doi.org/10.1007/978-3-319-26626-8_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-26626-8_23

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-26625-1

  • Online ISBN: 978-3-319-26626-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation