An efficient encoding scheme for a new multiple-type museum visitor routing problem with must-see and select-see exhibition rooms

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.