Statistiques de l'Observation et des statistiques (Soes)-Commissariat Général au développement Durable. Plus d'informations disponible sur http ://www.developpement-durable.gouv.fr/Commissariat-general-au.html 3. http ://www.developpement-durable.gouv.fr/Commissariat-general-au.html 4 Une enquête réalisée par TNS Sofres, 4 830 personnes interrogées par Internet en septembre 2013 dans huit pays Bibliographie Dynamic ride-sharing : A simulation study in metro atlanta, Statistiques de 2008 service de l'observation et des statistiques (Soes)-Commissariat Général au développement 2, pp.451450-1464, 2011. ,
Dynamic ridesharing with intermediate locations, 2014 IEEE Symposium on Computational Intelligence in Vehicles and Transportation Systems (CIVTS), 2014. ,
DOI : 10.1109/CIVTS.2014.7009475
Abstract, Journal of Artificial Intelligence and Soft Computing Research, vol.4, issue.4, pp.287-299, 2014. ,
DOI : 10.1515/jaiscr-2015-0015
A posteriori approach of realtime ridesharing problem with intermediate locations, ICORES 2015 -Proceedings of the International Conference on Operations Research and Enterprise Systems, pp.10-12, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01307939
The Round-Trip Ridesharing Problem with Relay Stations, Computational Logistics -6th International Conference, 2015. ,
DOI : 10.1016/j.endm.2013.05.122
URL : https://hal.archives-ouvertes.fr/hal-01307945
Carpooling as complement to multimodal transportation, Enterprise Information Systems -17th International Conference, pp.236-255, 2015. ,
DOI : 10.1007/978-3-319-29133-8_12
URL : https://hal.archives-ouvertes.fr/hal-01307956
Real-Time Ride-Sharing Substitution Service in Multi-modal Public Transport Using Buckets, Modelling, Computation and Optimization in Information Systems and Management Sciences -Proceedings of the 3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences - MCO 2015, pp.425-436, 2015. ,
DOI : 10.1007/978-3-319-18167-7_37
URL : https://hal.archives-ouvertes.fr/hal-01307960
Finding optimal paths in multi-modal public transportation networks using hub nodes and transit algorithm, ARTIFICIAL INTELLIGENCE AND LOGISTICS, p.7, 2012. ,
Transit Node Routing Reconsidered, Experimental Algorithms, pp.55-66, 2013. ,
DOI : 10.1007/978-3-642-38527-8_7
URL : http://algo2.iti.kit.edu/documents/chbasedtnr_TR.pdf
An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation, Operations Research, vol.52, issue.3, pp.422-439, 2004. ,
DOI : 10.1287/opre.1030.0106
Formal-Language-Constrained Path Problems, SIAM Journal on Computing, vol.30, issue.3, pp.809-837, 2000. ,
DOI : 10.1137/S0097539798337716
URL : http://ndssl.vbi.vt.edu/Publications/FormalLanguage_Madhav.pdf
Demand responsive transport, 2015. ,
Car or Public Transport???Two Worlds, 2009. ,
DOI : 10.1137/1.9781611972870.5
Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns, Algorithms?ESA 2010, pp.290-301, 2010. ,
DOI : 10.1007/978-3-642-15775-2_25
URL : http://ad.informatik.uni-freiburg.de/files/transferpatterns.pdf/at_download/file/
Ultrafast shortest-path queries via transit nodes. The Shortest Path Problem : Ninth DIMACS Implementation Challenge, pp.175-192, 2009. ,
DOI : 10.1090/dimacs/074/07
Experimental study of speed up techniques for timetable information systems, Networks, vol.10, issue.1, pp.38-52, 2011. ,
DOI : 10.1002/net.20382
On a routing problem, Quarterly of Applied Mathematics, vol.16, issue.1, 1956. ,
DOI : 10.1090/qam/102435
Dynamic pickup and delivery problems, European Journal of Operational Research, vol.202, issue.1, pp.8-15, 2010. ,
DOI : 10.1016/j.ejor.2009.04.024
URL : http://www.gerad.ca/~gerardo/PDP_dynamic_survey.pdf
Slugging in Houston ??? Casual Carpool Passenger Characteristics, Journal of Public Transportation, vol.9, issue.5, p.23, 2006. ,
DOI : 10.5038/2375-0901.9.5.2
Shortest paths algorithms: Theory and experimental evaluation, Mathematical Programming, vol.86, issue.2, pp.129-174, 1996. ,
DOI : 10.1137/1.9781611970265
A tabu search heuristic for the static multi-vehicle dial-a-ride problem, Transportation Research Part B: Methodological, vol.37, issue.6, pp.37579-594, 2003. ,
DOI : 10.1016/S0191-2615(02)00045-0
The dial-a-ride problem: models and algorithms, Annals of Operations Research, vol.174, issue.1, pp.29-46, 2007. ,
DOI : 10.1007/978-1-4613-1361-8_41
A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem, European Journal of Operational Research, vol.175, issue.3, pp.1605-1615, 2006. ,
DOI : 10.1016/j.ejor.2005.02.038
Robustness Tools in Dynamic Dial-a-Ride Problems, Recent Advances in Computational Optimization, pp.35-51, 2015. ,
DOI : 10.1007/978-3-319-12631-9_3
Engineering Time-Expanded Graphs for Faster Timetable Information, Robust and Online Large-Scale Optimization, pp.182-206, 2009. ,
DOI : 10.1007/978-3-642-05465-5_7
URL : http://i11www.ira.uka.de/extra/publications/dpw-etegf-09.pdf
Shortest-path algorithms: Taxonomy and annotation, Networks, vol.4, issue.2, pp.275-323, 1984. ,
DOI : 10.1145/321707.321712
A note on two problems in connexion with graphs, Numerische Mathematik, vol.4, issue.1, pp.269-271, 1959. ,
DOI : 10.1007/BF01386390
Using coarse gps data to quantify city-scale transportation system resilience to extreme events. arXiv preprint, 2015. ,
Empirical evaluation of a dynamic and distributed taxi-sharing system, Intelligent Transportation Systems (ITSC), 2012 15th International IEEE Conference on, pp.140-146, 2012. ,
Multi-hop ride sharing, Proceedings of the Sixth Annual Symposium on Combinatorial Search, pp.71-79, 2013. ,
Optimizing Landmark-Based Routing and Preprocessing, Proceedings of the Sixth ACM SIGSPATIAL International Workshop on Computational Transportation Science, IWCTS '13, p.25, 2013. ,
DOI : 10.1145/2533828.2533838
Algorithms for Matching and Predicting Trajectories, ALENEX, pp.84-95, 2011. ,
DOI : 10.1137/1.9781611972917.9
URL : http://www.siam.org/proceedings/alenex/2011/alx11_09_eisnerj.pdf
Fibonacci heaps and their uses in improved network optimization algorithms, Journal of the ACM, vol.34, issue.3, pp.596-615, 1987. ,
DOI : 10.1145/28869.28874
Ridesharing: The state-of-the-art and future directions, Transportation Research Part B: Methodological, vol.57, pp.28-46, 2013. ,
DOI : 10.1016/j.trb.2013.08.012
Shortest path algorithms, Annals of Operations Research, vol.7, issue.1, pp.1-79, 1988. ,
DOI : 10.1137/1.9781611970265
Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function, 4OR, vol.4, issue.1, pp.47-59, 2006. ,
DOI : 10.1007/s10288-005-0074-x
URL : https://hal.archives-ouvertes.fr/hal-00462028
Contraction of Timetable Networks with Realistic Transfers, Experimental Algorithms, pp.71-82, 2010. ,
DOI : 10.1007/978-3-642-13193-6_7
Fast detour computation for ride sharing In 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems -ATMOS'10 Exact routing in large road networks using contraction hierarchies, Th. Erlebach, M. Lubbecke. [Geisberger et al. Transportation. Science, vol.46, pp.88-99388, 2010. ,
Computing the shortest path : A search meets graph theory, Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, pp.156-165, 2005. ,
Computing point-topoint shortest paths from external memory, ALENEX/ANALCO, pp.26-40, 2005. ,
An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows, European Journal of Operational Research, vol.209, issue.1, pp.11-22, 2011. ,
DOI : 10.1016/j.ejor.2010.08.021
A Formal Basis for the Heuristic Determination of Minimum Cost Paths, IEEE Transactions on Systems Science and Cybernetics, vol.4, issue.2, pp.100-107, 1968. ,
DOI : 10.1109/TSSC.1968.300136
Evolutionary multiobjective route planning in dynamic multi-hop ride-sharing, pp.84-95, 2011. ,
Modeling the multihop ridematching problem with time windows and solving it using genetic algorithms The ridematching problem with time windows in dynamic ridesharing : a model and a genetic algorithm, Tools with Artificial Intelligence (ICTAI), 2012 IEEE 24th International Conference on Proceedings ACM Genetic and Evolutionary Computation Conference (GECCO), pp.89-96, 2012. ,
Fast pointto-point shortest path computations with arc-flags. The Shortest Path Problem : Ninth DIMACS Implementation Challenge, pp.41-72, 2009. ,
DOI : 10.1090/dimacs/074/03
URL : http://www.dis.uniroma1.it/~challenge9/papers/kohler.pdf
Traveling salesman problem, Encyclopedia of Operations Research and Management Science, pp.1573-1578, 2013. ,
Efficient algorithms for the 2-Way Multi Modal Shortest Path Problem, Electronic Notes in Discrete Mathematics, vol.41, pp.431-437, 2013. ,
DOI : 10.1016/j.endm.2013.05.122
URL : https://hal.archives-ouvertes.fr/hal-00957644
Simulation of a large scale dynamic pickup and delivery problem, Proceedings of the 3rd International ICST Conference on Simulation Tools and Techniques, SIMUTools '10, pp.1-77, 2010. ,
Distributed timedependent contraction hierarchies, Experimental Algorithms, pp.83-93, 2010. ,
DOI : 10.1007/978-3-642-13193-6_8
Path Prediction of Moving Objects on Road Networks Through Analyzing Past Trajectories, Knowledge-Based Intelligent Information and Engineering Systems, pp.379-389, 2007. ,
DOI : 10.1007/978-3-540-74819-9_47
Unialt for regular language contrained shortest paths on a multi-modal transportation network, ATMOS, pp.64-75, 2011. ,
An experimental evaluation of point-to-point shortest path calculation on roadnetworks with precalculated edge-flags. The Shortest Path Problem : Ninth DI- MACS Implementation Challenge, pp.19-40, 2006. ,
Complexity of vehicle routing and scheduling problems, Networks, vol.12, issue.2, pp.221-227, 1981. ,
DOI : 10.1016/S0022-0000(76)80016-5
Analysis and prediction of trajectories using Bayesian network, 2010 Sixth International Conference on Natural Computation, pp.3808-3812, 2010. ,
DOI : 10.1109/ICNC.2010.5583027
Shortest viable path algorithm in multimodal networks. Transportation Research Part A : Policy and Practice, pp.225-241, 2001. ,
Analysis and evaluation of the slugging form of ridesharing, Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems , SIGSPATIAL'13, pp.64-73, 2013. ,
DOI : 10.1109/ITNG.2009.224
T-share : A large-scale dynamic taxi ridesharing service, Data Engineering (ICDE), 2013 IEEE 29th International Conference on, pp.410-421, 2013. ,
The social context of informal commuting : Slugs, strangers and structuration. Transportation Research Part A : Policy and Practice, pp.258-268, 2011. ,
Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length, Journal of the ACM, vol.37, issue.3, pp.607-625, 1990. ,
DOI : 10.1145/79147.214078
Efficient models for timetable information in public transportation systems, Journal of Experimental Algorithmics, vol.12, pp.2-4, 2008. ,
DOI : 10.1145/1227161.1227166
Highway Hierarchies Hasten Exact Shortest Path Queries, 13th European Symposium on Algorithms, pp.568-579, 2005. ,
DOI : 10.1007/11561071_51
Engineering highway hierarchies, Algorithms?ESA 2006, pp.804-816, 2006. ,
DOI : 10.1007/11841036_71
URL : http://algo2.iti.kit.edu/documents/routeplanning/hhJournalSubmit.pdf
Engineering Fast Route Planning Algorithms, Experimental Algorithms, pp.23-36, 2007. ,
DOI : 10.1007/978-3-540-72845-0_2
Taxi and Ride Sharing: A Dynamic Dial-a-Ride Problem with Money as an Incentive, Expert Systems with Applications, 2015. ,
DOI : 10.1016/j.eswa.2015.04.060
The General Pickup and Delivery Problem, Transportation Science, vol.29, issue.1, pp.17-29, 1995. ,
DOI : 10.1287/trsc.29.1.17
Dynamic Highway-Node Routing, Experimental Algorithms, pp.66-79, 2007. ,
DOI : 10.1007/978-3-540-72845-0_6
Timetable information and shortest paths, 2005. ,
Dijkstra's algorithm on-line, Journal of Experimental Algorithmics, vol.5, p.12, 2000. ,
DOI : 10.1145/351827.384254
The benefits of meeting points in ride-sharing systems, ERIM Report Series Reference, 2015. ,
Multi-modal Transportation with Public Transport and Ride-sharing - Multi-modal Transportation using a Path-based Method, Proceedings of the 17th International Conference on Enterprise Information Systems, pp.479-486, 2015. ,
DOI : 10.5220/0005366204790486
URL : https://hal.archives-ouvertes.fr/hal-01307977
Geometric containers for efficient shortest-path computation, Journal of Experimental Algorithmics, vol.10, pp.1-3, 2005. ,
DOI : 10.1145/1064546.1103378
URL : http://i11www.iti.uni-karlsruhe.de/extra/publications/wwz-gcesp-05.pdf
A distributed geographic information system for the daily car pooling problem, Computers & Operations Research, vol.31, issue.13, pp.2263-2278, 2004. ,
DOI : 10.1016/S0305-0548(03)00186-2
An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays, European Journal of Operational Research, vol.125, issue.3, pp.486-502, 2000. ,
DOI : 10.1016/S0377-2217(99)00388-4