Yi-Chih Hsieh1, Peng-Sheng You2,*
Intelligent Automation & Soft Computing, Vol.26, No.4, pp. 703-713, 2020, DOI:10.32604/iasc.2020.010104
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 More >
Login
Register
