The Logistics Vehicle Routing Optimization Method and Implementation Based on Ant Colony Algorithm

Because the basic ant colony algorithm is easy to fall into the local optima, and Min-Min ant colony algorithm and adaptive ant colony algorithm can overcome its shortcomings. The comparison between these two algorithms on VRP in MATLAB shows the Max-Min ant colony algorithm has a better performance. In order to make the logistics distribution enterprises get good benefit, least costs is dispensable. Finally, the minimum vehicles that make enterprise gain high profits is obtained with Max-Min ant colony algorithm in VC++.