Route planning problem with groups of sightseeing sites classified by tourist's sensitivity under time-expanded network

Takashi Hasuike, Hideki Katagiri, Hiroe Tsubaki, Hiroshi Tsuda

研究成果: Conference article査読

5 被引用数 (Scopus)

抄録

This paper proposes a sightseeing route planning problem with time-dependent traveling times among sightseeing sites. Since traveling times are dependent on the time of day, Time-Expanded Network (TEN), which contains a copy to the set of nodes in the underlying static network for each discrete time step, is introduced. In addition, it is hard to set satisfaction values at sightseeing sites numerically due to tourist's ambiguous sensitivity, but it is not difficult to classify sightseeing sites into several groups by the tourist. Therefore, the objective function of our proposed model is set to maximize the total visiting sightseeing sites in each group. The problem is a multiobjective programming problem, and hence, a principle of compromise is introduced to solve our proposed problem in network optimization. Furthermore, a strict algorithm is also developed to equivalently transform the main problem into the existing TENbased problem.

本文言語English
論文番号6973905
ページ(範囲)188-193
ページ数6
ジャーナルConference Proceedings - IEEE International Conference on Systems, Man and Cybernetics
2014-January
January
DOI
出版ステータスPublished - 2014
外部発表はい
イベント2014 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2014 - San Diego, United States
継続期間: 2014 10月 52014 10月 8

ASJC Scopus subject areas

  • 電子工学および電気工学
  • 制御およびシステム工学
  • 人間とコンピュータの相互作用

フィンガープリント

「Route planning problem with groups of sightseeing sites classified by tourist's sensitivity under time-expanded network」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル