Volume 10, Issue 1, 2017, Pages 677 - 689
An efficient encoding scheme for a new multiple-type museum visitor routing problem with must-see and select-see exhibition rooms
Authors
Yi-Chih Hsiehyhsieh@nfu.edu.tw
Department of Industrial Management, National Formosa University, Huwei, Yunlin 632, TAIWAN
Peng-Sheng You*, psyuu@mail.ncyu.edu.tw
Department of Business Administration, National ChiaYi University, Chia-Yi 600, TAIWAN
*Corresponding author: psyuu@mail.ncyu.edu.tw
Corresponding Author
Peng-Sheng Youpsyuu@mail.ncyu.edu.tw
Received 15 December 2015, Accepted 17 January 2017, Available Online 1 February 2017.
- DOI
- 10.2991/ijcis.2017.10.1.45How to use a DOI?
- Keywords
- museum visitor routing problem; algorithm; lower bound; encoding
- Abstract
We present a new multiple-type museum visitor routing problem (MT-MVRP) in which a museum’s exhibition rooms are classified into must-see and select-see rooms. A novel encoding scheme is proposed to simultaneously determine the scheduling of rooms for all of the groups and an immune based evolutionary algorithm is developed to solve the MT-MVRP. Additionally, the lower bound of the makespan for the MT-MVRP is derived. The numerical results of the immune based algorithm on three museums in Taiwan are discussed and compared with those by the other approaches.
- Copyright
- © 2017, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article under the CC BY-NC license (http://creativecommons.org/licences/by-nc/4.0/).
Download article (PDF)
View full text (HTML)
Cite this article
TY - JOUR AU - Yi-Chih Hsieh AU - Peng-Sheng You PY - 2017 DA - 2017/02/01 TI - An efficient encoding scheme for a new multiple-type museum visitor routing problem with must-see and select-see exhibition rooms JO - International Journal of Computational Intelligence Systems SP - 677 EP - 689 VL - 10 IS - 1 SN - 1875-6883 UR - https://doi.org/10.2991/ijcis.2017.10.1.45 DO - 10.2991/ijcis.2017.10.1.45 ID - Hsieh2017 ER -