Complex vehicle scheduling optimization problem based on improved ant colony algorithm

Abstract

As to a kind of complex vehicle scheduling problem (CVSP) with loading and unloading and task combination, a dynamic expense coefficient model according to the actual load is built, and in ant colony algorithm the coding method is changed from based on site to based on operating. It makes the algorithm designing and programming easier. In the local operation routing search the corresponding heuristics algorithm is designed. By programming and calculating, an example proves the algorithm is effectual. © 2013 Springer-Verlag.