A Posteriori Approach of Real-time Ridesharing Problem with Intermediate Locations

Kamel Aissat, Ammar Oulmara


Ridesharing is a travel mode that provides several benefits and solutions, such as the reduction of travel cost, the reduction of the traffic congestion and the provision of travel options. In the classical ridesharing approach, the driver makes a detour to the rider’s origin in order to pick-up the rider, then drives him to his destination and finally the driver goes to his own destination. This implies that the driver endures the whole detour and may not accept such matching if the detour is too long. However, the matching could be accepted if the rider meets the driver at an intermediate location. In this paper, we present a general ridesharing approach in which a driver and a rider accept to meet each other at an intermediate pick-up location and to separate at an intermediate drop-off location not necessarily their origins and destinations locations, respectively. Thus, for a given rider, we propose an exact and heuristic methods to determine the best driver and the best meeting locations that minimize a total travel cost. Finally, we perform a numerical study using a real road network and a real dataset. Our experimental analysis shows that our heuristics provide efficient performance within short CPU times and improve participants cost-savings and matching rate compared to the classical ridesharing.


  1. Agatz, N., Erera, A., Savelsbergh, M., and Wang, X. (2012). Optimization for dynamic ride-sharing: A review. European Journal of Operational Research, 223:295- 303.
  2. Aissat, K. and Oulamara, A. (2014a). Dynamic ridesharing with intermediate locations. In proceedings of SSCI 2014.
  3. Aissat, K. and Oulamara, A. (2014b). Round trip ridesharing with an intermediate meeting location. In proceedings of MOSIM 2014.
  4. Amey, A. (2011). Proposed methodology for estimating rideshare viability within an organization: Application to the mit community. In Transportation Research Board Annual Meeting, pages pp. 11-25.
  5. Baldacci, R., Maniezzo, V., and Mingozzi, A. (2004). An exact method for the car pooling problem based on lagrangean column generation. Operations Research, 52:422-439.
  6. Bit-Monnot, A., Artigues, C., Huguet, M.-J., and Killijian, M.-O. (2013). Carpooling: the 2 synchronization points shortest paths problem. In OASIcs-OpenAccess Series in Informatics, volume 33. Schloss DagstuhlLeibniz-Zentrum fuer Informatik.
  7. Dijkstra, E. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1:269-271.
  8. Drews, F. and Luxen, D. (2013). Multi-hop ride sharing. In Proceedings of the Sixth Annual Symposium on Combinatorial Search, pages 71-79,.
  9. Furuhata, M., Dessouky, M., Brunet, F. O. M., Wang, X., and Koenig, S. (2013). Ridesharing: The state-ofthe-art and future directions. Transportation Research Part B: Methodological, 57:28-46.
  10. Geisberger, R., Luxen, D., Neubauer, S., Sanders, P., and Volker, L. (2010). Fast detour computation for ride sharing. In 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems - ATMOS'10, pages pp. 88-99. Th. Erlebach, M. Lubbecke.
  11. Hart, P., Nilsson, N., and Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. on Sys. Sci. and Cyb, 4:100-107.
  12. Hartwig, S. and Buchmann, M. (2006). Empty seats traveling: next-generation ridesharing and its potential to mitigate traffic-and emission problems in the 21st century. NOKIA Research Center.
  13. Herbawi, W. and Weber, M. (2012). The ridematching problem with time windows in dynamic ridesharing: a model and a genetic algorithm. In Proceedings ACM Genetic and Evolutionary Computation Conference (GECCO), pages 1-8.
  14. Ma, S. and Wolfson, O. (2013). Analysis and evaluation of the slugging form of ridesharing. In Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pages 64-73. ACM.
  15. Ma, S., Zheng, Y., and Wolfson, O. (2013). T-share: A large-scale dynamic taxi ridesharing service. In Data Engineering (ICDE), 2013 IEEE 29th International Conference on, pages 410-421. IEEE.
  16. Metz, B., Davidson, O., De Coninck, H., Loos, M., and Meyer, L. (2005). Ipcc special report on carbon dioxide capture and storage. prepared by working group iii of the intergovernmental panel on climate change. IPCC, Cambridge University Press: Cambridge, United Kingdom and New York, USA, 4.
  17. Mote, J. E. and Whitestone, Y. (2011). The social context of informal commuting: Slugs, strangers and structuration. Transportation Research Part A: Policy and Practice, 45(4):258-268.
  18. Sanders, P. and Schultes, D. (2007). Engineering fast route planning algorithms. In Experimental Algorithms, pages 23-36. Springer.
  19. Sassi, O. and Oulamara, A. (2014). Joint scheduling and optimal charging of electric vehicles problem. In Computational Science and Its Applications-ICCSA 2014, pages 76-91. Springer.
  20. Varone, S. and Janilionis, V. (2014). Insertion heuristic for a dynamic dial-a-ride problem using geographical maps. In proceedings of MOSIM 2014.

Paper Citation

in Harvard Style

Aissat K. and Oulmara A. (2015). A Posteriori Approach of Real-time Ridesharing Problem with Intermediate Locations . In Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-075-8, pages 63-74. DOI: 10.5220/0005256100630074

in Bibtex Style

author={Kamel Aissat and Ammar Oulmara},
title={A Posteriori Approach of Real-time Ridesharing Problem with Intermediate Locations},
booktitle={Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},

in EndNote Style

JO - Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - A Posteriori Approach of Real-time Ridesharing Problem with Intermediate Locations
SN - 978-989-758-075-8
AU - Aissat K.
AU - Oulmara A.
PY - 2015
SP - 63
EP - 74
DO - 10.5220/0005256100630074