Skip to main content
SpringerLink
Log in
Book cover

International Conference on Intelligent Computing

ICIC 2008: Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence pp 251–258Cite as

Hybrid Scatter Search with Extremal Optimization for Solving the Capacitated Vehicle Routing Problem

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5227))

Abstract

Capacitated vehicle routing problem (CVRP) is one of the most well-known and well-studied scheduling problems in operation research and logistics. However, it is quite difficult to achieve an optimal solution with the traditional optimization methods owing to the high computational complexity. The paper focuses on developing a hybrid optimization algorithm by incorporating the extremal optimization into a scatter search conceptual framework to solve the CVRP. The proposed algorithm is applied to a set of benchmark problems and the performance of the algorithm is evaluated by comparing the obtained results with the results published in the literature. Comparing results indicate that this new method is an effective and competitive approach for the capacitated vehicle routing problem.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   189.00
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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dantzig, G.B., Ramser, R.H.: The Truck Dispatching Problem. Management Science 10, 80–91 (1959)

    Article  MathSciNet  Google Scholar 

  2. Christofides, N., Mignozzi, A., Toth, P.: Exact Algorithms for the Vehicle Routing Problem Based on Spanning Tree and Shortest Path Relaxations. Math. Pto. 20, 255–282 (1981)

    Article  MATH  Google Scholar 

  3. Osman, I.H.: Meta-strategy Simulated Annealing and Tabu Search Algorithms for the Vehicle Routing Problem. Annals of Operations Research 41, 421–451 (1993)

    Article  MATH  Google Scholar 

  4. Brandao, J., Eglese, R.: A Deterministic Tabu Search Algorithm for the Capacitated Arc Routing Problem. Computers & Operations Research 35, 1112–1126 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  5. Berger, J., Barkaoui, M.: A Hybrid Genetic Algorithm for the Capacitated Vehicle Routing Problem. Journal of Operation Research Society 54, 1254–1262 (2003)

    Article  MATH  Google Scholar 

  6. Mazzeo, S., Loiseau, I.: An Ant Colony Algorithm for the Capacitated Vehicle Routing. Electronic Notes in Discrete Mathematics 18, 181–186 (2004)

    Article  MathSciNet  Google Scholar 

  7. Wang, Z.Z.: A Hybrid Optimization Algorithm Solving Vehicle Routing Problems. Operations Research and Management Science 13, 48–52 (2004)

    Google Scholar 

  8. Chen, A.L., Yang, G.K., Wu, Z.M.: Hybrid Discrete Particle Swarm Optimization Algorithm for Capacitated Vehicle Routing Problem. Journal of Zhejiang University Science A 7, 607–614 (2006)

    Article  MATH  Google Scholar 

  9. Glover, F.: Scatter Search and Path Relinking. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 297–316. McGraw-Hill, New York (1999)

    Google Scholar 

  10. Noorul, A., Saravanan, M.: A Scatter Search Approach for General Flowshop Scheduling Problem. International Journal of Advanced Manufacturing Technology 31, 731–736 (2007)

    Google Scholar 

  11. Bak, P., Kan, C.: Self-organized Criticality. Scientific American 264, 26–33 (1991)

    Article  Google Scholar 

  12. Boettcher, S.: Extremal Optimization: Heuristics via Coevolutionary Avalanches. Computing in Science Engineering 2, 75–82 (2000)

    Article  Google Scholar 

  13. Boettcher, S., Percus, A.G.: Optimization with Extremal Dynamics. Complexity 8, 57–62 (2003)

    Article  MathSciNet  Google Scholar 

  14. Chen, Y.W., Lu, Y.Z., Chen, P.: Optimization with Extremal Dynamics for the Traveling Salesman Problem. Physica A: Statistical Mechanics and its Applications 385, 115–123 (2007)

    Article  Google Scholar 

  15. Helsgaun, K.: An Effective Implementation of the Lin-kernighan Traveling Salesman Heuristic. European Journal of Operational Research 126, 106–130 (2000)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Automation, Shanghai Jiaotong University, 800, Dongchuan Road, Shanghai, China. P.R.

    Kai Sun, Gen-Ke Yang & Yu-Wang Chen

Authors
  1. Kai Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gen-Ke Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yu-Wang Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

De-Shuang Huang Donald C. Wunsch II Daniel S. Levine Kang-Hyun Jo

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sun, K., Yang, GK., Chen, YW. (2008). Hybrid Scatter Search with Extremal Optimization for Solving the Capacitated Vehicle Routing Problem. In: Huang, DS., Wunsch, D.C., Levine, D.S., Jo, KH. (eds) Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence. ICIC 2008. Lecture Notes in Computer Science(), vol 5227. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85984-0_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85984-0_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85983-3

  • Online ISBN: 978-3-540-85984-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation