Determination of optimal self-drive tourism route using the orienteering problem method

Zakiah Hashim, Wan Rosmanira Ismail, Norfaieqah Ahmad

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

1 Citation (Scopus)

Abstract

This paper was conducted to determine the optimal travel routes for self-drive tourism based on the allocation of time and expense by maximizing the amount of attraction scores assigned to each city involved. Self-drive tourism represents a type of tourism where tourists hire or travel by their own vehicle. It only involves a tourist destination which can be linked with a network of roads. Normally, the traveling salesman problem (TSP) and multiple traveling salesman problems (MTSP) method were used in the minimization problem such as determination the shortest time or distance traveled. This paper involved an alternative approach for maximization method which is maximize the attraction scores and tested on tourism data for ten cities in Kedah. A set of priority scores are used to set the attraction score at each city. The classical approach of the orienteering problem was used to determine the optimal travel route. This approach is extended to the team orienteering problem and the two methods were compared. These two models have been solved by using LINGO12.0 software. The results indicate that the model involving the team orienteering problem provides a more appropriate solution compared to the orienteering problem model.

Original languageEnglish
Title of host publicationAIP Conference Proceedings
Pages1420-1430
Number of pages11
Volume1522
DOIs
Publication statusPublished - 2013
Event20th National Symposium on Mathematical Sciences - Research in Mathematical Sciences: A Catalyst for Creativity and Innovation, SKSM 2012 - Putrajaya
Duration: 18 Dec 201220 Dec 2012

Other

Other20th National Symposium on Mathematical Sciences - Research in Mathematical Sciences: A Catalyst for Creativity and Innovation, SKSM 2012
CityPutrajaya
Period18/12/1220/12/12

Fingerprint

tourism
routes
traveling salesman problem
travel
attraction
roads
vehicles
computer programs
optimization

Keywords

  • Optimal travel route
  • Orienteering problem
  • Self-drive tourism
  • Team orienteering problem

ASJC Scopus subject areas

  • Physics and Astronomy(all)

Cite this

Hashim, Z., Ismail, W. R., & Ahmad, N. (2013). Determination of optimal self-drive tourism route using the orienteering problem method. In AIP Conference Proceedings (Vol. 1522, pp. 1420-1430) https://doi.org/10.1063/1.4801296

Determination of optimal self-drive tourism route using the orienteering problem method. / Hashim, Zakiah; Ismail, Wan Rosmanira; Ahmad, Norfaieqah.

AIP Conference Proceedings. Vol. 1522 2013. p. 1420-1430.

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

Hashim, Z, Ismail, WR & Ahmad, N 2013, Determination of optimal self-drive tourism route using the orienteering problem method. in AIP Conference Proceedings. vol. 1522, pp. 1420-1430, 20th National Symposium on Mathematical Sciences - Research in Mathematical Sciences: A Catalyst for Creativity and Innovation, SKSM 2012, Putrajaya, 18/12/12. https://doi.org/10.1063/1.4801296
Hashim, Zakiah ; Ismail, Wan Rosmanira ; Ahmad, Norfaieqah. / Determination of optimal self-drive tourism route using the orienteering problem method. AIP Conference Proceedings. Vol. 1522 2013. pp. 1420-1430
@inproceedings{7a5e2bf878864acb9ca5312aeedfec50,
title = "Determination of optimal self-drive tourism route using the orienteering problem method",
abstract = "This paper was conducted to determine the optimal travel routes for self-drive tourism based on the allocation of time and expense by maximizing the amount of attraction scores assigned to each city involved. Self-drive tourism represents a type of tourism where tourists hire or travel by their own vehicle. It only involves a tourist destination which can be linked with a network of roads. Normally, the traveling salesman problem (TSP) and multiple traveling salesman problems (MTSP) method were used in the minimization problem such as determination the shortest time or distance traveled. This paper involved an alternative approach for maximization method which is maximize the attraction scores and tested on tourism data for ten cities in Kedah. A set of priority scores are used to set the attraction score at each city. The classical approach of the orienteering problem was used to determine the optimal travel route. This approach is extended to the team orienteering problem and the two methods were compared. These two models have been solved by using LINGO12.0 software. The results indicate that the model involving the team orienteering problem provides a more appropriate solution compared to the orienteering problem model.",
keywords = "Optimal travel route, Orienteering problem, Self-drive tourism, Team orienteering problem",
author = "Zakiah Hashim and Ismail, {Wan Rosmanira} and Norfaieqah Ahmad",
year = "2013",
doi = "10.1063/1.4801296",
language = "English",
isbn = "9780735411500",
volume = "1522",
pages = "1420--1430",
booktitle = "AIP Conference Proceedings",

}

TY - GEN

T1 - Determination of optimal self-drive tourism route using the orienteering problem method

AU - Hashim, Zakiah

AU - Ismail, Wan Rosmanira

AU - Ahmad, Norfaieqah

PY - 2013

Y1 - 2013

N2 - This paper was conducted to determine the optimal travel routes for self-drive tourism based on the allocation of time and expense by maximizing the amount of attraction scores assigned to each city involved. Self-drive tourism represents a type of tourism where tourists hire or travel by their own vehicle. It only involves a tourist destination which can be linked with a network of roads. Normally, the traveling salesman problem (TSP) and multiple traveling salesman problems (MTSP) method were used in the minimization problem such as determination the shortest time or distance traveled. This paper involved an alternative approach for maximization method which is maximize the attraction scores and tested on tourism data for ten cities in Kedah. A set of priority scores are used to set the attraction score at each city. The classical approach of the orienteering problem was used to determine the optimal travel route. This approach is extended to the team orienteering problem and the two methods were compared. These two models have been solved by using LINGO12.0 software. The results indicate that the model involving the team orienteering problem provides a more appropriate solution compared to the orienteering problem model.

AB - This paper was conducted to determine the optimal travel routes for self-drive tourism based on the allocation of time and expense by maximizing the amount of attraction scores assigned to each city involved. Self-drive tourism represents a type of tourism where tourists hire or travel by their own vehicle. It only involves a tourist destination which can be linked with a network of roads. Normally, the traveling salesman problem (TSP) and multiple traveling salesman problems (MTSP) method were used in the minimization problem such as determination the shortest time or distance traveled. This paper involved an alternative approach for maximization method which is maximize the attraction scores and tested on tourism data for ten cities in Kedah. A set of priority scores are used to set the attraction score at each city. The classical approach of the orienteering problem was used to determine the optimal travel route. This approach is extended to the team orienteering problem and the two methods were compared. These two models have been solved by using LINGO12.0 software. The results indicate that the model involving the team orienteering problem provides a more appropriate solution compared to the orienteering problem model.

KW - Optimal travel route

KW - Orienteering problem

KW - Self-drive tourism

KW - Team orienteering problem

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

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

U2 - 10.1063/1.4801296

DO - 10.1063/1.4801296

M3 - Conference contribution

SN - 9780735411500

VL - 1522

SP - 1420

EP - 1430

BT - AIP Conference Proceedings

ER -