Tourism Service Scheduling in Smart City Based on Hybrid Genetic Algorithm Simulated Annealing Algorithm

被引:15
作者
Suanpang, Pannee [1 ]
Jamjuntr, Pitchaya [2 ]
Jermsittiparsert, Kittisak [3 ,4 ,5 ,6 ,7 ]
Kaewyong, Phuripoj [1 ]
机构
[1] Suan Dusit Univ, Fac Sci & Technol, Bangkok 10300, Thailand
[2] King Mongkuts Univ Technol Thonburi, Fac Engn, Bangkok 10140, Thailand
[3] Univ City Isl, Fac Educ, CY-9945 Gazimagusa, Cyprus
[4] Univ Muhammadiyah Sinjai, Fac Social & Polit Sci, Kabupaten Sinjai 92615, Sulawesi Selata, Indonesia
[5] Univ Muhammadiyah Makassar, Fac Social & Polit Sci, Kota Makassar 90221, Sulawesi Selata, Indonesia
[6] Univ Muhammadiyah Sidenreng Rappang, Publicat Res Inst & Community Serv, Rappang Regency 91651, South Sulawesi, Indonesia
[7] Sekolah Tinggi Ilmu Adm Abdul Haris, Kota Makassar 90000, Sulawesi Selata, Indonesia
关键词
service scheduling; hybrid genetic algorithms; simulated annealing algorithms; tourism services; sustainability tourism; PACKAGE TOURS; OPTIMIZATION ALGORITHM; DESTINATION CHOICE; JOB; MODEL; MANAGEMENT; TARDINESS; QUALITY; SEARCH; SYSTEM;
D O I
10.3390/su142316293
中图分类号
X [环境科学、安全科学];
学科分类号
08 ; 0830 ;
摘要
The disruptions in this era have caused a leap forward in information technology being applied in organizations to create a competitive advantage. In particular, we see this in tourism services, as they provide the best solution and prompt responses to create value in experiences and enhance the sustainability of tourism. Since scheduling is required in tourism service applications, it is regarded as a crucial topic in production management and combinatorial optimization. Since workshop scheduling difficulties are regarded as extremely difficult and complex, efforts to discover optimal or near-ideal solutions are vital. The aim of this study was to develop a hybrid genetic algorithm by combining a genetic algorithm and a simulated annealing algorithm with a gradient search method to the optimize complex processes involved in solving tourism service problems, as well as to compare the traditional genetic algorithms employed in smart city case studies in Thailand. A hybrid genetic algorithm was developed, and the results could assist in solving scheduling issues related to the sustainability of the tourism industry with the goal of lowering production requirements. An operation-based representation was employed to create workable schedules that can more effectively handle the given challenge. Additionally, a new knowledge-based operator was created within the context of function evaluation, which focuses on the features of the problem to utilize machine downtime to enhance the quality of the solution. To produce the offspring, a machine-based crossover with order-based precedence preservation was suggested. Additionally, a neighborhood search strategy based on simulated annealing was utilized to enhance the algorithm's capacity for local exploitation, and to broaden its usability. Numerous examples were gathered from the Thailand Tourism Department to demonstrate the effectiveness and efficiency of the proposed approach. The proposed hybrid genetic algorithm's computational results show good performance. We found that the hybrid genetic algorithm can effectively generate a satisfactory tourism service, and its performance is better than that of the genetic algorithm.
引用
收藏
页数:21
相关论文
共 90 条
[81]   Hybrid Genetic Simulated Annealing Algorithm for Improved Flow Shop Scheduling with Makespan Criterion [J].
Wei, Hongjing ;
Li, Shaobo ;
Jiang, Houmin ;
Hu, Jie ;
Hu, Jianjun .
APPLIED SCIENCES-BASEL, 2018, 8 (12)
[82]  
YAMADA T, 1992, PARALLEL PROBLEM SOLVING FROM NATURE, 2, P281
[83]   Solving job shop scheduling problem using a hybrid parallel micro genetic algorithm [J].
Yusof, Rubiyah ;
Khalid, Marzuki ;
Hui, Gan Teck ;
Yusof, Syafawati Md ;
Othman, Mohd Fauzi .
APPLIED SOFT COMPUTING, 2011, 11 (08) :5782-5792
[84]   A multi-objective cellular genetic algorithm for energy-oriented balancing and sequencing problem of mixed-model assembly line [J].
Zhang, Beikun ;
Xu, Liyun ;
Zhang, Jian .
JOURNAL OF CLEANER PRODUCTION, 2020, 244
[85]   Implementation of an Ant Colony Optimization technique for job shop scheduling problem [J].
Zhang, J ;
Hu, XM ;
Tan, X ;
Zhong, JH ;
Huang, Q .
TRANSACTIONS OF THE INSTITUTE OF MEASUREMENT AND CONTROL, 2006, 28 (01) :93-108
[86]   Solving the job shop scheduling problem using the imperialist competitive algorithm [J].
Zhang, Jie ;
Zhang, Peng ;
Yang, Jianxiong ;
Huang, Ying .
FRONTIERS OF ADVANCED MATERIALS AND ENGINEERING TECHNOLOGY, PTS 1-3, 2012, 430-432 :737-+
[87]   Optimization of Cutting Parameters for Minimizing Environmental Impact: Considering Energy Efficiency, Noise Emission and Economic Dimension [J].
Zhang, Lei ;
Zhang, Beikun ;
Bao, Hong ;
Huang, Haihong .
INTERNATIONAL JOURNAL OF PRECISION ENGINEERING AND MANUFACTURING, 2018, 19 (04) :613-624
[88]   A hybrid immune simulated annealing algorithm for the job shop scheduling problem [J].
Zhang, Rui ;
Wu, Cheng .
APPLIED SOFT COMPUTING, 2010, 10 (01) :79-89
[89]   The hybrid heuristic genetic algorithm for job shop scheduling [J].
Zhou, H ;
Feng, YC ;
Han, LM .
COMPUTERS & INDUSTRIAL ENGINEERING, 2001, 40 (03) :191-200
[90]   Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm [J].
Zhou, Hong ;
Cheung, Waiman ;
Leung, Lawrence C. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 194 (03) :637-649