Study on Optimization of Vehicle Routing Problem by Improved Ant Colony Algorithm
In this paper,an improved ant colony algorithm is used to optimize constrained vehicle routing.The constraints considered include path constraints,time window constraints and capacity con-straints.The main purpose is to propose an improved ant colony algorithm to optimize vehicle routing,construct vehicle routing,and minimize the total cost of distribution routes.The ant colony algorithm is improved from three aspects:preprocessing the candidate node list involved in conditional transition probability to reduce the time complexity of route construction.An Insertion-based saving algorithm was proposed to improve the initial distribution route of ant colony to improve the optimization accura-cy.Based on ant colony system,the pheromone up-dating strategy was improved to accelerate the con-vergence rate.Based on the Solomon benchmark data set,compared with the research results obtained in recent years,the effectiveness of the improved algorithm in improving the solution accuracy and search efficiency,and the practicability in optimizing the vehicle routing problem with constraints,which expands the application field of ant colony algorithm.
ant colony algorithmvehicle routing problemtime windowinsertion-based saving algorithm
万方数据
维普
