Unifying Constraint Satisfaction and Recommendation for Amusement Park Navigation
Unlike conventional traveling salesman problems(TSPs)for transportation,amusement park navigation using a smart phone needs both efficiency and preference for personal adaptation.In addition,a dynamic treatment for waiting time estimation and reservation ticket use should be incorporated into a minimum path finding algorithm.This study attempts to unify an optimization method and recommender system facility for real-time support in Tokyo Disneyland navigation.We have developed a smart phone web application in which users select attractions,and then the application suggests reasonable and enjoyable routes.The experiment was conducted to demonstrate the novel functionality and performance of the proposed application.
Recommendation Route planning Navigation Constraint satisfaction
Hayato Ohwada Hiroki Igarashi Tsukasa Tanaka Hiroyuki Nishiyama
Faculty of Science and Technology,Tokyo University of Science,2641 Yamazaki,Noda,Chiba,278-8510,Japan
国际会议
长沙
英文
341-345
2014-05-31（万方平台首次上网日期，不代表论文的发表时间）