par Baudru, Julien 
;Bersini, Hugues
Référence International Conference on Vehicle Technology and Intelligent Transport Systems, VEHITS - Proceedings, page (427-436)
Publication Publié, 2024-09-01
;Bersini, Hugues Référence International Conference on Vehicle Technology and Intelligent Transport Systems, VEHITS - Proceedings, page (427-436)
Publication Publié, 2024-09-01
Article révisé par les pairs
| Résumé : | 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. |
