MOTTA DE ALENCAR, Daniel (2016) Multimodal Journey Planner PFE - Project Graduation, ENSTA.
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial No Derivatives.
This six-month internship was focused on the definition of evaluation framework and the effective evaluation of the current rail and air journey planners of Amadeus in order to check if their algorithm were able to deal with each other’s data requirements. This evaluation sought to find a unique algorithm that was able to handle either air-only, rail-only and multimodal journeys. During the course of this internship we figured out that the current solutions used by the Amadeus’ journey planners would not be able to attain our goal. Therefore, we needed to look for an alternative option and we decided to implement the promising Connection Scan Algorithm. This report is divided in three main parts. Firstly it will be explained the context in which it was developed so lector understand it best. Secondly, the functional contributions like establishing how the algorithm should be evaluated and the main aspects we were looking for, will be presented. Finally, the last part is dedicated to describe the algorithm itself and the contributions made so far.
|Item Type:||Thesis (PFE - Project Graduation)|
|Uncontrolled Keywords:||Routing, journey planner, Connection Scan Algorithm, CSA|
|Subjects:||Mathematics and Applications|
|Deposited By:||Daniel Motta De Alencar|
|Deposited On:||12 oct. 2016 14:59|
|Dernière modification:||12 oct. 2016 14:59|
Repository Staff Only: item control page