期刊文献+

网络化运营下城市轨道交通列车车底运用计划编制的优化方法 被引量:13

Optimization Method for Working out Vehicle Scheduling Plan of Urban Rail Transit under Network Operation
在线阅读 下载PDF
导出
摘要 为提高城市轨道交通列车车底的运营效率,以城市轨道交通网络化运营为前提,研究网络化运营下城市轨道交通列车车底运用计划编制优化的方法。以车场能力约束、车底与车次衔接约束、车底始发与回送车场约束等为条件,构建以运营费用最小为目标的网络化运营下城市轨道交通列车车底运用计划编制优化模型,并给出并行禁忌搜索的智能算法。以某市轨道交通系统中3条线路组成的路网为例,验证了优化方法和求解算法的有效性和实用性。 To improve the operation efficiency of urban rail transit stocks and on the basis of urban rail transit network operation,an optimal method for urban rail transit train stocks scheduling under network operation condition was studied.In consideration of train stocks,train number connection and depot properties,the constraint of starting from and sending back to the same depot for train stocks,the optimization model for train stocks scheduling of urban rail transit under network operation condition was established with the minimum operation cost as the target,and the parallel tabu search algorithm was given based on the characteristics of the model.The numerical example of the operation network composed of three lines in the rail transit of a city was investigated,which has validated the effectiveness and practicality of the optimization method and algorithm.
出处 《中国铁道科学》 EI CAS CSCD 北大核心 2014年第2期104-110,共7页 China Railway Science
基金 国家重点基础研究发展计划项目(2012CB725403) 国家"十二.五"科技支撑计划项目(2011BAG01B01 2011BAG01B02)
关键词 城市轨道交通 网络化运营 车底周转 运用计划 优化方法 并行禁忌搜索 Urban rail transit Network operation Vehicle scheduling Scheduling plan Optimizationmethod Parallel tabu search
  • 相关文献

参考文献14

  • 1FRELING R,WAGELMANS A M,PAIXAO J P.Models and Algorithms for Single-Depot Vehicle Scheduling[J].Transportation Science,2001,35 (2):165-180.
  • 2BODIN L,GOLDEN B.Classification in Vehicle Routing and Scheduling[J].Networks,1981,11 (2):97-108.
  • 3BERTOSSI A A,CARRARESI P,GALLO G.On Some Matching Problems Arising in Vehicle Scheduling Models[J].Networks,1987,17 (3):271-281.
  • 4LOBEL A.Vehicle Scheduling in Public Transit and Lagrangean Pricing[J].Management Science,1998,44 (12):1637-1649.
  • 5HAGHANI A,BANIHASHEMI M.Heuristic Approaches for Solving Large-Scale Bus Transit Vehicle Scheduling Problem with Route Time Constraints[J].Transportation Research Part A:Policy and Practice,2002,36 (4):309-333.
  • 6OUKIL A,AMOR H B,DESROSIERS J,et al.Stabilized Column Generation for Highly Degenerate Multiple-Depot Vehicle Scheduling Problems[J].Computers & Operations Research,2007,34 (3):817-834.
  • 7RIBEIRO C C,SOUMIS K A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem[J].Operations Research,1994,42 (1):41-52.
  • 8CEDER A,STERN H I.Deficit Function Bus Scheduling with Deadheading Trip Insertions for Fleet Size Reduction[J].Transportation Science,1981,15 (4):338-363.
  • 9LAMATSCH A.An Approach to Vehicle Scheduling with Depot Capacity Constraints[R].Germany:Faw,1991.
  • 10HADJAR A,MARCOTTE O,SOUMIS K A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem[J].Operations Research,2006,54 (1):130-149.

二级参考文献17

  • 1徐瑞华,陈菁菁,杜世敏.城轨交通多种列车交路模式下的通过能力和车底运用研究[J].铁道学报,2005,27(4):6-10. 被引量:60
  • 2郑时德 吴汉琳.铁路行车组织[M].北京:中国铁道出版社,1988.171-174.
  • 3徐行方.高速铁路沪宁试验段列车开行方案的探讨[A]..走向市场经济的交通运输[C].北京:中国铁道出版社,1998.42-52.
  • 4CHRISTIANSEN C H, LYSGAARD J. A Branch-and-Price Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands [J]. Operations Research Letters, 2007, 35 (6): 773-781.
  • 5ROPKE S, CORDEAU J-F. Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows [J]. Transportation Science, 2009, 43 (3): 267-286.
  • 6BAKER B M, AYECHEW M A. A Genetic Algorithm for the Vehicle Routing Problem [J]. Computers and Opera- tions Research, 2003, 30 (5): 787-800.
  • 7BUNTE S, KLIENVE N. An Overview on Vehicle Scheduling Models [J]. Public Transportation, 2009, 1 (4) : 299- 317.
  • 8CORDEAU J-F, DUMIS F, DESROSIERS J. Simultaneous Assignment of Locomotives and Cars to Passenger Trains [J]. Operations Research, 2001, 49 (4): 531- 548.
  • 9ROUILLON S, DESAULNIERS G, SOUMIS F. An Extended Branch-and-Bound Method for Locomotive Assign- ment[J]. Transportation Research Part B: Methodological, 2006, 40 (5): 404-423.
  • 10CACCHIANI V, CAPRARA A, TOTH P. Solving a Real-World Train-Unit Assignment Problem [J]. Mathemati- cal Programming, 2010, 124 (1): 207-231.

共引文献45

同被引文献94

引证文献13

二级引证文献55

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部