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 条
  • [41] Welfare consequences of request stops at transport services with low demand
    Finn Jørgensen
    Gisle Solvoll
    [J]. European Transport Research Review, 2020, 12
  • [42] Optimization of Public Transport Services to Minimize Passengers' Waiting Times and Maximize Vehicles' Occupancy Ratios
    Tolic, Ivana Hartmann
    Nyarko, Emmanuel Karlo
    Ceder, Avishai
    [J]. ELECTRONICS, 2020, 9 (02)
  • [43] The oil tankers dispatching problem
    Ahmed, Nazimuddin
    Das, S.
    Purusotham, S.
    [J]. OPSEARCH, 2012, 49 (04) : 366 - 385
  • [44] Welfare consequences of request stops at transport services with low demand
    Jorgensen, Finn
    Solvoll, Gisle
    [J]. EUROPEAN TRANSPORT RESEARCH REVIEW, 2020, 12 (01)
  • [45] Integrating Demand Responsive Services Into Public Transport Disruption Management
    Cebecauer, Matej
    Burghout, Wilco
    Jenelius, Erik
    Babicheva, Tatiana
    Leffler, David
    [J]. IEEE OPEN JOURNAL OF INTELLIGENT TRANSPORTATION SYSTEMS, 2021, 2 : 24 - 36
  • [46] Integrating Demand Responsive Services into Public Transport Disruption Management
    Cebecauer, Matej
    Burghout, Wilco
    Jenelius, Erik
    Babicheva, Tatiana
    Leffler, David
    [J]. IEEE Open Journal of Intelligent Transportation Systems, 2021, 2 : 24 - 36
  • [47] A Unified Framework for Predicting KPIs of On-Demand Transport Services
    Guan, Jihong
    Wang, Weili
    Li, Wengen
    Zhou, Shuigeng
    [J]. IEEE ACCESS, 2018, 6 : 32005 - 32014
  • [48] THE DEMAND FOR TRANSPORT AND LOGISTICS SERVICES IN THE FRIULI VENEZIA GIULIA REGION
    Danielis, Romeo
    Torbianelli, Vittorio A.
    [J]. POMORSTVO-SCIENTIFIC JOURNAL OF MARITIME RESEARCH, 2007, 21 (02) : 129 - 138
  • [49] Proactive empty vehicle rebalancing for Demand Responsive Transport services
    Bischoff, Joschka
    Maciejewski, Michal
    [J]. 11TH INTERNATIONAL CONFERENCE ON AMBIENT SYSTEMS, NETWORKS AND TECHNOLOGIES (ANT) / THE 3RD INTERNATIONAL CONFERENCE ON EMERGING DATA AND INDUSTRY 4.0 (EDI40) / AFFILIATED WORKSHOPS, 2020, 170 : 739 - 744
  • [50] Flexible on Demand Transport Services (FDTS): The future of mobility systems
    Barreto, Luis
    Amaral, Antonio
    Baltazar, Sara
    [J]. 2019 IEEE INTERNATIONAL CONFERENCE ON ENGINEERING, TECHNOLOGY AND INNOVATION (ICE/ITMC), 2019,