TY - JOUR
T1 - Route Design Problem of Customized Buses
T2 - Mixed Integer Programming Model and Case Study
AU - Guo, Rongge
AU - Guan, Wei
AU - Zhang, Wenyi
N1 - Funding Information:
This paper is sponsored by NSFC Project (Nos. 71621001, 91746201, 71601015).
Publisher Copyright:
© 2018 American Society of Civil Engineers.
Copyright:
Copyright 2018 Elsevier B.V., All rights reserved.
PY - 2018/11/1
Y1 - 2018/11/1
N2 - In recent years, the customized bus (CB) has been introduced and popularized in China to improve the attraction and service level of public transportation. A key point of the CB system, the route design problem, is always formulated as a vehicle routing problem with pickup and delivery (VRPPD). However, VRPPD cannot sufficiently describe the in-vehicle passengers of multiple vehicles involved. In this paper, a mixed integer programming model is developed to formulate a multivehicle routing problem, with suggestions for bus stop locations and routes. Meanwhile, the model can determine passenger-to-vehicle assignment based on a series of constraints, like operation standard and number of stations. In solving the problem, a numerical example is used to compare a genetic algorithm (GA) and branch-andcut algorithm. The comparison results illustrate that GA is more efficient with lower complexity. Finally, in order to apply and evaluate the proposed model, a real-world case study using smartcard data is conducted to compare the approach with the current CB route design method in Beijing.
AB - In recent years, the customized bus (CB) has been introduced and popularized in China to improve the attraction and service level of public transportation. A key point of the CB system, the route design problem, is always formulated as a vehicle routing problem with pickup and delivery (VRPPD). However, VRPPD cannot sufficiently describe the in-vehicle passengers of multiple vehicles involved. In this paper, a mixed integer programming model is developed to formulate a multivehicle routing problem, with suggestions for bus stop locations and routes. Meanwhile, the model can determine passenger-to-vehicle assignment based on a series of constraints, like operation standard and number of stations. In solving the problem, a numerical example is used to compare a genetic algorithm (GA) and branch-andcut algorithm. The comparison results illustrate that GA is more efficient with lower complexity. Finally, in order to apply and evaluate the proposed model, a real-world case study using smartcard data is conducted to compare the approach with the current CB route design method in Beijing.
KW - Customized bus
KW - Mixed integer programming model
KW - Route design problem
KW - Smartcard data
UR - http://www.scopus.com/inward/record.url?scp=85052613288&partnerID=8YFLogxK
U2 - 10.1061/JTEPBS.0000185
DO - 10.1061/JTEPBS.0000185
M3 - Article
AN - SCOPUS:85052613288
VL - 144
JO - Journal of Transportation Engineering Part A: Systems
JF - Journal of Transportation Engineering Part A: Systems
SN - 2473-2907
IS - 11
M1 - 04018069
ER -