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: Contribution to journalArticle

12 Citations (Scopus)

Abstract

This article proposes a modified ant colony system algorithm for finding the shortest path with preferred links. Most of the shortest path search algorithms focus on finding the distance or time shortest paths. However, these shortest paths may not necessarily be the optimum path for drivers who prefer choosing a less short, yet more reliable or flexible path. Accordingly, a preference-based shortest path search algorithm is proposed that uses the properties of the links in a map, as specified by a set of data provided by the user of the car navigation system. The proposed algorithm is implemented in C and experiments are performed using maps that include 64, 128, 192, and 256 nodes with 118, 242, 362, and 484 links, respectively. The simulation results with various parameter sets confirm that the proposed algorithm is effective for finding the preference-based shortest path.

Original languageEnglish
Pages (from-to)181-196
Number of pages16
JournalJournal of the Chinese Institute of Engineers, Transactions of the Chinese Institute of Engineers,Series A/Chung-kuo Kung Ch'eng Hsuch K'an
Volume34
Issue number2
DOIs
Publication statusPublished - 2011 Mar 1

Fingerprint

Ant colony optimization
Navigation systems
Railroad cars
Experiments

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this

@article{4c3158923f12447c8822a53e9cd252d2,
title = "An ant colony optimization approach for the preference-based shortest path search",
abstract = "This article proposes a modified ant colony system algorithm for finding the shortest path with preferred links. Most of the shortest path search algorithms focus on finding the distance or time shortest paths. However, these shortest paths may not necessarily be the optimum path for drivers who prefer choosing a less short, yet more reliable or flexible path. Accordingly, a preference-based shortest path search algorithm is proposed that uses the properties of the links in a map, as specified by a set of data provided by the user of the car navigation system. The proposed algorithm is implemented in C and experiments are performed using maps that include 64, 128, 192, and 256 nodes with 118, 242, 362, and 484 links, respectively. The simulation results with various parameter sets confirm that the proposed algorithm is effective for finding the preference-based shortest path.",
author = "Ok, {Seung Ho} and Seo, {Woo Jin} and Ahn, {Jin Ho} and Sungho Kang and Byungin Moon",
year = "2011",
month = "3",
day = "1",
doi = "10.1080/02533839.2011.565574",
language = "English",
volume = "34",
pages = "181--196",
journal = "Chung-kuo Kung Ch'eng Hsueh K'an/Journal of the Chinese Institute of Engineers",
issn = "0253-3839",
publisher = "Chinese Institute of Engineers",
number = "2",

}

TY - JOUR

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 - 2011/3/1

Y1 - 2011/3/1

N2 - This article proposes a modified ant colony system algorithm for finding the shortest path with preferred links. Most of the shortest path search algorithms focus on finding the distance or time shortest paths. However, these shortest paths may not necessarily be the optimum path for drivers who prefer choosing a less short, yet more reliable or flexible path. Accordingly, a preference-based shortest path search algorithm is proposed that uses the properties of the links in a map, as specified by a set of data provided by the user of the car navigation system. The proposed algorithm is implemented in C and experiments are performed using maps that include 64, 128, 192, and 256 nodes with 118, 242, 362, and 484 links, respectively. The simulation results with various parameter sets confirm that the proposed algorithm is effective for finding the preference-based shortest path.

AB - This article proposes a modified ant colony system algorithm for finding the shortest path with preferred links. Most of the shortest path search algorithms focus on finding the distance or time shortest paths. However, these shortest paths may not necessarily be the optimum path for drivers who prefer choosing a less short, yet more reliable or flexible path. Accordingly, a preference-based shortest path search algorithm is proposed that uses the properties of the links in a map, as specified by a set of data provided by the user of the car navigation system. The proposed algorithm is implemented in C and experiments are performed using maps that include 64, 128, 192, and 256 nodes with 118, 242, 362, and 484 links, respectively. The simulation results with various parameter sets confirm that the proposed algorithm is effective for finding the preference-based shortest path.

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

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

U2 - 10.1080/02533839.2011.565574

DO - 10.1080/02533839.2011.565574

M3 - Article

VL - 34

SP - 181

EP - 196

JO - Chung-kuo Kung Ch'eng Hsueh K'an/Journal of the Chinese Institute of Engineers

JF - Chung-kuo Kung Ch'eng Hsueh K'an/Journal of the Chinese Institute of Engineers

SN - 0253-3839

IS - 2

ER -