Skip to main content
SpringerLink
Log in

An Ant Colony Optimization Approach for the Preference-Based Shortest Path Search

  • Conference paper
Communication and Networking (FGCN 2009)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 56))

Abstract

In this paper, a modified ant colony system (ACS) algorithm is proposed to find a shortest path based on the preference of links. Most of the shortest path search algorithms aim at finding the distance or time shortest paths. However, these shortest paths are not surely an optimum path for the drivers who prefer choosing a less short, but more reliable or flexible path. For this reason, we propose the preference-based shortest path search algorithm which uses the properties of the links of the map. The properties of the links are specified by a set of data provided by the user of the car navigation system. The proposed algorithm was implemented in C and experiments were performed upon the map that includes 64 nodes with 118 links.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Fu, L., Sun, D., Rilett, L.R.: Heuristic shortest path algorithms for transportation applications: state of the art. Computers and Operations Research 33(11), 3324–3343 (2006)

    Article  MATH  Google Scholar 

  2. Noto, M., Sato, H.: A method for the shortest path search by extended Dijkstra algorithm. In: IEEE International Conference Systems on Man, and Cybernetics, vol. 3, pp. 2316–2320 (2000)

    Google Scholar 

  3. Nazari, S., Meybodi, M.R., Salehigh, M.A., Taghipour, S.: An Advanced Algorithm for Finding Shortest Path in Car Navigation System. In: International Workshop on Intelligent Networks and Intelligent Systems, pp. 671–674 (2008)

    Google Scholar 

  4. Yue, H., Shao, C.: Study on the Application of A* Shortest Path Search Algorithm in Dynamic Urban Traffic. In: Third International Conference on Natural Computation, vol. 3, pp. 463–469 (2007)

    Google Scholar 

  5. Salehinejad, H., Talebi, S.: A new ant algorithm based vehicle navigation system: A wireless networking approach. In: International Symposium on Telecommunications, pp. 36–41 (2008)

    Google Scholar 

  6. Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B 26(1), 29–41 (1996)

    Article  Google Scholar 

  7. Gambardella, L.M., Dorigo, M.: Solving Symmetric and Asymmetric TSPs by Ant Colonies. In: Proceedings of the IEEE Conference on Evolutionary Computation, pp. 622–627 (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Electrical Eng. & Computer Science, Kyungpook National University, Daegu, Korea

    Seung-Ho Ok, Woo-Jin Seo & Byungin Moon

  2. Dept. of Electronic Engineering, Hoseo University, Chungcheongnam-do, Korea

    Jin-Ho Ahn

  3. Dept. of Electrical and Electronic Engineering, Yonsei University, Seoul, Korea

    Sungho Kang

Authors
  1. Seung-Ho Ok
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Woo-Jin Seo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jin-Ho Ahn
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Sungho Kang
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Byungin Moon
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Warsaw & Infobright Inc., Poland

    Dominik Ślęzak

  2. Hannam University, 306-791, Daejeon, South Korea

    Tai-hoon Kim

  3. National Chung Cheng University, Chiayi County, Taiwan

    Alan Chin-Chen Chang

  4. University of Western Macedonia, West Macedonia, Greece

    Thanos Vasilakos

  5. Tianjin University, China

    MingChu Li

  6. Faculty of Information Science and Electrical Engineering, Kyushu University, 6-10-1 Hakozaki, 812-8581, Fukuoka, Japan

    Kouichi Sakurai

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ok, SH., Seo, WJ., Ahn, JH., Kang, S., Moon, B. (2009). An Ant Colony Optimization Approach for the Preference-Based Shortest Path Search. In: Ślęzak, D., Kim, Th., Chang, A.CC., Vasilakos, T., Li, M., Sakurai, K. (eds) Communication and Networking. FGCN 2009. Communications in Computer and Information Science, vol 56. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10844-0_63

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10844-0_63

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10843-3

  • Online ISBN: 978-3-642-10844-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation