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

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...

Full description

Bibliographic Details
Main Authors: Zhen Wang, Jianqing Li, Manlin Fang, Yang Li
Format: Article
Language:English
Published: SAGE Publishing 2015-10-01
Series:International Journal of Distributed Sensor Networks
Online Access:https://doi.org/10.1155/2015/271067
id doaj-19e80ea921d44c2e9e827317ebbe3e22
record_format Article
spelling doaj-19e80ea921d44c2e9e827317ebbe3e222020-11-25T03:03:14ZengSAGE PublishingInternational Journal of Distributed Sensor Networks1550-14772015-10-011110.1155/2015/271067271067A Multimetric Ant Colony Optimization Algorithm for Dynamic Path Planning in Vehicular NetworksZhen WangJianqing LiManlin FangYang LiWith 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.https://doi.org/10.1155/2015/271067
collection DOAJ
language English
format Article
sources DOAJ
author Zhen Wang
Jianqing Li
Manlin Fang
Yang Li
spellingShingle Zhen Wang
Jianqing Li
Manlin Fang
Yang Li
A Multimetric Ant Colony Optimization Algorithm for Dynamic Path Planning in Vehicular Networks
International Journal of Distributed Sensor Networks
author_facet Zhen Wang
Jianqing Li
Manlin Fang
Yang Li
author_sort Zhen Wang
title A Multimetric Ant Colony Optimization Algorithm for Dynamic Path Planning in Vehicular Networks
title_short A Multimetric Ant Colony Optimization Algorithm for Dynamic Path Planning in Vehicular Networks
title_full A Multimetric Ant Colony Optimization Algorithm for Dynamic Path Planning in Vehicular Networks
title_fullStr A Multimetric Ant Colony Optimization Algorithm for Dynamic Path Planning in Vehicular Networks
title_full_unstemmed A Multimetric Ant Colony Optimization Algorithm for Dynamic Path Planning in Vehicular Networks
title_sort multimetric ant colony optimization algorithm for dynamic path planning in vehicular networks
publisher SAGE Publishing
series International Journal of Distributed Sensor Networks
issn 1550-1477
publishDate 2015-10-01
description 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.
url https://doi.org/10.1155/2015/271067
work_keys_str_mv AT zhenwang amultimetricantcolonyoptimizationalgorithmfordynamicpathplanninginvehicularnetworks
AT jianqingli amultimetricantcolonyoptimizationalgorithmfordynamicpathplanninginvehicularnetworks
AT manlinfang amultimetricantcolonyoptimizationalgorithmfordynamicpathplanninginvehicularnetworks
AT yangli amultimetricantcolonyoptimizationalgorithmfordynamicpathplanninginvehicularnetworks
AT zhenwang multimetricantcolonyoptimizationalgorithmfordynamicpathplanninginvehicularnetworks
AT jianqingli multimetricantcolonyoptimizationalgorithmfordynamicpathplanninginvehicularnetworks
AT manlinfang multimetricantcolonyoptimizationalgorithmfordynamicpathplanninginvehicularnetworks
AT yangli multimetricantcolonyoptimizationalgorithmfordynamicpathplanninginvehicularnetworks
_version_ 1724686899578142720