@Article{iasc.2020.010104,
AUTHOR = {Yi-Chih Hsieh, Peng-Sheng You},
TITLE = {A Generalized Museum Visitor Routing Problem Considering the  Preferences and Congestion for Multiple Groups: An Example in Taiwan},
JOURNAL = {Intelligent Automation \& Soft Computing},
VOLUME = {26},
YEAR = {2020},
NUMBER = {4},
PAGES = {703--713},
URL = {http://www.techscience.com/iasc/v26n4/40274},
ISSN = {2326-005X},
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.},
DOI = {10.32604/iasc.2020.010104}
}