USS itinerary algorithm

From IS480
Jump to navigation Jump to search

Algorithm Approach

  1. The system will dynamically update the itinerary based on the heuristic approach of the greedy algorithm and the following constraints:
    1. Most updated information:
      1. Weather conditions
      2. Status of the attractions (i.e. open/closed for renovations)
    2. Waiting time
    3. Allowable waiting time (threshold of a patron)
    4. Distance between variables
    5. Allowable distance between variables (patron should remain within each land to complete the variables before proceeding to another land)
    6. Show times (e.g. Waterworld)

(Detailed constraints of the algorithm will be added with further development of the system)


Greedy algorithms are used to solve optimisation problems. The key idea is to make the choice look the best at that moment based on the attractions’ variables, environment variables and patron’s preferences. In the real world application, it is used for event scheduling and berth allocation.

Our team has decided to use specifically Dijkstra's algorithm, which is invented by Dutch computer scientist Edsger Dijkstra in 1956. As this algorithm solves the shortest path problem which is often used in routing, thus, it is able to find the shortest route between one attraction and all other attractions. As a result, it is more promising to us this approach for the Resorts World Sentosa.

Click here to go back to the main page.