A model for taxi pooling with stochastic vehicle travel times

被引:8
|
作者
Chen, Chun-Ying [1 ]
Yan, Shangyao [2 ]
Wu, Yi-Siang [2 ]
机构
[1] Kainan Univ, Dept Air Transportat, Luzhu, Taiwan
[2] Natl Cent Univ, Dept Civil Engn, Taoyuan, Taiwan
关键词
Integer programming; network flow; passenger matching; stochastic travel times; taxi pooling; A-RIDE PROBLEM; SOLUTION ALGORITHM; TRANSPORTATION;
D O I
10.1080/15568318.2018.1490468
中图分类号
X [环境科学、安全科学];
学科分类号
08 ; 0830 ;
摘要
Taxi pooling means the sharing of a taxi by more than one passenger with at least a semi-common route. Currently, a trial-and-error process is adopted, taking into account expected travel times, for taxi pooling, a method which is neither effective nor efficient. This is because stochastic disturbances arising from variations in the taxi travel times that occur in actual traveling are neglected. In the worst case scenario, where vehicle travel times fluctuate wildly during operations, the planned schedule can be disturbed enough to lose its optimality. Therefore, in this study, a network flow technique is used to construct a stochastic taxi pooling model incorporating stochastic vehicle travel times. A solution algorithm is also proposed to efficiently solve the problem. The performance of the proposed models and the use of the solution method in practice are evaluated by executing numerical tests using real data with suitable assumptions. The test results show that the stochastic model and the solution method could be useful references for practice.
引用
收藏
页码:582 / 596
页数:15
相关论文
共 50 条
  • [31] A chance constrained programming model and an improved large neighborhood search algorithm for the electric vehicle routing problem with stochastic travel times
    Messaoud, Elhassania
    EVOLUTIONARY INTELLIGENCE, 2023, 16 (01) : 153 - 168
  • [32] A chance constrained programming model and an improved large neighborhood search algorithm for the electric vehicle routing problem with stochastic travel times
    Elhassania Messaoud
    Evolutionary Intelligence, 2023, 16 : 153 - 168
  • [33] A Granular Local Search Matheuristic for a Heterogeneous Fleet Vehicle Routing Problem with Stochastic Travel Times
    Ramon Faganello Fachini
    Vinícius Amaral Armentano
    Franklina Maria Bragion Toledo
    Networks and Spatial Economics, 2022, 22 : 33 - 64
  • [34] Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times
    Rostami, Borzou
    Desaulniers, Guy
    Errico, Fausto
    Lodi, Andrea
    OPERATIONS RESEARCH, 2021, 69 (02) : 436 - 455
  • [35] A Granular Local Search Matheuristic for a Heterogeneous Fleet Vehicle Routing Problem with Stochastic Travel Times
    Fachini, Ramon Faganello
    Armentano, Vinicius Amaral
    Toledo, Franklina Maria Bragion
    NETWORKS & SPATIAL ECONOMICS, 2022, 22 (01): : 33 - 64
  • [36] Vehicle routing problem with stochastic travel times including soft time windows and service costs
    Tas, Duygu
    Dellaert, Nico
    van Woensel, Tom
    de Kok, Ton
    COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (01) : 214 - 224
  • [37] The time-dependent vehicle routing problem with soft time windows and stochastic travel times
    Tas, Duygu
    Dellaert, Nico
    van Woensel, Tom
    de Kok, Ton
    TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2014, 48 : 66 - 83
  • [38] A reliability-extended simheuristic for the sustainable vehicle routing problem with stochastic travel times and demands
    Abdullahi, Hassana
    Reyes-Rubiano, Lorena
    Ouelhadj, Djamila
    Faulin, Javier
    Juan, Angel A.
    JOURNAL OF HEURISTICS, 2025, 31 (02)
  • [39] Implementation of a theoretical model for the calculation of slow vehicle travel times on alternative routes
    Hanzl, Jiri
    Brodsky, Jakub
    Mockova, Denisa
    Kumpost, Petr
    2017 SMART CITY SYMPOSIUM PRAGUE (SCSP), 2017,
  • [40] A Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel Times
    Nikolova, E.
    Stier-Moses, N. E.
    OPERATIONS RESEARCH, 2014, 62 (02) : 366 - 382