An ant colony optimization approach for the preference-based shortest path search

Seung Ho Ok, Woo Jin Seo, Jin Ho Ahn, Sungho Kang, Byungin Moon

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)


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.

Original languageEnglish
Title of host publicationCommunication and Networking
Subtitle of host publicationInternational Conference, FGCN/ACN 2009, Held as Part of the Future Generation Information Technology Conference, FGIT 2009, Jeju Island, Korea, December 10-12, 2009. Pro
EditorsDominik Slezak, Tai-hoon Kim, Alan Chin-Chen Chang, Thanos Vasilakos, MingChu Li, Kouichi Sakurai
Number of pages8
Publication statusPublished - 2009

Publication series

NameCommunications in Computer and Information Science
ISSN (Print)1865-0929

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Mathematics(all)


Dive into the research topics of 'An ant colony optimization approach for the preference-based shortest path search'. Together they form a unique fingerprint.

Cite this