Developing a comprehensive tour package using an improved greedy algorithm with tourist preferences

Syariza Abdul Rahman, . and Aimi Sarah Abdullah, . and Engku M. Nazri, . and Harli Zakry Yahaya, . and Aida Mauziah Benjamin, . Developing a comprehensive tour package using an improved greedy algorithm with tourist preferences. pp. 93-104. ISSN 2672-7226

This study sought to improve three heuristic algorithms derived from prior studies and applied on tour packages based on six tourist preferences. The tour packages were then tested in a real-case study in Langkawi Malaysia. At present holiday packages in the island are drawn up individually by tour agents. If these packages fail to satisfy tourists the agents would face problems in offering their services including spending more time to plan new packages. Hence it is hoped that the improved algorithms would make it easy for tour agents to devise packages that best fit the preferences of tourists. Three tour packages with different objectives ” maximum places to visit (package 1) maximum popularity weight (package 2) and minimum cost (package 3) ” were formulated. If a tourist wants to visit as many places as possible in one day with a budget of RM100 they may visit six places at RM59 (package 1) four places at RM90 (package 2) or five places at RM40 (package 3). These packages nonetheless were not compared to determine the best. They are presented as alternatives that may be proposed by tour agents.

Full text available from: Official URL: https://jssm.umt.edu.my/wp-content/uploads/sites/5...

Abstract

This study sought to improve three heuristic algorithms derived from prior studies and applied on tour packages based on six tourist preferences. The tour packages were then tested in a real-case study in Langkawi Malaysia. At present holiday packages in the island are drawn up individually by tour agents. If these packages fail to satisfy tourists the agents would face problems in offering their services including spending more time to plan new packages. Hence it is hoped that the improved algorithms would make it easy for tour agents to devise packages that best fit the preferences of tourists. Three tour packages with different objectives ” maximum places to visit (package 1) maximum popularity weight (package 2) and minimum cost (package 3) ” were formulated. If a tourist wants to visit as many places as possible in one day with a budget of RM100 they may visit six places at RM59 (package 1) four places at RM90 (package 2) or five places at RM40 (package 3). These packages nonetheless were not compared to determine the best. They are presented as alternatives that may be proposed by tour agents.

[error in script]

Item Type:	Article
AGROVOC Term:	Tourism
AGROVOC Term:	Business management
AGROVOC Term:	Work planning
AGROVOC Term:	Sales promotion
AGROVOC Term:	Consumer preferences
AGROVOC Term:	Budgets
AGROVOC Term:	Duration
AGROVOC Term:	Time
Depositing User:	Mr. AFANDI ABDUL MALEK
Last Modified:	24 Apr 2025 00:54
URI:	http://webagris.upm.edu.my/id/eprint/8592

Actions (login required)

View Item