Title: Study on the ant colony algorithm for solving the vehicle routing problem with time windows
Abstract: The vehicle routing problem(VRP) directly affects the efficiency and economic benefits in modern logistics service,so it is of realistic significance.A mathematic model of the VRP with time windows is first established.In view of the characters of the VRP,some improvements are made on some related parameters of the pseudo-probability fomula in the ant colony algorithm. Then the improved Ant Colony System is applied to solving of the VRP.The improved algorithm has been tested on the MATLAB in a simulated way.The results show that the improved algorithm can effectively improve the basic ant colony algorithm in slow convergence and easy involvement of a partial basis,and it can be applied in the large-scale optimization of vehicle routing problems.
Publication Year: 2008
Publication Date: 2008-01-01
Language: en
Type: article
Access and Citation
Cited By Count: 1
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot