A Priori Approach Of Real-Time Ridesharing Problem With Intermediate Meeting Locations

[1] Agatz, N.A.H., Erera, A., Savelsbergh, M., Wang, X.: Optimization for dynamic ridesharing: A review. European Journal of Operational Research, 223, pp. 295-303 (2012)10.1016/j.ejor.2012.05.028Search in Google Scholar

[2] Furuhata, M., Dessouky, M., Ordonez, F., Brunet, M.E.,Wang, X., Koenig, S.: Ridesharing: The stateof-the-art and future directions. Transportation Research Part B: Methodological, 57, pp. 28-46 (2013)10.1016/j.trb.2013.08.012Search in Google Scholar

[3] Agatz, N.A.H., Erera, A., Savelsbergh, M.W.P., Wang, X.: Dynamic ridesharing: a simulation study in metro atlanta. Transportation Research Part B, Methodological, 45, pp. 1450-1464 (2011)10.1016/j.trb.2011.05.017Search in Google Scholar

[4] Baldacci, R., Maniezzo, V., Mingozzi, A.: An exact method for the car pooling problem based on lagrangean column generation. Operations Research, 52, pp. 422-439 (2004)10.1287/opre.1030.0106Search in Google Scholar

[5] Herbawi, W., and Weber, M. 2012b. Modeling the multihop ridematching problem with time windows and solving it using genetic algorithms. In Proceedings of the 2011 IEEE 24th International Conference on Tools with Artificial Intelligence, ICTAI ’12, IEEE Computer Society. (Athens, Greece, 2012)10.1109/ICTAI.2012.21Search in Google Scholar

[6] Ghoseiri, K., Haghani, A., Hamedi, M.: Real-time rideshare matching problem. University of Maryland, Department of Civil and Environmental Engineering, UMD-2009-05 (2011)Search in Google Scholar

[7] Amey, A.: Proposed Methodology for Estimating Rideshare Viability Within an Organization: Application to the MIT Community, Transportation Research Board Annual Meeting 2011, pp. 11-2585 (2011)Search in Google Scholar

[8] Winter, S., Nittel, S: Ad-hoc shared-ride trip planning by mobile geosensor networks. International Journal of Geographic Information Science, 00, pp. 1-21 (2006)10.1109/MDM.2006.150Search in Google Scholar

[9] Xing, X., Warden, T., Nicolai, T., Herzog, O.: Smize: a spontaneous ridesharing system for individual urban transit. In: Proceedings of the 7th German Conference on Multiagent System Technologies, MATES’09. Springer-Verlag, Berlin Heidelberg, pp. 165-176 (2009)10.1007/978-3-642-04143-3_15Search in Google Scholar

[10] Geisberger, R., Luxen, D., Neubauer, S., Sanders, P., Volker, L.: Fast Detour Computation for Ride Sharing. In: 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems - ATMOS’10. Editors: Th. Erlebach, M. Lubbecke, pp. 88-99 (2010)Search in Google Scholar

[11] Calvo, R.W., de Luigi, F., Haastrup, P., Maniezzo, V.: A distributed geographic information system for the daily car pooling problem. Computers & Operations Research, 31, 2263-2278 (2004)10.1016/S0305-0548(03)00186-2Search in Google Scholar

[12] Herbawi, W., Weber, M.: The ridematching problem with time windows in dynamic ridesharing: a model and a genetic algorithm In: Proceedings ACM Genetic and Evolutionary Computation Conference (GECCO), pp. 1-8 (2012)10.1109/CEC.2012.6253001Search in Google Scholar

[13] Herbawi, W.,Weber, M.: Evolutionary multiobjective route planning in dynamic multi-hop ridesharing. In: EvoCOP’11, pp. 84-95 (2011)10.1007/978-3-642-20364-0_8Search in Google Scholar

[14] Pyrga, E., Schulz, F., Wagner, D., Zaroliagis, C.: Efficient Models for Timetable Information in Public Transportation Systems. ACM Journal of Experimental Algorithmics, 12 (2.4) (2007)10.1145/1227161.1227166Search in Google Scholar

[15] Drews, F., Luxen, D.: Multi-hop ride sharing. In: Proceedings of the Sixth Annual Symposium on Combinatorial Search, pp. 71-79 (2013)Search in Google Scholar

[16] Bit-Monnot, A., Artigues, C., Huguet, M.-J., Killijian, M.-O.: Carpooling: the 2 Synchronization Points Shortest Paths Problem. In: 13th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS), Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Vol. 33, pp. 150-163 (2013)Search in Google Scholar

[17] Dijkstra, E.W.: A Note on Two Problems in Connexion with Graphs. Numerische Mathematik, 1, pp. 269-271 (1959)10.1007/BF01386390Search in Google Scholar

[18] Hart. P.E., Nilsson, N., Raphael, B.:A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Trans. on Sys. Sci. and Cyb. 4, pp. 100-107 (1968)10.1109/TSSC.1968.300136Search in Google Scholar

[19] Geisberger, R., Sanders, P., Schultes, D., Vetter, C.: Exact Routing in Large Road Networks Using Contraction Hierarchies. Transp. Sci. 46, pp. 388-404 (2012)10.1287/trsc.1110.0401Search in Google Scholar

[20] Arz, J., Luxen, D., Sanders, P.: Transit Node Routing Reconsidered. In: International Symposium on Experimental Algorithms (SEA13). LNCS, volume 7933, pp. 55-66. Springer, Rome (2013)10.1007/978-3-642-38527-8_7Search in Google Scholar