Abstract
Meta-Heuristic Algorithms are one of the most widely used optimization algorithms. Vehicle routing problem with time windows (VRPTW) is a famous NP-hard combinatorial optimization problem that plays a key role in logistics systems. In this paper, we review some of the recent advancements in the VRPTW using meta-heuristic techniques. Many variants of the classical Vehicle Routing Problem (VRP) are also presented. An extensive survey of the related research is presented with a stress on the different approaches used to solve this problem. A review of various evolutionary and swarm intelligence based algorithms like Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO), Artificial Bee Colony algorithm (ABC), etc., for solving VRPTW is also presented. Finally, the research gaps inferred after analyzing the previous works are highlighted along with the future prospects in this field of research.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Pillac, V., Gendreau, M., Guéret, C., Medaglia, A.L.: A review of dynamic vehicle routing problems. Eur. J. Oper. Res. 225(1), 1–11 (2013)
Brandao, J.: A new tabu search algorithm for the vehicle routing problem with backhauls. Eur. J. Oper. Res. 173(2), 540–555 (2006)
Parragh, S.N., Doerner, K., Hartl, R.F.: A survey on pickup and delivery problems. J. für Betriebswirtschaft 58(1), 21–51 (2008)
Letchford, A.N., Lysgaard, J., Eglese, R.W.: A branch-and-cut algorithm for the capacitated open vehicle routing problem. J. Oper. Res. Soc. 58(12), 1642–1651 (2007)
Contardo, C., Martinelli, R.: A new exact algorithm for the multidepot vehicle routing problem under capacity and route length constraints. Discrete Optim. 12, 129–146 (2014)
Solomon, M.M., Desrosiers, J.: Survey paper-time window constrained routing and scheduling problems. Transp. Sci. 22(1), 1–13 (1988)
Soo, R.K.Y., Tay, Y.H.: A survey on the progress of research on vehicle routing problem with time window constraints. In: Symposium on Progress in Information and Communication Technology (SPICT), 2009, pp. 142–146 (2009)
Kallehauge, B.: Formulations and exact algorithms for the vehicle routing problem with time windows. Comput. Oper. Res. 35(7), 2307–2330 (2008)
Azi, N., Gendreau, M., Potvin, J.-Y.: An exact algorithm for a single-vehicle routing problem with time windows and multiple routes. Eur. J. Oper. Res. 178(3), 755–766 (2007)
Mishra, A., Shukla, A.: Mathematical analysis of the cumulative effect of novel ternary crossover operator and mutation on probability of survival of a schema. Theor. Comput. Sci. 1–11 (2016). http://doi.org/10.1016/j.tcs.2016.07.035
Mishra, A., Shukla, A.: Mathematical analysis of schema survival for genetic algorithms having dual mutation. Soft Comput. 1–9 (2017). https://doi.org/10.1007/s00500-017-2650-3
Mishra, A., Shukla, A.: A new insight into the schema survival for genetic algorithms consisting of chromosomes having bits with different vulnerability for mutation. Int. J. Control Theor. Appl. (2017). ISSN: 0974-5572. http://serialsjournals.com/serialjournalmanager/pdf/1493459459.pdf
Ombuki, Beatrice, Ross, Brian J., Hanshar, Franklin: Multi-objective genetic algorithms for vehicle routing problem with time windows. Appl. Intell. 24(1), 17–30 (2016)
Mishra, A., Shukla, A.: Analysis of the effect of elite count on the behavior of genetic algorithms: a perspective. In: 7th IEEE International Advance Computing Conference (IACC-2017), VNR Vignana Jyothi Institute of Engineering and Technology, Hyderabad, India, Jan 2017. https://doi.org/10.1109/iacc.2017.0172 (2017)
Mishra, A., Shukla, A.: Analysis of the effect of defining length and order of schemata on probability of survival of a group of schemata. In: Annual International Conference on Intelligent Computing, Computer Science and Information Systems (ICCSIS 16), Apr 2016, Pattaya, Thailand. ISBN: 978-93-84468-60-6. http://dx.doi.org/10.15242/IAE.IAE0416 (2016)
Gambardella, L.M., Taillard, É., Agazz, G.: Macs-VRPTW: a multiple ant colony system for vehicle routing problems with time windows (1999)
Zhu, Q., Qian, L., Li, Y., Zhu, S.: An improved particle swarm optimization algorithm for vehicle routing problem with time windows. In: 2006 IEEE International Conference on Evolutionary Computation. IEEE, pp. 1386–1390 (2006)
Liu, X., Jiang, W., Xie, J.: Vehicle routing problem with time windows: a hybrid particle swarm optimization approach. In: 2009 Fifth International Conference on Natural Computation, vol. 4, pp. 502–506. IEEE (2009)
Yu, S., Tai, C., Liu, Y., Gao, L.: An improved artificial bee colony algorithm for vehicle routing problem with time windows: a real case in dalian. Adv. Mech. Eng. 8(8), 1687814016665298 (2016)
Alzaqebah, M., Abdullah, S., Jawarneh, S.: Modified artificial bee colony for the vehicle routing problems with time windows. Springer-Plus 5(1), 1298 (2016)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Dixit, A., Mishra, A., Shukla, A. (2019). Vehicle Routing Problem with Time Windows Using Meta-Heuristic Algorithms: A Survey. In: Yadav, N., Yadav, A., Bansal, J., Deep, K., Kim, J. (eds) Harmony Search and Nature Inspired Optimization Algorithms. Advances in Intelligent Systems and Computing, vol 741. Springer, Singapore. https://doi.org/10.1007/978-981-13-0761-4_52
Download citation
DOI: https://doi.org/10.1007/978-981-13-0761-4_52
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-0760-7
Online ISBN: 978-981-13-0761-4
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)