This repository contains an application inspired from a real project, made by Grand Lyon between 2012 and 2015, which aims to optimise the public transport.
Given two xmls files corresponding to the plan of the city and the deliveries that have to be made, the application computes the shortest path that the delivery person has to do in order to complete all his tasks.
The shortest path is computed using the Dijkstra algorithm Branch and Bound algorithm (Travelling Salesman Problem).
For more details regarding the application or would you wish to provide us with some feedback, don't hesitate to contact us at one of the following e-mail addresses:
