,
, , p.94
, Geofabrik, p.44
, Geojson, p.94
,
, , p.118
, OpenStreetMap, p.93
, GTFS
Alternative routes in road networks, J. Exp. Algorithmics, 2013. ,
Optimization for dynamic ride-sharing : A review, European Journal of Operational Research, vol.223, issue.2, pp.295-303, 2012. ,
, Proceedings, chapter The Round-Trip Ridesharing Problem with Relay Stations, p.17, 2015.
Enterprise Information Systems, p.17 ,
, Revised Selected Papers, chapter Carpooling as Complement to Multi-modal Transportation, p.18, 2015.
A heuristic search algorithm for finding the k shortest paths, Artificial Intelligence, vol.175, issue.18, p.27, 2011. ,
State-based accelerations and bidirectional search for biobjective multi-modal shortest paths, Seventh Triennial Symposium on Transportation Analysis, vol.27, pp.233-259, 2013. ,
Alternative route graphs in road networks, Proceedings of the First International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems, TAPAS'11, pp.21-32, 2011. ,
Engineering Label-Constrained Shortest-Path Algorithms, vol.5034, p.15, 2008. ,
Formal-language-constrained path problems, SIAM J. Comput, vol.30, issue.3, pp.809-837, 2000. ,
Result diversity for multi-modal route planning, ATMOS -13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, vol.33, pp.123-136, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00871740
Sharc : Fast and robust unidirectional routing ,
, J. Exp. Algorithmics, vol.14, p.13, 2009.
The theory of dynamic programming, DTIC Document, vol.8, 1954. ,
On a routing problem, Quarterly of Applied Mathematics, vol.16, pp.87-90, 1958. ,
Carpooling : the 2 synchronization points shortest paths problem, 13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS), page 12 p, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00843628
On the adaptation of a label-setting shortest path algorithm for one-way and two-way routing in multimodal urban transport networks. INOC, p.16, 2009. ,
Reliable pretrip multipath planning and dynamic adaptation for a centralized road navigation system, IEEE Transactions on Intelligent Transportation Systems, vol.8, issue.1, pp.14-20, 2007. ,
Three models for the description of language. Information Theory, IRE Transactions on, vol.2, issue.3, p.121, 1956. ,
Continuous-time dynamic shortest path algorithms, p.14, 1999. ,
Shortest paths in fifo time-dependent networks : Theory and algorithms, p.14, 2004. ,
Robust and Online Large-Scale Optimization : Models and Techniques for Transportation Systems, chapter Engineering Time-Expanded Graphs for Faster Timetable InformationFinding the K Shor, p.14, 2009. ,
Round-based public transit routing, Transportation Science, vol.49, issue.3, pp.591-604, 2015. ,
A note on two problems in connexion with graphs, Numerische Mathematik, vol.1, issue.1, pp.269-271, 1959. ,
Finding the k shortest paths, p.22, 1994. ,
Finding the k shortest paths, SIAM Journal on Computing, vol.28, issue.2, pp.652-673, 1998. ,
Network flow theory, vol.8, 1956. ,
An optimal algorithm for selection in a min-heap. Information and Computation, vol.104, p.27, 1993. ,
Computing the shortest path : A* search meets graph theory, Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, SODA '05, p.12, 2005. ,
Calcul d'itinéraire multimodal et multiobjectif en milieu urbain. These, Université des Sciences Sociales -Toulouse I, p.19, 2010. ,
Algorithmes de recherche d'itinéraires en transport multimodal, 2010. ,
A formal basis for the heuristic determination of minimum cost paths. Systems Science and Cybernetics, IEEE Transactions on, vol.4, issue.2, pp.100-107, 1968. ,
Efficient algorithms for the 2-Way Multi Modal Shortest Path Problem, International Network Optimization Conference (INOC), vol.41, pp.431-437, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00957644
A fast algorithm for finding better routes by ai search techniques, Vehicle Navigation and Information Systems Conference, p.11, 1994. ,
Algorithm Engineering : 3rd International Workshop, WAE'99 London, Proceedings, chapter Computing the K Shortest Paths : A New Algorithm and an Experimental Comparison, p.29, 1999. ,
A lazy version of eppstein's k shortest paths algorithm, In : WEA, p.27, 2003. ,
Unialt for regular language contrained shortest paths on a multi-modal transportation network, 11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, vol.20, pp.64-75, 2011. ,
An extremely fast, exact algorithm for finding shortest paths in static networks with geographical background, Geoinformation und Mobilitätvon der Forschung zur praktischen Anwendung, vol.22, p.13, 2004. ,
A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem, Management Science, vol.18, issue.7, pp.401-405, 1972. ,
Shortest viable path algorithm in multimodal networks, Transportation Research Part A : Policy and Practice, vol.35, issue.3, pp.225-241, 2001. ,
On a multicriteria shortest path problem ,
, European Journal of Operational Research, vol.16, issue.2, p.19, 1984.
The shortest path trough a maze, vol.7, 1957. ,
Bidirectional a* search on time-dependent road networks, Networks, vol.59, issue.2, pp.240-251, 2012. ,
Finding the shortest route between two points in a network, The Computer Journal, vol.9, issue.3, pp.275-280, 1966. ,
Improved alternative route planning, ATMOS -13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems -2013, vol.33, pp.108-122, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00871739
Efficient models for timetable information in public transportation systems, J. Exp ,
, Algorithmics, vol.12, issue.2, p.14, 2008.
Highway hierarchies hasten exact shortest path queries, Proceedings of the 13th annual European conference on Algorithms, ESA'05, pp.568-579, 2005. ,
Engineering highway hierarchies, Proceedings of the 14th conference on Annual European Symposium, vol.14, pp.804-816, 2006. ,
Engineering highway hierarchies, J. Exp ,
, Algorithmics, vol.17, issue.1, p.13, 2012.
Recherche de chemins multiobjectifs pour la conception et la réalisation d'une cent These, vol.20, 2011. ,
Dijkstra's algorithm on-line : an empirical case study from public railroad transport, J. Exp. Algorithmics, vol.5, p.13, 2000. ,
Geometric speed-up techniques for finding shortest paths in large sparse graphs, Algorithms -ESA 2003, vol.2832, p.13, 2003. ,
Geometric containers for efficient shortest-path computation, J. Exp. Algorithmics, p.13, 2005. ,
Finding the k shortest loopless paths in a network, Management Science, vol.17, issue.11, pp.712-716, 1971. ,