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

2 Citations (Scopus)

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.

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
Pages539-546
Number of pages8
DOIs
Publication statusPublished - 2009 Dec 1

Publication series

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

Fingerprint

Ant colony optimization
Shortest path
Shortest Path Algorithm
Search Algorithm
Ant Colony System
Path
Navigation System
Driver
Navigation systems
Railroad cars
Vertex of a graph
Experiment
Experiments

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Mathematics(all)

Cite this

Ok, S. H., Seo, W. J., Ahn, J. H., Kang, S., & Moon, B. (2009). An ant colony optimization approach for the preference-based shortest path search. In D. Slezak, T. Kim, A. C-C. Chang, T. Vasilakos, M. Li, & K. Sakurai (Eds.), Communication and Networking: International Conference, FGCN/ACN 2009, Held as Part of the Future Generation Information Technology Conference, FGIT 2009, Jeju Island, Korea, December 10-12, 2009. Pro (pp. 539-546). (Communications in Computer and Information Science; Vol. 56). https://doi.org/10.1007/978-3-642-10844-0_63
Ok, Seung Ho ; Seo, Woo Jin ; Ahn, Jin Ho ; Kang, Sungho ; Moon, Byungin. / An ant colony optimization approach for the preference-based shortest path search. Communication and Networking: International Conference, FGCN/ACN 2009, Held as Part of the Future Generation Information Technology Conference, FGIT 2009, Jeju Island, Korea, December 10-12, 2009. Pro. editor / Dominik Slezak ; Tai-hoon Kim ; Alan Chin-Chen Chang ; Thanos Vasilakos ; MingChu Li ; Kouichi Sakurai. 2009. pp. 539-546 (Communications in Computer and Information Science).
@inproceedings{aff63484c75847b290bd785bb8ca877e,
title = "An ant colony optimization approach for the preference-based shortest path search",
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.",
author = "Ok, {Seung Ho} and Seo, {Woo Jin} and Ahn, {Jin Ho} and Sungho Kang and Byungin Moon",
year = "2009",
month = "12",
day = "1",
doi = "10.1007/978-3-642-10844-0_63",
language = "English",
isbn = "9783642108433",
series = "Communications in Computer and Information Science",
pages = "539--546",
editor = "Dominik Slezak and Tai-hoon Kim and Chang, {Alan Chin-Chen} and Thanos Vasilakos and MingChu Li and Kouichi Sakurai",
booktitle = "Communication and Networking",

}

Ok, SH, Seo, WJ, Ahn, JH, Kang, S & Moon, B 2009, An ant colony optimization approach for the preference-based shortest path search. in D Slezak, T Kim, AC-C Chang, T Vasilakos, M Li & K Sakurai (eds), Communication and Networking: International Conference, FGCN/ACN 2009, Held as Part of the Future Generation Information Technology Conference, FGIT 2009, Jeju Island, Korea, December 10-12, 2009. Pro. Communications in Computer and Information Science, vol. 56, pp. 539-546. https://doi.org/10.1007/978-3-642-10844-0_63

An ant colony optimization approach for the preference-based shortest path search. / Ok, Seung Ho; Seo, Woo Jin; Ahn, Jin Ho; Kang, Sungho; Moon, Byungin.

Communication and Networking: International Conference, FGCN/ACN 2009, Held as Part of the Future Generation Information Technology Conference, FGIT 2009, Jeju Island, Korea, December 10-12, 2009. Pro. ed. / Dominik Slezak; Tai-hoon Kim; Alan Chin-Chen Chang; Thanos Vasilakos; MingChu Li; Kouichi Sakurai. 2009. p. 539-546 (Communications in Computer and Information Science; Vol. 56).

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

TY - GEN

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

AU - Ok, Seung Ho

AU - Seo, Woo Jin

AU - Ahn, Jin Ho

AU - Kang, Sungho

AU - Moon, Byungin

PY - 2009/12/1

Y1 - 2009/12/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=73349109772&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=73349109772&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-10844-0_63

DO - 10.1007/978-3-642-10844-0_63

M3 - Conference contribution

AN - SCOPUS:73349109772

SN - 9783642108433

T3 - Communications in Computer and Information Science

SP - 539

EP - 546

BT - Communication and Networking

A2 - Slezak, Dominik

A2 - Kim, Tai-hoon

A2 - Chang, Alan Chin-Chen

A2 - Vasilakos, Thanos

A2 - Li, MingChu

A2 - Sakurai, Kouichi

ER -

Ok SH, Seo WJ, Ahn JH, Kang S, Moon B. An ant colony optimization approach for the preference-based shortest path search. In Slezak D, Kim T, Chang AC-C, Vasilakos T, Li M, Sakurai K, editors, Communication and Networking: International Conference, FGCN/ACN 2009, Held as Part of the Future Generation Information Technology Conference, FGIT 2009, Jeju Island, Korea, December 10-12, 2009. Pro. 2009. p. 539-546. (Communications in Computer and Information Science). https://doi.org/10.1007/978-3-642-10844-0_63