Customized bus service design for uncertain commuting travel demand

被引:42
作者
Dou, Xueping [1 ,2 ]
Meng, Qiang [2 ]
Liu, Kai [3 ]
机构
[1] Beijing Univ Technol, Beijing Key Lab Traff Engn, Beijing, Peoples R China
[2] Natl Univ Singapore, Dept Civil & Environm Engn, Singapore 117576, Singapore
[3] Dalian Univ Technol, Sch Transportat & Logist, Dalian, Peoples R China
基金
中国国家自然科学基金; 北京市自然科学基金;
关键词
bus route; bus timetable; bus deployment; demand uncertainty; risk-averse level; branch and price; heuristic algorithm;
D O I
10.1080/23249935.2020.1864509
中图分类号
U [交通运输];
学科分类号
08 ; 0823 ;
摘要
This study proposes an interesting customized bus service design problem by considering travel demand uncertainty. Given a fleet of heterogeneous vehicles, a mixed integer linear programming (MILP) model is put forward for the complex decision making on bus routing, timetabling and bus deployment, with the objective of generating a set of profitable bus services to cater for diverse commuting-trip requests. To capture the risk-averse level of the bus operator in uncertain travel demand environment, a random variable describing the likelihood that the offered bus services are rejected by potential passengers and two associated control parameters are embedded in the MILP model, facilitating an adjustable robust optimization framework. A branch-and-price method is implemented to solve the model exactly. A column-generation-based heuristic method is proposed to solve large-scale problems. The effectiveness of both the exact and heuristic methods is assessed in numerical experiments.
引用
收藏
页码:1405 / 1430
页数:26
相关论文
共 42 条
[1]   Vehicle routing problems with split deliveries [J].
Archetti, C. ;
Speranza, M. G. .
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2012, 19 (1-2) :3-22
[2]   Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows [J].
Archetti, C. ;
Bouchard, M. ;
Desaulniers, G. .
TRANSPORTATION SCIENCE, 2011, 45 (03) :285-298
[3]   Branch-and-price: Column generation for solving huge integer programs [J].
Barnhart, C ;
Johnson, EL ;
Nemhauser, GL ;
Savelsbergh, MWP ;
Vance, PH .
OPERATIONS RESEARCH, 1998, 46 (03) :316-329
[4]   School Bus Routing with Stochastic Demand and Duration Constraints [J].
Caceres, Hernan ;
Batta, Rajan ;
He, Qing .
TRANSPORTATION SCIENCE, 2017, 51 (04) :1349-1364
[5]   Combining robustness and recovery in rapid transit network design [J].
Cadarso, L. ;
Marin, A. .
TRANSPORTMETRICA A-TRANSPORT SCIENCE, 2016, 12 (03) :203-229
[6]   Design of suburban bus route for airport access [J].
Chen, Jingxu ;
Wang, Shuaian ;
Liu, Zhiyuan ;
Wang, Wei .
TRANSPORTMETRICA A-TRANSPORT SCIENCE, 2017, 13 (06) :568-589
[7]  
Chen X., 2018, INT C TRANSP DEV 201, P15
[8]   Mixed-integer programming model and branch-and-price-and-cut algorithm for urban bus network design and timetabling [J].
Chu, James C. .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2018, 108 :188-216
[9]   The dial-a-ride problem: models and algorithms [J].
Cordeau, Jean-Francois ;
Laporte, Gilbert .
ANNALS OF OPERATIONS RESEARCH, 2007, 153 (01) :29-46
[10]   Transit passengers' behavioural intentions: the influence of service quality and customer satisfaction [J].
de Ona, Juan ;
de Ona, Rocio ;
Eboli, Laura ;
Forciniti, Carmen ;
Mazzulla, Gabriella .
TRANSPORTMETRICA A-TRANSPORT SCIENCE, 2016, 12 (05) :385-412