Vehicle Routing Problem Based On An Improved Ant Colony Algorithm

With the development of the information, logistics, taken as"Third Profit Resource", has been paid more attention and is growing to be faced to a series of opportunities. In logistics, distribution is crucial and directly linked with the customers. Whereas, the optimization of vehicle planning of the distribution system is a key part of the whole system. By the optimization of vehicle planning, the enterprises can improve their nucleus competitiveness and achieve scientific process of logistics.So the researches about the optimization of vehicle planning of the distribution system which is based on ant colony algorithm are as follows:1,Ant colony algorithm is improved. Ant colony algorithm is a novel simulated evolutionary algorithm which is proposed first in the nineties. Firstly, the algorithm is introduced by its principle and application in a real detail. To avoid the problem that the algorithm easily tends to stagnation behavior and its calculating speed is too slow, a new global updating equation is designed. Then, by solving traveling salesman problem, the improved ant colony algorithm which gets good results is proved to be more effective than the original ant colony algorithm.2,In actual application, by the background of"The Pivotal Research and Exploitation of Fresh Food Cold Chain Process in supermarket", which is an important project in the Key Technologies R&D Programs of Jiangsu Province (BE2004311), the improved ant colony algorithm is combined with the Distribution Management Information System in SuGuo Supermarket. And Baesed on the analysis of the present distribution system a new distribution model is set up. This model is mainly to carry out route optimization. The vehicle routing problem which focuses to design the least distance of operating vehicles is the main part of...