Models and Algorithms for Carsharing Systems and Related Problems |
| |
| Affiliation: | 1. University of Kaiserslautern (Dep. of Mathematics), Kaiserslautern, Germany;2. University Blaise Pascal (LIMOS, UMR 6158 CNRS), Clermont-Ferrand,France;1. INF, UFG, and COPPE-Sistemas, UFRJ, Goiânia, GO, Brazil;2. DCC, UERJ, Rio de Janeiro, RJ, Brazil;3. Institut Fourier, CNRS - UJF, St Martin dʼHères, France;4. IM and COPPE-Sistemas, UFRJ, Rio de Janeiro, RJ, Brazil;1. Departamento de Ciência da Computação, Universidade Federal do Rio de Janeiro, Brasil;2. Institut für Optimierung und Operations Research, Universität Ulm, Germany |
| |
| Abstract: | In a Carsharing System, a fleet of cars is distributed at specified stations in an urban area, users can take and return cars at any time and station. For operating such a system in a satisfactory way, the stations have to keep a good ratio between the total number of places and the number of cars in each station, in order to refuse as few customer requests as possible. In this work, we propose to model the resulting problem of balancing the load of the stations as a General Pickup and Delivery Problem. As problems of this type are known to be hard, we discuss possible heuristic approaches both for the static (offline) and the dynamic (online) version of the problem, and give approximation results for special cases. |
| |
| Keywords: | carsharing pickup and delivery problem competitive analysis |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
