TY - JOUR
T1 - Time-Dependent Urban Customized Bus Routing with Path Flexibility
AU - Guo, Rongge
AU - Zhang, Wenyi
AU - Guan, Wei
AU - Ran, Bin
N1 - Funding Information:
Manuscript received February 27, 2020; revised May 24, 2020 and July 13, 2020; accepted August 19, 2020. Date of publication September 3, 2020; date of current version March 31, 2021. This work was supported by the National Natural Science Foundation of China (NSFC) under Project 71961137008, Project 91746201, and Project 71621001. The Associate Editor for this article was X. Ma. (Corresponding author: Wei Guan.) Rongge Guo, Wenyi Zhang, and Wei Guan are with the Key Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport, Ministry of Transport, Beijing Jiaotong University, Beijing 100044, China (e-mail: [email protected]; [email protected]; [email protected]).
Publisher Copyright:
© 2000-2011 IEEE.
Copyright:
Copyright 2021 Elsevier B.V., All rights reserved.
PY - 2021/4/1
Y1 - 2021/4/1
N2 - Urban customized bus companies are increasingly motivated by design efforts that entail more efficient route scenarios to incorporate adaptation to temporal and spatial heterogeneity in travel demand. However, such motivations are usually hindered by ubiquitous arrival unpunctuality resulting from traffic congestion. To resolve this problem, we suggest a time-dependent bus route planning methodology that explicitly considers path flexibility between nodes to be visited. First, we establish a mixed-integer programming model to formulate the problem, where decision-making considerations in bus route planning, path choice between nodes, and passenger assignment are concurrently integrated. Then, we develop a hybrid metaheuristic (combining tabu search and variable neighborhood search) to solve the model, in which satisfactory performance is observed from the numerical test in a small-sized example. Finally, the problem and methodology are addressed in a city-scale instance, where the effects of time-window features and traffic congestion, as well as the benefits from path flexibility inclusion in terms of cost, travel time, and distance are investigated.
AB - Urban customized bus companies are increasingly motivated by design efforts that entail more efficient route scenarios to incorporate adaptation to temporal and spatial heterogeneity in travel demand. However, such motivations are usually hindered by ubiquitous arrival unpunctuality resulting from traffic congestion. To resolve this problem, we suggest a time-dependent bus route planning methodology that explicitly considers path flexibility between nodes to be visited. First, we establish a mixed-integer programming model to formulate the problem, where decision-making considerations in bus route planning, path choice between nodes, and passenger assignment are concurrently integrated. Then, we develop a hybrid metaheuristic (combining tabu search and variable neighborhood search) to solve the model, in which satisfactory performance is observed from the numerical test in a small-sized example. Finally, the problem and methodology are addressed in a city-scale instance, where the effects of time-window features and traffic congestion, as well as the benefits from path flexibility inclusion in terms of cost, travel time, and distance are investigated.
KW - Customized bus routing problem
KW - Metaheuristic
KW - Path flexibility
KW - Soft time windows
KW - Traffic congestion
UR - http://www.scopus.com/inward/record.url?scp=85103869968&partnerID=8YFLogxK
U2 - 10.1109/TITS.2020.3019373
DO - 10.1109/TITS.2020.3019373
M3 - Article
AN - SCOPUS:85103869968
VL - 22
SP - 2381
EP - 2390
JO - IEEE Transactions on Intelligent Transportation Systems
JF - IEEE Transactions on Intelligent Transportation Systems
SN - 1524-9050
IS - 4
M1 - 9186321
ER -