城市轨道交通列车运行图编制理论与方法研究
|
摘要
列车运行图是轨道交通运输工作的生产计划,其编制质量的高低直接影响运输组织的效率和安全。与国有铁路列车运行图的编制相比,城市轨道交通运行图的编制具有其自身的复杂性。近年来,我国城市轨道交通网络大规模建设,上海、北京、广州等城市已逐步进入网络化运营阶段,在城市轨道交通网络建设过程中,部分线路的结构形式和客流特征也变得越来越复杂,列车运行交路从单一交路模式逐步发展为复杂交路模式,为运行图的编制工作带来了新的挑战。
本文充分借鉴和参考以往的研究成果,综合运用轨道交通运输组织、最优化理论、系统工程等学科的相关理论,对城市轨道交通运行图编制相关问题进行了深入研究。本文的研究内容主要包括以下几个方面：
(1)分析了城市轨道交通列车运行图的特征、要素、编制数据以及编制原则等相关基础理论,为运行图编制模型的构建奠下了基础；
(2)对多目标优化方法、禁忌搜索算法以及大系统优化方法等优化理论和方法进行了归纳和总结,为运行图编制模型的求解奠下了基础；
(3)行车计划是编制列车运行图的基础资料,是城市轨道交通运输组织的基础。大小交路模式列车开行方案规定各时间段内各交路上开行列车对数。以最小化乘客出行成本和企业运营成本为优化目标,以乘客需求、线路通过能力为约束,构建了关于大小交路模式行车计划优化编制的双目标混合整数非线性模型,采用理想点法将以上模型转化为单目标模型；大小交路模式下乘客出行成本的计算是构建模型的难点,从乘客在途时间成本和等待时间成本两方面,细致地分析了大小交路模式下乘客出行成本的计算方法；对折返站的选取、小交路区段客流比重作了灵敏度分析,得出了折返站对成本的影响趋势,以及小交路区段客流比重对列车开行对数、大小交路列车开行比例以及企业运营成本的影响趋势。
(4)共线交路列车运行图编制的实质是处理各子交路上列车与车站、列车与区间、列车与列车、以及共线区段不同交路上列车与列车之间的关系。对共线交路相关概念进行定义,深入分析了共线交路模式下列车运行图编制的关键问题,主要包括行车间隔、折返模式、折返站间隔时间、车底运用方式以及车底出入库方式；以列车发车间隔的分时段均衡性为优化目标构建了列车始发布点方案编制模型,在此基础上,以车底接续总时间最小为下层目标,以列车始发时刻与列车始发布点方案的偏差最小为上层目标,构建了关于共线交路列车运行图编制的双层规划模型,实现了列车运行图与车底交路计划的一体化编制。针对问题的特点,设计了一种递阶优化的方法,对优化目标进行分解,逐层缩小搜索空间,降低求解规模,主要包括：①生成列车停站时间算法；②车底交路计划编制算法；③基于禁忌搜索算法确定列车运行顺序；④基于列车运行顺序编制列车运行图。
(5)列车运行衔接协调是城市轨道交通网络化运输组织的重要内容。降低乘客换乘等待时间是轨道交通网络列车运行衔接协调的重要目标。分析了换乘等待时间的表示方法；针对城市轨道交通网络的大系统特性,借鉴大系统优化的递阶控制方法和分解协调优化方法,生成网络中的线路换乘衔接方案；以最小化乘客总换乘等待时间为目标,构建了“换乘衔接对-线路换乘衔接方案”的二级协调优化模型。
Train working diagram is the production plan of the railway transportation enterprises, and it has the direct influence on the efficiency and security of transportation organization. Compared with train working diagram of national railway, the designing of train working diagram of urban rail transit has its own characteristics and complexity.
In recent years, the urban rail transit systems in China are built rapidly, and some cities, such as, Shanghai, Beijing, and Guangzhou, has gradually come into the the network operation phase.During the construction of urban rail transit network, the line structure and traffic characteristic are becoming more and more complicated, especially for some long distance lines.Thus, the train operation schedule is gradually developed from the full-length operation mode to the complex operation mode, which has brought new challenges to train working diagram designing.The designing of the train working diagram is studied in detail in this paper. The contents of this thesis are as following:
(1) The characteristics,elements, data and principles for designing train working dia-gram are introduced to lay the theory foundation for further research,especially for the building of the mathematical model.
(2) The principles, characteristics and method of multi-objective optimization, tabu search algorithm and large scale system optimization algorithm are summarized to lay the algorithm foundation for solving the related optimization models.
(3) The train schedule is the basis for designing of train working diagram. Against the background of the Full-length&Short-turn operation mode, the main content in the train schedule of the urban rail transit is the train number of each route in every period, which is the main task of this chapter. The paper analyses the computational method of the passenger cost and the operation cost with the Full-length&Short-turn operation mode. Then, a bi-objective nonlinear mixed integer programming model is proposed. The objective of this model is to minimize the passenger total cost and the operation cost, and the constraints are the minimal headway and the passenger demand. The ideal point method is introduced to convert the above model into the single objective model. Sensitivity analysis of the cost related factors, such as the turn-back station and the flow ratio of the short route are done. The result show that the cost can be significantly affected by adjusting the turn-back station, and the higher the flow ratio of the short route is, the Full-length&Short-turn operation mode is more beneficial.
(4)The designing of train working diagram with the Shared-Path operation mode is to deal with the train running sequence on the Shared-Path route, and when the train arrives at/departs from the station.Based on the concept of Shared-Path operation mode, the key problems of designing train working diagram in urban rail transit with Shared-Path operation mode are analyzed, including the headway,the turn-back mode,the arrival/depart interval in the turn-back station,and the path of the EMU going into/coming out from the depot. A model for designing the initial departure plan is constructed, aiming to make sure that the headway in every period has a good equilibrium.A bi-level programming model for the train working diagram designing with the Shared-Path operation mode is constructed, aiming to the integrated designing of the train working diagram and the EMU circulation plan. The upper objective of the bi-level programming model is to design the timetable, with the objective of minimizing the deviation of the final timetable and the initial departure plan. The lower objective of the bi-level programming model is to design the EMU circulation plan, with the objective of minimizing the total connection time of the EMU.It is very difficult to solve the bi-level programming model directly,thus,we design a hierarchical optimization method,the main idea of the method is to decompose the objective,layer by layer to narrow the search space, to reduce solving scale, including:①generate the train stop schedule;②the EMU circulation plan designing;③based on tabu search algorithm to determine the trains running sequence;④based on the train running sequence to design the train working diagram.
(5)The train coordination is the important content of the transportation organization in urban rail transit network.Aiming to reduce the passenger transfer waiting time,the computational formula of the passenger transfer waiting time is introduced,which is the important part of the train coordination.The urban rail transit has the characteristic of the large scale system. With the help of the hierarchical control, decomposition and coordination optimization method in the system engineering theory, we introduce the algorithm to generate the transfer connection scheme,which is a key part of train coordination in the network. Then, a "transfer linkage pair-transfer connection scheme" two level hierarchical coordination model is introduced, and then a hierarchical coordination algorithm is designed.
本文充分借鉴和参考以往的研究成果,综合运用轨道交通运输组织、最优化理论、系统工程等学科的相关理论,对城市轨道交通运行图编制相关问题进行了深入研究。本文的研究内容主要包括以下几个方面：
(1)分析了城市轨道交通列车运行图的特征、要素、编制数据以及编制原则等相关基础理论,为运行图编制模型的构建奠下了基础；
(2)对多目标优化方法、禁忌搜索算法以及大系统优化方法等优化理论和方法进行了归纳和总结,为运行图编制模型的求解奠下了基础；
(3)行车计划是编制列车运行图的基础资料,是城市轨道交通运输组织的基础。大小交路模式列车开行方案规定各时间段内各交路上开行列车对数。以最小化乘客出行成本和企业运营成本为优化目标,以乘客需求、线路通过能力为约束,构建了关于大小交路模式行车计划优化编制的双目标混合整数非线性模型,采用理想点法将以上模型转化为单目标模型；大小交路模式下乘客出行成本的计算是构建模型的难点,从乘客在途时间成本和等待时间成本两方面,细致地分析了大小交路模式下乘客出行成本的计算方法；对折返站的选取、小交路区段客流比重作了灵敏度分析,得出了折返站对成本的影响趋势,以及小交路区段客流比重对列车开行对数、大小交路列车开行比例以及企业运营成本的影响趋势。
(4)共线交路列车运行图编制的实质是处理各子交路上列车与车站、列车与区间、列车与列车、以及共线区段不同交路上列车与列车之间的关系。对共线交路相关概念进行定义,深入分析了共线交路模式下列车运行图编制的关键问题,主要包括行车间隔、折返模式、折返站间隔时间、车底运用方式以及车底出入库方式；以列车发车间隔的分时段均衡性为优化目标构建了列车始发布点方案编制模型,在此基础上,以车底接续总时间最小为下层目标,以列车始发时刻与列车始发布点方案的偏差最小为上层目标,构建了关于共线交路列车运行图编制的双层规划模型,实现了列车运行图与车底交路计划的一体化编制。针对问题的特点,设计了一种递阶优化的方法,对优化目标进行分解,逐层缩小搜索空间,降低求解规模,主要包括：①生成列车停站时间算法；②车底交路计划编制算法；③基于禁忌搜索算法确定列车运行顺序；④基于列车运行顺序编制列车运行图。
(5)列车运行衔接协调是城市轨道交通网络化运输组织的重要内容。降低乘客换乘等待时间是轨道交通网络列车运行衔接协调的重要目标。分析了换乘等待时间的表示方法；针对城市轨道交通网络的大系统特性,借鉴大系统优化的递阶控制方法和分解协调优化方法,生成网络中的线路换乘衔接方案；以最小化乘客总换乘等待时间为目标,构建了“换乘衔接对-线路换乘衔接方案”的二级协调优化模型。
Train working diagram is the production plan of the railway transportation enterprises, and it has the direct influence on the efficiency and security of transportation organization. Compared with train working diagram of national railway, the designing of train working diagram of urban rail transit has its own characteristics and complexity.
In recent years, the urban rail transit systems in China are built rapidly, and some cities, such as, Shanghai, Beijing, and Guangzhou, has gradually come into the the network operation phase.During the construction of urban rail transit network, the line structure and traffic characteristic are becoming more and more complicated, especially for some long distance lines.Thus, the train operation schedule is gradually developed from the full-length operation mode to the complex operation mode, which has brought new challenges to train working diagram designing.The designing of the train working diagram is studied in detail in this paper. The contents of this thesis are as following:
(1) The characteristics,elements, data and principles for designing train working dia-gram are introduced to lay the theory foundation for further research,especially for the building of the mathematical model.
(2) The principles, characteristics and method of multi-objective optimization, tabu search algorithm and large scale system optimization algorithm are summarized to lay the algorithm foundation for solving the related optimization models.
(3) The train schedule is the basis for designing of train working diagram. Against the background of the Full-length&Short-turn operation mode, the main content in the train schedule of the urban rail transit is the train number of each route in every period, which is the main task of this chapter. The paper analyses the computational method of the passenger cost and the operation cost with the Full-length&Short-turn operation mode. Then, a bi-objective nonlinear mixed integer programming model is proposed. The objective of this model is to minimize the passenger total cost and the operation cost, and the constraints are the minimal headway and the passenger demand. The ideal point method is introduced to convert the above model into the single objective model. Sensitivity analysis of the cost related factors, such as the turn-back station and the flow ratio of the short route are done. The result show that the cost can be significantly affected by adjusting the turn-back station, and the higher the flow ratio of the short route is, the Full-length&Short-turn operation mode is more beneficial.
(4)The designing of train working diagram with the Shared-Path operation mode is to deal with the train running sequence on the Shared-Path route, and when the train arrives at/departs from the station.Based on the concept of Shared-Path operation mode, the key problems of designing train working diagram in urban rail transit with Shared-Path operation mode are analyzed, including the headway,the turn-back mode,the arrival/depart interval in the turn-back station,and the path of the EMU going into/coming out from the depot. A model for designing the initial departure plan is constructed, aiming to make sure that the headway in every period has a good equilibrium.A bi-level programming model for the train working diagram designing with the Shared-Path operation mode is constructed, aiming to the integrated designing of the train working diagram and the EMU circulation plan. The upper objective of the bi-level programming model is to design the timetable, with the objective of minimizing the deviation of the final timetable and the initial departure plan. The lower objective of the bi-level programming model is to design the EMU circulation plan, with the objective of minimizing the total connection time of the EMU.It is very difficult to solve the bi-level programming model directly,thus,we design a hierarchical optimization method,the main idea of the method is to decompose the objective,layer by layer to narrow the search space, to reduce solving scale, including:①generate the train stop schedule;②the EMU circulation plan designing;③based on tabu search algorithm to determine the trains running sequence;④based on the train running sequence to design the train working diagram.
(5)The train coordination is the important content of the transportation organization in urban rail transit network.Aiming to reduce the passenger transfer waiting time,the computational formula of the passenger transfer waiting time is introduced,which is the important part of the train coordination.The urban rail transit has the characteristic of the large scale system. With the help of the hierarchical control, decomposition and coordination optimization method in the system engineering theory, we introduce the algorithm to generate the transfer connection scheme,which is a key part of train coordination in the network. Then, a "transfer linkage pair-transfer connection scheme" two level hierarchical coordination model is introduced, and then a hierarchical coordination algorithm is designed.
引文
[1]毛保华.城市轨道交通系统运营管理[M].北京：人民交通出版社,2006：103-122
[2]毛保华.城市轨道交通规划与设计[M].北京：人民交通出版社,2006：34-57
[3]郑莉,董渊,张瑞丰.c++语言程序设计[M].第3版.北京：清华大学出版社,2003：243-245
[4]徐瑞华,江志彬,朱效洁,等.城市轨道交通列车运行图计算机编制的关键问题研究[J].城市轨道交通研究.2005,5：31-35
[5]徐瑞华,陈菁菁,杜世敏.城市轨道交通多种列车交路模式下的通过能力和车底运用研究[J].铁道学报.2005,27(4)：6-10
[6]徐瑞华,李侠,陈菁菁.市域快速轨道交通线路列车运行交路研究[J].城市轨道交通研究.2006,5：41-45
[7]李俊芳,王柄达.城市轨道交通典型交路形式分析[J].铁道运输与经济.2009,31(10)：54-58
[8]徐新玉.城市轨道交通行车组织交通形式分析[J].铁道运输与经济.2009,32(9)：55-58
[9]严大龙.城市轨道交通建设融资模式研究[D].长沙：国防科学技术大学,2007：56-69
[10]崔立秋.城市轨道交通运营安全管理模式研究[D].北京：北京交通大学,2009：92-102
[11]陈柳钦.城市轨道交通建设的PPP融资模式[J].中国铁路.2005(09)：55-76
[12]杨国荣,张军.城市基础设施建设的融资渠道选择研究[J].重庆大学学报(社会科学版).2005(04)：21-28
[13]樊晓梅.城市轨道交通运营组织计算机辅助设计系统研究[D].成都：西南交通大学,2010：34-76
[14]颜彦文.数据冗余处理技术在轨道交通AFC系统中的应用[D].上海：上海交通大学,2012：87-98
[15]赵朔雪.基于自律分散技术的城市轨道交通ATS子系统优化分析与设计[D].兰州交通大学,2012：34-56
[16]张国宝.城市轨道交通运营组织[M].北京：中国铁道出版社,2000：58-179
[17]何宗华等.城市轨道交通运营组织[M].北京：中国建筑工业出版社,2003：53-160
[18]何静.城市轨道交通运营管理[M].北京：中国铁道出版社,2007：43-120
[19]房宵虹.城市轨道交通网络化运输组织协调理论及方法研究[D].北京交通大学.2010：23-169
[20]周艳芳.城市轨道交通网络列车运行计划一体化编制理论与方法研究[D].北京交通 大学.2012：26-125
[21]黄荣.城市轨道交通网络化运营的组织方法及实施技术研究[D].北京交通大学.2010：15-120
[22]孙焰,施其洲,赵源,等.城市轨道交通行车计划的确定[J].同济大学学报(自然科学版).2004,32(8)：1005-1014
[23]林震,杨浩.城市轨道交通发车间距优化模型探讨[J].土木工程学报.2003,1：1-5
[24]严波.城市轨道交通行车间隔时间优化模型研究[J].城市轨道交通研究.2008,6：53-62
[25]洪玲,陈菁菁,徐瑞华.市域快速轨道交通线行车间隔优化问题研究[J].城市轨道交通研究.2006,3：35-59
[26]FURTH P G. Short Turning on Transit Routes [J]. Transportation Research Record.1987, 1108:42-52
[27]PAOLO Delle Site, FRANCESCO Filippi.Service Optimization for Bus Corridors with Short-turn Strategies and Variable vehicle size [J].Transportation Research Part A:Policy and Practice.1998,32(1):19-38
[28]TIRACHINI A, CORTES CE,JARA Diaz SR. Optimal Design and Benefits of a Short Turning Strategy for a Bus Corridor [J].Transportation,2011,38 (1):169-189
[29]郭富娥.中国铁道部和原苏联交通部科技合作项目“应用电子计算机编制列车运行图”课题工作综述[J].铁道运输与经济.1992,11：39-40
[30]刘梅林,郭富娥.苏联铁路利用电子计算机编制列车运行图综述[J].世界铁路.1991,4：6-10
[31]周小棋,郭富娥,王光华.计算机辅助编制旅客列车运行详图的研究[J].铁道报.1992,14(3)：65-71
[32]郭富娥.日本近期开发的列车运行图编制系统[J].中国铁路.1995,8：38-40
[33]铁道科学研究院.计算机辅助编制全路直通客车方案研究报告[R].北京,1989：13-45
[34]郭富娥.利用电子计算机编制列车运行图[J].铁道运输与经济.1992,1：27-29
[35]Serafini, P, Ukovich. A mathematical model for Periodic Event Scheduling Problems [J]. SIAM Journal of Discrete Mathematics.1989,2(4):550-581
[36]Schrijver, A.S.A. Timetable construction for Railned. Technical report [J]. Center for Mathematics and Computer Science.1994:25-36
[37]徐炜.计算机编制列车运行图的方法研究[D].大连交通大学.2005：76-112
[38]倪少权,杨明伦.计算机编制全路直通旅客列车运行图的研究[J].铁道运输与经济,2002,24(6)：41-44
[39]倪少权,吕红霞,李浩.计算机编制列车运行图系统的研究[J].铁道运输与经济.2001,23(7)：32-35
[40]Kroon, L.G, Peeters, L.W.P, A variable trip time model for cyclic railway timetabling [J], Transportation Science.2003,37(2)198-212
[41]Nachtigall, K., Voget, S. Minimizing waiting times in integrated fixed interval timetables byUpgrading railway tracks [J]. European Journal of Operational Research. 1997,103:610-627.
[42]Goverde, R.M.P., Optimal scheduling of connections in railway systems [A]. World Congress on Transport Research 8th (WCTR8).1998,6:1-17
[43]Lindner,T. Train Schedule Optimization in Public Rail Transport[D].Germany: Technical University Braunschweig.2000:23-54
[44]Yu-Hern Chang, C.-H.Y.b, Ching-Cheng Shen. A multiobjective model for passenger train services planning application to Taiwan's high-speed rail line [J]. Transportation Research Part B.2000,34(3):91-106
[45]Frederick S.Hillier, Gerald J.Lieberman.Introdution to Operation Research (8th Ed.)[M].The McGraw-Hill Companies, Inc.2005:458-634.
[46]Goossens J, Van Hoesel S, Kroon L. A Branch-and-Cut Approach for Solving Railway Line-Planning Problems [J]. Transportation Science.2004,80(1):193-210
[47]邢文训,谢金星.现代优化计算方法[M].北京：清华大学出版社,2001：145-234
[48]孙焰.单线列车运行图优化理论及计算机编制方法[D].长沙：长沙铁道学院,1997：25-67
[49]史峰.定序单线列车运行图的原始-对偶算法[J].铁道学报,1996,18(1)：8-20
[50]Brannlund U, Lindberg P.O, Nou A. Railway Timetabling Using Lagrangian Relaxation [J].Transportation Science.1998,32(4):358-369
[51]Vivian Salim, Xiaoqiang Cai. A genetic algorithm for railway scheduling with environmental considerations [J]. Environmental Modelling&Software.1997,12 (4):301-309
[52]许红,马建军,等.客运专线列车运行图编制模型及计算方法研究[J].铁道学报,2007,29(2)：1-7
[53]K.Fukumori,H.Sano.Fundamental algorithm fortrain scheduling based on artificial intelligence[J].Systems and Computers in Japan.1987,18(3):52-63
[54]Lids.Y.Timetable preparation by A.I. approaches[C].Proceeding of Multiconference.Nice,France.1998:163-168.
[55]程宇.列车运行调整专家系统的探讨[J].北方交通大学学报.1989(4)：11-17
[56]程宇,秦作睿.列车运行调整专家系统的研究[J].铁道学报.1992,14(2)：1-9
[57]蔡柏根,王菊贞.基于模拟的列车调度专家系统的研究[J].铁道学报.1992,14(3)：31-41
[58]倪少权,杨明伦,彭其渊.列车运行图编制专家系统之研究[J].1995,30(5)：550-556
[59]彭其渊,王宝杰,周党瑞.基于实用的一种网络列车运行图计算方法[J].1999,5：588-593
[60]史峰,黎新华,秦进,邓连波.单线列车运行调整的最早冲突优化方法[J].中国铁道科学.2005,26(1)：106-113
[61]史峰,黎新华,等.单线列车运行图铺划的时间循环迭代优化方法[J].铁道学报.2005,27(1)：1-5
[62]许红,马建军,龙建成,杨浩,龙昭.城市轨道交通列车运行图编制的数学模型及方法[J].北京交通大学学报.2006,30(3)：10-14
[63]江志彬,徐瑞华,吴强,吕杰.计算机编制城市轨道交通共线交路列车运行图[J].同济大学学报.2010,38(5)：692-696
[64]王川.城市轨道交通列车运行图编制模型和算法研究[D].成都：西南交通大学,2011：20-85
[65]高强周.城市轨道交通列车运行图设计实现与评价[D].北京交通大学硕士学位论文.2008：30-46
[66]缪道平.城市轨道交通车体运用计划自动编制及优化研究[D].北京交通大学硕士学位论文.2009：35-78
[67]Christian Liebchen. The First Optimized Railway Timetable in Practice [J]. Transportation Science.2008,42(4):420-435
[68]J. E. CURY, F. A. C. GOMIDE, AND M. J. MENDES. A Methodology for Generation of Optimal chedulesfor an Underground Railway System[J].IEEE Transaction on Automatic Control.1980. AC-25(2):217-222
[69]Wanderson O. Assisa, Basilio E.A. Milan. Generation of optimal schedules for metro lines using model predictive control [J]. Automatica.2004,(40):1397-1404
[70]Mohring, H., J. Schroeter, P. Wiboonchuikula.1987. The values of waiting time, travel time, and a seat on a bus. Rand J. Econom.18 (1).40-56.
[71]Eranki, A. A model to create bus timetables to attain maximum synchronization considering waiting times at transfer stops [D].Department of Industrial and Management Systems Engineering, University of South Florida,2004:33-53
[72]张铭,徐瑞华.轨道交通网络列车衔接组织的递阶协调优化[J].系统工程.2007,25(9)：33-37
[73]周艳芳,周磊山,乐逸祥.城市轨道网络换乘站列车衔接同步协调优化研究[J].铁道学报.2011,33(3)：9-16
[74]张铭.城市轨道交通网络化运营协调性模糊评价[J].交通信息与安 全.2010,3(28)：38-42
[75]Chung Min Kwan, Chang C S. Timetable Synchronization of Mass Rapid Transit System Using Multi-objective Evolutionary Approach [J]. IEEE Transactions on Systems, Man, and Cybernetics Part C:Applications and Reviews,2008,38(5):636-648.
[76]ZHAO Fang, ZENG Xiao-gang. Optimization of Transit Route Network, vehicle Headways and Timetables for Large-Scale Transit Networks [J]. European Journal of Operational Research.2008,186(2):841-855
[77]VANST EENWEGEN P, VAN Oudheusden D. Decreasing the Passenger Waiting Time for an Intercity Rail Network[J].Transportation Research Part B.2007,41(4):478-492.
[78]Yuval Hadas, Avishai Ceder. Public Transit Simulation Model for Optimal Sy-nchronized Transfers [J].Transportation Research Record:Journal of the Transport ation Research Board.2008,2063:52-59.
[79]Dusan Teodoro, Panta Lui. Schedule Synchronization in Public Transit Using the Fuzzy Ant System [J].Transportation Planning and Technology.2005,28(1):47-76.
[80]Ceder, A., Tal, O.Designing synchronization into bus timetables. Transportation Research Record [J]:Journal of the Transportation Research Board.2001,1760:28-33.
[81]Rachel C. W.Wong, Tony W. Y. Yuen, Kwok Wah Fung, Janny M. Y. Leung [J]. Optimizing Timetable Synchronization for Rail Mass Transit. Transportation Science.2008,42:57-69.
[82]季令,张国宝.城市轨道交通运行组织[M].北京：中国铁道出版社,1998：38-48
[83]朱光正.列车由车辆段往返正线的接发车能力分析[J].铁路通信信号工程技术,2007,4(1)：41-42
[84]Andrea D'Ariano, Dario Pacciarelli, Marco Pranzo.A branch and bound algorithm for scheduling trains in a railway network [J]. European Journal of Operational Research.2007,183:643-657
[85]Senzana M. Heuristic Approach to train Rescheduling[J].Yugoslav Journal of Operation:Research.2007,17:9-29
[86]Zwaneveld P.J. Routing trains through railway stations:Model formulation and algorithms[J].Transportation Science.1996,30(3):181-194
[87]Alberto Caprara, Michele Monaci, Paolo Toth. A Lagrangian heuristic algorithm for a realworld train timetabling problem [J]. Discrete Applied Mathematics. 2006,154(5):738-753
[88]Yu Cheng. Hybrid simulation for resolving resource conflicts in train traffic rescheduling [J].Computers in Industry.1998,35(3):233-246
[89]Van Der Touw J, Veevers A. A dynamic programming method for matching rail-track monitoring data [J]. The journal ofthe Operational Research Society. 2003,54(11):1148-1154
[90]孙焰.单线列车运行图优化理论及计算机编制方法[D].长沙：长沙铁道学院.1997
[91]彭其渊,杨明伦,倪少权.单线区段货物列车始发方案的优化模型及求解方法[J].西南交通大学学报.1995,30(2)：177-181
[92]王凌.智能优化算法及其应用[M].北京：清华大学出版社.2001：135-176
[93]李素莹,陈光华,车永兵.上海轨道交通1号线开行大小交路运行方案的实践[J].城市轨道交通研究.2007,1(1)：50-53.
[94]沈荣芳.运筹学高级教程[M].北京：高等教育出版社,2008：148-181.
[95]王粉线,汪履直.城市轨道交通车辆段出入段线的设置[J].现代城市轨道交通.2006,(2)：36-37
[96]杨洪.浅谈城市轨道交通的配线设置[J].西铁科技.2009,(2)：41-42
[97]朱光正.列车由车辆段往返正线的接发车能力分析[J].铁路通信信号工程技术,2007,4(1)：41-42
[98]孙焰,李致中.列车运行图的均衡性标准[J].长沙铁道学院学报.1993,11(2)：63-68.
[99]史峰,胡安洲.机车周转图的线性配置算法[J].铁道学报.1996,8(4)：18-24
[100]张铭,杜世敏.基于递阶偏好的轨道交通网络化运营换乘协调优化[J].铁道学报.2009,31(6)：9-14
[101]林锉云,董加礼.多目标优化的方法与理论[J].长春：吉林教育出版社,1992：55-80
[102]王凌,郑大钟.邻域搜索算法的统一结构和混合优化策略[J].清华大学学报(自然科学版.2000,40(9)：125-128
[103]汪应洛.系统工程理论、方法与应用(第二版)[M].北京：高等教育出版社.1998,5：25-76
[104]陈树勋.工程大系统设计的普遍型分解协调优化[J].中国机械工程(自然科学版).1997,7：799-803
[105]金福才.多目标优化列车运行调整理论与方法研究[D].北京：北京交通大学.2004：26-76
[106]谢金星,薛毅.优化建模与LINDO/LINGO软件[M].北京：清华大学出版社.2005：45-142
[107]Petresom E. R. An Introduction to Computer-Assisted Train Dispatch [J]. Advanced Transportation.1986,20(1):63-72
[108]Stephen G. Ritchie. A Knowledge-based Decision Support Architecture for Advanced Traffic Management [J]. Transportion Research.1990(24):27-37
[109]Yu-Hem Chang, et al., A Multi-objective Model for Passenger Train Services Planning: Application to TaiWan's High Speed Rail Line [J], Transpn. Res.2000,34:91-106
[110]Samer S. Saab, Senior Member. Compensation of Axle-Generator Errors Due to Wheel Slip and Slide [J]. IEEE TRANS ACIONS ON VEHICULAR TECHNOLOGY.2002,5:9-16
[111]郑莉,董渊,张瑞丰.C++语言程序设计[M].第3版.北京：清华大学出版社,2003.12：3-39
[112]C. V. A. Benedetto., M. Monica. Train Position and Speed Estimation Using Wheel Velocity measurements [J]. Journal of Rail and Rapid Transit.2002:15-25
[113]J. Thayer, J. Herzog, J. Guttman, Strand spaces:1998 IEEE Sympisium on Security and Privacy, Why is a security protocol correct [J]. In:Proceeding of IEEE Computer Society Press,1998:160-171
[114]P. E. Hart, N. J. Nilsson, B. Raphael. A formal basis for the heuristic determination of minimum cost paths in graphs [J]. IEEE Trans. Syst. Sci.and Cybermetics, 1968,SSC-4(2):100-107
[115]O. Gulbrodsem. Optimal planning of marshalling yard by operation research [J]. PROC,1963:226-233
[116]R. S. McGaughey. Planning locomotive and car distribution [J]. Rail Int,1973:1213-1218
[117]M. H. Keaton. Designing Optimal Railroad Operating Plans:Lagrangian Relaxation and Heuristice Approaches[J].Trans.Res.(B),1989(23):443-452
[118]M. H. Keaton. Designing railroad operating plans:A dual adjustment method for implementing lagrangian relaxation [J]. Trans. Sci.(B),1992(26):263-279
[119]T. Crainic, J. Ferland and J. Rousseav. A trantical planning model for rail freight transportation [J].Tans.Sci.1984(18):165-183
[120]Belew R. Artificial Life:A Constructive Lower Bound for Artificial Intelligence [J]. IEEE Exper,1991,6(1):342-351
[121]Davis L.Genetic Algorithms and Simulated Annealing [M]. Pitman,1987:89-121
[122]Holland J H, Reitman. J. S. Cognitive Systems Based on Adaptive Algorithms [J]. Pattern Directed Inference Systems,New York:Academic Press,1978,7(2):99-112
[123]Janikow C Z. A Knowledge-Intensive Genetic Algorithm for Supervised Learning [J]. Machine Learning,1993,13(2):23-40
[124]Wong Rachel C W, Yuen Tony W Y, Fung Kwok Wah, et al. Optimizing timetable synchronization for rail mass transit [J]. Transportation Science,2008,42(1):57-65
[125]Peeters Marc, Kroon Leo. Circulation of railway rolling stock:a branch and price approach [J]. Computer & Operations Research,2008,35(2):538-547
[126]Kroon Leo.Stochastic improvement of cyclic railway timetables [J]. Transportation Research Part B:Methodological,2008,42(6):553-562
[127]贺协腾.基于开行方案的动车组运用仿真研究[D].北京交通大学.2010：23-56
[128]赵鹏,富井规雄.动车组运用计划及其编制算法[J].铁道学报.2003,25(3)：1-7
[129]甘应爱,田丰,李维铮等.运筹学(第三版)[M].北京：清华大学出版社,2005：12-65
[130]符卓,肖雁.求指派问题多重最优解的分枝定界法[J].长沙铁道学院学报.2000,18(1)：69-72.
[131]石雨.客运专线列车运行调整的策略、模型与算法[D]北京交通大学.2010：23-54
[132]王慧妮.客运专线列车运行调整模型及算法研究[D].西南交通大学.2006：32-67
[133]黎新华.单线区段列车运行图铺划与运行调整优化方法研究[D].中南大学.2005：34-54
[134]聂磊.高速铁路列车运行调整优化理论与方法[D].北京：北京交通大学.2000：21-54
[135]青学江,马国忠.遗传算法在区段站到发线的应用研究[J].西南交通大学学报,1998,33(4)：387-392
[136]王正彬,杜文.铁路技术站到发线运用调整模型及算法[J].西南交通大学学报,2006,41(2)：202-205
[137]谢楚农,黎新华.铁路客运站到发线运用优化研究[J].中国铁道科学,2004,25(5)：130-133
[138]吕红霞.铁路大型客运站作业计划智能编制的优化技术和方法研究[D].成都：西南交通大学.2008：42-76
[139](意)Marco Dorige,(德)Thomas Stutzle著.张军,胡晓敏,罗旭跃等译.蚁群优化[M].清华大学出版社.2007：25-42
[140]Ismail Sahim. Railway Traffic Control and Train Scheduling based on Inter-train Conflict Management [J]. Transpn. Res.B.1999.33:511-534
[2]毛保华.城市轨道交通规划与设计[M].北京：人民交通出版社,2006：34-57
[3]郑莉,董渊,张瑞丰.c++语言程序设计[M].第3版.北京：清华大学出版社,2003：243-245
[4]徐瑞华,江志彬,朱效洁,等.城市轨道交通列车运行图计算机编制的关键问题研究[J].城市轨道交通研究.2005,5：31-35
[5]徐瑞华,陈菁菁,杜世敏.城市轨道交通多种列车交路模式下的通过能力和车底运用研究[J].铁道学报.2005,27(4)：6-10
[6]徐瑞华,李侠,陈菁菁.市域快速轨道交通线路列车运行交路研究[J].城市轨道交通研究.2006,5：41-45
[7]李俊芳,王柄达.城市轨道交通典型交路形式分析[J].铁道运输与经济.2009,31(10)：54-58
[8]徐新玉.城市轨道交通行车组织交通形式分析[J].铁道运输与经济.2009,32(9)：55-58
[9]严大龙.城市轨道交通建设融资模式研究[D].长沙：国防科学技术大学,2007：56-69
[10]崔立秋.城市轨道交通运营安全管理模式研究[D].北京：北京交通大学,2009：92-102
[11]陈柳钦.城市轨道交通建设的PPP融资模式[J].中国铁路.2005(09)：55-76
[12]杨国荣,张军.城市基础设施建设的融资渠道选择研究[J].重庆大学学报(社会科学版).2005(04)：21-28
[13]樊晓梅.城市轨道交通运营组织计算机辅助设计系统研究[D].成都：西南交通大学,2010：34-76
[14]颜彦文.数据冗余处理技术在轨道交通AFC系统中的应用[D].上海：上海交通大学,2012：87-98
[15]赵朔雪.基于自律分散技术的城市轨道交通ATS子系统优化分析与设计[D].兰州交通大学,2012：34-56
[16]张国宝.城市轨道交通运营组织[M].北京：中国铁道出版社,2000：58-179
[17]何宗华等.城市轨道交通运营组织[M].北京：中国建筑工业出版社,2003：53-160
[18]何静.城市轨道交通运营管理[M].北京：中国铁道出版社,2007：43-120
[19]房宵虹.城市轨道交通网络化运输组织协调理论及方法研究[D].北京交通大学.2010：23-169
[20]周艳芳.城市轨道交通网络列车运行计划一体化编制理论与方法研究[D].北京交通 大学.2012：26-125
[21]黄荣.城市轨道交通网络化运营的组织方法及实施技术研究[D].北京交通大学.2010：15-120
[22]孙焰,施其洲,赵源,等.城市轨道交通行车计划的确定[J].同济大学学报(自然科学版).2004,32(8)：1005-1014
[23]林震,杨浩.城市轨道交通发车间距优化模型探讨[J].土木工程学报.2003,1：1-5
[24]严波.城市轨道交通行车间隔时间优化模型研究[J].城市轨道交通研究.2008,6：53-62
[25]洪玲,陈菁菁,徐瑞华.市域快速轨道交通线行车间隔优化问题研究[J].城市轨道交通研究.2006,3：35-59
[26]FURTH P G. Short Turning on Transit Routes [J]. Transportation Research Record.1987, 1108:42-52
[27]PAOLO Delle Site, FRANCESCO Filippi.Service Optimization for Bus Corridors with Short-turn Strategies and Variable vehicle size [J].Transportation Research Part A:Policy and Practice.1998,32(1):19-38
[28]TIRACHINI A, CORTES CE,JARA Diaz SR. Optimal Design and Benefits of a Short Turning Strategy for a Bus Corridor [J].Transportation,2011,38 (1):169-189
[29]郭富娥.中国铁道部和原苏联交通部科技合作项目“应用电子计算机编制列车运行图”课题工作综述[J].铁道运输与经济.1992,11：39-40
[30]刘梅林,郭富娥.苏联铁路利用电子计算机编制列车运行图综述[J].世界铁路.1991,4：6-10
[31]周小棋,郭富娥,王光华.计算机辅助编制旅客列车运行详图的研究[J].铁道报.1992,14(3)：65-71
[32]郭富娥.日本近期开发的列车运行图编制系统[J].中国铁路.1995,8：38-40
[33]铁道科学研究院.计算机辅助编制全路直通客车方案研究报告[R].北京,1989：13-45
[34]郭富娥.利用电子计算机编制列车运行图[J].铁道运输与经济.1992,1：27-29
[35]Serafini, P, Ukovich. A mathematical model for Periodic Event Scheduling Problems [J]. SIAM Journal of Discrete Mathematics.1989,2(4):550-581
[36]Schrijver, A.S.A. Timetable construction for Railned. Technical report [J]. Center for Mathematics and Computer Science.1994:25-36
[37]徐炜.计算机编制列车运行图的方法研究[D].大连交通大学.2005：76-112
[38]倪少权,杨明伦.计算机编制全路直通旅客列车运行图的研究[J].铁道运输与经济,2002,24(6)：41-44
[39]倪少权,吕红霞,李浩.计算机编制列车运行图系统的研究[J].铁道运输与经济.2001,23(7)：32-35
[40]Kroon, L.G, Peeters, L.W.P, A variable trip time model for cyclic railway timetabling [J], Transportation Science.2003,37(2)198-212
[41]Nachtigall, K., Voget, S. Minimizing waiting times in integrated fixed interval timetables byUpgrading railway tracks [J]. European Journal of Operational Research. 1997,103:610-627.
[42]Goverde, R.M.P., Optimal scheduling of connections in railway systems [A]. World Congress on Transport Research 8th (WCTR8).1998,6:1-17
[43]Lindner,T. Train Schedule Optimization in Public Rail Transport[D].Germany: Technical University Braunschweig.2000:23-54
[44]Yu-Hern Chang, C.-H.Y.b, Ching-Cheng Shen. A multiobjective model for passenger train services planning application to Taiwan's high-speed rail line [J]. Transportation Research Part B.2000,34(3):91-106
[45]Frederick S.Hillier, Gerald J.Lieberman.Introdution to Operation Research (8th Ed.)[M].The McGraw-Hill Companies, Inc.2005:458-634.
[46]Goossens J, Van Hoesel S, Kroon L. A Branch-and-Cut Approach for Solving Railway Line-Planning Problems [J]. Transportation Science.2004,80(1):193-210
[47]邢文训,谢金星.现代优化计算方法[M].北京：清华大学出版社,2001：145-234
[48]孙焰.单线列车运行图优化理论及计算机编制方法[D].长沙：长沙铁道学院,1997：25-67
[49]史峰.定序单线列车运行图的原始-对偶算法[J].铁道学报,1996,18(1)：8-20
[50]Brannlund U, Lindberg P.O, Nou A. Railway Timetabling Using Lagrangian Relaxation [J].Transportation Science.1998,32(4):358-369
[51]Vivian Salim, Xiaoqiang Cai. A genetic algorithm for railway scheduling with environmental considerations [J]. Environmental Modelling&Software.1997,12 (4):301-309
[52]许红,马建军,等.客运专线列车运行图编制模型及计算方法研究[J].铁道学报,2007,29(2)：1-7
[53]K.Fukumori,H.Sano.Fundamental algorithm fortrain scheduling based on artificial intelligence[J].Systems and Computers in Japan.1987,18(3):52-63
[54]Lids.Y.Timetable preparation by A.I. approaches[C].Proceeding of Multiconference.Nice,France.1998:163-168.
[55]程宇.列车运行调整专家系统的探讨[J].北方交通大学学报.1989(4)：11-17
[56]程宇,秦作睿.列车运行调整专家系统的研究[J].铁道学报.1992,14(2)：1-9
[57]蔡柏根,王菊贞.基于模拟的列车调度专家系统的研究[J].铁道学报.1992,14(3)：31-41
[58]倪少权,杨明伦,彭其渊.列车运行图编制专家系统之研究[J].1995,30(5)：550-556
[59]彭其渊,王宝杰,周党瑞.基于实用的一种网络列车运行图计算方法[J].1999,5：588-593
[60]史峰,黎新华,秦进,邓连波.单线列车运行调整的最早冲突优化方法[J].中国铁道科学.2005,26(1)：106-113
[61]史峰,黎新华,等.单线列车运行图铺划的时间循环迭代优化方法[J].铁道学报.2005,27(1)：1-5
[62]许红,马建军,龙建成,杨浩,龙昭.城市轨道交通列车运行图编制的数学模型及方法[J].北京交通大学学报.2006,30(3)：10-14
[63]江志彬,徐瑞华,吴强,吕杰.计算机编制城市轨道交通共线交路列车运行图[J].同济大学学报.2010,38(5)：692-696
[64]王川.城市轨道交通列车运行图编制模型和算法研究[D].成都：西南交通大学,2011：20-85
[65]高强周.城市轨道交通列车运行图设计实现与评价[D].北京交通大学硕士学位论文.2008：30-46
[66]缪道平.城市轨道交通车体运用计划自动编制及优化研究[D].北京交通大学硕士学位论文.2009：35-78
[67]Christian Liebchen. The First Optimized Railway Timetable in Practice [J]. Transportation Science.2008,42(4):420-435
[68]J. E. CURY, F. A. C. GOMIDE, AND M. J. MENDES. A Methodology for Generation of Optimal chedulesfor an Underground Railway System[J].IEEE Transaction on Automatic Control.1980. AC-25(2):217-222
[69]Wanderson O. Assisa, Basilio E.A. Milan. Generation of optimal schedules for metro lines using model predictive control [J]. Automatica.2004,(40):1397-1404
[70]Mohring, H., J. Schroeter, P. Wiboonchuikula.1987. The values of waiting time, travel time, and a seat on a bus. Rand J. Econom.18 (1).40-56.
[71]Eranki, A. A model to create bus timetables to attain maximum synchronization considering waiting times at transfer stops [D].Department of Industrial and Management Systems Engineering, University of South Florida,2004:33-53
[72]张铭,徐瑞华.轨道交通网络列车衔接组织的递阶协调优化[J].系统工程.2007,25(9)：33-37
[73]周艳芳,周磊山,乐逸祥.城市轨道网络换乘站列车衔接同步协调优化研究[J].铁道学报.2011,33(3)：9-16
[74]张铭.城市轨道交通网络化运营协调性模糊评价[J].交通信息与安 全.2010,3(28)：38-42
[75]Chung Min Kwan, Chang C S. Timetable Synchronization of Mass Rapid Transit System Using Multi-objective Evolutionary Approach [J]. IEEE Transactions on Systems, Man, and Cybernetics Part C:Applications and Reviews,2008,38(5):636-648.
[76]ZHAO Fang, ZENG Xiao-gang. Optimization of Transit Route Network, vehicle Headways and Timetables for Large-Scale Transit Networks [J]. European Journal of Operational Research.2008,186(2):841-855
[77]VANST EENWEGEN P, VAN Oudheusden D. Decreasing the Passenger Waiting Time for an Intercity Rail Network[J].Transportation Research Part B.2007,41(4):478-492.
[78]Yuval Hadas, Avishai Ceder. Public Transit Simulation Model for Optimal Sy-nchronized Transfers [J].Transportation Research Record:Journal of the Transport ation Research Board.2008,2063:52-59.
[79]Dusan Teodoro, Panta Lui. Schedule Synchronization in Public Transit Using the Fuzzy Ant System [J].Transportation Planning and Technology.2005,28(1):47-76.
[80]Ceder, A., Tal, O.Designing synchronization into bus timetables. Transportation Research Record [J]:Journal of the Transportation Research Board.2001,1760:28-33.
[81]Rachel C. W.Wong, Tony W. Y. Yuen, Kwok Wah Fung, Janny M. Y. Leung [J]. Optimizing Timetable Synchronization for Rail Mass Transit. Transportation Science.2008,42:57-69.
[82]季令,张国宝.城市轨道交通运行组织[M].北京：中国铁道出版社,1998：38-48
[83]朱光正.列车由车辆段往返正线的接发车能力分析[J].铁路通信信号工程技术,2007,4(1)：41-42
[84]Andrea D'Ariano, Dario Pacciarelli, Marco Pranzo.A branch and bound algorithm for scheduling trains in a railway network [J]. European Journal of Operational Research.2007,183:643-657
[85]Senzana M. Heuristic Approach to train Rescheduling[J].Yugoslav Journal of Operation:Research.2007,17:9-29
[86]Zwaneveld P.J. Routing trains through railway stations:Model formulation and algorithms[J].Transportation Science.1996,30(3):181-194
[87]Alberto Caprara, Michele Monaci, Paolo Toth. A Lagrangian heuristic algorithm for a realworld train timetabling problem [J]. Discrete Applied Mathematics. 2006,154(5):738-753
[88]Yu Cheng. Hybrid simulation for resolving resource conflicts in train traffic rescheduling [J].Computers in Industry.1998,35(3):233-246
[89]Van Der Touw J, Veevers A. A dynamic programming method for matching rail-track monitoring data [J]. The journal ofthe Operational Research Society. 2003,54(11):1148-1154
[90]孙焰.单线列车运行图优化理论及计算机编制方法[D].长沙：长沙铁道学院.1997
[91]彭其渊,杨明伦,倪少权.单线区段货物列车始发方案的优化模型及求解方法[J].西南交通大学学报.1995,30(2)：177-181
[92]王凌.智能优化算法及其应用[M].北京：清华大学出版社.2001：135-176
[93]李素莹,陈光华,车永兵.上海轨道交通1号线开行大小交路运行方案的实践[J].城市轨道交通研究.2007,1(1)：50-53.
[94]沈荣芳.运筹学高级教程[M].北京：高等教育出版社,2008：148-181.
[95]王粉线,汪履直.城市轨道交通车辆段出入段线的设置[J].现代城市轨道交通.2006,(2)：36-37
[96]杨洪.浅谈城市轨道交通的配线设置[J].西铁科技.2009,(2)：41-42
[97]朱光正.列车由车辆段往返正线的接发车能力分析[J].铁路通信信号工程技术,2007,4(1)：41-42
[98]孙焰,李致中.列车运行图的均衡性标准[J].长沙铁道学院学报.1993,11(2)：63-68.
[99]史峰,胡安洲.机车周转图的线性配置算法[J].铁道学报.1996,8(4)：18-24
[100]张铭,杜世敏.基于递阶偏好的轨道交通网络化运营换乘协调优化[J].铁道学报.2009,31(6)：9-14
[101]林锉云,董加礼.多目标优化的方法与理论[J].长春：吉林教育出版社,1992：55-80
[102]王凌,郑大钟.邻域搜索算法的统一结构和混合优化策略[J].清华大学学报(自然科学版.2000,40(9)：125-128
[103]汪应洛.系统工程理论、方法与应用(第二版)[M].北京：高等教育出版社.1998,5：25-76
[104]陈树勋.工程大系统设计的普遍型分解协调优化[J].中国机械工程(自然科学版).1997,7：799-803
[105]金福才.多目标优化列车运行调整理论与方法研究[D].北京：北京交通大学.2004：26-76
[106]谢金星,薛毅.优化建模与LINDO/LINGO软件[M].北京：清华大学出版社.2005：45-142
[107]Petresom E. R. An Introduction to Computer-Assisted Train Dispatch [J]. Advanced Transportation.1986,20(1):63-72
[108]Stephen G. Ritchie. A Knowledge-based Decision Support Architecture for Advanced Traffic Management [J]. Transportion Research.1990(24):27-37
[109]Yu-Hem Chang, et al., A Multi-objective Model for Passenger Train Services Planning: Application to TaiWan's High Speed Rail Line [J], Transpn. Res.2000,34:91-106
[110]Samer S. Saab, Senior Member. Compensation of Axle-Generator Errors Due to Wheel Slip and Slide [J]. IEEE TRANS ACIONS ON VEHICULAR TECHNOLOGY.2002,5:9-16
[111]郑莉,董渊,张瑞丰.C++语言程序设计[M].第3版.北京：清华大学出版社,2003.12：3-39
[112]C. V. A. Benedetto., M. Monica. Train Position and Speed Estimation Using Wheel Velocity measurements [J]. Journal of Rail and Rapid Transit.2002:15-25
[113]J. Thayer, J. Herzog, J. Guttman, Strand spaces:1998 IEEE Sympisium on Security and Privacy, Why is a security protocol correct [J]. In:Proceeding of IEEE Computer Society Press,1998:160-171
[114]P. E. Hart, N. J. Nilsson, B. Raphael. A formal basis for the heuristic determination of minimum cost paths in graphs [J]. IEEE Trans. Syst. Sci.and Cybermetics, 1968,SSC-4(2):100-107
[115]O. Gulbrodsem. Optimal planning of marshalling yard by operation research [J]. PROC,1963:226-233
[116]R. S. McGaughey. Planning locomotive and car distribution [J]. Rail Int,1973:1213-1218
[117]M. H. Keaton. Designing Optimal Railroad Operating Plans:Lagrangian Relaxation and Heuristice Approaches[J].Trans.Res.(B),1989(23):443-452
[118]M. H. Keaton. Designing railroad operating plans:A dual adjustment method for implementing lagrangian relaxation [J]. Trans. Sci.(B),1992(26):263-279
[119]T. Crainic, J. Ferland and J. Rousseav. A trantical planning model for rail freight transportation [J].Tans.Sci.1984(18):165-183
[120]Belew R. Artificial Life:A Constructive Lower Bound for Artificial Intelligence [J]. IEEE Exper,1991,6(1):342-351
[121]Davis L.Genetic Algorithms and Simulated Annealing [M]. Pitman,1987:89-121
[122]Holland J H, Reitman. J. S. Cognitive Systems Based on Adaptive Algorithms [J]. Pattern Directed Inference Systems,New York:Academic Press,1978,7(2):99-112
[123]Janikow C Z. A Knowledge-Intensive Genetic Algorithm for Supervised Learning [J]. Machine Learning,1993,13(2):23-40
[124]Wong Rachel C W, Yuen Tony W Y, Fung Kwok Wah, et al. Optimizing timetable synchronization for rail mass transit [J]. Transportation Science,2008,42(1):57-65
[125]Peeters Marc, Kroon Leo. Circulation of railway rolling stock:a branch and price approach [J]. Computer & Operations Research,2008,35(2):538-547
[126]Kroon Leo.Stochastic improvement of cyclic railway timetables [J]. Transportation Research Part B:Methodological,2008,42(6):553-562
[127]贺协腾.基于开行方案的动车组运用仿真研究[D].北京交通大学.2010：23-56
[128]赵鹏,富井规雄.动车组运用计划及其编制算法[J].铁道学报.2003,25(3)：1-7
[129]甘应爱,田丰,李维铮等.运筹学(第三版)[M].北京：清华大学出版社,2005：12-65
[130]符卓,肖雁.求指派问题多重最优解的分枝定界法[J].长沙铁道学院学报.2000,18(1)：69-72.
[131]石雨.客运专线列车运行调整的策略、模型与算法[D]北京交通大学.2010：23-54
[132]王慧妮.客运专线列车运行调整模型及算法研究[D].西南交通大学.2006：32-67
[133]黎新华.单线区段列车运行图铺划与运行调整优化方法研究[D].中南大学.2005：34-54
[134]聂磊.高速铁路列车运行调整优化理论与方法[D].北京：北京交通大学.2000：21-54
[135]青学江,马国忠.遗传算法在区段站到发线的应用研究[J].西南交通大学学报,1998,33(4)：387-392
[136]王正彬,杜文.铁路技术站到发线运用调整模型及算法[J].西南交通大学学报,2006,41(2)：202-205
[137]谢楚农,黎新华.铁路客运站到发线运用优化研究[J].中国铁道科学,2004,25(5)：130-133
[138]吕红霞.铁路大型客运站作业计划智能编制的优化技术和方法研究[D].成都：西南交通大学.2008：42-76
[139](意)Marco Dorige,(德)Thomas Stutzle著.张军,胡晓敏,罗旭跃等译.蚁群优化[M].清华大学出版社.2007：25-42
[140]Ismail Sahim. Railway Traffic Control and Train Scheduling based on Inter-train Conflict Management [J]. Transpn. Res.B.1999.33:511-534
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |