Ride-matching and routing optimisation: Models and a large neighbourhood search heuristic

被引：33
|
作者：
Hou, Liwen [1 ]
Li, Dong [2 ]
Zhang, Dali [1 ]
机构：
[1] Shanghai Jiao Tong Univ, Antai Coll Econ & Management, Shanghai 200030, Peoples R China
[2] York Univ, Sch Management, York, N Yorkshire, England
来源：
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW | 2018年 / 118卷
基金：
中国国家自然科学基金;
关键词：
Ride-matching and routing; Ridesharing systems; Large neighbourhood search; TIME WINDOWS; DELIVERY PROBLEM; EXACT ALGORITHM; DYNAMIC PICKUP; TABU SEARCH; BRANCH; CUT; TRANSPORTATION; FUTURE;
D O I：
10.1016/j.tre.2018.07.003
中图分类号：
F [经济];
学科分类号：
02 ;
摘要：
This paper considers a ridesharing problem on how to match riders to drivers and how to choose the best routes for vehicles. Unlike the others in the literature, we are concerned with the maximization of the average loading ratio of the entire system. Moreover, we develop a flow-dependent version of the model to characterize the impact of pick-up and drop-off congestion. In another extended model we take into account the riders' individual evaluation on different transportation modes. Due to the large size of the resulting models, we develop a large neighbourhood search algorithm and demonstrate its efficiency.
引用
下载
收藏
页码：143 / 162
页数：20
相关论文
共 50 条
  • [1] A large neighbourhood search heuristic for ship routing and scheduling with split loads
    Korsvik, Jarl Eirik
    Fagerholt, Kjetil
    Laporte, Gilbert
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (02) : 474 - 483
  • [2] Dynamic Ride-Matching for Large-Scale Transportation Systems
    Cokyasar, Taner
    de Souza, Felipe
    Auld, Joshua
    Verbas, Omer
    [J]. TRANSPORTATION RESEARCH RECORD, 2022, 2676 (03) : 172 - 182
  • [3] A large neighbourhood search heuristic for covering designs
    Nikolic, Nebojsa
    Grujicic, Igor
    Mladenovic, Nenad
    [J]. IMA JOURNAL OF MANAGEMENT MATHEMATICS, 2016, 27 (01) : 89 - 106
  • [4] An Adaptive Large Neighbourhood Search Heuristic for the Capacitated Arc-Routing Problem with Stochastic Demands
    Laporte, Gilbert
    Musmanno, Roberto
    Vocaturo, Francesca
    [J]. TRANSPORTATION SCIENCE, 2010, 44 (01) : 125 - 135
  • [5] Guided Local Search with an Adaptive Neighbourhood Size Heuristic for Large Scale Vehicle Routing Problems
    Costa, Joao Guilherme Cavalcanti
    Mei, Yi
    Zhang, Mengjie
    [J]. PROCEEDINGS OF THE 2022 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'22), 2022, : 213 - 221
  • [6] Long-Haul Fleet Mix and Routing Optimisation with Constraint Programming and Large Neighbourhood Search
    Kilby, Philip
    Urli, Tommaso
    [J]. PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, CP 2015, 2015, 9255 : 729 - 729
  • [7] A Ride-Matching Strategy For Large Scale Dynamic Ridesharing Services Based on Polar Coordinates
    Li, Jiyao
    Allan, Vicki H.
    [J]. 2019 IEEE INTERNATIONAL CONFERENCE ON SMART COMPUTING (SMARTCOMP 2019), 2019, : 449 - 453
  • [8] An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports
    Hellsten, Erik Orm
    Sacramento, David
    Pisinger, David
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 287 (02) : 682 - 698
  • [9] A hybridisation of adaptive variable neighbourhood search and large neighbourhood search: Application to the Vehicle routing problem
    Sze, Jeeu Fong
    Salhi, Said
    Wassan, Niaz
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2016, 65 : 383 - 397
  • [10] A large neighbourhood search heuristic for the aircraft and passenger recovery problem
    Serge Bisaillon
    Jean-François Cordeau
    Gilbert Laporte
    Federico Pasin
    [J]. 4OR, 2011, 9 : 139 - 157
12345