An interactive multiobjective programming approach to tour route planning problems

摘要

This article considers tour route planning problems to find an optimal tour route in sightseeing. Tour routes are optimized in terms of two types of criteria. The first optimization criterion is to maximize the sum of values of places a tourist visits, namely, the sum of the values of sightseeing spots, restaurants and hotels. The second optimization criterion is to minimize the tiredness caused by moving from place to place, which is dependent on means of transportation. This paper provides a problem formulation of a tour route planning problem as a multiobjective mixed 0-1 programming problem in which the number of constraints is a polynomial order of the number of places possible to visit or stay. An interactive algorithm is provided in order to find a satisficing solution reflecting tourist's preferences.