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

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.