{"repository":{"description":"In order to make Parisian’s life easier, we built a service that compute optimal trips over the public transportation. This include structured data of subways, suburban trains, public cycles, public cars and buses networks provided by RATP, SNCF, Vélib’ and Autolib’ (mostly GTFS data). We performed two very different implementations of this service in order to compare performance. The first implementation uses a graph implementation and the second Elasticsearch (a search engine). We also made two algorithms: A variant of Dijkstra’s algorithm and RAPTOR (Daniel Delling, Thomas Pajor, and Renato F. Werneck) to compute Pareto-optimal journeys using criteria. We are still working on it in the background of our studies.","watchers":2,"stargazers":2,"forks":1,"fork":false,"size":9793,"owner":"Plantaquatix","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"created_at":"2013-10-23T14:55:51-07:00","pushed_at":"2013-10-24T11:42:17-07:00","master_branch":"Start-point"},"actor_attributes":{"type":"User","name":"Julien Brayere","blog":"fr.linkedin.com/pub/julien-brayere/77/836/6a3/","location":"Paris","email":"858785daf753b91574e6840d4a1d2f53c159622f@gmail.com"},"url":"https://github.com/Plantaquatix/ItineriParis/compare/8d0b1712f6...8d0b1712f6"}