Interactive multi-objective route planning for sightseeing on Time-Expanded Networks under various conditions

Takashi Hasuike, Hideki Katagiri, Hiroe Tsubaki, Hiroshi Tsuda

Research output: Contribution to journalConference articlepeer-review

13 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)221-230
Number of pages10
JournalProcedia Computer Science
Publication statusPublished - 2013 Jan 1
Externally publishedYes
Event17th International Conference in Knowledge Based and Intelligent Information and Engineering Systems, KES 2013 - Kitakyushu, Japan
Duration: 2013 Sept 92013 Sept 11


  • Interactive approach
  • Multi-objective programming
  • Route planning for sightseeing
  • Time-Expanded Network

ASJC Scopus subject areas

  • Computer Science(all)


Dive into the research topics of 'Interactive multi-objective route planning for sightseeing on Time-Expanded Networks under various conditions'. Together they form a unique fingerprint.

Cite this