Open Access

ARTICLE

A Generalized Museum Visitor Routing Problem Considering the Preferences and Congestion for Multiple Groups: An Example in Taiwan

Yi-Chih Hsieh¹, Peng-Sheng You^2,*

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,

Intelligent Automation & Soft Computing 2020, 26(4), 703-713. https://doi.org/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 performance of the IBA.

---

Keywords

---

Citations