136 Vehicle Routing Simulation Research Based on an Improved Ant Colony Algorithm Available to Purchase

Aiming at problems of slow convergence and to easily plunge into one partial basis in basic ant colony algorithms, an improved ant colony algorithm is proposed in this paper. In this improved algorithm, the inspired route information strength changes according to the vehicles loaded rate. Both local information and global information are updated on the effective route. Achieving at local optimal basis ensures the best possible solution by means of 3-opt optimized algorithm. The example of 22-city vehicle routing is simulated by this improved algorithm, and it shows that convergence speed has increased by nearly 50% , which compared with basic ant algorithm. The algorithm has achieved significant results too, and needs less time to solve large-scale vehicle routing problems.