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 条
  • [1] A polynomial-time criterion for stability of large-scale switched conjunctive Boolean networks☆
    Li, Haitao
    Pang, Xiaojun
    AUTOMATICA, 2024, 159
  • [2] Polynomial-time algorithms for linear and convex optimization on jump systems
    Shioura, Akiyoshi
    Tanaka, Ken'ichiro
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2007, 21 (02) : 504 - 522
  • [3] Optimization problems in the polynomial-time hierarchy
    Umans, Christopher
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 2006, 3959 : 345 - 355
  • [4] Optimization of JavaScript Large-Scale Urban Simulations
    Patrou, Maria
    Kent, Kenneth B.
    Sheppard, Dane
    Advances in Intelligent Systems and Computing, 2021, 1264 AISC : 20 - 31
  • [5] A POLYNOMIAL-TIME DESCENT METHOD FOR SEPARABLE CONVEX OPTIMIZATION PROBLEMS WITH LINEAR CONSTRAINTS
    Chubanov, Sergei
    SIAM JOURNAL ON OPTIMIZATION, 2016, 26 (01) : 856 - 889
  • [6] A polynomial-time algorithm for linear optimization based on a new simple kernel function
    Bai, YQ
    Roos, C
    OPTIMIZATION METHODS & SOFTWARE, 2003, 18 (06): : 631 - 646
  • [7] A polynomial-time algorithm for linear optimization based on a new class of kernel functions
    El Ghami, M.
    Ivanov, I.
    Melissen, J. B. M.
    Roos, C.
    Steihaug, T.
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2009, 224 (02) : 500 - 513
  • [8] Polynomial-time construction of linear network coding
    Iwama, Kazuo
    Nishimura, Harumichi
    Paterson, Mike
    Raymond, Rudy
    Yamashita, Shigeru
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT 1, PROCEEDINGS, 2008, 5125 : 271 - +
  • [9] A POLYNOMIAL-TIME ALGORITHM FOR LINEAR-PROGRAMMING
    TURNOVEC, F
    EKONOMICKO-MATEMATICKY OBZOR, 1980, 16 (04): : 468 - 470
  • [10] Link transmission model: A formulation with enhanced compute time for large-scale network optimization
    Lu, Jing
    Osorio, Carolina
    TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2024, 185