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...

Full description

Saved in:
Bibliographic Details
Main Authors: Ohwada, Hayato, Igarashi, Hiroki, Tanaka, Tsukasa, Nishiyama, Hiroyuki
Format: Conference Proceeding
Language:English
Subjects:
Cities and towns
Constraint satisfaction
Global Positioning System
Heuristic algorithms
Navigation
Planning
Recommendation
Route planning
Servers
Smart phones
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1948-9439
1948-9447
DOI:10.1109/CCDC.2014.6852169