Study on multi-depots vehicle routing problem and its ant colony optimization

Su Xin Wang*, Li Gao, Xiao Guang Cui, Xue Mei Chen

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

8 Citations (Scopus)

Abstract

In order to get the global solution in multi-depots vehicle routing problem (VRP), VRP model based on detail order information was established. A two dimension Tabu table based on orders was established for ant colony optimization algorithm, and state transfer rules were established when the two adjacent nodes were same. Then all the vehicle routs were searched by ants that satisfied the vehicle constrain according to ants Tabu table. It is easy to get the global solution for model and algorithm implement the routs search of all vehicles to all orders. The illustration result shows that model and algorithm are effective for multi-depots vehicle routing problem.

Original languageEnglish
Pages (from-to)143-147
Number of pages5
JournalXitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice
Volume28
Issue number2
Publication statusPublished - Feb 2008

Keywords

  • Ant colony optimization
  • Multi-depots
  • Tabu table
  • Vehicle routing problem

Fingerprint

Dive into the research topics of 'Study on multi-depots vehicle routing problem and its ant colony optimization'. Together they form a unique fingerprint.

Cite this

Wang, S. X., Gao, L., Cui, X. G., & Chen, X. M. (2008). Study on multi-depots vehicle routing problem and its ant colony optimization. Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice, 28(2), 143-147.