Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
490397 | Procedia Computer Science | 2013 | 10 Pages |
This paper proposes a versatile and interactive route planning problem for sightseeing under various conditions based on constraints of required traveling times and total satisfaction of sightseeing activities, which are time-dependent. In general, traveling times among sightseeing places and the satisfactions of activities also change dependent on various conditions such as weather, climate and season. It is important to represent a satisfying route to ensure the large satisfaction even if any assumable condition happens. In order to incorporate the above-mentioned situations, a multi-objective route planning problem is formulated as a network optimization problems based on Time-Expanded Network to represent time-dependent parameters in a static network. Furthermore, an interactive approach based on the Satisficing Trade-Off Method is introduced to transform the multi-objective into the single. In addition, the proposed problem is equivalently transformed into an extended model of network optimization problems by introducing parameters, and the interactive algorithm is developed.