Optimal Route Search Problem for a Visitor in a Theme Park Considering Waiting Time

Abstract

This paper proposes an algorithm for a route search problem of traveling multiple sites with the time-varying waiting time. The considering problem is typified when a guest in a crowded theme park visits attractions in a short time. The cost function is defined by three kinds of times: traveling time, service time, and waiting time. The proposed method is inspired by the “insertion and manipulation PSO strategy,” which only considers the relative traveling order. This paper introduces absolute traveling order into the algorithm to consider time-varying waiting time. Numerical experiments with theme park data verify the effectiveness of the proposed algorithm.