RWS Itinerary Algorithm

From IS480
Jump to navigation Jump to search

Algorithm Approach

  1. A heuristic approach to the greedy algorithm will be used to plan the patron’s itinerary and is based on the following constraints:
    1. Time (duration of stay at RWS)
    2. Distance between each variable
  2. After the user has confirmed his itinerary, a unique ID will be assigned to him.

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