Abstract
The multi-objective optimization problem of vehicle routing is a hot issue in many industries in recent years, because it is more fully considered for real-world constraints and has always been a hot issue in shipping transport. Vehicle path planning issues with time window constraints are also the most concerned. Therefore, this paper presents a large number of papers on vehicle routing problem with time window limit, and details the application of various algorithms in this problem. In this paper, several novel and widely applied algorithms are introduced and compared.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Osaba, E., Carballedo, R., Yang, X.-S., Diaz, F.: An evolutionary discrete firefly algorithm with novel operators for solving the vehicle routing problem with time windows. In: Yang, X.-S. (ed.) Nature-Inspired Computation in Engineering. SCI, vol. 637, pp. 21–41. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-30235-5_2
Osaba, E., Yang, X.S., Diaz, F., Onieva, E., Masegosa, A.D., Perallos, A.: A discrete firefly algorithm to solve a rich vehicle routing problem modelling a newspaper distribution system with recycling policy. Soft. Comput. 21(18), 5295–5308 (2017)
Ombuki, B., Ross, B.J., Hanshar, F.: Multi-objective genetic algorithms for vehicle routing problem with time windows. Appl. Intell. 24(1), 17–30 (2006)
Taillard, É., Badeau, P., Gendreau, M., Guertin, F., Potvin, J.Y.: A tabu search heuristic for the vehicle routing problem with soft time windows. Transp. Sci. 31(2), 170–186 (1997)
Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254–265 (1987)
Desrochers, M., Desrosiers, J., Solomon, M.: A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. 40(2), 342–354 (1992)
Solomon, M.M., Desrosiers, J.: Survey paper—time window constrained routing and scheduling problems. Transp. Sci. 22(1), 1–13 (1988)
Gambardella, L.M., Taillard, É., Agazzi, G.: MACS-VRPTW: a multiple colony system for vehicle routing problems with time windows. In: New Ideas in Optimization (1999)
Govindan, K., Jafarian, A., Khodaverdi, R., Devika, K.: Two-echelon multiple-vehicle location–routing problem with time windows for optimization of sustainable supply chain network of perishable food. Int. J. Prod. Econ. 152, 9–28 (2014)
Schneider, M., Stenger, A., Goeke, D.: The electric vehicle-routing problem with time windows and recharging stations. Transp. Sci. 48(4), 500–520 (2014)
Dalmeijer, K., Spliet, R.: A branch-and-cut algorithm for the time window assignment vehicle routing problem. Comput. Oper. Res. 89, 140–152 (2018)
Golden, B.L., Assad, A.A.: OR forum—perspectives on vehicle routing: exciting new developments. Oper. Res. 34(5), 803–810 (1986)
Feillet, D., Dejax, P., Gendreau, M., Gueguen, C.: An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems. Networks 44(3), 216–229 (2004)
Coelho, L.C., Laporte, G.: A branch-and-cut algorithm for the multi-product multi-vehicle inventory-routing problem. Int. J. Prod. Res. 51(23–24), 7156–7169 (2013)
Lysgaard, J., Letchford, A.N., Eglese, R.W.: A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Program. 100(2), 423–445 (2004)
Raff, S.: Routing and scheduling of vehicles and crews: the state of the art. Comput. Oper. Res. 10(2), 63–211 (1983)
Acknowledgement
This research is partially supported by the National Science Foundation of China (61773192, 61503170, 61603169, 61773246), Shandong Province Higher Educational Science and Technology Program (J17KZ005, J14LN28), Natural Science Foundation of Shandong Province (ZR2016FL13, ZR2017BF039), Key Laboratory of Computer Network and Information Integration (Southeast University), Ministry of Education (K93-9-2017-02), and State Key Laboratory of Synthetical Automation for Process Industries (PAL-N201602).
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Han, YQ. et al. (2018). Research on Vehicle Routing Problem with Time Windows Restrictions. In: Huang, DS., Jo, KH., Zhang, XL. (eds) Intelligent Computing Theories and Application. ICIC 2018. Lecture Notes in Computer Science(), vol 10955. Springer, Cham. https://doi.org/10.1007/978-3-319-95933-7_84
Download citation
DOI: https://doi.org/10.1007/978-3-319-95933-7_84
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-95932-0
Online ISBN: 978-3-319-95933-7
eBook Packages: Computer ScienceComputer Science (R0)