网络化运营下城市轨道交通列车车底运用优化方法研究
|
摘要
发展城市轨道交通是缓解大城市交通压力,促进城市可持续发展的重要方式。随着我国城市轨道交通的日益发展,部分城市轨道交通网络已初步形成。与此同时,传统的单线运营和组织方式在满足成网条件下旅客运输组织、运力资源利用等方面逐渐表现出不足,使得网络化运营下的城市轨道交通资源优化配置在促进社会效益提升方面受到越来越多的关注。列车车底资源作为城市轨道交通运力资源的重要组成部分,其在网络化运营下是否能合理地优化运用,成为衡量轨道交通运营生产效益的重要指标。本论文以此为切入点,针对网络化运营下城市轨道交通列车车底运用优化问题进行了较为深入的研究,包括以下主要内容：
(1)阐述了城市轨道交通的网络化运营及其列车车底运用优化的总体架构。对城市轨道交通网络化运营概念进行了界定,分析了不同网络化运营模式的特点。对“网络化运营下城市轨道交通列车车底运用优化”给出了明确的定义,并从基本类型、总体架构及优化目的等几个方面对其内涵进行了详细阐述。从而为运用计划优化和检修计划优化的提出和研究奠定了坚实的基础。
(2)研究了网络化运营下城市轨道交通列车车底运用计划编制优化方法。在充分考虑列车车底、车次、车场等多个属性的基础上,以车场容量约束、列车车底始发／回送车场相同约束等为条件,建立了网络化运营下城市轨道交通列车车底运用计划编制优化基本模型。结合列车车底的时、空运营特征,提出了连续运营时间约束等多个附加约束。基于模型特点给出了精确求解算法和并行禁忌搜索的智能算法。通过算例验证了编制优化方法的有效性。
(3)构建了网络化运营下基于不同动态条件的城市轨道交通列车车底运用计划调整优化方法。结合实际运营过程中可能出现的车次延误、列车车底故障等多种动态条件,分析了不同动态条件下列车车底运用计划调整的类型及特点,提出了扰动、在途列车车底、救援策略等相关概念。基于干扰管理理论,给出了列车车底运用计划扰动的定量化方法,分别建立了基于车次时间延误及列车车底故障事件的列车车底运用计划调整优化模型,给出了精确求解算法并结合模型求解特点设计了改进的并行禁忌搜索算法。通过算例验证了调整优化方法的有效性。
(4)提出了网络化运营下列车车底检修计划编制优化方法。通过分析城市轨道交通列车车底检修模式,以月检修程为研究对象,借鉴公交乘务轮值思想,构建了检修计划编制优化基本模型,在其基础上加入对车场属性的考虑,扩展建立了适应网络化运营特点的检修计划编制优化模型。通过案例分析验证了方法的实用性。
(5)进行了基于运用计划编制优化和调整优化方法的案例分析研究。以BJ市三条轨道交通线路组成的运营网络作为案例进行了大规模问题的实证研究。验证了研究的实用价值。
Developing urban rail transits is a significant way to release the metropolitan traffic pressure and promote the sustainable development of a city. With the continuing development of urban rail transit in China, some urban rail transit networks have preliminarily formed. At the same time, the traditional operation modes for single line gradually shows disadvantages in meeting the requirements of the passenger transport organization and transportation resource utilization with network operation condition, and this leads to more and more focuses on optimal allocation of resources for urban rail transit network in order to promote more social benefits. As an important part of the transportation resource of urban rail transit, the train stocks can be used in a reasonable and effective way or not is becoming a crucial indictor for evaluating the benefits of urban rail transit operation. Based on the above points, the optimal utilization of urban rail transit train stocks with network operation condition is investigated in this dissertation, and the main efforts are summarized as follows:
(1) The urban rail transit network operation and its overall architecture for optimal utilization of train stocks are presented. The definition of the urban rail transit network operation is introduced, and the characteristics of different types of network operation modes are analyzed. Then, a concept of optimal utilization of train stocks of urban rail transit with network operation condition is defined, and it is elaborated from aspects of basic types, overall architecture, and goals for optimization, respectively. And all these are to establish the foundation of train stocks scheduling and maintenance scheduling researches.
(2) The method of optimization for train stocks scheduling of urban rail transit with network operation condition is studied. In consideration of train stock, trip and depot properties, a basic model of optimization for train stocks scheduling of urban rail transit with network operation condition is established according to the constraint of depots volume, the constraint of starting from and sending back to the same depot for the train stocks, et al. And several additional constraints are introduced by combining with the time-space operation characteristics of train stocks, such as continuous operation time constraint, et al. Moreover, the accurate solution algorithm and the parallel tabu search algorithm are generated basing on the characteristics of the basic model. The validity of the optimization method is verified by numerical examples.
(3) The method of adjustment optimization of train stocks scheduling for urban rail transit under network operation with different dynamic conditions is structured. Combining with several possible dynamic conditions in the actual operational process, such as trip delay, train stocks failure, et al., the types and characteristics of adjustment for train stocks scheduling are analyzed. And the concepts of disturbance, train stocks on lines and rescue strategy are defined as well. Based on the interference management theory, the quantitative method for disturbance is given. Models for scheduling adjustment optimization in the condition of trip delay and train stocks failure are established, and an accurate solution algorithm is proposed. Moreover, an improved parallel tabu search algorithm is also designed combining with the characteristics of model solving process. The validity of the method for adjustment optimization is verified by numerical examples.
(4) The method of maintenance scheduling optimization for train stocks utilization of urban rail transit with network operation condition is generated. By analyzing the maintenance modes of urban rail transit, the monthly maintenance is proposed as researching objective. Rotation of public transit crew scheduling is referenced and the basic model of maintenance scheduling optimization is established. Furthermore, taking the property of the depot into account, a model which is adapted to the characteristics of network operation, is established for the maintenance scheduling optimization. The method is proved practicably through the cases analysis.
(5) A real example of case for scheduling optimization and adjustment optimization is analyzed. The large-scale problem of operation network of three rail lines in the subway of BJ city is investigated and analyzed, and the results prove the practical value of this research.
(1)阐述了城市轨道交通的网络化运营及其列车车底运用优化的总体架构。对城市轨道交通网络化运营概念进行了界定,分析了不同网络化运营模式的特点。对“网络化运营下城市轨道交通列车车底运用优化”给出了明确的定义,并从基本类型、总体架构及优化目的等几个方面对其内涵进行了详细阐述。从而为运用计划优化和检修计划优化的提出和研究奠定了坚实的基础。
(2)研究了网络化运营下城市轨道交通列车车底运用计划编制优化方法。在充分考虑列车车底、车次、车场等多个属性的基础上,以车场容量约束、列车车底始发／回送车场相同约束等为条件,建立了网络化运营下城市轨道交通列车车底运用计划编制优化基本模型。结合列车车底的时、空运营特征,提出了连续运营时间约束等多个附加约束。基于模型特点给出了精确求解算法和并行禁忌搜索的智能算法。通过算例验证了编制优化方法的有效性。
(3)构建了网络化运营下基于不同动态条件的城市轨道交通列车车底运用计划调整优化方法。结合实际运营过程中可能出现的车次延误、列车车底故障等多种动态条件,分析了不同动态条件下列车车底运用计划调整的类型及特点,提出了扰动、在途列车车底、救援策略等相关概念。基于干扰管理理论,给出了列车车底运用计划扰动的定量化方法,分别建立了基于车次时间延误及列车车底故障事件的列车车底运用计划调整优化模型,给出了精确求解算法并结合模型求解特点设计了改进的并行禁忌搜索算法。通过算例验证了调整优化方法的有效性。
(4)提出了网络化运营下列车车底检修计划编制优化方法。通过分析城市轨道交通列车车底检修模式,以月检修程为研究对象,借鉴公交乘务轮值思想,构建了检修计划编制优化基本模型,在其基础上加入对车场属性的考虑,扩展建立了适应网络化运营特点的检修计划编制优化模型。通过案例分析验证了方法的实用性。
(5)进行了基于运用计划编制优化和调整优化方法的案例分析研究。以BJ市三条轨道交通线路组成的运营网络作为案例进行了大规模问题的实证研究。验证了研究的实用价值。
Developing urban rail transits is a significant way to release the metropolitan traffic pressure and promote the sustainable development of a city. With the continuing development of urban rail transit in China, some urban rail transit networks have preliminarily formed. At the same time, the traditional operation modes for single line gradually shows disadvantages in meeting the requirements of the passenger transport organization and transportation resource utilization with network operation condition, and this leads to more and more focuses on optimal allocation of resources for urban rail transit network in order to promote more social benefits. As an important part of the transportation resource of urban rail transit, the train stocks can be used in a reasonable and effective way or not is becoming a crucial indictor for evaluating the benefits of urban rail transit operation. Based on the above points, the optimal utilization of urban rail transit train stocks with network operation condition is investigated in this dissertation, and the main efforts are summarized as follows:
(1) The urban rail transit network operation and its overall architecture for optimal utilization of train stocks are presented. The definition of the urban rail transit network operation is introduced, and the characteristics of different types of network operation modes are analyzed. Then, a concept of optimal utilization of train stocks of urban rail transit with network operation condition is defined, and it is elaborated from aspects of basic types, overall architecture, and goals for optimization, respectively. And all these are to establish the foundation of train stocks scheduling and maintenance scheduling researches.
(2) The method of optimization for train stocks scheduling of urban rail transit with network operation condition is studied. In consideration of train stock, trip and depot properties, a basic model of optimization for train stocks scheduling of urban rail transit with network operation condition is established according to the constraint of depots volume, the constraint of starting from and sending back to the same depot for the train stocks, et al. And several additional constraints are introduced by combining with the time-space operation characteristics of train stocks, such as continuous operation time constraint, et al. Moreover, the accurate solution algorithm and the parallel tabu search algorithm are generated basing on the characteristics of the basic model. The validity of the optimization method is verified by numerical examples.
(3) The method of adjustment optimization of train stocks scheduling for urban rail transit under network operation with different dynamic conditions is structured. Combining with several possible dynamic conditions in the actual operational process, such as trip delay, train stocks failure, et al., the types and characteristics of adjustment for train stocks scheduling are analyzed. And the concepts of disturbance, train stocks on lines and rescue strategy are defined as well. Based on the interference management theory, the quantitative method for disturbance is given. Models for scheduling adjustment optimization in the condition of trip delay and train stocks failure are established, and an accurate solution algorithm is proposed. Moreover, an improved parallel tabu search algorithm is also designed combining with the characteristics of model solving process. The validity of the method for adjustment optimization is verified by numerical examples.
(4) The method of maintenance scheduling optimization for train stocks utilization of urban rail transit with network operation condition is generated. By analyzing the maintenance modes of urban rail transit, the monthly maintenance is proposed as researching objective. Rotation of public transit crew scheduling is referenced and the basic model of maintenance scheduling optimization is established. Furthermore, taking the property of the depot into account, a model which is adapted to the characteristics of network operation, is established for the maintenance scheduling optimization. The method is proved practicably through the cases analysis.
(5) A real example of case for scheduling optimization and adjustment optimization is analyzed. The large-scale problem of operation network of three rail lines in the subway of BJ city is investigated and analyzed, and the results prove the practical value of this research.
引文
[1]王炜,杨新苗,陈学武.城市公共交通系统规划方法与管理技术[M].北京：科学出版社,2002.
[2]维基百科.世界城市轨道交通列表[EB/OL]. http://zh.wikipedia.org/wiki/世界城市轨道交通列表.
[3]维基百科.中国城市轨道交通[EB/OL]. http://zh.wikipedia.org/wiki/中国城市轨道交通.
[4]张铭.城市轨道交通网络运营计划协调优化研究[D].上海：同济大学,2008.
[5]北京市基础设施投资有限公司.首都轨道交通网络化运营管理模式创新与实践[EB/OL].http://www.chinametro.net/Content/DisplayArticle.aspx?ID=3698.
[6]罗铭. “北京城市轨道交通网络化运营研究”课题结题[EB/OL].http://www.bsdc.net.cn/v/showNews.jsp?NewsID=61202.
[7]俞展猷,李照星.纽约、伦敦、巴黎、莫斯科、东京五大城市轨道交通的网络化建设[J].现代城市轨道交通,2009(1)：55-59.
[8]Vuchic V R. Urban Transit[M]. New YORK:JOHN wiley & SONS INC,2005.
[9]马丹.论马克思资源配置理论及其指导意义[J].经济师,2007(7)：30-31.
[10]Topp H H. Innovations in tram and light rail systems[J]. PROC Institution of Mechanical Engineers Part F:J,123(3):133-141.
[11]Hellewell S. Light Rapid Transit[J]. Traffic Engineering and Control,1977,18(11):532-537.
[12]Ceder A, Golany B, Tal O. Creating bus timetables with maximal synchronization[J]. Transportation Research,2001,35(10):913-928.
[13]Klemt W D, Stemme W. Schedule synchronization for public Transit networks[J]. OR Spectrum,1989,11(1):17-24.
[14]Desilets A, Rousseau J M. SYNCRO:A computer-assisted tool for the synchronization of transfers in public Transit networks[J]. Computer-aided Transit Scheduling. Proceedings, MO, 1990:153-166.
[15]Adamski A, Chmiel W. Optimal service synchronization in public transport[J]. Transportation Systems; 1997:1283-1287.
[16]Fleurent C, Lessard R, Seguin L. Transit timetable synchronization:Evaluation and optimization[J]. GIRO INC,2007:1-8.
[17]Guihaire V, HAO J-k. Improving timetable quality in scheduled Transit networks[J]. Trends in Applied Intelligent Systems,2010:21-30.
[18]卢曙光.韩、日城市轨道交通票款清分中心的经验与借鉴[J].都市快轨交通,2007,20(2)：22-24.
[19]Freling R, Wagelmans A M, Paixao J P. Models and algorithms for single-depot vehicle scheduling[J]. Transportation Science,2001,35(2):165-180.
[20]Pepin A S, Desaulniers G, Hertz A, et al. Comparison of heuristic approaches for the multiple depot vehicle scheduling problem [R]. Erasmus school of economics (ese),2006.
[21]Paixao J P, Branco I M. A quasi-assignment algorithm for bus scheduling[J], Networks, 1987,17(3):249-269.
[22]Bertsekas D P. Auction algorithms for network flow problems:A tutorial introduction[J]. Computational Optimization and Applications,1992,1(1):7-66.
[23]Bertsekas D P, Castanon D A. A forward/reverse auction algorithm for asymmetric assignment problems[J]. Computational Optimization and Applications,1992,1(3):277-297.
[24]Bodin L, Golden B. Classification in vehicle routing and scheduling[J]. Networks,1981,11(2): 97-108.
[25]Bertossi A A, Carraresi P, Gallo G. On some matching problems arising in vehicle scheduling models[J]. Networks,1987,17(3):271-281.
[26]Lobel A. Vehicle scheduling in public Transit and Lagrangean pricing[J]. Management Science,1998,44(12/1):1637-1649.
[27]Mesquita M, Paixao J. Exact algorithms for the multi-depot vehicle scheduling problem based on multicommodity network flow type formulations[J]. Lecture Notes in Economics and Mathematical System,1999:221-243.
[28]Banihashemi M, Haghani A. Optimization model for large-scale bus Transit scheduling problems[J]. Transportation Research Record:Journal of the TRA,2000,1733(1):23-30.
[29]Haghani 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 Practic,2002,36(4):309-333.
[30]Suhl U H, Friedrich S, Waue V. Progress in solving large scale multi-depot multi-vehicle-type bus scheduling problems with integer programming[J]. Wirtschaftinformatik Proceedings, 2007:429-445.
[31]Oukil 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.
[32]Ribeiro C C, Soumis F. A column Generation approach to the multiple-depot vehicle scheduling problem[J]. Operations Research,1994,42(1):41-52.
[33]Ceder A, Stern H I. Deficit function bus scheduling with deadheading trip insertions for fleet size reduction[J]. Transportation Science,1981,15(4):338-363.
[34]Lamatsch A. An approach to vehicle scheduling with depot capacity constraints [R]: Germany:Faw,1991.
[35]Hadjar A, Marcotte O, Soumis F. A branch-and-cut algorithm for the multiple depot vehicle scheduling problem[J]. Operations Research,2006,54(1):130-149.
[36]Dantzig G B, Ramser J H. The truck dispatching problem[J]. Management Science,1959,6(1): 80-91.
[37]Laporte G. The vehicle routing problem:An overview of exact and approximate algorithms[J]. European Journal of Operational Research,1992,59(3):345-358.
[39]Laporte G, Nobert Y, Taillefer S. Solving a family of multi-depot vehicle routing and location-routing problems[J]. Transportation Science,1988,22(3):161-172.
[40]Golden B, Assad A, Levy L, et al. The fleet size and mix vehicle routing problem[J]. Computers & Operations Research,1984,11(1):49-66.
[41]Toth P, Vigo D. Models, relaxations and exact approaches for the capacitated vehicle routing problem[J]. Discrete Applied Mathematics,2002,123(1):487-512.
[42]Desrochers M, Desrosiers J, Solomon M. A new optimization algorithm for the vehicle routing problem with time Windows[J]. Operations Research,1992,40(2):342-354.
[43]Gendreau M, Potvin J Y, Universite de Montreal Departement d'informatique et de recherche operationnelle, et al. Dynamic vehicle routing and dispatching[M]. Princeton:Citeseer,1997.
[44]Haghani A, Jung S. A dynamic vehicle routing problem with time-dependent travel times[J]. Computers & Operations Research,2005,32(11):2959-2986.
[45]Psaraftis H N. Dynamic vehicle routing:Status and prospects[J]. Annals of Operations Research,1995,61(1):143-164.
[46]Bertsimas D J, Van ryzin G. A stochastic and dynamic vehicle routing problem in the Euclidean plane[J]. Operations Research,1991,39(4):601-615.
[47]Psaraftis H N. Dynamic vehicle routing problems[J]. Vehicle Routing:Methods and Studies, 1988,16:223-248.
[48]Christofides N, Mingozzi A, Toth P. Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations[J]. Mathematical Programming,1981,20(1): 255-282.
[49]Gendreau M, Hertz A, Laporte G. A tabu search heuristic for the vehicle routing problem[J]. Management Science,1994,40(10):1276-1290.
[50]Taillard E, Badeau P, Gendreau M, et al. A tabu search heuristic for the vehicle routing problem with soft time Windows[J]. Transportation Science,1997,31(2):170-186.
[51]Bullnheimer B, Hartl R F, Strauss C. Applying the ant system to the vehicle routing problem[J]. Meta-heuristics:Advances and Trends in Local SEAR,1999:109-120.
[52]Bullnheimer B, Hartl R F, Strauss C. An improved ant System algorithm for thevehicle Routing Problem[J]. Annals of Operations Research,1999,89:319-328.
[53]Alfieri A, Groot R, Kroon L, et al. Efficient circulation of railway rolling stock[J]. Transportation Science,2006,40(3):378-391.
[54]Cordeau J F, Laporte G, Savelsbergh M P, et al. Vehicle routing[J]. Transportation,2007,14: 367-428.
[55]Cordeau J F, Gendreau M, Hertz A, et al. New heuristics for the vehicle routing problem[J]. Logistics Systems:Design and Optimization,2005:279-297.
[56]Cordeau J F, Stojkovic G, Soumis F, et al. Benders decomposition for simultaneous aircraft routing and crew scheduling[J]. Transportation Science,2001,35(4):375-388.
[57]Maroti G. Operations research models for railway rolling stock planning[D]. Eindhoven: Technische Universiteit Eindhoven,2006.
[58]Budai G, Maroti G, Dekker R, et al. Rescheduling in passenger railways:the rolling stock rebalancing problem[J]. Journal of Scheduling,2010,13(3):281-297.
[59]Cadarso L, Marin A. Robust rolling stock in rapid Transit networks[J]. Computers & Operations Research,2011,38(8):1131-1142.
[60]Maroti G, Kroon L G. Maintenance routing for train units:the transition model[J]. Cwi. Probability, Networks and Algorithms,2004(0415):1-20.
[61]Maroti G, Kroon L. Maintenance routing for train units:The interchange model[J]. Computers & Operations Research,2007,34(4):1121-1140.
[62]Penicka M, Strupchanska A, Bjorner D. Train maintenance routing [EB/OL] http://www2.imm.dtu.dk/-dibj/martin.pdf.
[63]Hani Y, Chehade H, Amodeo L, et al. Simulation based optimization of a train maintenance facility model using genetic algorithms[C]//service Systems and Service Management. Troyes: IEEE,2006:513-518.
[64]Hani Y, Amodeo L, Yalaoui F, et al. Simulation based optimization of a train maintenance facility[J]. Journal of Intelligent Manufacturing,2008,19(3):293-300.
[65]宋键.城市轨道交通的线路、网络、体系[J].城市轨道交通研究,2008,11(1)：1-5.
[66]毕湘利.城市轨道交通网络化阶段推进标准化建设的探讨[J].城市轨道交通研究,2010,13(7)：1-3.
[67]刘灿齐,周溪召.城市轨道交通网络及其建设顺序的规划[J].上海海运学院学报,1999,20(3)：29-34.
[68]高咏玲.城市轨道交通建设时机理论与方法研究[D].北京：北京交通大学,2008.
[69]胡俐先.城市轨道交通线网规模梯度机理分析及其模型研究[D].成都：西南交通大学,2008.
[70]李惠彬,蒲勇健.大城市发展进程中轨道交通网络运营收益平衡分析[J].西南大学学报(社会科学版),2009,35(2)：107-114.
[71]朱沪生.上海城市轨道交通网络化运营管理思考[J].现代城市轨道交通,2007(4)：10-13.
[72]王如路.上海轨道交通形成网络化运营的特点及对策初探[J].地下工程与隧道,2007(1)：6-10.
[73]汪波,陈德爱,杨杰.北京城市轨道交通网络化运营探讨[J].现代城市轨道交通,2010(4)：14-17.
[74]顾伟华.上海城市轨道交通网络建设与资源共享[J].城市轨道交通研究,2005,8(6)：15-19.
[75]王焱,杨超.上海市轫道交通网络的复杂网络特性研究[J].城市轨道交通研究,2009,12(2)：33-36,55.
[76]刘志谦,宋瑞.基于复杂网络理论的广州轨道交通网络可靠性研究[J].交通运输系统工程与信息,2010,10(5)：194-200.
[77]高洁,施其洲.城市轨道网络抗毁可靠性定义及评价指标模型研究[J].铁道学报,2007,29(3)：29-33.
[78]郭丽丽.环放结构城市轨道交通运输组织相关问题研究[D].成都：西南交通大学,2007.
[79]张一梅.基于路网的城市轨道交通系统运输能力研究[D].北京：北京交通大学,2009.
[80]罗钦.基于网络运营的城市轨道交通客流分布理论及仿真研究[D].上海：同济大学,2009.
[81]房霄虹.城市轨道交通网络化运输组织协调理论及方法研究[D].北京：北京交通大学,2010.
[82]周艳芳.城市轨道交通网络列车车底运行计划一体化编制理论与方法研究[D].北京：北京交通大学,2012.
[83]缪道平.城市轨道交通车体运用计划自动编制及优化研究[D].北京：北京交通大学,2009.
[84]孙焰,施其洲,赵源,孔庆瑜.城市轨道交通列车车底开行方案的确定[J].同济大学学报(自然科学版),2004,32(8)：1005-1008.
[85]徐瑞华,李侠,陈菁菁.市域快速轨道交通线路列车车底运行交路研究[J].城市轨道交通研究,2006,9(5)：36-39.
[86]张铭,徐瑞华.轨道交通网络列车车底衔接组织的递阶协调优化[J].系统工程,2007, 25(9)：33-37.
[87]宋键,徐瑞华,缪和平.市域快速轨道交通线开行快慢车问题的研究[J].城市轨道交通研究,2006,9(12)：23-27.
[88]徐瑞华,徐浩,宋键.城市交通列车车底共线运营的通过能力和延误[J].同济大学学报(自然科学版),2005,33(3)：301-305.
[89]李素莹,罗超,吴强.上海轨道交通4号线环线运营组织实践分析[J].城市轨道交通研究,2009,12(6)：52-55.
[90]田福生,吕红霞,李致宏.基于列车车底配置最优的地铁列车车底交路设计[J].铁道运输与经济,2006,28(1)：26-28.
[91]吴非,张岩.关于城市轨道交通列车车底编组合理性的探讨[J].都市快轨交通,2010,23(4)：46-48.
[92]曲思源,徐行方.城际铁路动车组运用计划模型[J].同济大学学报(自然科学版),2010,38(9)：1298-1302.
[93]聂磊,赵鹏,杨浩,胡安洲.高速铁路动车组运用的研究[J].铁道学报,2001,23(3)：1-7.
[94]史峰,周文梁,郁宇卫,卿力.客运专线动车组运用计划优化模型与算法[J].铁道学报,2011,33(1)：8-13.
[95]陈华群.动车组运用计划编制系统相关问题研究[D].成都：西南交通大学,2007.
[96]左大杰,王慈光.客运专线动车组列车车底重联运行相关问题探讨[J].铁道运输与经济,2009,31(7)：32-34.
[97]徐行方,徐瑞华.高速客运专线列车车底运行组织相关问题的研究[J].同济大学学报(自然科学版),2003,31(5)：572-575.
[98]秦胜,周磊山,乐逸祥.基于动态事件调度仿真的高速铁路动车组运用计划计算机协同编制方法的研究[J].物流技术,2012,31(2)：79-83,137.
[99]闫海峰,崔燚.编制机车周转图的优化模型[J].中国铁道科学,2006,27(4)：123-128.
[100]菅美英.基于MAS的列车车底编组计划与运行图的一体化优化方法研究[D].北京：北京交通大学,2006.
[101]李家平.基于MAS的城市轨道交通列车车底运行调整方法研究[D].北京：北京交通大学,2008.
[102]王世东,郑力,张智海,刘书成.编组站阶段计划自动编制的数学模型及算法[J].中国铁道科学,2008,29(2)：120-125.
[103]毛保华,王保山,徐彬,刘海东,陈建华,杜鹏.我国铁路列车车底运行计划集成编制方法研究[J].交通运输系统工程与信息,2009,9(2)：27-37.
[104]梁栋,林柏梁.铁路运输动态车流组织的策略优化模型研究[J].系统工程理论与实践,2007,27(1)：77-84,106.
[105]宋瑞,何世伟,杨永凯,罗康锦.公交时刻表设计与车辆运用综合优化模型[J].中国公路学报,2006,19(3)：70-76.
[106]王海星.公交车辆区域调度理论与方法研究——以电动车为背景[D].北京：北京交通大学,2007.
[107]刘志刚,申金升.区域公交时刻表及车辆调度双层规划模型[J].系统工程理论与实践,2007,27(11)：135-141.
[108]王大勇,臧学运,王海星.公交区域车辆调度优化研究现状与发展[J].北京交通大学学 报(自然科学版),2008,32(3)：42-45.
[109]张思伟.单车场多送货点车辆调度优化的一种改进禁忌算法[J].工业工程,2006,9(3)：55-58.
[110]宋远清,李永生,梁慎清,石小英.需求随机车辆调度问题的遗传算法研究[J].计算机技术与发展,2009,19(2)：230-233.
[111]杨智伟,赵骞,赵胜川.基于人工免疫算法的公交车辆调度优化问题研究[J].武汉理工大学学报(交通科学与工程版),2009,33(5)：1004-1007.
[112]汤旻安,任恩恩,赵春艳.遗传蚁群算法的公交车辆调度路线优化[J].微计算机信息,2009(031)：48-49.
[113]白子建,贺国光,赵淑芝,王敏.快速公交车辆调度优化的禁忌算法设计与实现[J].计算机工程与应用,2007,43(23)：229-232.
[114]刘小兰,郝志峰,汪国强,符克强.有时间窗的车辆路径问题的近似算法研究[J].计算机集成制造系统,2004,10(7)：825-831.
[115]张景玲,赵燕伟,王海燕,介婧,王万良.多车型动态需求车辆路径问题建模及优化[J].计算机集成制造系统,2010,16(3)：543-550.
[116]吕雄伟,赵达,李军.基于多态蚁群算法的多目标邮政物流车辆路径问题研究[J].计算机应用研究,2009,26(6)：2070-2073.
[117]徐杰,黄德先.基于混合粒子群算法的多目标车辆路径研究[J].计算机集成制造系统,2007,13(3)：573-579,58.
[118]Cadarso L, Marin A. Integration of timetable planning and rolling stock in rapid Transit networks[J]. Annals of Operations Research,2012,199(1):113-135.
[119]重庆市人民政府.重庆市城市快速轨道交通第二轮建设规划(2012～2020)[R].重庆：重庆市人民政府,2011.
[120]叶霞飞,李君,霍建平.国内外城市轨道交通车辆段对比研究[J].城市轨道交通研究,2003,6(1)：72-77.
[121]温清.关于地铁车辆检修制度[J].城市轨道交通研究,2004,7(4)：58-60.
[122]程祖国,王居宽,陈鞍龙,浦汉亮,余强.城市轨道交通车辆部件故障与均衡修修程周期[J].城市轨道交通研究,2006,9(1)：46-49.
[123]安琪,王建英.检修条件下动车组运用计划编制研究[J].铁道运输与经济,2012,34(3)：56-60.
[124]谢金贵,张仲阳,罗维.维修时间不确定的列车车底列车车底调度问题研究[J].铁道运输与经济,2008,30(4)：75-78.
[125]王忠凯,史天运,张惟皎,王辉.动车组运用计划和检修计划一体化编制模型及算法[J].中国铁道科学,2012,33(3)：102-108.
[126]张才春,花伟,陈建华.双修制下的动车组运用计划编制研究[J].铁道学报,2010,32(3)：16-19.
[127]王莹,刘军,苗建瑞.基于列生成算法的动车组检修计划优化[J].中国铁道科学,2010,31(2)：115-120.
[128]北市市规划委员会,中国城市规划设计研究院,清华大学建筑学院等.北京城市总体规划(2004年-2020年)[R].国务院,2005.
[129]中铁第四勘察设计院.北京市城市快速轨道交通近期建设规划(2007-2015)调整环境影响报告书[R].北京,2011.
[130]Giuliano G. Land use policy and transportation:why we won't get there from here[J]. Transportation Research Circular,1999,495:179-198.
[131]Zheng L, Ying J Q, Song R, Li T T. Relationship between Urban Structure and Railway System in Nagoya Metropolitan Area[J]. Procedia-Social and Behavioral Sciences,2012,43: 98-110.
[132]北京交通大学.大城市低碳客运交通系统评价指标体系技术研究[R],2011.
[133]茹祥辉,郭春安.奥运与北京城市轨道交通规划建设[J].城市交通,2008,6(3)：23-28.
[134]刘金玲,张勇.北京城铁13号线北段土地利用对客流影响的分析[J].城市交通,2004,2(2)：54-57.
[135]李建国.北京市优先发展公共交通的实践[J].上海城市发展,2008(3)：21-23.
[136]张铭,徐瑞华.轨道交通网络列车车底衔接组织的递阶协调优化[J].系统工程,2007,25(9)：33-37.
[137]四兵锋,毛保华,刘智丽.无缝换乘条件下城市轨道交通网络客流分配模型及算法[J].铁道学报,2008,29(6)：12-18.
[138]徐瑞华,张铭,江志彬.基于线网运营协调的城市轨道交通首末班列车车底发车时间域研究[J].铁道学报,2008,30(2)：7-11.
[139]王志国.中国铁路运力资源配置研究[D].北京：北京交通大学,2007.
[140]王保华.综合运输体系下快捷货物运输网络资源配置优化研究[D].北京：北京交通大学,2010.
[141]Caprara A, Kroon L, Monaci M, Peeters M, Toth P. Passenger railway optimization[J]. Handbooks in Operations Research and Management Science,2007,14:129-187.
[142]杨浩.铁路运输组织学(第三版)[M].北京：中国铁道出版社,2011.
[143]Huisman D, Freling R, Wagelmans A M. A robust solution approach to the dynamic vehicle scheduling problem[J]. Transportation Science,2004,38(4):447-458.
[144]Moudani W E, Mora-camino F. A dynamic approach for aircraft assignment and maintenance scheduling by airlines[J]. Journal of Air Transport Management,2000,6(4):233-237.
[145]Berge M E, Hopperstad C A, Haraldsdottir A. Airline schedule recovery in collaborative flow management with airport and airspace capacity constraints[C]//5th US/Europe Air Traffic Management R&D Seminar. Budapset,2003,23-27.
[146]徐瑞华;马兴峰,宋键.上海轨道交通明珠线共线运营方案[J].同济大学学报：自然科学版,2003,31(6)：682-686.
[147]梁广深.建设节约型地铁车辆段初探[J].都市快轨交通,2009,22(006)：14-17.
[148]Sato K, Fukumura N. Real-time freight locomotive rescheduling and uncovered train detection during disruption[J]. European Journal of Operational Research,2012,221(3):636-648.
[149]王凌.智能优化算法及其应用[M].北京：清华大学出版社,2001.
[150]郑宗汉,郑晓明.算法设计与分析[M].北京：清华大学出版社,2005.
[151]黄友锐.智能优化算法及其应用[M].北京：国防工业出版社,2008.
[152]Currie R H, Salhi S. A tabu search heuristic for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows [J]. Journal of Mathematical Modelling and Algorithms,2004,3(3):225-243.
[153]刑文训,谢金星.现代优化计算方法[M].北京：清华大学出版社,2005.
[154]贺一.禁忌搜索及其并行化研究[D].成都：西南大学,2006.
[155]U Bilge, F Kirac, M Kurtulan, P Pekgfln. A tabu search algorithm for parallel machine total tardiness problem [J]. Computers & Operations Research,2004,31(3):397-414.
[156]Gendreau M, Guertin F, Potvin J Y, Eric Taillard. Parallel tabu search for real-time vehicle routing and dispatching [J]. Transportation Science,1999,33(2):381-390.
[157]杨元峰,崔志明,陈建明.有时间窗约束的多车场车辆路径问题的改进遗传算法[J].苏州大学学报：工科版,2006,26(2)：20-23.
[158]Tan K C, Lee L H, Zhu Q.L, Ou K. Heuristic methods for vehicle routing problem with time windows[J]. Artificial Intelligence in Engineering,2001,15(3):281-295.
[159]李妍峰.时变网络环境下车辆调度问题研究[D].成都：西南交通大学,2008.
[160]陈宝文,宋申民,陈兴林.基于混合算法的带时间窗车辆路径问题[J].控制理论与应用,2007,24(5)：807-810.
[161]石磊.基于大规模邻域搜索的车辆调度快速算法研究[D].上海：上海交通大学,2007.
[162]钱晓龙,唐立新,刘文新.动态调度的研究方法综述[J].控制与决策,2001,16(2)：141-145.
[163]陈菁菁.城市轨道交通重大运营事故和灾害分析[J].城市轨道交通研究,2010,13(5)：41-45.
[164]刘浩江.城市轨道交通运营安全及故障浅析[J].上海铁道科技,2007(5)：39-42.
[165]江志彬.城市轨道交通列车车底运行延误调整的仿真算法研究[C]//2005年全国博士生学术论坛——交通运输工程学科论文集,2005,119-125.
[166]王旭坪,牛君,胡祥培,许传磊.车辆路径问题的受扰救援策略[J].系统工程理论与实践,2007,12(1)：104-110.
[167]郑锂,宋瑞,何世伟,李婷婷.突发客流情况下的公交系统运营管理机制研究[J].物流技术,2012,30(11)：61-64.
[168]胡祥培,丁秋雷,张漪,王旭坪.干扰管理研究评述[J].管理科学,2007,20(2)：2-8.
[169]凌松涛,刘纪俭.地铁列车车底救援路径的灵活选择探讨[EB/OL].http://www.sz-mtr.com/yyManager/vcone.action?cid=508
[170]王英龙.哈尔滨地铁列车车底救援事故处理方案探寻[J].交通企业管理,2012,27(6)：68-70.
[171]杜鹏,张增勇,毛保华.城际轨道交通列车车底故障救援模式的探讨[J].城市轨道交通研究,2011,14(3)：75-78.
[172]殷峻.上海轨道交通共线运营非正常事件处置对策初探[J].城市轨道交通研究,2005,8(6)：20-22.
[173]陆万忠.城市轨道交通车辆检修制度研究[D].北京：北京交通大学,2007.
[174]冷庆君.城市轨道交通车辆检修模式及建议[J].机车电传动,2011,1：57-58.
[175]中铁第一勘察设计院.重庆市轨道交通六号线一期工程可行性研究报告[R].重庆,2006.
[176]中铁第二勘察设计院,重庆市轨道交通设计研究院有限责任公司.重庆市轨道交通五号线一期工程(园博园至石龙)可行性研究报告[R].重庆,2012.
[177]北京城建设计研究院.北京市地下铁道五号线工程可行性研究报告[R].北京,2001.
[178]吴东华,夏洪山,徐波.飞机排班问题的模糊优选动态规划模型[J].济南大学学报：自然科学版,2012,26(1)：20-26.
[179]Cordeau J F, Gendreau M, Laporte G. A tabu search heuristic for periodic and multi-depot vehicle routing problems[J]. Networks,1997,30(2):105-119.
[2]维基百科.世界城市轨道交通列表[EB/OL]. http://zh.wikipedia.org/wiki/世界城市轨道交通列表.
[3]维基百科.中国城市轨道交通[EB/OL]. http://zh.wikipedia.org/wiki/中国城市轨道交通.
[4]张铭.城市轨道交通网络运营计划协调优化研究[D].上海：同济大学,2008.
[5]北京市基础设施投资有限公司.首都轨道交通网络化运营管理模式创新与实践[EB/OL].http://www.chinametro.net/Content/DisplayArticle.aspx?ID=3698.
[6]罗铭. “北京城市轨道交通网络化运营研究”课题结题[EB/OL].http://www.bsdc.net.cn/v/showNews.jsp?NewsID=61202.
[7]俞展猷,李照星.纽约、伦敦、巴黎、莫斯科、东京五大城市轨道交通的网络化建设[J].现代城市轨道交通,2009(1)：55-59.
[8]Vuchic V R. Urban Transit[M]. New YORK:JOHN wiley & SONS INC,2005.
[9]马丹.论马克思资源配置理论及其指导意义[J].经济师,2007(7)：30-31.
[10]Topp H H. Innovations in tram and light rail systems[J]. PROC Institution of Mechanical Engineers Part F:J,123(3):133-141.
[11]Hellewell S. Light Rapid Transit[J]. Traffic Engineering and Control,1977,18(11):532-537.
[12]Ceder A, Golany B, Tal O. Creating bus timetables with maximal synchronization[J]. Transportation Research,2001,35(10):913-928.
[13]Klemt W D, Stemme W. Schedule synchronization for public Transit networks[J]. OR Spectrum,1989,11(1):17-24.
[14]Desilets A, Rousseau J M. SYNCRO:A computer-assisted tool for the synchronization of transfers in public Transit networks[J]. Computer-aided Transit Scheduling. Proceedings, MO, 1990:153-166.
[15]Adamski A, Chmiel W. Optimal service synchronization in public transport[J]. Transportation Systems; 1997:1283-1287.
[16]Fleurent C, Lessard R, Seguin L. Transit timetable synchronization:Evaluation and optimization[J]. GIRO INC,2007:1-8.
[17]Guihaire V, HAO J-k. Improving timetable quality in scheduled Transit networks[J]. Trends in Applied Intelligent Systems,2010:21-30.
[18]卢曙光.韩、日城市轨道交通票款清分中心的经验与借鉴[J].都市快轨交通,2007,20(2)：22-24.
[19]Freling R, Wagelmans A M, Paixao J P. Models and algorithms for single-depot vehicle scheduling[J]. Transportation Science,2001,35(2):165-180.
[20]Pepin A S, Desaulniers G, Hertz A, et al. Comparison of heuristic approaches for the multiple depot vehicle scheduling problem [R]. Erasmus school of economics (ese),2006.
[21]Paixao J P, Branco I M. A quasi-assignment algorithm for bus scheduling[J], Networks, 1987,17(3):249-269.
[22]Bertsekas D P. Auction algorithms for network flow problems:A tutorial introduction[J]. Computational Optimization and Applications,1992,1(1):7-66.
[23]Bertsekas D P, Castanon D A. A forward/reverse auction algorithm for asymmetric assignment problems[J]. Computational Optimization and Applications,1992,1(3):277-297.
[24]Bodin L, Golden B. Classification in vehicle routing and scheduling[J]. Networks,1981,11(2): 97-108.
[25]Bertossi A A, Carraresi P, Gallo G. On some matching problems arising in vehicle scheduling models[J]. Networks,1987,17(3):271-281.
[26]Lobel A. Vehicle scheduling in public Transit and Lagrangean pricing[J]. Management Science,1998,44(12/1):1637-1649.
[27]Mesquita M, Paixao J. Exact algorithms for the multi-depot vehicle scheduling problem based on multicommodity network flow type formulations[J]. Lecture Notes in Economics and Mathematical System,1999:221-243.
[28]Banihashemi M, Haghani A. Optimization model for large-scale bus Transit scheduling problems[J]. Transportation Research Record:Journal of the TRA,2000,1733(1):23-30.
[29]Haghani 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 Practic,2002,36(4):309-333.
[30]Suhl U H, Friedrich S, Waue V. Progress in solving large scale multi-depot multi-vehicle-type bus scheduling problems with integer programming[J]. Wirtschaftinformatik Proceedings, 2007:429-445.
[31]Oukil 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.
[32]Ribeiro C C, Soumis F. A column Generation approach to the multiple-depot vehicle scheduling problem[J]. Operations Research,1994,42(1):41-52.
[33]Ceder A, Stern H I. Deficit function bus scheduling with deadheading trip insertions for fleet size reduction[J]. Transportation Science,1981,15(4):338-363.
[34]Lamatsch A. An approach to vehicle scheduling with depot capacity constraints [R]: Germany:Faw,1991.
[35]Hadjar A, Marcotte O, Soumis F. A branch-and-cut algorithm for the multiple depot vehicle scheduling problem[J]. Operations Research,2006,54(1):130-149.
[36]Dantzig G B, Ramser J H. The truck dispatching problem[J]. Management Science,1959,6(1): 80-91.
[37]Laporte G. The vehicle routing problem:An overview of exact and approximate algorithms[J]. European Journal of Operational Research,1992,59(3):345-358.
[39]Laporte G, Nobert Y, Taillefer S. Solving a family of multi-depot vehicle routing and location-routing problems[J]. Transportation Science,1988,22(3):161-172.
[40]Golden B, Assad A, Levy L, et al. The fleet size and mix vehicle routing problem[J]. Computers & Operations Research,1984,11(1):49-66.
[41]Toth P, Vigo D. Models, relaxations and exact approaches for the capacitated vehicle routing problem[J]. Discrete Applied Mathematics,2002,123(1):487-512.
[42]Desrochers M, Desrosiers J, Solomon M. A new optimization algorithm for the vehicle routing problem with time Windows[J]. Operations Research,1992,40(2):342-354.
[43]Gendreau M, Potvin J Y, Universite de Montreal Departement d'informatique et de recherche operationnelle, et al. Dynamic vehicle routing and dispatching[M]. Princeton:Citeseer,1997.
[44]Haghani A, Jung S. A dynamic vehicle routing problem with time-dependent travel times[J]. Computers & Operations Research,2005,32(11):2959-2986.
[45]Psaraftis H N. Dynamic vehicle routing:Status and prospects[J]. Annals of Operations Research,1995,61(1):143-164.
[46]Bertsimas D J, Van ryzin G. A stochastic and dynamic vehicle routing problem in the Euclidean plane[J]. Operations Research,1991,39(4):601-615.
[47]Psaraftis H N. Dynamic vehicle routing problems[J]. Vehicle Routing:Methods and Studies, 1988,16:223-248.
[48]Christofides N, Mingozzi A, Toth P. Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations[J]. Mathematical Programming,1981,20(1): 255-282.
[49]Gendreau M, Hertz A, Laporte G. A tabu search heuristic for the vehicle routing problem[J]. Management Science,1994,40(10):1276-1290.
[50]Taillard E, Badeau P, Gendreau M, et al. A tabu search heuristic for the vehicle routing problem with soft time Windows[J]. Transportation Science,1997,31(2):170-186.
[51]Bullnheimer B, Hartl R F, Strauss C. Applying the ant system to the vehicle routing problem[J]. Meta-heuristics:Advances and Trends in Local SEAR,1999:109-120.
[52]Bullnheimer B, Hartl R F, Strauss C. An improved ant System algorithm for thevehicle Routing Problem[J]. Annals of Operations Research,1999,89:319-328.
[53]Alfieri A, Groot R, Kroon L, et al. Efficient circulation of railway rolling stock[J]. Transportation Science,2006,40(3):378-391.
[54]Cordeau J F, Laporte G, Savelsbergh M P, et al. Vehicle routing[J]. Transportation,2007,14: 367-428.
[55]Cordeau J F, Gendreau M, Hertz A, et al. New heuristics for the vehicle routing problem[J]. Logistics Systems:Design and Optimization,2005:279-297.
[56]Cordeau J F, Stojkovic G, Soumis F, et al. Benders decomposition for simultaneous aircraft routing and crew scheduling[J]. Transportation Science,2001,35(4):375-388.
[57]Maroti G. Operations research models for railway rolling stock planning[D]. Eindhoven: Technische Universiteit Eindhoven,2006.
[58]Budai G, Maroti G, Dekker R, et al. Rescheduling in passenger railways:the rolling stock rebalancing problem[J]. Journal of Scheduling,2010,13(3):281-297.
[59]Cadarso L, Marin A. Robust rolling stock in rapid Transit networks[J]. Computers & Operations Research,2011,38(8):1131-1142.
[60]Maroti G, Kroon L G. Maintenance routing for train units:the transition model[J]. Cwi. Probability, Networks and Algorithms,2004(0415):1-20.
[61]Maroti G, Kroon L. Maintenance routing for train units:The interchange model[J]. Computers & Operations Research,2007,34(4):1121-1140.
[62]Penicka M, Strupchanska A, Bjorner D. Train maintenance routing [EB/OL] http://www2.imm.dtu.dk/-dibj/martin.pdf.
[63]Hani Y, Chehade H, Amodeo L, et al. Simulation based optimization of a train maintenance facility model using genetic algorithms[C]//service Systems and Service Management. Troyes: IEEE,2006:513-518.
[64]Hani Y, Amodeo L, Yalaoui F, et al. Simulation based optimization of a train maintenance facility[J]. Journal of Intelligent Manufacturing,2008,19(3):293-300.
[65]宋键.城市轨道交通的线路、网络、体系[J].城市轨道交通研究,2008,11(1)：1-5.
[66]毕湘利.城市轨道交通网络化阶段推进标准化建设的探讨[J].城市轨道交通研究,2010,13(7)：1-3.
[67]刘灿齐,周溪召.城市轨道交通网络及其建设顺序的规划[J].上海海运学院学报,1999,20(3)：29-34.
[68]高咏玲.城市轨道交通建设时机理论与方法研究[D].北京：北京交通大学,2008.
[69]胡俐先.城市轨道交通线网规模梯度机理分析及其模型研究[D].成都：西南交通大学,2008.
[70]李惠彬,蒲勇健.大城市发展进程中轨道交通网络运营收益平衡分析[J].西南大学学报(社会科学版),2009,35(2)：107-114.
[71]朱沪生.上海城市轨道交通网络化运营管理思考[J].现代城市轨道交通,2007(4)：10-13.
[72]王如路.上海轨道交通形成网络化运营的特点及对策初探[J].地下工程与隧道,2007(1)：6-10.
[73]汪波,陈德爱,杨杰.北京城市轨道交通网络化运营探讨[J].现代城市轨道交通,2010(4)：14-17.
[74]顾伟华.上海城市轨道交通网络建设与资源共享[J].城市轨道交通研究,2005,8(6)：15-19.
[75]王焱,杨超.上海市轫道交通网络的复杂网络特性研究[J].城市轨道交通研究,2009,12(2)：33-36,55.
[76]刘志谦,宋瑞.基于复杂网络理论的广州轨道交通网络可靠性研究[J].交通运输系统工程与信息,2010,10(5)：194-200.
[77]高洁,施其洲.城市轨道网络抗毁可靠性定义及评价指标模型研究[J].铁道学报,2007,29(3)：29-33.
[78]郭丽丽.环放结构城市轨道交通运输组织相关问题研究[D].成都：西南交通大学,2007.
[79]张一梅.基于路网的城市轨道交通系统运输能力研究[D].北京：北京交通大学,2009.
[80]罗钦.基于网络运营的城市轨道交通客流分布理论及仿真研究[D].上海：同济大学,2009.
[81]房霄虹.城市轨道交通网络化运输组织协调理论及方法研究[D].北京：北京交通大学,2010.
[82]周艳芳.城市轨道交通网络列车车底运行计划一体化编制理论与方法研究[D].北京：北京交通大学,2012.
[83]缪道平.城市轨道交通车体运用计划自动编制及优化研究[D].北京：北京交通大学,2009.
[84]孙焰,施其洲,赵源,孔庆瑜.城市轨道交通列车车底开行方案的确定[J].同济大学学报(自然科学版),2004,32(8)：1005-1008.
[85]徐瑞华,李侠,陈菁菁.市域快速轨道交通线路列车车底运行交路研究[J].城市轨道交通研究,2006,9(5)：36-39.
[86]张铭,徐瑞华.轨道交通网络列车车底衔接组织的递阶协调优化[J].系统工程,2007, 25(9)：33-37.
[87]宋键,徐瑞华,缪和平.市域快速轨道交通线开行快慢车问题的研究[J].城市轨道交通研究,2006,9(12)：23-27.
[88]徐瑞华,徐浩,宋键.城市交通列车车底共线运营的通过能力和延误[J].同济大学学报(自然科学版),2005,33(3)：301-305.
[89]李素莹,罗超,吴强.上海轨道交通4号线环线运营组织实践分析[J].城市轨道交通研究,2009,12(6)：52-55.
[90]田福生,吕红霞,李致宏.基于列车车底配置最优的地铁列车车底交路设计[J].铁道运输与经济,2006,28(1)：26-28.
[91]吴非,张岩.关于城市轨道交通列车车底编组合理性的探讨[J].都市快轨交通,2010,23(4)：46-48.
[92]曲思源,徐行方.城际铁路动车组运用计划模型[J].同济大学学报(自然科学版),2010,38(9)：1298-1302.
[93]聂磊,赵鹏,杨浩,胡安洲.高速铁路动车组运用的研究[J].铁道学报,2001,23(3)：1-7.
[94]史峰,周文梁,郁宇卫,卿力.客运专线动车组运用计划优化模型与算法[J].铁道学报,2011,33(1)：8-13.
[95]陈华群.动车组运用计划编制系统相关问题研究[D].成都：西南交通大学,2007.
[96]左大杰,王慈光.客运专线动车组列车车底重联运行相关问题探讨[J].铁道运输与经济,2009,31(7)：32-34.
[97]徐行方,徐瑞华.高速客运专线列车车底运行组织相关问题的研究[J].同济大学学报(自然科学版),2003,31(5)：572-575.
[98]秦胜,周磊山,乐逸祥.基于动态事件调度仿真的高速铁路动车组运用计划计算机协同编制方法的研究[J].物流技术,2012,31(2)：79-83,137.
[99]闫海峰,崔燚.编制机车周转图的优化模型[J].中国铁道科学,2006,27(4)：123-128.
[100]菅美英.基于MAS的列车车底编组计划与运行图的一体化优化方法研究[D].北京：北京交通大学,2006.
[101]李家平.基于MAS的城市轨道交通列车车底运行调整方法研究[D].北京：北京交通大学,2008.
[102]王世东,郑力,张智海,刘书成.编组站阶段计划自动编制的数学模型及算法[J].中国铁道科学,2008,29(2)：120-125.
[103]毛保华,王保山,徐彬,刘海东,陈建华,杜鹏.我国铁路列车车底运行计划集成编制方法研究[J].交通运输系统工程与信息,2009,9(2)：27-37.
[104]梁栋,林柏梁.铁路运输动态车流组织的策略优化模型研究[J].系统工程理论与实践,2007,27(1)：77-84,106.
[105]宋瑞,何世伟,杨永凯,罗康锦.公交时刻表设计与车辆运用综合优化模型[J].中国公路学报,2006,19(3)：70-76.
[106]王海星.公交车辆区域调度理论与方法研究——以电动车为背景[D].北京：北京交通大学,2007.
[107]刘志刚,申金升.区域公交时刻表及车辆调度双层规划模型[J].系统工程理论与实践,2007,27(11)：135-141.
[108]王大勇,臧学运,王海星.公交区域车辆调度优化研究现状与发展[J].北京交通大学学 报(自然科学版),2008,32(3)：42-45.
[109]张思伟.单车场多送货点车辆调度优化的一种改进禁忌算法[J].工业工程,2006,9(3)：55-58.
[110]宋远清,李永生,梁慎清,石小英.需求随机车辆调度问题的遗传算法研究[J].计算机技术与发展,2009,19(2)：230-233.
[111]杨智伟,赵骞,赵胜川.基于人工免疫算法的公交车辆调度优化问题研究[J].武汉理工大学学报(交通科学与工程版),2009,33(5)：1004-1007.
[112]汤旻安,任恩恩,赵春艳.遗传蚁群算法的公交车辆调度路线优化[J].微计算机信息,2009(031)：48-49.
[113]白子建,贺国光,赵淑芝,王敏.快速公交车辆调度优化的禁忌算法设计与实现[J].计算机工程与应用,2007,43(23)：229-232.
[114]刘小兰,郝志峰,汪国强,符克强.有时间窗的车辆路径问题的近似算法研究[J].计算机集成制造系统,2004,10(7)：825-831.
[115]张景玲,赵燕伟,王海燕,介婧,王万良.多车型动态需求车辆路径问题建模及优化[J].计算机集成制造系统,2010,16(3)：543-550.
[116]吕雄伟,赵达,李军.基于多态蚁群算法的多目标邮政物流车辆路径问题研究[J].计算机应用研究,2009,26(6)：2070-2073.
[117]徐杰,黄德先.基于混合粒子群算法的多目标车辆路径研究[J].计算机集成制造系统,2007,13(3)：573-579,58.
[118]Cadarso L, Marin A. Integration of timetable planning and rolling stock in rapid Transit networks[J]. Annals of Operations Research,2012,199(1):113-135.
[119]重庆市人民政府.重庆市城市快速轨道交通第二轮建设规划(2012～2020)[R].重庆：重庆市人民政府,2011.
[120]叶霞飞,李君,霍建平.国内外城市轨道交通车辆段对比研究[J].城市轨道交通研究,2003,6(1)：72-77.
[121]温清.关于地铁车辆检修制度[J].城市轨道交通研究,2004,7(4)：58-60.
[122]程祖国,王居宽,陈鞍龙,浦汉亮,余强.城市轨道交通车辆部件故障与均衡修修程周期[J].城市轨道交通研究,2006,9(1)：46-49.
[123]安琪,王建英.检修条件下动车组运用计划编制研究[J].铁道运输与经济,2012,34(3)：56-60.
[124]谢金贵,张仲阳,罗维.维修时间不确定的列车车底列车车底调度问题研究[J].铁道运输与经济,2008,30(4)：75-78.
[125]王忠凯,史天运,张惟皎,王辉.动车组运用计划和检修计划一体化编制模型及算法[J].中国铁道科学,2012,33(3)：102-108.
[126]张才春,花伟,陈建华.双修制下的动车组运用计划编制研究[J].铁道学报,2010,32(3)：16-19.
[127]王莹,刘军,苗建瑞.基于列生成算法的动车组检修计划优化[J].中国铁道科学,2010,31(2)：115-120.
[128]北市市规划委员会,中国城市规划设计研究院,清华大学建筑学院等.北京城市总体规划(2004年-2020年)[R].国务院,2005.
[129]中铁第四勘察设计院.北京市城市快速轨道交通近期建设规划(2007-2015)调整环境影响报告书[R].北京,2011.
[130]Giuliano G. Land use policy and transportation:why we won't get there from here[J]. Transportation Research Circular,1999,495:179-198.
[131]Zheng L, Ying J Q, Song R, Li T T. Relationship between Urban Structure and Railway System in Nagoya Metropolitan Area[J]. Procedia-Social and Behavioral Sciences,2012,43: 98-110.
[132]北京交通大学.大城市低碳客运交通系统评价指标体系技术研究[R],2011.
[133]茹祥辉,郭春安.奥运与北京城市轨道交通规划建设[J].城市交通,2008,6(3)：23-28.
[134]刘金玲,张勇.北京城铁13号线北段土地利用对客流影响的分析[J].城市交通,2004,2(2)：54-57.
[135]李建国.北京市优先发展公共交通的实践[J].上海城市发展,2008(3)：21-23.
[136]张铭,徐瑞华.轨道交通网络列车车底衔接组织的递阶协调优化[J].系统工程,2007,25(9)：33-37.
[137]四兵锋,毛保华,刘智丽.无缝换乘条件下城市轨道交通网络客流分配模型及算法[J].铁道学报,2008,29(6)：12-18.
[138]徐瑞华,张铭,江志彬.基于线网运营协调的城市轨道交通首末班列车车底发车时间域研究[J].铁道学报,2008,30(2)：7-11.
[139]王志国.中国铁路运力资源配置研究[D].北京：北京交通大学,2007.
[140]王保华.综合运输体系下快捷货物运输网络资源配置优化研究[D].北京：北京交通大学,2010.
[141]Caprara A, Kroon L, Monaci M, Peeters M, Toth P. Passenger railway optimization[J]. Handbooks in Operations Research and Management Science,2007,14:129-187.
[142]杨浩.铁路运输组织学(第三版)[M].北京：中国铁道出版社,2011.
[143]Huisman D, Freling R, Wagelmans A M. A robust solution approach to the dynamic vehicle scheduling problem[J]. Transportation Science,2004,38(4):447-458.
[144]Moudani W E, Mora-camino F. A dynamic approach for aircraft assignment and maintenance scheduling by airlines[J]. Journal of Air Transport Management,2000,6(4):233-237.
[145]Berge M E, Hopperstad C A, Haraldsdottir A. Airline schedule recovery in collaborative flow management with airport and airspace capacity constraints[C]//5th US/Europe Air Traffic Management R&D Seminar. Budapset,2003,23-27.
[146]徐瑞华;马兴峰,宋键.上海轨道交通明珠线共线运营方案[J].同济大学学报：自然科学版,2003,31(6)：682-686.
[147]梁广深.建设节约型地铁车辆段初探[J].都市快轨交通,2009,22(006)：14-17.
[148]Sato K, Fukumura N. Real-time freight locomotive rescheduling and uncovered train detection during disruption[J]. European Journal of Operational Research,2012,221(3):636-648.
[149]王凌.智能优化算法及其应用[M].北京：清华大学出版社,2001.
[150]郑宗汉,郑晓明.算法设计与分析[M].北京：清华大学出版社,2005.
[151]黄友锐.智能优化算法及其应用[M].北京：国防工业出版社,2008.
[152]Currie R H, Salhi S. A tabu search heuristic for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows [J]. Journal of Mathematical Modelling and Algorithms,2004,3(3):225-243.
[153]刑文训,谢金星.现代优化计算方法[M].北京：清华大学出版社,2005.
[154]贺一.禁忌搜索及其并行化研究[D].成都：西南大学,2006.
[155]U Bilge, F Kirac, M Kurtulan, P Pekgfln. A tabu search algorithm for parallel machine total tardiness problem [J]. Computers & Operations Research,2004,31(3):397-414.
[156]Gendreau M, Guertin F, Potvin J Y, Eric Taillard. Parallel tabu search for real-time vehicle routing and dispatching [J]. Transportation Science,1999,33(2):381-390.
[157]杨元峰,崔志明,陈建明.有时间窗约束的多车场车辆路径问题的改进遗传算法[J].苏州大学学报：工科版,2006,26(2)：20-23.
[158]Tan K C, Lee L H, Zhu Q.L, Ou K. Heuristic methods for vehicle routing problem with time windows[J]. Artificial Intelligence in Engineering,2001,15(3):281-295.
[159]李妍峰.时变网络环境下车辆调度问题研究[D].成都：西南交通大学,2008.
[160]陈宝文,宋申民,陈兴林.基于混合算法的带时间窗车辆路径问题[J].控制理论与应用,2007,24(5)：807-810.
[161]石磊.基于大规模邻域搜索的车辆调度快速算法研究[D].上海：上海交通大学,2007.
[162]钱晓龙,唐立新,刘文新.动态调度的研究方法综述[J].控制与决策,2001,16(2)：141-145.
[163]陈菁菁.城市轨道交通重大运营事故和灾害分析[J].城市轨道交通研究,2010,13(5)：41-45.
[164]刘浩江.城市轨道交通运营安全及故障浅析[J].上海铁道科技,2007(5)：39-42.
[165]江志彬.城市轨道交通列车车底运行延误调整的仿真算法研究[C]//2005年全国博士生学术论坛——交通运输工程学科论文集,2005,119-125.
[166]王旭坪,牛君,胡祥培,许传磊.车辆路径问题的受扰救援策略[J].系统工程理论与实践,2007,12(1)：104-110.
[167]郑锂,宋瑞,何世伟,李婷婷.突发客流情况下的公交系统运营管理机制研究[J].物流技术,2012,30(11)：61-64.
[168]胡祥培,丁秋雷,张漪,王旭坪.干扰管理研究评述[J].管理科学,2007,20(2)：2-8.
[169]凌松涛,刘纪俭.地铁列车车底救援路径的灵活选择探讨[EB/OL].http://www.sz-mtr.com/yyManager/vcone.action?cid=508
[170]王英龙.哈尔滨地铁列车车底救援事故处理方案探寻[J].交通企业管理,2012,27(6)：68-70.
[171]杜鹏,张增勇,毛保华.城际轨道交通列车车底故障救援模式的探讨[J].城市轨道交通研究,2011,14(3)：75-78.
[172]殷峻.上海轨道交通共线运营非正常事件处置对策初探[J].城市轨道交通研究,2005,8(6)：20-22.
[173]陆万忠.城市轨道交通车辆检修制度研究[D].北京：北京交通大学,2007.
[174]冷庆君.城市轨道交通车辆检修模式及建议[J].机车电传动,2011,1：57-58.
[175]中铁第一勘察设计院.重庆市轨道交通六号线一期工程可行性研究报告[R].重庆,2006.
[176]中铁第二勘察设计院,重庆市轨道交通设计研究院有限责任公司.重庆市轨道交通五号线一期工程(园博园至石龙)可行性研究报告[R].重庆,2012.
[177]北京城建设计研究院.北京市地下铁道五号线工程可行性研究报告[R].北京,2001.
[178]吴东华,夏洪山,徐波.飞机排班问题的模糊优选动态规划模型[J].济南大学学报：自然科学版,2012,26(1)：20-26.
[179]Cordeau J F, Gendreau M, Laporte G. A tabu search heuristic for periodic and multi-depot vehicle routing problems[J]. Networks,1997,30(2):105-119.