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 条
[1]   The Multi-Parent Biased Random-Key Genetic Algorithm with Implicit Path-Relinking and its real-world applications [J].
Andrade, Carlos E. ;
Toso, Rodrigo F. ;
Goncalves, Jose F. ;
Resende, Mauricio G. C. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 289 (01) :17-30
[2]   Minimizing flowtime in a flowshop scheduling problem with a biased random-key genetic algorithm [J].
Andrade, Carlos E. ;
Silva, Thuener ;
Pessoa, Luciana S. .
EXPERT SYSTEMS WITH APPLICATIONS, 2019, 128 :67-80
[3]  
[Anonymous], 1992, Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence, DOI DOI 10.7551/MITPRESS/1090.001.0001
[4]   A combined dial-a-ride and fixed schedule ferry service for coastal cities [J].
Aslaksen, Ingvild Eide ;
Svanberg, Elisabeth ;
Fagerholt, Kjetil ;
Johnsen, Lennart C. ;
Meisel, Frank .
TRANSPORTATION RESEARCH PART A-POLICY AND PRACTICE, 2021, 153 :306-325
[5]   Choice-driven service network design for an integrated fixed line and demand responsive mobility system [J].
Azadeh, Shadi Sharif ;
van der Zee, J. ;
Wagenvoort, M. .
TRANSPORTATION RESEARCH PART A-POLICY AND PRACTICE, 2022, 166 :557-574
[6]   On the inefficiency of ride-sourcing services towards urban congestion [J].
Beojone, Caio Vitor ;
Geroliminis, Nikolas .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2021, 124
[7]   Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots [J].
Braekers, Kris ;
Caris, An ;
Janssens, Gerrit K. .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2014, 67 :166-186
[8]  
Brevet D., 2019, Journal on Vehicle Routing Algorithms, V2, P89, DOI 10.1007/s41604-019-00014-5
[9]   An ELS-based approach with dynamic probabilities management in local search for the Dial-A-Ride Problem [J].
Chassaing, M. ;
Duhamel, C. ;
Lacomme, P. .
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2016, 48 :119-133
[10]   An Adaptive and Near Parameter-Free BRKGA Using Q-Learning Method [J].
Chaves, Antonio Augusto ;
Nogueira Lorena, Luiz Henrique .
2021 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC 2021), 2021, :2331-2338