当前位置: 首页> 国外交通期刊数据库 >详情
原文传递 Route Design Problem of Customized Buses: Mixed Integer Programming Model and Case Study
题名: Route Design Problem of Customized Buses: Mixed Integer Programming Model and Case Study
其他题名: Abdulkader,M.M.,Y.Gajpal,and T.Y.ElMekkawy.2015."Hybridized ant colony algorithm for the multi compartment vehicle routing problem."Appl.Soft Comput.37:196-203.https://doi.org/10.1016/j.asoc.2015.08.020.
正文语种: 英文
作者: Rongge Guo
关键词: Customized bus;Route design problem;Mixed integer programming model;Smartcard data
摘要: 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.
出版年: 2018
论文唯一标识: P-72Y2018V144N11006
英文栏目名称: TECHNICAL PAPERS
doi: 10.1061/JTEPBS.0000185
期刊名称: Journal of Transportation Engineering
拼音刊名(出版物代码): P-72
卷: 144
期: 11
页码: 45-58
检索历史
应用推荐