基于集合覆盖理论的公交线路驾驶员排班优化方法

摘要
图/表
参考文献
相关文章 (15)

全文: PDF (381 KB) HTML ()
输出: BibTeX | EndNote (RIS)

摘要 A work schedule optimization model of a bus route is proposed to minimize labor cost by optimizing the work schedule of bus drivers. The mathematical model is constructed using set covering theory to minimize the number of operating buses by considering the bus schedule chain of a single bus line as the research subject, as well as the constraints of vehicle operation task, shift time, and labor rules. In addition, a 0-1 integer programming algorithm based on heuristic method is designed to solve the model. Finally, this algorithm is realized according to the real investigation data of Jinan Public Transit, and the schedule scheme is solved using MATLAB. Experiment result shows that (1) unlike other algorithms, 0-1 integer programming algorithm can shorten the waiting period of drivers and decrease the total work time and personnel cost to reduce the operating costs of the bus company; and (2) the method can protect the working hours of drivers by improving their efficiency, thereby providing a reasonable solution to optimize the work schedule of bus drivers.

	服务

	把本文推荐给朋友
	加入我的书架
	加入引用管理器
	E-mail Alert
	RSS
	作者相关文章
	魏金丽
	郭亚娟
	张萌萌

关键词 ： traffic engineering, work schedule of bus drivers, heuristic method, set covering, 0-1 integer programming

Abstract：A work schedule optimization model of a bus route is proposed to minimize labor cost by optimizing the work schedule of bus drivers. The mathematical model is constructed using set covering theory to minimize the number of operating buses by considering the bus schedule chain of a single bus line as the research subject, as well as the constraints of vehicle operation task, shift time, and labor rules. In addition, a 0-1 integer programming algorithm based on heuristic method is designed to solve the model. Finally, this algorithm is realized according to the real investigation data of Jinan Public Transit, and the schedule scheme is solved using MATLAB. Experiment result shows that (1) unlike other algorithms, 0-1 integer programming algorithm can shorten the waiting period of drivers and decrease the total work time and personnel cost to reduce the operating costs of the bus company; and (2) the method can protect the working hours of drivers by improving their efficiency, thereby providing a reasonable solution to optimize the work schedule of bus drivers.

Key words： traffic engineering work schedule of bus drivers heuristic method set covering 0-1 integer programming

收稿日期: 2016-06-18

基金资助:Supported by the National Natural Science Foundation of China (No. 51178231,No.61174175); the Shandong Natural Science Foundation (No. ZR2014EEP023)

通讯作者: WEI Jin-li,E-mail:wjl827025@163.com E-mail: wjl827025@163.com

引用本文:

魏金丽, 郭亚娟, 张萌萌. 基于集合覆盖理论的公交线路驾驶员排班优化方法[J]. Journal of Highway and Transportation Research and Development, 2016, 10(4): 96-101.
WEI Jin-li, GUO Ya-juan, ZHANG Meng-meng. A Method of Optimizing the Work Schedule of Bus Drivers Based on Set Covering Theory. Journal of Highway and Transportation Research and Development, 2016, 10(4): 96-101.

链接本文:

http://manu27.magtech.com.cn/Jwk_gljtkj_en/CN/ 或 http://manu27.magtech.com.cn/Jwk_gljtkj_en/CN/Y2016/V10/I4/96

[1] XIE L, NAUMANN M, SUHL L. A Stochastic Model for Rota Scheduling in Public Bus Transport[R]. Germany:University of Paderborn, 2012.
[2] XU Qun-ling. Schedule Problem of City Bus Drivers Based on Immune Optimization. Computer Engineering[J]. 2010, 36(24):164-166. (in Chinese)
[3] LOURENCO H R,PORTUGAL R. Multiobjective MetaHeuristics for the Bus Driver Scheduling Problem[J]. Transportation Science, 2007, 35(3):331-343.
[4] CEDER A. Public Transit Planning and Operation:Theory Modeling and Practice[M]. Beijing:Tsinghua University Press, 2010. (in Chinese)
[5] MAO Lin, LI Wen-quan. Research on Transit Vehicle Scheduling Model and Its Algorithm[J]. Journal of Transportation Engineering and Information, 2009, 7(3):64-67. (in Chinese)
[6] MESQUITA M, MOZ M, PAIAS A, et al. A Decomposition Approach for the Integrated Vehicle-crew-roster Problem with Days-off Pattern[J]. European Journal of Operation Research, 2013, 229(2):318-331.
[7] LIN X, KLIEWER N, SUHL L. Integrated Driver Rostering Problem in Pubic Bus Transit[J]. Procedia-social and behavioral sciences, 2012, 54:656-660.
[8] MESQUITA M, MOZ M, PAIAS A. A New Model for the Integrated Vehicle-crew-rostering Problem and a Computational Study on Rosters[J]. Journal of Scheduling, 2011, 14(4):1094-6136.
[9] REPICIOA M, MOZ M, PATO M V. Enhanced Genetic Algorithms for a Bi-objective Bus Driver Rostering Problem:A Computational Study[J]. International Transactions in Operational Research, 2013, 20(4):0969-6016.
[10] YANG Ying-jun, WANG Yi-peng, ZHAO Xiang-mo. Research on Staff Scheduling of Urban Passenger Taxi Dispatching Center Based on Genetic Algorithm[J]. Journal of Highway and Transportation Research and Development, 2010, 27(7):142-146. (in Chinese)
[11] YANG Shang. Study on Bus Driver Scheduling Problem Based on Ant Algorithm[D]. Wuhan:Huazhong University of Science and Technology, 2009. (in Chinese)
[12] ZHAI Dong-wei. Study on Bus Driver Scheduling Algorithm Based on GATS[D]. Beijing:Beijing Jiaotong University, 2007. (in Chinese)
[13] WANG Jian. Research and Implementation of Bus Crew-scheduling Algorithm Based on Set-covering Problem[D]. Beijing:Beijing Jiaotong University, 2011. (in Chinese)