Application of Travelling Salesman Problem for Minimizing Travel Distance of a Two-Day Trip in Kuala Lumpur via Go KL City Bus

Wan Nor Ashikin Wan Ahmad Fatthi; Mea Haslina Mohd Haris; Hasan Kahtan

doi:10.1007/978-3-030-00979-3_28

Application of Travelling Salesman Problem for Minimizing Travel Distance of a Two-Day Trip in Kuala Lumpur via Go KL City Bus

Wan Nor Ashikin Wan Ahmad Fatthi^*, Mea Haslina Mohd Haris, Hasan Kahtan

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

5 Citations (Scopus)

Abstract

Kuala Lumpur is a cosmopolitan urban centre of Malaysia and has received more than 11 million tourists per year. Tourists usually spend a few days in Kuala Lumpur to visit as many attractions as possible. However, planning such trips can be challenging for tourists who are unfamiliar with the city. Moreover, they are restricted by time and budget constraints. One of the free charter public transports in Kuala Lumpur is the Go KL City Bus. This study aims to assist tourists or travellers (domestic or international) in optimizing their trip around Kuala Lumpur via the Go KL City Bus. A mathematical approach called travelling salesman problem is used to identify the shortest distance between the places of interest. The study proposes a solution on the basis of a two-day tour route for selected tourist attractions in Kuala Lumpur. Results show that the shortest distance of routes for the first and second days are 48.64km and 46.96km, respectively. This study aims to promote tourism in Malaysia, thereby contributing to the country’s economic and tourism growth.

Original language	English
Title of host publication	Intelligent Computing and Optimization
Editors	Pandian Vasant, Gerhard-Wilhelm Weber, Ivan Zelinka
Publisher	Springer Verlag
Pages	277-284
Number of pages	8
ISBN (Print)	9783030009786
DOIs	https://doi.org/10.1007/978-3-030-00979-3_28
Publication status	Published - 28 Sept 2018
Externally published	Yes
Event	International Conference on Intelligent Computing and Optimization, ICO 2018 - Pattaya, Thailand Duration: 4 Oct 2018 → 5 Oct 2018

Publication series

Name	Advances in Intelligent Systems and Computing
Volume	866
ISSN (Print)	2194-5357

Conference

Conference	International Conference on Intelligent Computing and Optimization, ICO 2018
Country/Territory	Thailand
City	Pattaya
Period	4/10/18 → 5/10/18

Keywords

Optimization
Shortest distance
Tourism route
Travelling salesman problem

Access to Document

10.1007/978-3-030-00979-3_28

Cite this

Fatthi, W. N. A. W. A., Haris, M. H. M., & Kahtan, H. (2018). Application of Travelling Salesman Problem for Minimizing Travel Distance of a Two-Day Trip in Kuala Lumpur via Go KL City Bus. In P. Vasant, G.-W. Weber, & I. Zelinka (Eds.), Intelligent Computing and Optimization (pp. 277-284). (Advances in Intelligent Systems and Computing; Vol. 866). Springer Verlag. https://doi.org/10.1007/978-3-030-00979-3_28

Fatthi, Wan Nor Ashikin Wan Ahmad ; Haris, Mea Haslina Mohd ; Kahtan, Hasan. / Application of Travelling Salesman Problem for Minimizing Travel Distance of a Two-Day Trip in Kuala Lumpur via Go KL City Bus. Intelligent Computing and Optimization. editor / Pandian Vasant ; Gerhard-Wilhelm Weber ; Ivan Zelinka. Springer Verlag, 2018. pp. 277-284 (Advances in Intelligent Systems and Computing).

@inproceedings{ebacf9bda01a42bdaa75e7ce72e83275,

title = "Application of Travelling Salesman Problem for Minimizing Travel Distance of a Two-Day Trip in Kuala Lumpur via Go KL City Bus",

abstract = "Kuala Lumpur is a cosmopolitan urban centre of Malaysia and has received more than 11 million tourists per year. Tourists usually spend a few days in Kuala Lumpur to visit as many attractions as possible. However, planning such trips can be challenging for tourists who are unfamiliar with the city. Moreover, they are restricted by time and budget constraints. One of the free charter public transports in Kuala Lumpur is the Go KL City Bus. This study aims to assist tourists or travellers (domestic or international) in optimizing their trip around Kuala Lumpur via the Go KL City Bus. A mathematical approach called travelling salesman problem is used to identify the shortest distance between the places of interest. The study proposes a solution on the basis of a two-day tour route for selected tourist attractions in Kuala Lumpur. Results show that the shortest distance of routes for the first and second days are 48.64km and 46.96km, respectively. This study aims to promote tourism in Malaysia, thereby contributing to the country{\textquoteright}s economic and tourism growth.",

keywords = "Optimization, Shortest distance, Tourism route, Travelling salesman problem",

author = "Fatthi, {Wan Nor Ashikin Wan Ahmad} and Haris, {Mea Haslina Mohd} and Hasan Kahtan",

note = "Publisher Copyright: {\textcopyright} 2019, Springer Nature Switzerland AG.; International Conference on Intelligent Computing and Optimization, ICO 2018 ; Conference date: 04-10-2018 Through 05-10-2018",

year = "2018",

month = sep,

day = "28",

doi = "10.1007/978-3-030-00979-3_28",

language = "English",

isbn = "9783030009786",

series = "Advances in Intelligent Systems and Computing",

publisher = "Springer Verlag",

pages = "277--284",

editor = "Pandian Vasant and Gerhard-Wilhelm Weber and Ivan Zelinka",

booktitle = "Intelligent Computing and Optimization",

}

Fatthi, WNAWA, Haris, MHM & Kahtan, H 2018, Application of Travelling Salesman Problem for Minimizing Travel Distance of a Two-Day Trip in Kuala Lumpur via Go KL City Bus. in P Vasant, G-W Weber & I Zelinka (eds), Intelligent Computing and Optimization. Advances in Intelligent Systems and Computing, vol. 866, Springer Verlag, pp. 277-284, International Conference on Intelligent Computing and Optimization, ICO 2018, Pattaya, Thailand, 4/10/18. https://doi.org/10.1007/978-3-030-00979-3_28

Application of Travelling Salesman Problem for Minimizing Travel Distance of a Two-Day Trip in Kuala Lumpur via Go KL City Bus. / Fatthi, Wan Nor Ashikin Wan Ahmad; Haris, Mea Haslina Mohd; Kahtan, Hasan.
Intelligent Computing and Optimization. ed. / Pandian Vasant; Gerhard-Wilhelm Weber; Ivan Zelinka. Springer Verlag, 2018. p. 277-284 (Advances in Intelligent Systems and Computing; Vol. 866).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Application of Travelling Salesman Problem for Minimizing Travel Distance of a Two-Day Trip in Kuala Lumpur via Go KL City Bus

AU - Fatthi, Wan Nor Ashikin Wan Ahmad

AU - Haris, Mea Haslina Mohd

AU - Kahtan, Hasan

PY - 2018/9/28

Y1 - 2018/9/28

N2 - Kuala Lumpur is a cosmopolitan urban centre of Malaysia and has received more than 11 million tourists per year. Tourists usually spend a few days in Kuala Lumpur to visit as many attractions as possible. However, planning such trips can be challenging for tourists who are unfamiliar with the city. Moreover, they are restricted by time and budget constraints. One of the free charter public transports in Kuala Lumpur is the Go KL City Bus. This study aims to assist tourists or travellers (domestic or international) in optimizing their trip around Kuala Lumpur via the Go KL City Bus. A mathematical approach called travelling salesman problem is used to identify the shortest distance between the places of interest. The study proposes a solution on the basis of a two-day tour route for selected tourist attractions in Kuala Lumpur. Results show that the shortest distance of routes for the first and second days are 48.64km and 46.96km, respectively. This study aims to promote tourism in Malaysia, thereby contributing to the country’s economic and tourism growth.

AB - Kuala Lumpur is a cosmopolitan urban centre of Malaysia and has received more than 11 million tourists per year. Tourists usually spend a few days in Kuala Lumpur to visit as many attractions as possible. However, planning such trips can be challenging for tourists who are unfamiliar with the city. Moreover, they are restricted by time and budget constraints. One of the free charter public transports in Kuala Lumpur is the Go KL City Bus. This study aims to assist tourists or travellers (domestic or international) in optimizing their trip around Kuala Lumpur via the Go KL City Bus. A mathematical approach called travelling salesman problem is used to identify the shortest distance between the places of interest. The study proposes a solution on the basis of a two-day tour route for selected tourist attractions in Kuala Lumpur. Results show that the shortest distance of routes for the first and second days are 48.64km and 46.96km, respectively. This study aims to promote tourism in Malaysia, thereby contributing to the country’s economic and tourism growth.

KW - Optimization

KW - Shortest distance

KW - Tourism route

KW - Travelling salesman problem

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

U2 - 10.1007/978-3-030-00979-3_28

DO - 10.1007/978-3-030-00979-3_28

M3 - Conference contribution

AN - SCOPUS:85054722425

SN - 9783030009786

T3 - Advances in Intelligent Systems and Computing

SP - 277

EP - 284

BT - Intelligent Computing and Optimization

A2 - Vasant, Pandian

A2 - Weber, Gerhard-Wilhelm

A2 - Zelinka, Ivan

PB - Springer Verlag

T2 - International Conference on Intelligent Computing and Optimization, ICO 2018

Y2 - 4 October 2018 through 5 October 2018

ER -

Application of Travelling Salesman Problem for Minimizing Travel Distance of a Two-Day Trip in Kuala Lumpur via Go KL City Bus

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Cite this