Abstract—Many amusement parks adopt a reservation service(e.g. Fast pass at Disneyland) , that effectively reduce the waiting time for visitors. Even if visitors do use the reservation service, the traveling time may be long, depending on the order in which users visit the attractions. We think that people need a new route search algorithm to enhance the reservation service. Therefore, we have developed a new algorithm employingstructured programming. We constructed the system to be executed on a smart phone by using constraint logic programming and Java.
Index Terms—Traveling salesman problem, traveling problem in amusement parks, smart phone, ECLiPSe.
The authors are with the Industrial Administration Department, Tokyo University of Science, 2641 Yamazaki, Noda, Chiba, Japan (e-mail: j7411616@ed.noda.tus.ac.jp; katsu@rs.tus.ac.jp; ohwada@ia.noda.tus.ac.jp).
Cite: Takahirio Shibuya, Katsutoshi Kanamori, and Hayato Ohwada, "A Route Search System in Consideration of the Reservation Service in Amusement Parks for Smart Phone," International Journal of Machine Learning and Computing vol. 2, no. 6, pp. 771-775, 2012.