A Vehicle Routing Optimization Method with Constraints Condition based on Max-Min Ant Colony Algorithm

2014 ◽  
Vol 8 (1L) ◽  
pp. 239-243 ◽  
Author(s):  
Wei-Cheng Xie ◽  
Chang-Min Chen ◽  
Song-Song Fan ◽  
Ling-Ling Li
Keyword(s):  
Vehicle Routing ◽  
Ant Colony Algorithm ◽  
Optimization Method ◽  
Ant Colony ◽  
Routing Optimization ◽  
Vehicle Routing Optimization

Research on Vehicle Routing Optimization Based on Improved Ant Colony Algorithm

2013 ◽  
Vol 385-386 ◽  
pp. 1917-1920
Author(s):  
Rui Wang ◽  
Zai Tang Wang
Keyword(s):  
Vehicle Routing ◽  
Optimization Problem ◽  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Route Optimization ◽  
Local Optimum ◽  
Evaporation Coefficient ◽  
Logistics Distribution ◽  
Routing Optimization ◽  
Vehicle Routing Optimization

This paper analyzes the domestic and international logistics distribution route optimization problem and the research status of ant colony algorithm, illustrates the problems existing in the logistics distribution now. It reflects the necessity to research on the vehicle routing optimization problem. In order to increasing the ant colony algorithm’s convergence speed and avoiding to fall into local optimum, we improve the pheromone evaporation coefficient and visibility to optimize the searching ability, which can avoid premature convergence and stagnation.

The Application of a Improved Hybrid Ant Colony Algorithm in Vehicle Routing Optimization Problem

2014 ◽  
Vol 556-562 ◽  
pp. 4693-4696
Author(s):  
Yue Li Li ◽  
Ai Hua Ren
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Ant Colony System ◽  
Routing Problem ◽  
Logistics Industry ◽  
Routing Optimization ◽  
Constrained Vehicle Routing ◽  
Capacity Constrained

With the development of the market economy, the logistics industry has been developed rapidly.It is easy to understand that good vehicle travel path planning has very important significance in the logistics company,especially in the general production enterprises. This paper mainly studies the microcosmic traffic system in the type of vehicle routing problems: capacity-constrained vehicle routing problem. We demonstrate the use of Ant Colony System (ACS) to solve the capacitated vehicle routing problem, treated as nodes in a spatial network. For the networks where the nodes are concentrated, the use of hybrid heuristic optimization can greatly improve the efficiency of the solution. The algorithm produces high-quality solutions for the capacity-constrained vehicle routing problem.

The Application of a Improved Hybrid Ant Colony Algorithm in Vehicle Routing Optimization Problem

2014 ◽  
Vol 556-562 ◽  
pp. 4005-4008
Author(s):  
Yue Li Li ◽  
Ai Hua Ren
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Ant Colony System ◽  
Routing Problem ◽  
Logistics Industry ◽  
Routing Optimization ◽  
Constrained Vehicle Routing ◽  
Capacity Constrained

With the development of the market economy, the logistics industry has been developed rapidly.It is easy to understand that good vehicle travel path planning has very important significance in the logistics company,especially in the general production enterprises. This paper mainly studies the microcosmic traffic system in the type of vehicle routing problems: capacity-constrained vehicle routing problem. We demonstrate the use of Ant Colony System (ACS) to solve the capacitated vehicle routing problem, treated as nodes in a spatial network. For the networks where the nodes are concentrated, the use of hybrid heuristic optimization can greatly improve the efficiency of the solution. The algorithm produces high-quality solutions for the capacity-constrained vehicle routing problem.

Sign in / Sign up

Export Citation Format

Share Document