An Improved Ant Colony Algorithm for the Vehicle Routing Problem in Time-Dependent Networks

2011 ◽  
Vol E94-B (5) ◽  
pp. 1506-1510
Author(s):  
Yongqiang LIU ◽  
Qing CHANG ◽  
Huagang XIONG
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Time Dependent ◽  
Routing Problem ◽  
Improved Ant Colony Algorithm

The Research on Vehicle Routing Problem Based on Improved Ant Colony Algorithm

2013 ◽  
Vol 397-400 ◽  
pp. 2439-2446 ◽  
Author(s):  
Zheng Qiang Jiang ◽  
Yue Wu
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Ant Colony Algorithm ◽  
Vital Role ◽  
Ant Colony ◽  
Transition Rule ◽  
Routing Problem ◽  
Np Hard Problem ◽  
Matlab Programming ◽  
Improved Ant Colony Algorithm

Vehicle Routing Problem (VRP) plays a vital role in mathematical and logistics research. Its a typical NP-Hard problem, and ant colony algorithm has been proven to be an effect way in solving these problems. An improved ant colony algorithm is proposed to solve VRP on the basis of depth analyzing VRP and ant colony algorithm. It proposes the mathematical model of VRP and designs an improved ant colony algorithm, considering the inefficient solving, easy to partial stagnation shortcomings of ant colony algorithm and the attraction, repulsion, time constraint phenomena in VRP. This paper redesigns the pheromone update rule and the state transition rule and then it makes a simulation experiment by MATLAB programming, the results show that the improved ant colony is feasible and very valid in solving VRP.

Sign in / Sign up

Export Citation Format

Share Document