Abstract
The logistics industry is developing rapidly; however, it is still in limited quantities and with many dynamic changes, and logistic distribution route optimization is becoming increasingly important. Since the design of a quick and effective optimization method should be given the priority in solving this problem. For this reason, the paper presents a new niche cellular genetic algorithm based on canonical cellular genetic algorithm by introducing niche technology, which can maintain the population diversity very well. This algorithm is then applied to the vehicle routing problem with time-window. And an order-reversing crossover operator is designed for solving this problem. The results show that, compared with the canonical cellular genetic algorithms, niche genetic algorithms and simple genetic algorithm, the new algorithm avoids pre-mature more effectively, and the results gained is of higher accuracy. It is of great efficiency in solving the vehicle routing problem with time-window.
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
Alba E, Bernabé D (2008) Cellular genetic algorithms. Springer Science, Business Media, LLC, ISBN:978-0-387-77609-5
Bernabé D, Alba E (2006) A simple cellular genetic algorithm for continuous optimization. In: 2006 IEEE congress on evolutionary computation sheraton vancouver wall centre hotel, Vancouver, BC, Canada, 16–21 July
Duhamel C, Potvin J-Y, Rousseau J-M (1997) A tabu search heuristic for the vehicle routing problem with backhauls and time windows. Transp Sci 31(1):49–59
Ho SC, Haugland D (2004) A tabu search heuristic for the vehicle routing problem with time windows and split deliveries. Comput Opera Res 31(2):1947–1964
Li Q (2006) Immune algorithm for vehicle routing problem with time windows. Syst Eng Theory Pract 26(10):119–124 (in Chinese)
Li N, Zou T, Sun D (2004) Particle swarm optimization for vehicle routing problem with time windows. Syst Eng-theory Pract 24(4):130–135 (in Chinese)
Lin Q (2007) Research of the vehicle routing problem with time windows based on hybrid genetic algorithm. Shandong University
Liu Z, Li J (2006) Ant colony system based on vehicle routing problem with time windows. Control Eng China 13(2):127–129+134 (in Chinese)
Savelsbergh M (1985) Local search for routing problem with time windows. Ann Oper Res 16(4):285–305
Wang H, Ren C, Yin C, Hao X (2009) Study on optimization of logistics distribution route based on niche genetic algorithm. J Comput Appl 29(10):2862–2864 (in Chinese)
Yang Y, Lang M, Hu S (2006) Study on the model and improved simulated Annealing algorithm for vehicle routing problem with time windows (in Chinese). J Ind Eng Eng Manag 20(3):104–107
Yue Y, Zhou L, Yue Q, Qi S (2006) Improved ant colony algorithm for logistics distribution routing problem. Comput Integr Manuf Syst 12(6):905–910 (in Chinese)
Zhang Z, Wu X (2007) Parallel genetic algorithm for vehicle routing problem with time window. Ind Eng J 10(3):111–114 (in Chinese)
Zhang L, Chai Y, Cao R (2006) Improved genetic algorithm for vehicle routing problem with time windows. Comput Integr Manuf Syst 8(6):857–861 (in Chinese)
Zhang T, Wang S, Tian W, Zhang Y-j, Liu S (2007) A model for the VRPTW with re-used vehicles and improved ant colony optimization. Syst Eng 25(4):20–26 (in Chinese)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lu, T., Zhan, T., Hu, F. (2013). Application of Niche Cellular Genetic Algorithm in Vehicle Routing Problem with Time Windows. In: Qi, E., Shen, J., Dou, R. (eds) International Asia Conference on Industrial Engineering and Management Innovation (IEMI2012) Proceedings. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38445-5_42
Download citation
DOI: https://doi.org/10.1007/978-3-642-38445-5_42
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38444-8
Online ISBN: 978-3-642-38445-5
eBook Packages: EngineeringEngineering (R0)