TY - GEN
T1 - Museum visitor routing problem with the balancing of concurrent visitors
AU - Chou, Shuo Yan
AU - Lin, Shih Wei
PY - 2007
Y1 - 2007
N2 - In the museum visitor routing problem, each visitor has some exhibits of interest. The visiting route requires going through all the locations of the exhibits that he/she wants to visit. Routes need to be scheduled based on certain criteria to avoid congestion and/or prolonged touring time. In this study, museum visitor routing problems (MVRPs) are formulated by mixed integer programming and can be solved as open shop scheduling (OSS) problems. While visitors can be viewed as jobs, exhibits are like machines. Each visitor would view an exhibit for a certain amount of time, which is analogous to the processing time required for each job at a particular machine. The traveling distance from one exhibit to another can be modeled as the setup time at a machine. It is clear that such setup time is sequence dependent which are not considered in OSS problems. Therefore, this kind of routing problem is an extension of OSS problems. Due to the intrinsic complexity of this kind of problems, that is NP-hard, a simulated annealing approach is proposed to solve MVRPs. The computational results show that the proposed approach solves the MVRPS with a reasonable amount of computational time.
AB - In the museum visitor routing problem, each visitor has some exhibits of interest. The visiting route requires going through all the locations of the exhibits that he/she wants to visit. Routes need to be scheduled based on certain criteria to avoid congestion and/or prolonged touring time. In this study, museum visitor routing problems (MVRPs) are formulated by mixed integer programming and can be solved as open shop scheduling (OSS) problems. While visitors can be viewed as jobs, exhibits are like machines. Each visitor would view an exhibit for a certain amount of time, which is analogous to the processing time required for each job at a particular machine. The traveling distance from one exhibit to another can be modeled as the setup time at a machine. It is clear that such setup time is sequence dependent which are not considered in OSS problems. Therefore, this kind of routing problem is an extension of OSS problems. Due to the intrinsic complexity of this kind of problems, that is NP-hard, a simulated annealing approach is proposed to solve MVRPs. The computational results show that the proposed approach solves the MVRPS with a reasonable amount of computational time.
KW - Museum visitor routing problem
KW - Open shop scheduling
KW - Sequence-dependence setup times
KW - Simulated annealing
KW - Vehicle routing
UR - http://www.scopus.com/inward/record.url?scp=84878242956&partnerID=8YFLogxK
U2 - 10.1007/978-1-84628-976-7_39
DO - 10.1007/978-1-84628-976-7_39
M3 - 会议稿件
AN - SCOPUS:84878242956
SN - 9781846289750
T3 - Complex Systems Concurrent Engineering: Collaboration, Technology Innovation and Sustainability
SP - 345
EP - 353
BT - Complex Systems Concurrent Engineering
T2 - 14th ISPE International Conference on Concurrent Engineering, CE 2007
Y2 - 16 July 2007 through 20 July 2007
ER -