An optimal routing problem for sightseeing with fuzzy time-varying weights

The purpose of this study is to derive the optimal route for sightseeing. In order to obtain the optimal route, we have defined an optimal routing problem for sightseeing (ORPS). In ORPS, the travel time or the location value has been treated as a crisp number. However, it is better that these values are expressed by ambiguous value like "about 10 minutes" rather than by crisp number. In this paper, we formalize an optimal routing problem adopting fuzzy time-varying travel time and propose an algorithm to solve the problem.