Online scheduling of car-sharing requests between two locations with many cars and flexible advance bookings

K Luo, T Erlebach, Y Xu - 29th International Symposium on …, 2018 - research.tue.nl
We study an on-line scheduling problem that is motivated by applications such as car-
sharing, in which users submit ride requests, and the scheduler aims to accept requests of …

Car-sharing on a star network: on-line scheduling with k servers

K Luo, T Erlebach, Y Xu - 36th International Symposium on …, 2019 - research.tue.nl
We study an on-line scheduling problem that is motivated by applications such as car-
sharing for trips between an airport and a group of hotels. Users submit ride requests, and …

Online scheduling of car-sharing request pairs between two locations

K Luo, Y Xu, H Liu - Journal of Combinatorial Optimization, 2022 - Springer
We consider an online car-sharing problem between two locations with advance bookings.
Each customer submits a pair of requests, where each request specifies the pick-up time …

Minimizing Travel Time and Latency in Multi-Capacity Ride-Sharing Problems

K Luo, FCR Spieksma - Algorithms, 2022 - mdpi.com
Motivated by applications in ride-sharing and truck-delivery, we study the problem of
matching a number of requests and assigning them to cars. A number of cars are given …

Car-sharing problem: online scheduling with flexible advance bookings

H Liu, K Luo, Y Xu, H Zhang - International Conference on Combinatorial …, 2019 - Springer
We study an online scheduling problem that is motivated by applications such as car-
sharing for trips among a number of locations. Users submit ride requests, and the scheduler …

Online car-sharing problem with variable booking times

H Liu, K Luo, Y Xu, H Zhang - Journal of Combinatorial Optimization, 2024 - Springer
In this paper, we address the problem of online car-sharing with variable booking times
(CSV for short). In this scenario, customers submit ride requests, each specifying two …

即時車輛共乘問題在三點循環模型的競爭分析

許孟翔 - 2023 - tdr.lib.ntu.edu.tw
在汽車共乘問題中, 我們旨在有效地分配有限的車輛來滿足城市中許多服務站的顧客.
顧客可以在線上來指定他們的接送時間, 接送地點和下車地點. 演算法會以即時的方式來決定 …

Maximum Customers' Satisfaction in One-way Car-sharing: Modeling, Exact and Heuristic Solving

WR Silva, R Schouery - arXiv preprint arXiv:2008.07372, 2020 - arxiv.org
One-way car-sharing systems are transportation systems that allow customers to rent cars at
stations scattered around the city, use them for a short journey, and return them at any …

Car-Sharing: Online Scheduling k Cars Between Two Locations

S Li, L Zheng, VCS Lee - … 14th International Workshop, FAW 2020, Haikou …, 2020 - Springer
This paper studies a special setting of the online order-dispatching problem in the car-
sharing system (CSS). Once an order is released online by a user at its booking time, it …

Tight competitive analyses of online car-sharing problems

YC Liang, KY Lai, HL Chen, K Iwama… - Theoretical Computer …, 2022 - Elsevier
The online car-sharing problem finds many real-world applications. The problem, proposed
by Luo, Erlebach and Xu in 2018, mainly focuses on an online model in which there are two …