Skip to main content

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 472))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Toth, P., Vigo, D.: The Vehicle Routing Problem. Society for Industrial and Applied Mathematics Philadephia, 1115–1136 (2002)

    Google Scholar 

  2. 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)

    Google Scholar 

  3. Zhou, K., Chen, J.: Simulation DNA Algorithm of Set Covering Problem. Appl. Math. Inf. Sci. 8, 139–144 (2014)

    Article  MathSciNet  Google Scholar 

  4. Yong, L.X.: Models and Algorithms for Vehicle Routing Problem. Shanghai Jiao Tong University (2007)

    Google Scholar 

  5. 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)

    Article  Google Scholar 

  6. Solomon, M.M.: Algorithms for the Vehicle Routing and Scheduling Problem with Time Window Contraints. Operational Research 35, 254–265 (1987)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics