EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
2835. Dynamic Routing and Scheduling Optimization of Teleoperated Car-Sharing Service
Invited abstract in session TC-64: Dynamic Vehicle Routing 1, stream VeRoLog - Vehicle Routing and Logistics.
Tuesday, 12:30-14:00Room: S16 (building: 101)
Authors (first author is the speaker)
| 1. | Gideon Gottschalg
|
| Mercator Endowed Chair of Demand Management & Sustainable Transport, WHU – Otto Beisheim School of Management | |
| 2. | Arne Strauss
|
| WHU - Otto Beisheim School of Management | |
| 3. | Marlin Wolf Ulmer
|
| Management Science, Otto von Guericke Universität Magdeburg | |
| 4. | Jarmo Haferkamp
|
| Management Science, Otto von Guericke University Magdeburg |
Abstract
Teleoperated vehicles are a promising concept for increasing the attractiveness and profitability of car-sharing services. Such vehicles can be remotely steered by an operator to the location of an on-demand vehicle requesting user. It eliminates the need for users to walk to a car-sharing vehicle and the need for providers to relocate vehicles with drivers on site to meet the temporal and spatial vehicle demand.
To ensure an acceptable service level, an effective utilization of the vehicle fleet and the number of operators is required. The decision process involves deciding which vehicle should be steered next by which operator to fulfil which user request. This is challenging as the future demand and the future availability of vehicles are uncertain, since the rental duration and return location are unknown.
We tackle this problem with a two-step allocation algorithm that combines a cost function approximation with the prediction of future vehicle returns to minimize the waiting time for current and potential future users. The first step identifies effective vehicle-user matchings which balance waiting times and driving efforts. In the second step, the sequence of identified matchings to be executed by the operators is determined, anticipating potential improvements by predicted future vehicle returns. We demonstrate the merits of our approach in comparison to intuitive benchmark policies in a computational study highlighting the characteristics of this novel problem.
Keywords
- Vehicle Routing
- Transportation
Status: accepted
Back to the list of papers