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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manag. Sci. 6(1), 80–91 (1959)
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)
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)
Psaraftis, H.N.: Dynamic vehicle routing: status and prospects. Ann. Oper. Res. 61(1), 143–164 (1995)
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)
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)
Beaudry, A., Laporte, G., Melo, T., et al.: Dynamic transportation of patients in hospitals. OR Spectrum 32(1), 77–107 (2010)
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)
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)
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)
Hong, L.: An improved LNS algorithm for real-time vehicle routing problem with time windows. Comp. Oper. Res. 39(2), 151–163 (2012)
Kilby, P., Prosser, P., Shaw, P.: Dynamic VRPs: a study of scenarios. University of Strathclyde Technical report, pp. 1–11 (1998)
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)
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)
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)
Pillac, V., Gendreau, M., Guret, C., et al.: A review of dynamic vehicle routing problems. Eur. J. Oper. Res. 225(1), 1–11 (2013)
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)
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)
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)
Fisher, M.L., Jaikumar, R.: A generalized assignment heuristic for vehicle routing. Netw. 11(2), 109–124 (1981)
Christofides, N., Beasley, J.E.: The period routing problem. Netw. 14(2), 237–256 (1984)
Taillard, É.: Parallel iterative search methods for vehicle routing problems. Netw. 23(8), 661–673 (1993)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights 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)