Abstract
This paper proposes a framework to recommend personal sightseeing route as well as to objectively obtain the tourist's utility to sightseeing plans and sightseeing spots from subjective comparison. The subjective comparison is qualitatively performed using a scale of measurement such as Likert scale, and the mathematical programming problem including this comparison as constraints is introduced. In the case of route planning, traveling and sightseeing times are randomly changed dependent on current traffic and congestion conditions, and hence, Time-Expanded Network (TEN) to represent these traffic conditions in the underlying static network with each discrete time step is introduced. In addition, the network optimization problem is introduced to obtain the personal appropriate sightseeing route. This problem is formulated as a nonlinear and discrete optimization problem, and it is hard to solve it directly and efficiently. Therefore, an efficient algorithm is also developed based on dynamic programming and transformation of the main problem into the recursive equation.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - 2016 5th IIAI International Congress on Advanced Applied Informatics, IIAI-AAI 2016 |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 801-806 |
| Number of pages | 6 |
| ISBN (Electronic) | 9781467389853 |
| DOIs | |
| Publication status | Published - 2016 Aug 31 |
| Event | 5th IIAI International Congress on Advanced Applied Informatics, IIAI-AAI 2016 - Kumamoto, Japan Duration: 2016 Jul 10 → 2016 Jul 14 |
Other
| Other | 5th IIAI International Congress on Advanced Applied Informatics, IIAI-AAI 2016 |
|---|---|
| Country | Japan |
| City | Kumamoto |
| Period | 16/7/10 → 16/7/14 |
Fingerprint
Keywords
- Mathematical programming
- Sightseeing route recommendation
- Time-Expanded Network
- Utility function
ASJC Scopus subject areas
- Information Systems
- Computer Networks and Communications
- Computer Science Applications
- Computer Vision and Pattern Recognition
Cite this
A framework of route recommendation system for sightseeing from subjective and objective evaluation of tourism data. / Hasuike, Takashi; Katagiri, Hideki; Tsuda, Hiroshi.
Proceedings - 2016 5th IIAI International Congress on Advanced Applied Informatics, IIAI-AAI 2016. Institute of Electrical and Electronics Engineers Inc., 2016. p. 801-806 7557721.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - A framework of route recommendation system for sightseeing from subjective and objective evaluation of tourism data
AU - Hasuike, Takashi
AU - Katagiri, Hideki
AU - Tsuda, Hiroshi
PY - 2016/8/31
Y1 - 2016/8/31
N2 - This paper proposes a framework to recommend personal sightseeing route as well as to objectively obtain the tourist's utility to sightseeing plans and sightseeing spots from subjective comparison. The subjective comparison is qualitatively performed using a scale of measurement such as Likert scale, and the mathematical programming problem including this comparison as constraints is introduced. In the case of route planning, traveling and sightseeing times are randomly changed dependent on current traffic and congestion conditions, and hence, Time-Expanded Network (TEN) to represent these traffic conditions in the underlying static network with each discrete time step is introduced. In addition, the network optimization problem is introduced to obtain the personal appropriate sightseeing route. This problem is formulated as a nonlinear and discrete optimization problem, and it is hard to solve it directly and efficiently. Therefore, an efficient algorithm is also developed based on dynamic programming and transformation of the main problem into the recursive equation.
AB - This paper proposes a framework to recommend personal sightseeing route as well as to objectively obtain the tourist's utility to sightseeing plans and sightseeing spots from subjective comparison. The subjective comparison is qualitatively performed using a scale of measurement such as Likert scale, and the mathematical programming problem including this comparison as constraints is introduced. In the case of route planning, traveling and sightseeing times are randomly changed dependent on current traffic and congestion conditions, and hence, Time-Expanded Network (TEN) to represent these traffic conditions in the underlying static network with each discrete time step is introduced. In addition, the network optimization problem is introduced to obtain the personal appropriate sightseeing route. This problem is formulated as a nonlinear and discrete optimization problem, and it is hard to solve it directly and efficiently. Therefore, an efficient algorithm is also developed based on dynamic programming and transformation of the main problem into the recursive equation.
KW - Mathematical programming
KW - Sightseeing route recommendation
KW - Time-Expanded Network
KW - Utility function
UR - http://www.scopus.com/inward/record.url?scp=84988819981&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84988819981&partnerID=8YFLogxK
U2 - 10.1109/IIAI-AAI.2016.34
DO - 10.1109/IIAI-AAI.2016.34
M3 - Conference contribution
SP - 801
EP - 806
BT - Proceedings - 2016 5th IIAI International Congress on Advanced Applied Informatics, IIAI-AAI 2016
PB - Institute of Electrical and Electronics Engineers Inc.
ER -