IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v11y2015i10p271067.html
   My bibliography  Save this article

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

Author

Listed:
  • Zhen Wang
  • Jianqing Li
  • Manlin Fang
  • Yang Li

Abstract

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.

Suggested Citation

  • Zhen Wang & Jianqing Li & Manlin Fang & Yang Li, 2015. "A Multimetric Ant Colony Optimization Algorithm for Dynamic Path Planning in Vehicular Networks," International Journal of Distributed Sensor Networks, , vol. 11(10), pages 271067-2710, October.
  • Handle: RePEc:sae:intdis:v:11:y:2015:i:10:p:271067
    DOI: 10.1155/2015/271067
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2015/271067
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2015/271067?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:11:y:2015:i:10:p:271067. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.