A Vehicle Routing Optimization Method with Constraints Condition based on Max-Min Ant Colony Algorithm

According to the command quantity of customers and limits of distribution vehicle, in order to obtain more profit, optimization study on vehicle routing and quantity is needed. Basic ant colony algorithm has slow convergence speed and is easy to falling into local optimum when used to solve this problem, while max-min ant colony algorithm can overcome these shortcomings and is the best algorithm to solve this problem at present. In this paper, vehicle routing optimization on constraints condition is simulated with max-min ant colony algorithm on MATLAB, and the direction of vehicle routing and the least number of vehicle can be obtained from the simulation results.