Vol.26, No.4, 2020, pp.703-713, doi:10.32604/iasc.2020.010104
OPEN ACCESS
ARTICLE
A Generalized Museum Visitor Routing Problem Considering the Preferences and Congestion for Multiple Groups: An Example in Taiwan
  • Yi-Chih Hsieh1, Peng-Sheng You2,*
1 Department of Industrial Management, National Formosa University, Yunlin, Taiwan
2 Department of Business Administration, National ChiaYi University, Chia-Yi, Taiwan
* Corresponding Author: Peng-Sheng You, psyuu@mail.ncyu.edu.tw
Abstract
In this study we present a generalized museum visitor routing problem considering the preferences and congestion of multiple groups with each group having its own must-see and select-see exhibition rooms based on their preferences in exhibits. The problem aims to minimize the makespan of all groups. An effective encoding scheme is proposed to simultaneously determine the scheduling of exhibition rooms for all groups and an immune-based algorithm (IBA) is developed. Numerical results, compared with those of a genetic algorithm and particle swarm optimization, on a museum in Taiwan are reported and discussed to show the performance of the IBA.
Keywords
Generalized museum visitor routing problem, Preference, Congestion, Algorithm, Optimization.
Cite This Article
Y. Hsieh and P. You, "A generalized museum visitor routing problem considering the preferences and congestion for multiple groups: an example in taiwan," Intelligent Automation & Soft Computing, vol. 26, no.4, pp. 703–713, 2020.
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.