(Created page with " == Abstract == hEART 2019, 8th Symposium of the European Association for Research in Transportation, Budapest, HONGRIE, 04-/09/2019 - 06/09/2019; In recent years, intelligen...") |
m (Scipediacontent moved page Draft Content 565951549 to ALISOLTANI et al 2019a) |
(No difference)
| |
Latest revision as of 17:40, 3 February 2021
Abstract
hEART 2019, 8th Symposium of the European Association for Research in Transportation, Budapest, HONGRIE, 04-/09/2019 - 06/09/2019; In recent years, intelligent transportation systems made it possible for operators to adapt in real-time the transportation supply to travel demand via new mobility services. Among these services, ride-sharing is becoming popular. The dynamic ride-sharing problem involves two sub-problems: (1) How to serve the upcoming trips (Optimal fleet management) and (2) How to accurately predict the travel times to determine vehicles availability and pick up/drop off times. In this paper, we express the optimal fleet management problem as a constrained multi objective integer linear programming. Our aim is to find the global optimal solution for the ride-sharing problem without uncertainty in demand to have a vision of these services performance in optimal situation. Then we compare the results and experiments with the exact optimal condition. We have designed an algorithm to find the exact solution for matching problem based on the branch and bound algorithm. To solve the second sub-problem, we define two different models to assess the impact of traffic conditions on the dynamic ride-sharing system performance for large-scale problems.
Original document
The different versions of the original document can be found in:
Document information
Published on 01/01/2019
Volume 2019, 2019
Licence: CC BY-NC-SA license
Share this document
Keywords
claim authorship
Are you one of the authors of this document?