Autosoft Journal

Online Manuscript Access


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


Authors



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


Pages

Total Pages: 11

DOI
10.31209/2020.100000144


Manuscript ViewPdf Subscription required to access this document

Obtain access this manuscript in one of the following ways


Already subscribed?

Need information on obtaining a subscription? Personal and institutional subscriptions are available.

Already an author? Have access via email address?


Published

Online Article

JOURNAL INFORMATION


ISSN PRINT: 1079-8587
ISSN ONLINE: 2326-005X
DOI PREFIX: 10.31209
10.1080/10798587 with T&F
IMPACT FACTOR: 0.652 (2017/2018)

TWO YEAR CITATIONS PER DOCUMENT (SJR DATA): 0.993 (2018)
SJR: "The two years line is equivalent to journal impact factor ™ (Thomson Reuters) metric."





Journal: 1995-Present


CONTACT INFORMATION


TSI Press
18015 Bullis Hill
San Antonio, TX 78258 USA
PH: 210 479 1022
FAX: 210 479 1048
EMAIL: tsiepress@gmail.com
WEB: http://www.wacong.org/tsi/