Heuristic Optimal Meeting Point Algorithm for Car-Sharing in Large Multimodal Road Networks

Julien Baudru, Julien Baudru, Hugues Bersini, Hugues Bersini

2024

Abstract

This article introduces a new version of the car-pooling problem (CPP). This involves defining rendezvous or meeting point in such a way that the travel times of the users are fair, this problem shares similarities with the problem of finding the optimal meeting point (OMP) in a graph. We propose a heuristic algorithm to solve the OMP problem in this new context and compare its results with those of the exact solution algorithm, showing its low error rate and short runtime. Finally, we propose some exploratory directions for future research.

Paper Citation

in Harvard Style

Baudru J. and Bersini H. (2024). Heuristic Optimal Meeting Point Algorithm for Car-Sharing in Large Multimodal Road Networks. In Proceedings of the 10th International Conference on Vehicle Technology and Intelligent Transport Systems - Volume 1: VEHITS; ISBN 978-989-758-703-0, SciTePress, pages 427-436. DOI: 10.5220/0012719100003702

in Bibtex Style

@conference{vehits24,
author={Julien Baudru and Hugues Bersini},
title={Heuristic Optimal Meeting Point Algorithm for Car-Sharing in Large Multimodal Road Networks},
booktitle={Proceedings of the 10th International Conference on Vehicle Technology and Intelligent Transport Systems - Volume 1: VEHITS},
year={2024},
pages={427-436},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0012719100003702},
isbn={978-989-758-703-0},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 10th International Conference on Vehicle Technology and Intelligent Transport Systems - Volume 1: VEHITS
TI - Heuristic Optimal Meeting Point Algorithm for Car-Sharing in Large Multimodal Road Networks
SN - 978-989-758-703-0
AU - Baudru J.
AU - Bersini H.
PY - 2024
SP - 427
EP - 436
DO - 10.5220/0012719100003702
PB - SciTePress