Developing a comprehensive tour package using an improved greedy algorithm with tourist preferences
2019
Syariza Abdul Rahman | Aimi Sarah Abdullah | Engku M. Nazri | Harli Zakry Yahaya | Aida Mauziah Benjamin
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.
Показать больше [+] Меньше [-]Ключевые слова АГРОВОК
Библиографическая информация
Эту запись предоставил Universiti Putra Malaysia
