Skip to main content

A Novel Meta-heuristic for the Multi-depot Vehicle Routing Problem

  • Conference paper
Information Computing and Applications (ICICA 2012)

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

Included in the following conference series:

Abstract

Shuffled Frog Leaping Algorithm (SFLA), which was presented by Eusuff and Lansey, is a novel meta-heuristic optimization. In this study, an improved SFLA (ISFLA) which improves the leaping rule of frog by enlarging the leaping step size and adding leaping inertia component in the view of social behavior is proposed to solve the Multi-Depot Vehicle Routing Problem (MDVRP). Considering the MDVRP is combinatorial optimization problem, in which every dimension of solution is discrete, we present a novel real number encoding method of ISFLA for MDVRP. At the same time, the Extremal Optimization (EO) is introduced to ISFLA to further improve the local search ability. The results of experiments have shown the proposed algorithm possesses outstanding performance to solve the MDVRP.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. Boettcher, S., Percus, A.G.: Extremal Optimization: Methods derived from Co-Evolution. In: Proceedings of the Genetic and Evolutionary Computation Conference, New York, USA, pp. 101–106 (1999)

    Google Scholar 

  2. Crevier, B., Cordeau, J., Laporte, G.: The multi-depot vehicle routing problem with inter-depot routes. European Journal of Operational Research 176(2), 756–773 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  3. Dantzig, G., Ramser, J.: The truck dispatching problem. Management Science 6(1), 80–91 (1959)

    Article  MATH  MathSciNet  Google Scholar 

  4. Eusuff, M., Lansey, K.: Optimization of Water Distribution Network Design Using the Shuffled Frog Leaping Algorithm. Journal of Water Resources Planning and Management 129(3), 10–25 (2003)

    Article  Google Scholar 

  5. Ghoseiri, K., Ghannadpour, S.F.: A hybrid genetic algorithm for multi-depot homogenous locomotive assignment with time windows. Applied Soft Computing 10(1), 53–65 (2010)

    Article  Google Scholar 

  6. Liu, R., Jiang, Z.B., Fung, R.Y.K., Chen, F., Liu, X.: Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration. Computers & Operations Research 37(11), 950–959 (2010)

    Article  MATH  Google Scholar 

  7. Luo, J.P., Chen, M.R., Li, X.: A Novel Hybrid Algorithm for Global Optimization Based on EO and SFLA. In: 2009 4th IEEE Conference on Industrial Electronics and Applications, ICIEA, pp. 1935–1939 (2009)

    Google Scholar 

  8. Mirabi, M., Fatemi Ghomi, S.M.T., Jolai, F.: Efficient stochastic hybrid heuristics for the multi-depot vehicle routing problem. Robotics and Computer-Integrated Manufacturing 26(6), 564–569 (2010)

    Article  Google Scholar 

  9. Villegas, J.G., Christian, P.: GRASP/VND and multi-start evolutionary local search for the single truck and trailer routing problem with satellite depots. Engineering Applications of Artificial Intelligence 23(5), 780–794 (2010)

    Article  Google Scholar 

  10. Wren, A., Holliday, A.: Computer scheduling of vehicles from one or more depots to a number of delivery points. Operational Research Quarterly 23(3), 333–344 (1972)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Luo, J., Li, X., Chen, MR. (2012). A Novel Meta-heuristic for the Multi-depot Vehicle Routing Problem. In: Liu, C., Wang, L., Yang, A. (eds) Information Computing and Applications. ICICA 2012. Communications in Computer and Information Science, vol 307. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34038-3_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34038-3_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34037-6

  • Online ISBN: 978-3-642-34038-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics