Application of Travelling Salesman Problem for Minimizing Travel Distance of a Two-Day Trip in Kuala Lumpur via Go KL City Bus
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....
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English English |
| Published: |
Springer
2019
|
| Subjects: | |
| Online Access: | http://umpir.ump.edu.my/id/eprint/24583/1/23.%20Application%20of%20Travelling%20Salesman%20Problem%20for%20Minimizing%20Travel.pdf http://umpir.ump.edu.my/id/eprint/24583/2/23.1%20Application%20of%20Travelling%20Salesman%20Problem%20for%20Minimizing%20Travel.pdf |
| _version_ | 1825812636127723520 |
|---|---|
| author | Wan Nor Ashikin, Wan Ahmad Fatthi Mea Haslina, Mohd Haris Kahtan, Hasan |
| author_facet | Wan Nor Ashikin, Wan Ahmad Fatthi Mea Haslina, Mohd Haris Kahtan, Hasan |
| author_sort | Wan Nor Ashikin, Wan Ahmad Fatthi |
| collection | UMP |
| description | 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.64 km and 46.96 km, respectively. This study aims to promote tourism in Malaysia, thereby contributing to the country’s economic and tourism growth. |
| first_indexed | 2024-03-06T12:32:05Z |
| format | Conference or Workshop Item |
| id | UMPir24583 |
| institution | Universiti Malaysia Pahang |
| language | English English |
| last_indexed | 2024-03-06T12:32:05Z |
| publishDate | 2019 |
| publisher | Springer |
| record_format | dspace |
| spelling | UMPir245832020-03-04T07:56:33Z http://umpir.ump.edu.my/id/eprint/24583/ 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 Kahtan, Hasan QA76 Computer software 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.64 km and 46.96 km, respectively. This study aims to promote tourism in Malaysia, thereby contributing to the country’s economic and tourism growth. Springer 2019-12 Conference or Workshop Item PeerReviewed pdf en http://umpir.ump.edu.my/id/eprint/24583/1/23.%20Application%20of%20Travelling%20Salesman%20Problem%20for%20Minimizing%20Travel.pdf pdf en http://umpir.ump.edu.my/id/eprint/24583/2/23.1%20Application%20of%20Travelling%20Salesman%20Problem%20for%20Minimizing%20Travel.pdf Wan Nor Ashikin, Wan Ahmad Fatthi and Mea Haslina, Mohd Haris and Kahtan, Hasan (2019) Application of Travelling Salesman Problem for Minimizing Travel Distance of a Two-Day Trip in Kuala Lumpur via Go KL City Bus. In: Intelligent Computing & Optimization. International Conference on Intelligent Computing & Optimization: ICO 2018 , 4-5 October 2018 , Pattaya, Thailand. pp. 277-284., 866. ISBN 978-3-030-00979-3 (Published) https://link.springer.com/chapter/10.1007/978-3-030-00979-3_28 https://doi.org/10.1007/978-3-030-00979-3_28 |
| spellingShingle | QA76 Computer software Wan Nor Ashikin, Wan Ahmad Fatthi Mea Haslina, Mohd Haris Kahtan, Hasan Application of Travelling Salesman Problem for Minimizing Travel Distance of a Two-Day Trip in Kuala Lumpur via Go KL City Bus |
| title | Application of Travelling Salesman Problem for Minimizing Travel Distance of a Two-Day Trip in Kuala Lumpur via Go KL City Bus |
| title_full | Application of Travelling Salesman Problem for Minimizing Travel Distance of a Two-Day Trip in Kuala Lumpur via Go KL City Bus |
| title_fullStr | Application of Travelling Salesman Problem for Minimizing Travel Distance of a Two-Day Trip in Kuala Lumpur via Go KL City Bus |
| title_full_unstemmed | Application of Travelling Salesman Problem for Minimizing Travel Distance of a Two-Day Trip in Kuala Lumpur via Go KL City Bus |
| title_short | Application of Travelling Salesman Problem for Minimizing Travel Distance of a Two-Day Trip in Kuala Lumpur via Go KL City Bus |
| title_sort | application of travelling salesman problem for minimizing travel distance of a two day trip in kuala lumpur via go kl city bus |
| topic | QA76 Computer software |
| url | http://umpir.ump.edu.my/id/eprint/24583/1/23.%20Application%20of%20Travelling%20Salesman%20Problem%20for%20Minimizing%20Travel.pdf http://umpir.ump.edu.my/id/eprint/24583/2/23.1%20Application%20of%20Travelling%20Salesman%20Problem%20for%20Minimizing%20Travel.pdf |
| work_keys_str_mv | AT wannorashikinwanahmadfatthi applicationoftravellingsalesmanproblemforminimizingtraveldistanceofatwodaytripinkualalumpurviagoklcitybus AT meahaslinamohdharis applicationoftravellingsalesmanproblemforminimizingtraveldistanceofatwodaytripinkualalumpurviagoklcitybus AT kahtanhasan applicationoftravellingsalesmanproblemforminimizingtraveldistanceofatwodaytripinkualalumpurviagoklcitybus |