Abstract
Vehicle routing problem(VRP) has the same mathematical model with many combinatorial optimization problems, they are typical NP- hard problems in combinatorial optimization problem. In this paper, artificial bee colony (ABC) algorithm is applied to solve VRP. We propose a method to keep the colony diversity and improve the search efficiency of ABC. To validate the performance of ABC algorithm, we calculate the instance from standard VRP database. The results show that improved ABC can be used for VRP efficiently.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Toth, P., Vigo, D.: The Vehicle Routing Problem. Society for Industrial and Applied Mathematics Philadephia, 1115–1136 (2002)
Zhuo, F., Wei, C.S.: The Current Situation and Development Trends on Vehicle Routing Problems. China’s Strategy to the 7th Academic Communication, 997–1002 (2004)
Zhou, K., Chen, J.: Simulation DNA Algorithm of Set Covering Problem. Appl. Math. Inf. Sci. 8, 139–144 (2014)
Yong, L.X.: Models and Algorithms for Vehicle Routing Problem. Shanghai Jiao Tong University (2007)
Li, X., Yin, M.: A discrete Artificial Bee Colony Algorithm with Composite Mutation Strategies for Permutation Flow Shop Scheduling Problem. Scientia Iranica 19, 1921–1935 (2012)
Solomon, M.M.: Algorithms for the Vehicle Routing and Scheduling Problem with Time Window Contraints. Operational Research 35, 254–265 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shao, K., Zhou, K., Qiu, J., Zhao, J. (2014). ABC Algorithm for VRP. In: Pan, L., Păun, G., Pérez-Jiménez, M.J., Song, T. (eds) Bio-Inspired Computing - Theories and Applications. Communications in Computer and Information Science, vol 472. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-45049-9_59
Download citation
DOI: https://doi.org/10.1007/978-3-662-45049-9_59
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-45048-2
Online ISBN: 978-3-662-45049-9
eBook Packages: Computer ScienceComputer Science (R0)