scholarly journals A Multimetric Ant Colony Optimization Algorithm for Dynamic Path Planning in Vehicular Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Zhen Wang ◽  
Jianqing Li ◽  
Manlin Fang ◽  
Yang Li

With the rapid growth in the number of vehicles, energy consumption and environmental pollution in urban transportation have become a worldwide problem. Efforts to reduce urban congestion and provide green intelligent transport become a hot field of research. In this paper, a multimetric ant colony optimization algorithm is presented to achieve real-time dynamic path planning in complicated urban transportation. Firstly, four attributes are extracted from real urban traffic environment as the pheromone values of ant colony optimization algorithm, which could achieve real-time path planning. Then Technique for Order Preference by Similarity to Ideal Solution methods is adopted in forks to select the optimal road. Finally, a vehicular simulation network is set up and many experiments were taken. The results show that the proposed method can achieve the real-time planning path more accurately and quickly in vehicular networks with traffic congestion. At the same time it could effectively avoid local optimum compared with the traditional algorithms.

2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Junqi Yu ◽  
Ruolin Li ◽  
Zengxi Feng ◽  
Anjun Zhao ◽  
Zirui Yu ◽  
...  

In order to improve the working efficiency of automated guided vehicles (AGVs) and the processing efficiency of fulfilling orders in intelligent warehouses, a novel parallel ant colony optimization algorithm for warehouse path planning is proposed. Through the interaction of pheromones among multiple subcolonies, the coevolution of multiple subcolonies is realized and the operational capability of the algorithm is improved. Then, a multiobjective function with the object of the shortest path and the minimum number of turns of the AGV is established. And the path satisfying this objective function is obtained by the proposed algorithm. In addition, the path is further smoothed by reducing the number of intermediate nodes. The results show that the stability and convergence rate of the algorithm are faster and more stable, compared to other algorithms, in generating paths for different complexity maps. The smoothing treatment of the path significantly reduces the number of turns and the path length in the AGV driving process.


Sign in / Sign up

Export Citation Format

Share Document