Skip to main navigation Skip to search Skip to main content

An improved optimization algorithm for multi vehicle routing problem

  • Tong Zhou*
  • , Bing Rong Hong
  • , Song Hao Piao
  • , Hong Yu Zhou
  • *Corresponding author for this work
  • School of Computer Science and Technology, Harbin Institute of Technology
  • Harbin University of Science and Technology

Research output: Contribution to journalArticlepeer-review

Abstract

An improved method based on Ant Colony Optimization (ACO) is proposed for Multi Vehicle Routing Problem (MVRP). The procedure simulates the decision-making processes of ant colonies as they forage for food. The candidate routes are used to reduce calculation of algorithm. The removing and the inserting of nodes are used to find better solutions of the algorithm. Experiment shows that the algorithm is successful in finding solutions and the lengths of routes are shorter than other similar algorithm.

Original languageEnglish
Pages (from-to)327-331
Number of pages5
JournalHarbin Gongye Daxue Xuebao/Journal of Harbin Institute of Technology
Volume39
Issue numberSUPPL. 1
StatePublished - Jun 2007
Externally publishedYes

Keywords

  • Ant colony optimization
  • Combinational optimization
  • Coordination
  • Multi vehicle routing problem

Fingerprint

Dive into the research topics of 'An improved optimization algorithm for multi vehicle routing problem'. Together they form a unique fingerprint.

Cite this