Hybrid metaheuristic for the dial-a-ride problem with private fleet and common carrier integrated with public transportation

被引:2
作者
Schenekemberg, Cleder M. [1 ,2 ]
Chaves, Antonio A. [1 ]
Guimaraes, Thiago A. [3 ]
Coelho, Leandro C. [4 ]
机构
[1] Fed Univ Sao Paulo UNIFESP, Sao Jose Dos Campos, Brazil
[2] Aeronaut Inst Technol ITA, Sao Jose Dos Campos, Brazil
[3] Fed Inst Sci & Technol Parana IFPR, Curitiba, Brazil
[4] Univ Laval, Canada Res Chair Integrated Logist, CIRRELT, Quebec City, PQ, Canada
基金
加拿大自然科学与工程研究理事会; 巴西圣保罗研究基金会;
关键词
Dial-a-ride; Inter-modal mobility; Common carrier; Bus; Genetic algorithm; LOCAL SEARCH; BRANCH; CUT; ALGORITHM; PICKUP;
D O I
10.1007/s10479-024-06136-9
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Dial-a-ride operations consist of door-to-door transportation systems designed for users with specific needs. Governments and companies offer such services, and due to the flexibility and service level required by the users, it is considerably more costly than public transportation, besides emitting higher levels of CO2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$_2$$\end{document}. Hence, it is crucial to analyze alternatives to improve operational costs and efficiency without compromising the quality of the service. This paper introduces a variant for the dial-a-ride problem with private fleets and common carriers (DARP-PFCC) integrated with public transportation. Requests can be served by the private fleet, the common carrier, or by integrating them into the public transportation system. In this case, users are collected at the pickup locations and taken to bus stops. After the bus trip, other vehicles serve them from the bus stops to their final destination. Bus schedules must be considered when deciding on the best integration trip. As a methodology, we solve this extension of the DARP-PFCC with a metaheuristic and machine learning hybrid method by combining a biased random key genetic algorithm with the Q-Learning and local search heuristics (BRKGA-QL). This paper also introduces some improvements to this method, particularly with respect to population quality and diversity, thanks to a new mutation method in the classical crossover operator and deterministic rules for the learning process. Computational experiments on a new benchmark data set with realistic data from Qu & eacute;bec City show that our BRKGA-QL outperforms its previous version. In addition, we provide a qualitative analysis for the DARP-PFCC, showing that the middle mile integration with public transportation can save up to 20% in operating costs, besides reducing the traveled distances of private vehicles and common carriers.
引用
收藏
页数:39
相关论文
共 46 条
[31]   Three effective metaheuristics to solve the multi-depot multi-trip heterogeneous dial-a-ride problem [J].
Masmoudi, Mohamed Amine ;
Hosny, Manar ;
Braekers, Kris ;
Dammak, Abdelaziz .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2016, 96 :60-80
[32]   Benefits of horizontal cooperation in dial-a-ride services [J].
Molenbruch, Yves ;
Braekers, Kris ;
Caris, An .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2017, 107 :97-119
[33]   Variable neighborhood search for the dial-a-ride problem [J].
Parragh, Sophie N. ;
Doerner, Karl F. ;
Hartl, Richard F. .
COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (06) :1129-1138
[34]   A metaheuristic for evaluation of an integrated special transport service [J].
Posada, M. ;
Hall, C. H. .
INTERNATIONAL JOURNAL OF URBAN SCIENCES, 2020, 24 (03) :316-338
[35]   The integrated dial-a-ride problem with timetabled fixed route service [J].
Posada M. ;
Andersson H. ;
Häll C.H. .
Public Transport, 2017, 9 (1-2) :217-241
[36]   A Branch-and-Price-and-Cut Algorithm for Heterogeneous Pickup and Delivery Problems with Configurable Vehicle Capacity [J].
Qu, Yuan ;
Bard, Jonathan F. .
TRANSPORTATION SCIENCE, 2015, 49 (02) :254-270
[37]   Near linear time algorithm to detect community structures in large-scale networks [J].
Raghavan, Usha Nandini ;
Albert, Reka ;
Kumara, Soundar .
PHYSICAL REVIEW E, 2007, 76 (03)
[38]  
Rey D., 2011, INT ENCY STAT SCI, P1658, DOI [10.1007/978-3-642-04898-2616, DOI 10.1007/978-3-642-04898-2616, DOI 10.1007/978-3-642-04898-2_616]
[39]   Models and branch-and-cut algorithms for pickup and delivery problems with time windows [J].
Ropke, Stefan ;
Cordeau, Jean-Francois ;
Laporte, Gilbert .
NETWORKS, 2007, 49 (04) :258-272
[40]   Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows [J].
Ropke, Stefan ;
Cordeau, Jean-Francois .
TRANSPORTATION SCIENCE, 2009, 43 (03) :267-286