The balanced dispatching problem in passengers transport services on demand

被引:2
|
作者
Moraga-Correa, Javier [1 ,4 ]
Quezada, Franco [2 ,4 ]
Rojo-Gonzalez, Luis [3 ,4 ]
Vasquez, Oscar C. [4 ]
机构
[1] Univ Nottingham, Business Sch, Nottingham, England
[2] Sorbonne Univ, CNRS, Lab Informat Paris 6 LIP6, Paris, France
[3] Univ Politecn Cataluna, Fac Matemat & Estadist, Barcelona, Spain
[4] Univ Santiago Chile, Ind Engn Dept, Santiago, Chile
关键词
Dispatching problem; Online algorithm; Passengers transport services; Drivers incomes balancing; Mixed integer quadratic programming; TAXI; OPTIMIZATION; STRATEGIES;
D O I
10.1016/j.eswa.2021.114918
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In the passengers' transport services on demand, such as taxi services, a dispatching solution determines the service quality level and the incomes received by both drivers and the transport company. In the last years, related work has been mainly focused on improving the service quality. However, the drivers' incomes balancing is still a challenge, especially for emerging economies. To address this situation, we introduce the balanced dispatching problem in passengers transport services (BDP-PTS) on demand, which seeks a dispatching solution that aims to minimize the variance of the incomes per unit of working time among the drivers. We propose five easy-to-implement online dispatching algorithms, which rely on dispatching rules obtained from the variance analysis and explore the performance measures for a dispatching solution provided by them. Those algorithms consider the BDP-PTS under an offline scenario, where all the information is revealed beforehand, and the maximum number of solicited transport services is performed. We are focused on a specific set of instances, called complete, which admit at least a feasible solution where all requested transport services are performed. Consequently, we prove the NP-completeness in the strong sense of the BDP-PTS under an offline scenario for these instances, and formulate a mixed integer quadratic programming (MIQP) model to solve it. This complexity computation status implies that no polynomial or pseudo time algorithms exist for solving it, unless P = NP, involving an important quantity of running time and memory resources to model and to resolve it in an empirical computation. Finally, computational experiments are carried out to compare the proposed online dispatching algorithms and the MIQP model on datasets of real complete instances from a Chilean transport company. The obtained results show that the proposed online dispatching algorithm based on the dispatching rule, called SRV, is able to reduce more efficiently the income dispersion among drivers within reduced running times, assigning over a 98% of total solicited transport service and allowing a practical implementation into an automated dispatching system on a basic hardware infrastructure, as it is the case of the transport companies in developing countries.
引用
收藏
页数:12
相关论文
共 50 条
  • [1] The Balanced Dispatching Problem in Passengers Transport Services on Demand
    Araya-Cordova, Patricio J.
    Diaz-Nunez, Fabian
    Moraga, Javier
    Quezada, Franco
    Rojo-Gonzalez, Luis
    Vasquez, Oscar C.
    [J]. COMPUTATIONAL LOGISTICS (ICCL 2018), 2018, 11184 : 379 - 387
  • [2] A Novel Demand Dispatching Model for Autonomous On-Demand Services
    Yang, Lei
    Yu, Xi
    Cao, Jiannong
    Li, Wengen
    Wang, Yuqi
    Szczecinski, Michal
    [J]. IEEE TRANSACTIONS ON SERVICES COMPUTING, 2022, 15 (01) : 322 - 333
  • [3] The demand for intercity public transport: the case of business passengers
    Carlsson, F
    [J]. APPLIED ECONOMICS, 2003, 35 (01) : 41 - 50
  • [4] Forecasting the air transport demand for passengers with neural modelling
    Alekseev, KPG
    Seixas, JM
    [J]. VII BRAZILIAN SYMPOSIUM ON NEURAL NETWORKS, PROCEEDINGS, 2002, : 86 - 91
  • [5] Fleet scheduling and dispatching for demand-responsive passenger services
    Horn, MET
    [J]. TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2002, 10 (01) : 35 - 63
  • [6] Accessibility to Riga Public Transport Services for Transit Passengers
    Yatskiv , Irina
    Budilovich , Evelina
    Gromule, Vaira
    [J]. TRANSBALTICA 2017: TRANSPORTATION SCIENCE AND TECHNOLOGY, 2017, 187 : 82 - 88
  • [7] Accounting for cost heterogeneity on the demand in the context of a technician dispatching problem
    Cavada, Juan P.
    Cortes, Cristian E.
    Goic, Marcel
    Weintraub, Andres
    Zambrano, Juan, I
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 287 (03) : 820 - 831
  • [8] Passengers' Satisfaction among the Private Bus Transport Services in Mayiladuthurai
    Rajarajan, M.
    Manikandan, B.
    Narayanan, S. Raja
    [J]. JOURNAL OF PHARMACEUTICAL NEGATIVE RESULTS, 2022, 13 : 1166 - 1173
  • [9] Model of Developement of Passengers Transport Demand in Croatian Maritime Traffic System
    Rajsman, Marijan
    Beros, Ivo
    [J]. NASE MORE, 2006, 53 (3-4): : 112 - 117
  • [10] Routes Planning Models for Railway Transport Systems in Relation to Passengers' Demand
    Severino, Alessandro
    Martseniuk, Larysa
    Curto, Salvatore
    Neduzha, Larysa
    [J]. SUSTAINABILITY, 2021, 13 (16)