Title: Vehicle routing plan based on ant colony and insert heuristic algorithm
Abstract: A model with multiple customers to minimize the path length and waiting time of vehicle is investigated. Ant colony optimization (ACO) algorithm combined with insert heuristic algorithm for vehicle routing problems with time windows is presented. Ants tend to trap in infeasible solutions at the final stages of the algorithm when we use ACO algorithm to solve routing problems. Hence, after we obtain the pre-path through the use of ant colony algorithm, we take insert heuristic based on the time window classification. Simulation results show that the proposed algorithm can solve the vehicle path planning with time windows better than the other algorithms.
Publication Year: 2016
Publication Date: 2016-07-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 3
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot