TY - JOUR
T1 - Interactive multi-objective route planning for sightseeing on Time-Expanded Networks under various conditions
AU - Hasuike, Takashi
AU - Katagiri, Hideki
AU - Tsubaki, Hiroe
AU - Tsuda, Hiroshi
PY - 2013/1/1
Y1 - 2013/1/1
N2 - 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.
AB - 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.
KW - Interactive approach
KW - Multi-objective programming
KW - Route planning for sightseeing
KW - Time-Expanded Network
UR - http://www.scopus.com/inward/record.url?scp=84896948792&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84896948792&partnerID=8YFLogxK
U2 - 10.1016/j.procs.2013.09.098
DO - 10.1016/j.procs.2013.09.098
M3 - Conference article
AN - SCOPUS:84896948792
SN - 1877-0509
VL - 22
SP - 221
EP - 230
JO - Procedia Computer Science
JF - Procedia Computer Science
T2 - 17th International Conference in Knowledge Based and Intelligent Information and Engineering Systems, KES 2013
Y2 - 9 September 2013 through 11 September 2013
ER -