A Practical Route Search System for Amusement Parks Navigation

Abstract

It is very difficult to find the minimum route to travel in amusement park navigation. A searching system for visitors would be useful. Therefore, we constructed a system to find the route with the minimum total traveling time. Facility visitors can employ this system on a smart phone. The system is composed of Java and a Java Servlet. We conclude that our system is useful and can greatly shorten travel time within a typical amusement park.

Keywords

• Traveling problem in amusement parks
• Java Servlet
• Smart phone
• Traveling salesman problem