Polynomial-Time Carsharing Optimization: Linear Formulation and Large-Scale Simulations

被引:2
|
作者
Monteiro, Cristiano Martins [1 ]
Davis Jr, Clodoveu A. A. [1 ]
机构
[1] Univ Fed Minas Gerais, Dept Comp Sci, BR-31270901 Belo Horizonte, Brazil
关键词
Carsharing; fleet-sizing; polynomial-time; large-scale simulation; CAR; LOCATION; FACILITY; FLEXIBILITY; RELOCATION; SELECTION; SYSTEM;
D O I
10.1109/TITS.2022.3232149
中图分类号
TU [建筑科学];
学科分类号
0813 ;
摘要
Shared mobility services are useful for low-income people that are not satisfied with public transport and cannot comfortably afford their own vehicle. Among the low-cost shared mobility services, carsharing stands out because it avoids the cost of a driver. This work applies a polynomial-time linear programming formulation to optimize different carsharing business models for the Metropolitan Region of Sao Paulo. Real mobility data are used, focusing on inhabitants who are able to drive. Scenarios are evaluated varying distances that clients would be flexible to walk to get to an available vehicle or parking slot, comparing carsharing business models, and considering different rental prices. Results show that it is possible to offer a profitable low-cost carsharing service without performing vehicle relocations if clients are flexible enough to walk and if only a subset of trips is selected to be served. Results also demonstrate that trips selected to be served are similar among the different business models; are concentrated on Sao Paulo's downtown region; are shorter than the average trip, but otherwise behave in a similar way as compared to the complete set of trips; and the lack of parking slots may be a risk to the carsharing company.
引用
收藏
页码:4428 / 4437
页数:10
相关论文
共 50 条
  • [41] A polynomial-time algorithm to estimate returns to scale in FDH models
    Soleimani-damaneh, M.
    Reshadi, M.
    COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (07) : 2168 - 2176
  • [42] A POLYNOMIAL-TIME ALGORITHM FOR A CLASS OF LINEAR COMPLEMENTARITY-PROBLEMS
    KOJIMA, M
    MIZUNO, S
    YOSHISE, A
    MATHEMATICAL PROGRAMMING, 1989, 44 (01) : 1 - 26
  • [43] Polynomial-time algorithm for learning noisy linear threshold functions
    Blum, A.
    Frieze, A.
    Kannan, R.
    Vempala, S.
    Algorithmica (New York), 1998, 22 (1-2): : 35 - 52
  • [44] Time-dependent simulations of large-scale quantum dynamics
    Collins, Lee A.
    Mazevet, Stephane
    Kress, Joel D.
    Schneider, Barry I.
    Feder, David L.
    PHYSICA SCRIPTA, 2004, T110 : 408 - 412
  • [45] Solving large-scale electricity market pricing problems in polynomial time
    Ahunbay, Mete Seref
    Bichler, Martin
    Dobos, Teodora
    Knoerr, Johannes
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2024, 318 (02) : 605 - 617
  • [46] Design optimization of large-scale structures with sequential linear programming
    Lamberti, L
    Pappalettere, C
    PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART C-JOURNAL OF MECHANICAL ENGINEERING SCIENCE, 2002, 216 (08) : 799 - 811
  • [47] Stochastic Sequential Minimal Optimization for Large-Scale Linear SVM
    Peng, Shili
    Hu, Qinghua
    Dang, Jianwu
    Peng, Zhichao
    NEURAL INFORMATION PROCESSING, ICONIP 2017, PT I, 2017, 10634 : 279 - 288
  • [48] SELECTION OF A LARGE SUM-FREE SUBSET IN POLYNOMIAL-TIME
    KOLOUNTZAKIS, MN
    INFORMATION PROCESSING LETTERS, 1994, 49 (05) : 255 - 256
  • [49] Hopfield neural networks in large-scale linear optimization problems
    Velazco Fontova, Marta I.
    Oliveira, Aurelio R. L.
    Lyra, Christiano
    APPLIED MATHEMATICS AND COMPUTATION, 2012, 218 (12) : 6851 - 6859
  • [50] Large-scale dual AGN in large-scale cosmological hydrodynamical simulations
    Puerto-Sanchez, Clara
    Habouzit, Melanie
    Volonteri, Marta
    Ni, Yueying
    Foord, Adi
    Angles-Alcazar, Daniel
    Chen, Nianyi
    Guetzoyan, Paloma
    Dave, Romeel
    Di Matteo, Tiziana
    Dubois, Yohan
    Koss, Michael
    Rosas-Guevara, Yetli
    MONTHLY NOTICES OF THE ROYAL ASTRONOMICAL SOCIETY, 2025, 536 (03) : 3016 - 3040