铁路区域路网车流组织优化及调整研究
|
摘要
随着全球经济的快速发展,各个领域的交流活动也愈加频繁,最为突出的是区域间物资的流通。当今的运输组织方式主要包括铁路、水路、公路、航空和管道,它们相互交叉和渗透又形成了多式联运方式。即使如此,每种运输方式都存在从物资集中进而转变为物流的过程。铁路运输调度是铁路日常运输组织的指挥中枢,担负着组织客货运输、保证国家重点运输等的运输安全和服务质量及的重要责任。我国铁路管理体制的改革—撤销分局,同时随着DMIS、TMIS的应用以及新一代CTC技术的出现,都使得现行铁路局调度所直接指挥行车的区域扩大,调度更加集中,调度员管理区段的能力扩大。因此,调度的合理分工与调整为实际生产所需要。
铁路车流组织与调整是铁路运输组织工作的基础。其中,车流组织指按照各种要求,如线路通过能力和车站能力限制等,将全路的运用车进行整理和组合,并形成指导日常运输和生产的列车编组计划,其优化包括车流路径选择优化和列车编组计划优化,它们都属于组合优化研究的范畴。而车流调整通过合理的车流预测、推算、组织,防止区间通过能力浪费和线路、车站阶段性堵塞。
随着铁路市场化经营的深入发展,车流不均衡现象日趋明显,影响波及范围越来越大,其调整难度也相应增大。为适应不均衡车流的运输环境,需要重新定位车流调整的思路和方法,并据此采取相关的调整措施提高应变能力,快速消除不均衡影响,保持运输相对稳定的动态均衡,实现运输整体效能的最大化,这已成为铁路调度集中整合后,调度系统人员亟待解决的问题。
目前,车流的优化组织与调整研究已经取得一些成果,但对二者的整体考虑综合优化尚缺少关注。本论文在借鉴国内外研究成果的基础上,密切结合我国铁路运输组织特点,重点研究区域路网车流组织与调整的协调,提出了具有实际应用价值的,能实现动态车流优化的模型与方法,从而为我国铁路车流组织问题的深入研究奠定了理论基础。
论文的主要研究工作体现在以下几个方面：
1、根据铁路货物运输递进的关系,比较系统地分析了货流、车流和列流的形成以及三者之间的内在联系。
2、在分析了车流径路确定和编组计划编制的基础上,以始发车流和技术车流在站的集结消耗、改编消耗和装卸费用以及在线路运行费用总和最小为目标函数,考虑线路通过能力约束和车站的改编能力约束,建立区域路网车流组织优化模型,该模型可以确定列车编组计划与车流径路选择。
3、在介绍铁路运输调整的产生、意义、原则、分类和方法的基础上,以重空车流输送的总费用最小为目标,遵循车流不拆分以及车流接续归并原则,同时考虑线路能力限制,综合重车输送和多品类多车种的空车调配,构建协同优化模型。该模型克服了传统重车输送优化和空车调配优化相分离的缺陷；车流不可拆分约束使模型更切合我国车流组织的要求；模型考虑货物品类对车种的关联参数,使空车使用更加细化,即只有适合货种的空车才能调配,调配结果更符合实际。
4、在构建时空网络的基础上,构建了区域路网车流组织和车流调整的整体优化模型SOMCOR。模型的求解针对其结构特点,利用松弛机车流量变量的整数约束为非负约束得到模型SOMCOR*,同时根据模型SOMCOR决策变量的类型(整数型或实数型)分解为两个子问题,车流优化组织模型OMCO,追求机车费用最小；车流优化调整模型OMCR,追求重车和空车调整费用最小。两个子问题的最优解构成了SOMCOR最优解的上界。而松弛问题SOMCOR*得到的最优解又构成了SOMCOR最优解的下界,上下界一起共同限定了SOMCOR问题的最优解的范围。
5、设计了求解区域路网车流组织与调整综合优化模型的蚁群算法,通过对成都铁路局路网大量车流数据进行测试,表明该算法能够在较短的时间内对车流优化调整,充分验证了模型和算法的有效性和实用性。
With the fast development of global economy, exchange activity is developed synchronously in each field. The most outstanding one is the circulation of the goods and materials among areas. The current transportation mode mainly includes railway, waterway, highway, aviation and pipeline, which has formed multimodal transportation through crossing and permeating with each other. However, no matter which kind of transportation, it includes the process of gathering goods and turning into logistics. Railway transport dispatch is the conductor centre of daily transportation organization, which is responsible for organizing passenger-cargo transportation, guarantying the state transports safety, improving the service quality. With the cancelation of the railway branch office,the application of DMIS,TMIS and the appearance of new generation CTC technology, the current railway bureau deployment command area has been much more widened and concentrated, which also allowed the enlargement of the dispatch conductor managing ability. Therefore, the actual produce requires the proper division and regulation of labor work.
Organization and adjustment of railway wagon flow are the foundation of the transportation organization work. Railway wagon flow organization refers to that according to the requirements of, such as line capacity and station capacity limitation, they can organize and compose all the cars and form the train marshalling plan to direct daily transportation and production. The optimization contains wagon flow trace and train marshalling plan optimization, which both belong to the combination optimization research area. Adjustment of railway wagon flow can prevent capacity waste, period olocking of line and station by forecasting, calculating and organizing.
As the deep development of railway mercerization, the wagon flow unbalance is oeeoming obvious, which influences wildly and is much harder to adjust. To adapt to the unbalance wagon flow transportation environment, the thoughts and methods of the wagon flow adjustment must be changed. We must take certain methods to improve the strain capacity, quickly easer the influence of unbalance and keep a dynamic balance of auportation to maximize the whole transportation utility. This has been the most urgent problem for the dispatch conductor to solve after the concentration of railway deployment system.
Optimization of wagon flow and organization has made an achievement. But the whole integration of two still need more research. In this dissertation, on the basis of research results at home and abroad, we considered the features of the railway transportation in China and did research on coordination between the sector railway wagon flow organization and adjustment. Here we proposed some methods and models to optimize dynamic wagon flow with practical application value, by which we hope to establish theory foundation for deep research of wagon flow in our nation.
The main research work of the dissertation includes the following several respects:
1. Considering the progressive relation of railway freight transportation, the flow of goods, wagon and train and the inner link between them has been analyzed systematically.
2. By analyzing the determination of wagon flow routing and the compiling of formation plan, aimed at minimizing the cost of aggregation and line operation, a comprehensive optimization model of regional-network train organization has been formulated, which can help the determination of formation plan and the choice of train routing.
3.Based on the emergence, significance, principle, classification and method of transportation adjustment, according to the principle of non-division and flow connection together with the constrain of line capacity, a collaborative optimization model of loaded and empty wagon flow been formulated aiming at minimizing the total cost of empty and loaded wagon transportation. It overcame the defect of separation between the loaded and empty wagon flow transportation in traditional way, met the wagon organization requirement of our nation with non-division principle and arrived at a more concrete allocation scheme by taking the related parameters between the category of goods and wagon into consideration, which determined that the empty wagon could be allocated only when there were suitable goods.
4. On the basis of constructing the space-time network, the global optimization models of regional network wagon flow organization and adjustment named SOMCOR has been formulated. Following the structure feature, the solution to the model uses the integer constraint of slack variable of locomotive as the nonnegative constraint to get the model SOMCOR*. Meanwhile, it divided into two sub problems depending on the type of decision variable. The one was wagon flow organization optimization model named OMCO whose objective was the minimum cost of locomotive. The other one was wagon flow adjustment optimization model named OMCR which aimed at the minimum cost of empty and loaded wagon flow adjustment. The optimal solution to the two sub problems formed the upper bound of optimal solution of SOMCOR while the optimal solution to SOMCOR*as the lower bound. As a result, the upper and lower bound determined the range of optimal solution of SOMCOR.
5. A designed ant colony algorithm was applied to the solution to the comprehensive optimization model. Testing by the data from Chengdu Railway Bureau, it was proved that the algorithm could adjust wagon flow in a short time, which well demonstrated its availability and practicality.
铁路车流组织与调整是铁路运输组织工作的基础。其中,车流组织指按照各种要求,如线路通过能力和车站能力限制等,将全路的运用车进行整理和组合,并形成指导日常运输和生产的列车编组计划,其优化包括车流路径选择优化和列车编组计划优化,它们都属于组合优化研究的范畴。而车流调整通过合理的车流预测、推算、组织,防止区间通过能力浪费和线路、车站阶段性堵塞。
随着铁路市场化经营的深入发展,车流不均衡现象日趋明显,影响波及范围越来越大,其调整难度也相应增大。为适应不均衡车流的运输环境,需要重新定位车流调整的思路和方法,并据此采取相关的调整措施提高应变能力,快速消除不均衡影响,保持运输相对稳定的动态均衡,实现运输整体效能的最大化,这已成为铁路调度集中整合后,调度系统人员亟待解决的问题。
目前,车流的优化组织与调整研究已经取得一些成果,但对二者的整体考虑综合优化尚缺少关注。本论文在借鉴国内外研究成果的基础上,密切结合我国铁路运输组织特点,重点研究区域路网车流组织与调整的协调,提出了具有实际应用价值的,能实现动态车流优化的模型与方法,从而为我国铁路车流组织问题的深入研究奠定了理论基础。
论文的主要研究工作体现在以下几个方面：
1、根据铁路货物运输递进的关系,比较系统地分析了货流、车流和列流的形成以及三者之间的内在联系。
2、在分析了车流径路确定和编组计划编制的基础上,以始发车流和技术车流在站的集结消耗、改编消耗和装卸费用以及在线路运行费用总和最小为目标函数,考虑线路通过能力约束和车站的改编能力约束,建立区域路网车流组织优化模型,该模型可以确定列车编组计划与车流径路选择。
3、在介绍铁路运输调整的产生、意义、原则、分类和方法的基础上,以重空车流输送的总费用最小为目标,遵循车流不拆分以及车流接续归并原则,同时考虑线路能力限制,综合重车输送和多品类多车种的空车调配,构建协同优化模型。该模型克服了传统重车输送优化和空车调配优化相分离的缺陷；车流不可拆分约束使模型更切合我国车流组织的要求；模型考虑货物品类对车种的关联参数,使空车使用更加细化,即只有适合货种的空车才能调配,调配结果更符合实际。
4、在构建时空网络的基础上,构建了区域路网车流组织和车流调整的整体优化模型SOMCOR。模型的求解针对其结构特点,利用松弛机车流量变量的整数约束为非负约束得到模型SOMCOR*,同时根据模型SOMCOR决策变量的类型(整数型或实数型)分解为两个子问题,车流优化组织模型OMCO,追求机车费用最小；车流优化调整模型OMCR,追求重车和空车调整费用最小。两个子问题的最优解构成了SOMCOR最优解的上界。而松弛问题SOMCOR*得到的最优解又构成了SOMCOR最优解的下界,上下界一起共同限定了SOMCOR问题的最优解的范围。
5、设计了求解区域路网车流组织与调整综合优化模型的蚁群算法,通过对成都铁路局路网大量车流数据进行测试,表明该算法能够在较短的时间内对车流优化调整,充分验证了模型和算法的有效性和实用性。
With the fast development of global economy, exchange activity is developed synchronously in each field. The most outstanding one is the circulation of the goods and materials among areas. The current transportation mode mainly includes railway, waterway, highway, aviation and pipeline, which has formed multimodal transportation through crossing and permeating with each other. However, no matter which kind of transportation, it includes the process of gathering goods and turning into logistics. Railway transport dispatch is the conductor centre of daily transportation organization, which is responsible for organizing passenger-cargo transportation, guarantying the state transports safety, improving the service quality. With the cancelation of the railway branch office,the application of DMIS,TMIS and the appearance of new generation CTC technology, the current railway bureau deployment command area has been much more widened and concentrated, which also allowed the enlargement of the dispatch conductor managing ability. Therefore, the actual produce requires the proper division and regulation of labor work.
Organization and adjustment of railway wagon flow are the foundation of the transportation organization work. Railway wagon flow organization refers to that according to the requirements of, such as line capacity and station capacity limitation, they can organize and compose all the cars and form the train marshalling plan to direct daily transportation and production. The optimization contains wagon flow trace and train marshalling plan optimization, which both belong to the combination optimization research area. Adjustment of railway wagon flow can prevent capacity waste, period olocking of line and station by forecasting, calculating and organizing.
As the deep development of railway mercerization, the wagon flow unbalance is oeeoming obvious, which influences wildly and is much harder to adjust. To adapt to the unbalance wagon flow transportation environment, the thoughts and methods of the wagon flow adjustment must be changed. We must take certain methods to improve the strain capacity, quickly easer the influence of unbalance and keep a dynamic balance of auportation to maximize the whole transportation utility. This has been the most urgent problem for the dispatch conductor to solve after the concentration of railway deployment system.
Optimization of wagon flow and organization has made an achievement. But the whole integration of two still need more research. In this dissertation, on the basis of research results at home and abroad, we considered the features of the railway transportation in China and did research on coordination between the sector railway wagon flow organization and adjustment. Here we proposed some methods and models to optimize dynamic wagon flow with practical application value, by which we hope to establish theory foundation for deep research of wagon flow in our nation.
The main research work of the dissertation includes the following several respects:
1. Considering the progressive relation of railway freight transportation, the flow of goods, wagon and train and the inner link between them has been analyzed systematically.
2. By analyzing the determination of wagon flow routing and the compiling of formation plan, aimed at minimizing the cost of aggregation and line operation, a comprehensive optimization model of regional-network train organization has been formulated, which can help the determination of formation plan and the choice of train routing.
3.Based on the emergence, significance, principle, classification and method of transportation adjustment, according to the principle of non-division and flow connection together with the constrain of line capacity, a collaborative optimization model of loaded and empty wagon flow been formulated aiming at minimizing the total cost of empty and loaded wagon transportation. It overcame the defect of separation between the loaded and empty wagon flow transportation in traditional way, met the wagon organization requirement of our nation with non-division principle and arrived at a more concrete allocation scheme by taking the related parameters between the category of goods and wagon into consideration, which determined that the empty wagon could be allocated only when there were suitable goods.
4. On the basis of constructing the space-time network, the global optimization models of regional network wagon flow organization and adjustment named SOMCOR has been formulated. Following the structure feature, the solution to the model uses the integer constraint of slack variable of locomotive as the nonnegative constraint to get the model SOMCOR*. Meanwhile, it divided into two sub problems depending on the type of decision variable. The one was wagon flow organization optimization model named OMCO whose objective was the minimum cost of locomotive. The other one was wagon flow adjustment optimization model named OMCR which aimed at the minimum cost of empty and loaded wagon flow adjustment. The optimal solution to the two sub problems formed the upper bound of optimal solution of SOMCOR while the optimal solution to SOMCOR*as the lower bound. As a result, the upper and lower bound determined the range of optimal solution of SOMCOR.
5. A designed ant colony algorithm was applied to the solution to the comprehensive optimization model. Testing by the data from Chengdu Railway Bureau, it was proved that the algorithm could adjust wagon flow in a short time, which well demonstrated its availability and practicality.
引文
[1]俞刚等.美国铁路调度集中系统对我国铁路发展CTC的启示[J].中国铁路,2005：19-22.
[2]张骥翼,杨宏图.从日本铁路看中国铁路客运专线运营调度系统的建设[J].铁道运输与经济,2006,28(9)：29-34.
[3]史文胜,吴江娇.我国铁路调度集中系统的现状与发展策略[J].铁道运输与经济,2004,26(6)：42-44.
[4]张锡第.国外铁路调度指挥系统现状[J].中国铁路,1995,7：37-41.
[5]曲思源.不均衡条件下车流调整的优化[J].铁道运输与经济,2006,29(2)：42-43.
[6]卢新明,郑时德.求解路网上车流径路的启发式算法[J].北方交通大学学报,1993,3：250-255
[7]高旭敏,周潮,顾炎.铁路网货车车流径路分配的优化模型及算法[J].铁道学报.1992,14(4)：43-48
[8]高旭敏,顾炎.铁路网货流分配的优化模型的D-GUB算法[J].铁道学报.1995,17(4)：1-7
[9]高旭敏,顾炎.铁路网货流分配的线性0-1规划模型[J].铁道运输与经济,1996,4：31-33
[10]林柏梁.车流运行径路与列车编组计划的整体优化模型及模拟退火算法[D].西南交通大学博士学位论文.1994：11-91
[11]林柏梁,彭辉,任保国.铁路网上带权重的车流径路优化方法[J].北方交通大学学报.1996,20(6)：645-650
[12]林柏梁,朱松年.路网上车流径路与列车编组计划的整体优化[J].铁道学报.1996,18(1)：1-7
[13]林柏梁.直达与区段列车编组计划及车流径路的整体优化方法[J].铁道学报.1996,18(5)：1-7
[14]林柏梁,朱松年,陈竹生等.路网上车流径路优化的0-1规划模型及其合理径路集生成集法[J].铁道学报.1997,19(1)：7-12
[15]施其洲.铁路网络系统运输能力与车流路径模型[J].铁道学报.1996,18(4)：1-8
[16]施其洲,施勇.具有双向、空重车流的路网车流径路多目标线性规划模型及算法[J].铁道学报.1999,21(1)：1-8
[17]施勇,施其洲.铁路网双向空重车流径路的多目标决策模型[J].上海铁道大学学报,1998,19(3)：74-78
[18]张志斌,张喜.铁路网规划中车流配流方法的研究及实现[J].铁路计算机应用, 1998,7(1)：6-8
[19]李致中,史峰.路网上无约束单组列车编组优化方法[J].铁道学报,1988,10(3)：29-35
[20]史峰.直线方向无约束单组列车编组方案的最优化研究[J].铁道学报,1988,10(2)：51-65
[21]史峰,李致中.路网上技术站多种能力约束下的单组列车编组的网络方法[J].铁道学报,1990,12(4)：51-55
[22]史峰,李致中.铁路车流路径的优选算法[J].铁道学报.1993,15(3)：70-76
[23]史峰,李致中,孙焰,胡建华.列车编组计划网络优化方法[J].铁道学报,1994,16(2)：74-79
[24]史峰,孔庆铃,胡安洲.车流径路与编组计划综合优化的网络方法[J].铁道学报.1997,19(1)：1-6
[25]史峰,黎新华,莫辉辉等.铁路OD分配优化方法[J].中国铁道科学,2004,25(4)：116-119
[26]卢新明,郑时德.求解路网上车流径路的启发式算法[J].北方交通大学学报.1993,17(8)：250-255
[27]王甦男,宋伟,姜文生.最短路径算法的比较[J].系统工程与电子技术,1994,5：43-49
[28]王甦男,冯育麒.车流径路域研究[J].铁道学报.1996,18(增刊)：20-24
[29]孙晚华,郑时德.铁路车流径路优化算法的研究[J].北方交通大学学报.1995,19(增刊)：39-44
[30]孙晚华,张永臣.确定车流最短径路的CN模型及算法[J].铁道学报.1999,21(5)：106-108
[31]胡思继,王苏男,李菊,张晓霖.关于特定径路准编译系统的研究[J].北方交通大学学报.1996,20(2)：226-229
[32]周经伦,吴唤群.受顶点数限制的最短路问题及其算法[J].系统工程,1996,14(5)：37-44
[33]姜志康等.车流径路选择的模糊0-1规划方法[J].模糊集理论及应用,1996,5：393-396
[34]查伟雄,秦作睿.路网上车流径路最优配流法[J].北方交通大学学报.1997,21(3)：259-263
[35]李引珍,顾守淮.铁路网络两顶点间最短路径定向搜索算法[J].铁道学报.1997,19(2)：25-27
[36]李引珍.路网上货运路径的计算[J].铁道学报.1997,19(3)：14-18
[37]李引珍.不确定环境下交通运输网络路径求解方法及应用研究[D].成都：西南交通大学博士学位论文.2005
[38]李邦义,何勇,姚恩瑜.点带约束成本的最短路问题[J].高校应用数学学报A辑,2000,15(1)：93-96
[39]李帮义,姚恩瑜.关于最短路问题的一个双目标优化问题[J].运筹学学报,2001,4：68-71
[40]王刊良,徐寅峰.相异路径选线问题的一种模型与算法[J].系统工程理论方法应用,2001,1：8-12
[41]周培德.交通道路网中任意两点之间最短路径的决速算法[J].计算机工程与科学.2002,24(4)：35-37
[42]谭国珍,高文.时间依赖的网络中最小时间路径算法[J].计算机学报,2002,2：1-6
[43]于立勇,李曙光.一类双约束最短路问题的近似算法[J].山东大学学报,2002(4)：304-311
[44]齐东元等.点边带约束成本的最短路问题及其算法[J].东南大学学报,2003(1)：112-114
[45]谭国真,柳亚玲,高文.随机时间依赖网络的K期望最短路径[J].计算机学报,2003,3：324-331
[46]江南.论铁路车流径路数学问题[J].中国铁道科学.2004,25(5)：121-124
[47]张波.模拟退火算法在路径优化问题中的应用[J].中国公路学报.2004,17(1)：79-81
[48]杨群等.基于合理多路径的路径选择方法的研究[J].管理工程学报,2004,(4)：42-45
[49]靳来勇,叶玉玲,赵永旭,何静.区域性路网车流径路的选择[J].中国铁路.2005,12：49-51
[50]杜进有,姚新胜,黄洪钟.路网车流径路的满意优化[J].系统工程,2005,23(9)：46-49
[51]张运河,林柏梁,梁栋,高红艳.优化多式联运问题的一种广义最短路方法研究[J].铁道学报.2006,28(4)：23-26
[52]成惠,张修如.铁路运输特定经路算法的研究与实现[J].计算机技术与发展.2007,17(3)：239-241
[53]农静,季令,叶玉玲,刘志杰.铁路车流径路优化分布式算法[J].中国铁道科学.2008,29(3).115-121
[54]苏顺虎,陈治亚.铁路网车流径路优化模型及算法研究[J].铁道学报.2008,30(6)：1-6
[55]孟凡江,高树喜,杨新安,王瑶.多路径分配的车流径路优化模型[J].辽宁工程技术大学学报,2008,27：93-95
[56]曹学明,王喜富,林柏梁.重空车流径路及多车种空车调配协同优化模型[J]. 中国铁道科学.2009,30(6)：114-118
[57]谢金梅,徐慧星.车流径路及车流组号划分算法的研究[J].铁道运营技术.2009,15(3)：18-21
[58]彭娟娟.铁路车流组织问题优化[J].交通科技与经济.2009,(6)：26-31
[59]钱名军.车流组号算法[J].兰州交通大学学报,2010,29(1)：62-65
[60]农静,王磊,尹慧琳.铁路车流径路优化的遗传算法设计[J].同济大学学报(自然科学版).2010,38(1)：77-80
[61]彭其渊,文超,闫海峰.提速战略对我国铁路运输发展的带动作用[J].西南交通大学学报,2008,43(6)：685-691.
[62]刘立检.路企直通运输在湘钢专用铁道的运用与思考[J].中国铁路,2008,8：29-32.
[63]技术计划编写组.铁路运输工作技术计划[M].北京：中国铁道出版社,1977
[64]B.N.巴利奇等.铁路运输调整[M].北京：中国铁道出版社,1992
[65]胡思继.铁路行车组织[M].北京：中国铁道出版社,1998.
[66]郑时德.吴汉琳.铁路行车组织第二版[M].北京：中国铁道出版社.1999
[67]交通运输智能化编写组.新世纪铁路、公路、水运、航空、城市交通运输智能化全书(上)[M].北京：清华大学出版社,2001
[68]交通运输智能化编写组.新世纪铁路、公路、水运、航空、城市交通运输智能化全书(中)[M].北京：清华大学出版社,2001
[69]交通运输智能化编写组.新世纪铁路、公路、水运、航空、城市交通运输智能化全书(下)[M].北京：清华大学出版社,2001
[70]沈庆衍主编；中国铁道百科全书总编委员会《运输与经济》编辑委员会编.中国铁道百科全书-运输与经济卷[M].北京：中国铁道出版社,2001
[71]宋建业,谢金宝.铁路运输调度指挥与统计分析[M].北京：中国铁道出版社,2006.
[72]杨浩.铁路运输组织学[M].北京：中国铁道出版社,2006
[73]彭其渊,王慈光.铁路行车组织[M].北京：中国铁道出版社,2007
[74]杜艳平.智能车流动态预测理论及方法[M].北京：中国铁道出版社,2009
[75]苗邦均,李致中.技术直达列车最优方案的算法[J].铁道运输与经济论文集,中国铁道出版社,1979：139-161
[76]芮惟铭.铁路运输网技术站车流组织问题的0-1规划数学模型[J].铁道运输与经济论文集,中国铁道出版社,1979：101-110
[77]韩锋.制定列车编组计划的整数规划方法[J].数学实践与认识,1982,2：1-13
[78]郑时德.制定技术站列车编组计划的0-1规划法[J].铁道学报.1985,7(3)：56-65
[79]郑时德.制定技术站列车编组计划的0-1规划法[J].北方交通大学学报.1985,1：24-31
[80]朱松年.列车编组计划的二次0-1规划模型及其解法[J].西南交通大学学报.1986年增刊,65-72
[81]雷广萍,袁威.直线方向单组列车编组优化的压缩分枝定界法[J].铁道学报,1989,11(1)：26-38
[82]赵瑜,郑时德.路网上车流组织优化与调整[J].北方交通大学学报,1990,14(4)：74-80
[83]曹家明,朱松年.铁路网上技术直达列车编组计划优化的二次0-1规划法[J].铁道学报.1993,15(2)：65-72
[84]查伟雄,黄孝章,秦作睿.直线方向列车编组计划有利去向模型及其多项式算法[J].铁道学报.1996.20(6)：641-644
[85]查伟雄,秦作睿.路网上列车编组计划的有利去向模型及其网络流算法[J].铁道学报.1998,20(2)：12-19
[86]李映红,吴世贵,彭其渊.货物列车编组计划网络模型的建立及算法[J].西南交通大学学报,2002,37(1)：68-71
[87]M.Frank, P.Wolfe.An Algorithm for Quadratic Programming [J].Naval Res. Logist. Quart.1956,3:95-110.
[88]W.W.White, A.M.Bomerault.A Network Algorithm for Empty Freight Car Allocation [J].IBM.Syst.J.1969,8:147-169.
[89]S.Gorenstein, S.Poley, W.W.White. On the Scheduling of the Railroad Freight Operations [R]. IBM Data Processing Report, Technical Report 320-2999, IBM, Philadelphia Scientific Center,1971.
[90]S.C.Misra.Linear Programming of Empty Wagon Disposition [J].Rail Int.,1972, 3:151-158.
[91]G.P.Ouimet.Empty Freight Car Distribution[D].Queen's University, Kingston, Ontario, Canada,1972.
[92]H.Herren. The Distribution of Empty Wagons by Means of Computer:An Analytical Model of the Swiss Federal Railways [J].Rail.Int.1973,4:1005-1010.
[93]L.R.Ford, D.R.Fulkerson. Flows in Networks[M].Princeton University Press, Princeton, N.J.,1974.
[94]V.B.Mendiratta.A Dynamic Optimization Model of the Empty Car Distribution Porcess [D]. Northwestern University,Evanston,Illinois,1981.
[95]V.B Mendiratta, M.A.Turnquist.A Model for Management of Empty Freight Cars [J]. Transportation Research Record 1982,838:50-55.
[96]W.C.Jordan.The Impact of Uncertain Demand and Supply on Empty Railroad Car Distribution [D] University.Ithaca.New York,1982.
[97]W.C.Jordan, M.A.Turnquist. A Stochastic Dynamic Network Model for Railroad Car Distribution [J]. Trans.Sci.1983,17(2):123-145.
[98]Jordan WC and Turnquist MA.A stoehastic dynamic model for railroad car distribution [M]. Transportation Science,1983,17(2):123-145.
[99]L.L.Ratcliffe, B.Vinot, F.T.Sparrow.Optimal Prepositioning of Empty Freight Cars [J]. Simulation,1984,2:69-275.
[100]S.Kikuchi.Empty Freight Car Dispatching Model under Freight Car Pool Concept [J].Trans.Res.1985,19B(2):169-185.
[101]T.S.Glickman, H.D.Sherali.Large-Scale Network Distribution of Pooled Empty Freight Cars over Time, with Limited Substitution and Equitable Benefits [J].Trans.Res.1985,19B(2):85-94.
[102]Y.S.Shan.A Dynamic Multicommodity Network Flow Model for Real Optimal Rail Freight Car Management[D].Princeton University,Princeton,N.J.1985.
[103]M.T.Fernandes Grain,M.C.Fogliatti De Sinay.Optimal Distribution of Empty Railroad Cars[J].In Proceedings of the 1st International Congress in France of Industrial Engineering and Management, Cole Centrale de Paris, France,1986, 21-26.
[104]P.J.Dejax, T.G.Crainic.A Review of Empty Flows and Fleet Management Models in Freight Transportation [J].Trans.Sci.1987,21(4):227-247.
[105]A.E.Haghani.Rail Freight Transportation:A Review of Recent Optimization Models for Train Routing and Empty Car Distribution[J].Journal of Advanced Transportation,1987,21(2):147-172.
[106]G.J.Beaujon, M.A.Turnquist.A Model for Fleet Sizing and Vehicle Allocation [J].Trans. Sci.1991,25:19-45.
[107]M.Joborn.Empty Freight Car Distribution at Swedish Railways-Analysis and Optimization Modeling [D]. Department of Mathematics, Linkoping University, Sweden,1995.
[108]S.Spieckermann,S.Voss.A Case Study in Empty Railcar Distribution [J].Eur. J. Operational Res,1995,87:586-598
[109]B.E.Hoppe.Efficient Dynamic Network Flow Algorithm [D].Cornell University, 1995.
[110]H.D.Sherali, C.H.Tuncbilek.Static and Dynamic Time-Space Strategic Models and Algorithms for Multilevel Rail-Car Fleet Management[J].Management Sci, 1997.43:235-250.
[111]K.Holmberg, M.Joborn, J.T.Lundgren. Improved Empty Freight Car Distribution [J]. Trans. Sci,1998,32(2):163-173.
[112]J.F. Cordeau, P.Toth, D.Vigo. A Survey of Optimization Models for Train Routing and Scheduling [J].Trans. Sci.1998,32(4):380-404
[113]O.K.Kwon, C.D.Martland, J.M.Sussman. Routing and Scheduling Temporal and Heterogeneous Freight Car Traffic on Rail Networks [J].Trans.Res.1998,34E (2): 101-115.
[114]Ricardo Fukazawa, Mareus Vinicius Poggi de Aragao, Oscar Porto, Eduardo Uchoa. Solving the Freight Car Flow Problem to Optimality[J].Electronic Notes in Theoretical Computer Science,2002,66(6):1-11
[115]M.Joborn,T.G.Crainic,M.Gendreau,K.Holmberg,J.T.Lundgren.Economies of Scale in Empty Freight Car Distribution in Scheduled Railways[J].Trans.Sci,2004, 38(2):121-134.
[116]Joaquin Rodriguez. A constraint programming model for real-time train scheduling at junctions [J]. Transportation Research Part B:Methodological,2007, 41(2):231-245
[117]Kaj Holmberg, Martin Joborn, Kennet Melin.Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths[J].European Journal of Operational Research,2008,188 (1):101-108
[118]Mark Lawley, Vijay Parmeshwaran, Jean-Philippe Richard, Ayten Turkcan, Malay Dalai, David Ramcharan. A time-space scheduling model for optimizing recurring bulk railcar deliveries [J]. Transportation Research Part B,2008,42(5):438-454
[119]Shi Qiang Liu, Erhan Kozan. Scheduling trains as a blocking parallel-machine job shop scheduling problem[J].Computers & Operations Research,2009, 36(10):2840-2852
[120]Valentina Cacchiani, Alberto Caprara, Paolo Toth. Scheduling extra freight trains on railway networks[J].Transportation Research Part B,2010,44(2):215-231
[121]Francesco Corman, Andrea D'Ariano, Dario Pacciarelli, Marco Pranzo. A tabu search algorithm for rerouting trains during rail operations[J].Transportation Research Part B,2010,44(1):175-192
[122]刘梅林.用电子计算机进行铁路空车调配的探讨[J].铁道运输与经济,1987,6：29-32.
[123]汤代炎.空车调配方案的研究——匈牙利法的一个应用[J].长沙铁道学院学报,1990,9(4)：20-25.
[124]任民,王彦,杜文.空车调整最小费用的合理分摊[J].西南交通大学学报1998,33(2)：214-218.
[125]李文权,杜文.优化空车调配问题的数学模型[J].系统工程理论与实践,1998,10：1-5.
[126]林柏梁,胡安洲.重空车流运行组织的协同优化理论及模型[J].铁道学报,1998,20(5)：9-14.
[127]党建武.神经网络在铁路空车调度问题中的应用[J].兰州铁道学院学报,1999,18(1)：77-85.
[128]叶玉铃,季令.市场经济下空车流调整问题[J].上海交通大学学报.2000,34(增刊)：19-22
[129]纪嘉伦,林柏梁,李福志,果鹏文.用重心优化法求解铁路网上空车调配问题[J].铁道学报,2001,23(3)：109-113.
[130]果鹏文,林柏梁,余洋.大规模路网上空车调配的区段中心优化法[J].中国铁道科学,2001,22(2)：122-128.
[131]牛惠民,胡安洲.铁路枢纽车流组织的非线性0-1规划模型及算法[J].铁道学报,2001,23(3)：8-12.
[132]牛惠民.铁路枢纽重空车流组织的协调优化模型及遗传算法[J].铁道学报,2001,23(4)：12-16.
[133]王亚宁,张喜.铁路空车调整的算法模型及软件实现[J].研究与开发,2001,7：6-9.
[134]刘洪涛.技术计划空车调整的数学模型[J].TMIS工程,2002,10：29-31.
[135]熊红云,鲁五一,温红艳.铁路空车调配问题的遗传启发算法[J].中国铁道科学,2002,23(4)：118-121.
[136]果鹏文,褚江,林柏梁.用振荡法解大规模路网上的空车调配问题[J].中国铁道科学,2002,23(4)：111-117.
[137]张喜,张全寿.基于知识约束的空车调整优化方法研究[J].铁道学报,2003,25(6)：14-20.
[138]杜艳平,陈光伟.大规模路网上空车调整的分阶段优化模型[J].铁道运输与经济,2004,26(4)：59-62.
[139]李宗平.铁路货运空重车调整优化模型与算法研究[J].学术动态.2005.3：1-7
[140]李宗平.铁路货运空重车调整优化模型与算法研究-续[J].学术动态.2005.4：3-8
[141]梁栋,林柏梁,严贺祥,李俊卫.车种代用情况下的铁路空车调配研究[J].铁道学报,2005,27(4)：1-5.
[142]雷中林,何世伟,宋瑞,蔡靖.铁路空车调配问题的随机机会约束模型及遗传算法[J].铁道学报,2005,27(5)：1-5
[143]孙焰,姜磊.具有能力限制的路网重车流径路优化方法[J].铁道运输与经济,2005,25(12)：82-84
[144]纪丽君,林柏梁,乔国会.基于路网的多车种空车调配优化方案研究[J].铁道运输与经济,2008,30(7)：85-87
[145]林柏梁,熊天文,朱志国.给定调车线数量条件下的列车编组方案优化[J].中国铁道科学,1993,14(4)：23-31.
[146]林柏梁.具有非线性改编费用的列车编组计划优化[J].铁道学报,1996,18(增刊)：37-42.
[147]Dorigo M. Optimization, learning and natural algorithms[D].Department of Electronics, Politecnico di Milano, Italy,1992
[148]Colorni A, Dorigo M, Maniezzo V. An Investigation of some properties of an "Ant algorithm". Proceedings of the Parallel Problem Solving From Nature Conference (PPSN92). Brussels, Belgium:Elsevier Publishing,1992:509-520
[149]邢文训,谢金星.现代优化计算方法[M].北京：清华大出版社,2005
[150]杨丽锦.浅析蚁群算法的原理及应用方向[J].电脑知识与技术,2009,2(5)：1455-1456
[151]薛锋.编组站调度系统配流协同优化理论与方法研究[D].成都：西南交通大学博士学位论文,2009：134-135
[152]武交峰.应用遗传算法提高蚁群算法性能的研究[D].太原理工大学硕士学位论文.2007
[153]徐红梅.蚁群算法的改进及其在连续空间优化中的应用[D].烟台大学硕士学位论文.2008
[154]杨雅琪.可拓变换在蚁群算法参数选择中的应用[D].大连海事大学硕士学位论文.2008
[155]李金汉.蚁群优化算法及其应用研究[D].哈尔滨理工大学硕士学位论文.2008
[156]张喜.铁路空车调整综合优化模型与智能决策方法的研究[D].北京：北京交通大学博士学位论文,2004.
[157]孟繁臣.哈尔滨铁路局空车调整计划计算机编制方法研究[D].北京：北京交通大学博士学位论文,2004
[158]汪镭,吴启迪.蚁群算法在连续空间寻优问题求解中的应用[J].控制与决策,2003,18(1)：45-48.
[159]魏平,熊伟清.用于一般函数优化的蚁群算法[J].宁波大学学报,2001,14(4)：52-55
[160]詹士昌.蚁群算法及其在连续性空间优化问题中的应用.浙江大学硕士学位论文
[161]李士勇,陈永强,李研.蚁群算法及其应用[M].哈尔滨：哈尔滨工业大学出版社,2004
[162]陈峻,沈洁,秦玲等.基于分布均匀度的自适应蚁群算法[J].软件学报,2003,14(8)：1379-1387
[163]黄维.铁路货运站实行物流化运营的研究[D].成都：西南交通大学,2005
[164]铁道部统计中心.中华人民共和国铁道部2008年铁道统计公报[J].中国铁路,2009,6：3-9
[165]冯芬玲.铁路重载运输发展动因及组织策略研究[D].长沙：中南大学,2009
[166]孟繁臣.铁路车流结构分析与设计[J].铁道运输与经济,2009,8(31)：28-31
[2]张骥翼,杨宏图.从日本铁路看中国铁路客运专线运营调度系统的建设[J].铁道运输与经济,2006,28(9)：29-34.
[3]史文胜,吴江娇.我国铁路调度集中系统的现状与发展策略[J].铁道运输与经济,2004,26(6)：42-44.
[4]张锡第.国外铁路调度指挥系统现状[J].中国铁路,1995,7：37-41.
[5]曲思源.不均衡条件下车流调整的优化[J].铁道运输与经济,2006,29(2)：42-43.
[6]卢新明,郑时德.求解路网上车流径路的启发式算法[J].北方交通大学学报,1993,3：250-255
[7]高旭敏,周潮,顾炎.铁路网货车车流径路分配的优化模型及算法[J].铁道学报.1992,14(4)：43-48
[8]高旭敏,顾炎.铁路网货流分配的优化模型的D-GUB算法[J].铁道学报.1995,17(4)：1-7
[9]高旭敏,顾炎.铁路网货流分配的线性0-1规划模型[J].铁道运输与经济,1996,4：31-33
[10]林柏梁.车流运行径路与列车编组计划的整体优化模型及模拟退火算法[D].西南交通大学博士学位论文.1994：11-91
[11]林柏梁,彭辉,任保国.铁路网上带权重的车流径路优化方法[J].北方交通大学学报.1996,20(6)：645-650
[12]林柏梁,朱松年.路网上车流径路与列车编组计划的整体优化[J].铁道学报.1996,18(1)：1-7
[13]林柏梁.直达与区段列车编组计划及车流径路的整体优化方法[J].铁道学报.1996,18(5)：1-7
[14]林柏梁,朱松年,陈竹生等.路网上车流径路优化的0-1规划模型及其合理径路集生成集法[J].铁道学报.1997,19(1)：7-12
[15]施其洲.铁路网络系统运输能力与车流路径模型[J].铁道学报.1996,18(4)：1-8
[16]施其洲,施勇.具有双向、空重车流的路网车流径路多目标线性规划模型及算法[J].铁道学报.1999,21(1)：1-8
[17]施勇,施其洲.铁路网双向空重车流径路的多目标决策模型[J].上海铁道大学学报,1998,19(3)：74-78
[18]张志斌,张喜.铁路网规划中车流配流方法的研究及实现[J].铁路计算机应用, 1998,7(1)：6-8
[19]李致中,史峰.路网上无约束单组列车编组优化方法[J].铁道学报,1988,10(3)：29-35
[20]史峰.直线方向无约束单组列车编组方案的最优化研究[J].铁道学报,1988,10(2)：51-65
[21]史峰,李致中.路网上技术站多种能力约束下的单组列车编组的网络方法[J].铁道学报,1990,12(4)：51-55
[22]史峰,李致中.铁路车流路径的优选算法[J].铁道学报.1993,15(3)：70-76
[23]史峰,李致中,孙焰,胡建华.列车编组计划网络优化方法[J].铁道学报,1994,16(2)：74-79
[24]史峰,孔庆铃,胡安洲.车流径路与编组计划综合优化的网络方法[J].铁道学报.1997,19(1)：1-6
[25]史峰,黎新华,莫辉辉等.铁路OD分配优化方法[J].中国铁道科学,2004,25(4)：116-119
[26]卢新明,郑时德.求解路网上车流径路的启发式算法[J].北方交通大学学报.1993,17(8)：250-255
[27]王甦男,宋伟,姜文生.最短路径算法的比较[J].系统工程与电子技术,1994,5：43-49
[28]王甦男,冯育麒.车流径路域研究[J].铁道学报.1996,18(增刊)：20-24
[29]孙晚华,郑时德.铁路车流径路优化算法的研究[J].北方交通大学学报.1995,19(增刊)：39-44
[30]孙晚华,张永臣.确定车流最短径路的CN模型及算法[J].铁道学报.1999,21(5)：106-108
[31]胡思继,王苏男,李菊,张晓霖.关于特定径路准编译系统的研究[J].北方交通大学学报.1996,20(2)：226-229
[32]周经伦,吴唤群.受顶点数限制的最短路问题及其算法[J].系统工程,1996,14(5)：37-44
[33]姜志康等.车流径路选择的模糊0-1规划方法[J].模糊集理论及应用,1996,5：393-396
[34]查伟雄,秦作睿.路网上车流径路最优配流法[J].北方交通大学学报.1997,21(3)：259-263
[35]李引珍,顾守淮.铁路网络两顶点间最短路径定向搜索算法[J].铁道学报.1997,19(2)：25-27
[36]李引珍.路网上货运路径的计算[J].铁道学报.1997,19(3)：14-18
[37]李引珍.不确定环境下交通运输网络路径求解方法及应用研究[D].成都：西南交通大学博士学位论文.2005
[38]李邦义,何勇,姚恩瑜.点带约束成本的最短路问题[J].高校应用数学学报A辑,2000,15(1)：93-96
[39]李帮义,姚恩瑜.关于最短路问题的一个双目标优化问题[J].运筹学学报,2001,4：68-71
[40]王刊良,徐寅峰.相异路径选线问题的一种模型与算法[J].系统工程理论方法应用,2001,1：8-12
[41]周培德.交通道路网中任意两点之间最短路径的决速算法[J].计算机工程与科学.2002,24(4)：35-37
[42]谭国珍,高文.时间依赖的网络中最小时间路径算法[J].计算机学报,2002,2：1-6
[43]于立勇,李曙光.一类双约束最短路问题的近似算法[J].山东大学学报,2002(4)：304-311
[44]齐东元等.点边带约束成本的最短路问题及其算法[J].东南大学学报,2003(1)：112-114
[45]谭国真,柳亚玲,高文.随机时间依赖网络的K期望最短路径[J].计算机学报,2003,3：324-331
[46]江南.论铁路车流径路数学问题[J].中国铁道科学.2004,25(5)：121-124
[47]张波.模拟退火算法在路径优化问题中的应用[J].中国公路学报.2004,17(1)：79-81
[48]杨群等.基于合理多路径的路径选择方法的研究[J].管理工程学报,2004,(4)：42-45
[49]靳来勇,叶玉玲,赵永旭,何静.区域性路网车流径路的选择[J].中国铁路.2005,12：49-51
[50]杜进有,姚新胜,黄洪钟.路网车流径路的满意优化[J].系统工程,2005,23(9)：46-49
[51]张运河,林柏梁,梁栋,高红艳.优化多式联运问题的一种广义最短路方法研究[J].铁道学报.2006,28(4)：23-26
[52]成惠,张修如.铁路运输特定经路算法的研究与实现[J].计算机技术与发展.2007,17(3)：239-241
[53]农静,季令,叶玉玲,刘志杰.铁路车流径路优化分布式算法[J].中国铁道科学.2008,29(3).115-121
[54]苏顺虎,陈治亚.铁路网车流径路优化模型及算法研究[J].铁道学报.2008,30(6)：1-6
[55]孟凡江,高树喜,杨新安,王瑶.多路径分配的车流径路优化模型[J].辽宁工程技术大学学报,2008,27：93-95
[56]曹学明,王喜富,林柏梁.重空车流径路及多车种空车调配协同优化模型[J]. 中国铁道科学.2009,30(6)：114-118
[57]谢金梅,徐慧星.车流径路及车流组号划分算法的研究[J].铁道运营技术.2009,15(3)：18-21
[58]彭娟娟.铁路车流组织问题优化[J].交通科技与经济.2009,(6)：26-31
[59]钱名军.车流组号算法[J].兰州交通大学学报,2010,29(1)：62-65
[60]农静,王磊,尹慧琳.铁路车流径路优化的遗传算法设计[J].同济大学学报(自然科学版).2010,38(1)：77-80
[61]彭其渊,文超,闫海峰.提速战略对我国铁路运输发展的带动作用[J].西南交通大学学报,2008,43(6)：685-691.
[62]刘立检.路企直通运输在湘钢专用铁道的运用与思考[J].中国铁路,2008,8：29-32.
[63]技术计划编写组.铁路运输工作技术计划[M].北京：中国铁道出版社,1977
[64]B.N.巴利奇等.铁路运输调整[M].北京：中国铁道出版社,1992
[65]胡思继.铁路行车组织[M].北京：中国铁道出版社,1998.
[66]郑时德.吴汉琳.铁路行车组织第二版[M].北京：中国铁道出版社.1999
[67]交通运输智能化编写组.新世纪铁路、公路、水运、航空、城市交通运输智能化全书(上)[M].北京：清华大学出版社,2001
[68]交通运输智能化编写组.新世纪铁路、公路、水运、航空、城市交通运输智能化全书(中)[M].北京：清华大学出版社,2001
[69]交通运输智能化编写组.新世纪铁路、公路、水运、航空、城市交通运输智能化全书(下)[M].北京：清华大学出版社,2001
[70]沈庆衍主编；中国铁道百科全书总编委员会《运输与经济》编辑委员会编.中国铁道百科全书-运输与经济卷[M].北京：中国铁道出版社,2001
[71]宋建业,谢金宝.铁路运输调度指挥与统计分析[M].北京：中国铁道出版社,2006.
[72]杨浩.铁路运输组织学[M].北京：中国铁道出版社,2006
[73]彭其渊,王慈光.铁路行车组织[M].北京：中国铁道出版社,2007
[74]杜艳平.智能车流动态预测理论及方法[M].北京：中国铁道出版社,2009
[75]苗邦均,李致中.技术直达列车最优方案的算法[J].铁道运输与经济论文集,中国铁道出版社,1979：139-161
[76]芮惟铭.铁路运输网技术站车流组织问题的0-1规划数学模型[J].铁道运输与经济论文集,中国铁道出版社,1979：101-110
[77]韩锋.制定列车编组计划的整数规划方法[J].数学实践与认识,1982,2：1-13
[78]郑时德.制定技术站列车编组计划的0-1规划法[J].铁道学报.1985,7(3)：56-65
[79]郑时德.制定技术站列车编组计划的0-1规划法[J].北方交通大学学报.1985,1：24-31
[80]朱松年.列车编组计划的二次0-1规划模型及其解法[J].西南交通大学学报.1986年增刊,65-72
[81]雷广萍,袁威.直线方向单组列车编组优化的压缩分枝定界法[J].铁道学报,1989,11(1)：26-38
[82]赵瑜,郑时德.路网上车流组织优化与调整[J].北方交通大学学报,1990,14(4)：74-80
[83]曹家明,朱松年.铁路网上技术直达列车编组计划优化的二次0-1规划法[J].铁道学报.1993,15(2)：65-72
[84]查伟雄,黄孝章,秦作睿.直线方向列车编组计划有利去向模型及其多项式算法[J].铁道学报.1996.20(6)：641-644
[85]查伟雄,秦作睿.路网上列车编组计划的有利去向模型及其网络流算法[J].铁道学报.1998,20(2)：12-19
[86]李映红,吴世贵,彭其渊.货物列车编组计划网络模型的建立及算法[J].西南交通大学学报,2002,37(1)：68-71
[87]M.Frank, P.Wolfe.An Algorithm for Quadratic Programming [J].Naval Res. Logist. Quart.1956,3:95-110.
[88]W.W.White, A.M.Bomerault.A Network Algorithm for Empty Freight Car Allocation [J].IBM.Syst.J.1969,8:147-169.
[89]S.Gorenstein, S.Poley, W.W.White. On the Scheduling of the Railroad Freight Operations [R]. IBM Data Processing Report, Technical Report 320-2999, IBM, Philadelphia Scientific Center,1971.
[90]S.C.Misra.Linear Programming of Empty Wagon Disposition [J].Rail Int.,1972, 3:151-158.
[91]G.P.Ouimet.Empty Freight Car Distribution[D].Queen's University, Kingston, Ontario, Canada,1972.
[92]H.Herren. The Distribution of Empty Wagons by Means of Computer:An Analytical Model of the Swiss Federal Railways [J].Rail.Int.1973,4:1005-1010.
[93]L.R.Ford, D.R.Fulkerson. Flows in Networks[M].Princeton University Press, Princeton, N.J.,1974.
[94]V.B.Mendiratta.A Dynamic Optimization Model of the Empty Car Distribution Porcess [D]. Northwestern University,Evanston,Illinois,1981.
[95]V.B Mendiratta, M.A.Turnquist.A Model for Management of Empty Freight Cars [J]. Transportation Research Record 1982,838:50-55.
[96]W.C.Jordan.The Impact of Uncertain Demand and Supply on Empty Railroad Car Distribution [D] University.Ithaca.New York,1982.
[97]W.C.Jordan, M.A.Turnquist. A Stochastic Dynamic Network Model for Railroad Car Distribution [J]. Trans.Sci.1983,17(2):123-145.
[98]Jordan WC and Turnquist MA.A stoehastic dynamic model for railroad car distribution [M]. Transportation Science,1983,17(2):123-145.
[99]L.L.Ratcliffe, B.Vinot, F.T.Sparrow.Optimal Prepositioning of Empty Freight Cars [J]. Simulation,1984,2:69-275.
[100]S.Kikuchi.Empty Freight Car Dispatching Model under Freight Car Pool Concept [J].Trans.Res.1985,19B(2):169-185.
[101]T.S.Glickman, H.D.Sherali.Large-Scale Network Distribution of Pooled Empty Freight Cars over Time, with Limited Substitution and Equitable Benefits [J].Trans.Res.1985,19B(2):85-94.
[102]Y.S.Shan.A Dynamic Multicommodity Network Flow Model for Real Optimal Rail Freight Car Management[D].Princeton University,Princeton,N.J.1985.
[103]M.T.Fernandes Grain,M.C.Fogliatti De Sinay.Optimal Distribution of Empty Railroad Cars[J].In Proceedings of the 1st International Congress in France of Industrial Engineering and Management, Cole Centrale de Paris, France,1986, 21-26.
[104]P.J.Dejax, T.G.Crainic.A Review of Empty Flows and Fleet Management Models in Freight Transportation [J].Trans.Sci.1987,21(4):227-247.
[105]A.E.Haghani.Rail Freight Transportation:A Review of Recent Optimization Models for Train Routing and Empty Car Distribution[J].Journal of Advanced Transportation,1987,21(2):147-172.
[106]G.J.Beaujon, M.A.Turnquist.A Model for Fleet Sizing and Vehicle Allocation [J].Trans. Sci.1991,25:19-45.
[107]M.Joborn.Empty Freight Car Distribution at Swedish Railways-Analysis and Optimization Modeling [D]. Department of Mathematics, Linkoping University, Sweden,1995.
[108]S.Spieckermann,S.Voss.A Case Study in Empty Railcar Distribution [J].Eur. J. Operational Res,1995,87:586-598
[109]B.E.Hoppe.Efficient Dynamic Network Flow Algorithm [D].Cornell University, 1995.
[110]H.D.Sherali, C.H.Tuncbilek.Static and Dynamic Time-Space Strategic Models and Algorithms for Multilevel Rail-Car Fleet Management[J].Management Sci, 1997.43:235-250.
[111]K.Holmberg, M.Joborn, J.T.Lundgren. Improved Empty Freight Car Distribution [J]. Trans. Sci,1998,32(2):163-173.
[112]J.F. Cordeau, P.Toth, D.Vigo. A Survey of Optimization Models for Train Routing and Scheduling [J].Trans. Sci.1998,32(4):380-404
[113]O.K.Kwon, C.D.Martland, J.M.Sussman. Routing and Scheduling Temporal and Heterogeneous Freight Car Traffic on Rail Networks [J].Trans.Res.1998,34E (2): 101-115.
[114]Ricardo Fukazawa, Mareus Vinicius Poggi de Aragao, Oscar Porto, Eduardo Uchoa. Solving the Freight Car Flow Problem to Optimality[J].Electronic Notes in Theoretical Computer Science,2002,66(6):1-11
[115]M.Joborn,T.G.Crainic,M.Gendreau,K.Holmberg,J.T.Lundgren.Economies of Scale in Empty Freight Car Distribution in Scheduled Railways[J].Trans.Sci,2004, 38(2):121-134.
[116]Joaquin Rodriguez. A constraint programming model for real-time train scheduling at junctions [J]. Transportation Research Part B:Methodological,2007, 41(2):231-245
[117]Kaj Holmberg, Martin Joborn, Kennet Melin.Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths[J].European Journal of Operational Research,2008,188 (1):101-108
[118]Mark Lawley, Vijay Parmeshwaran, Jean-Philippe Richard, Ayten Turkcan, Malay Dalai, David Ramcharan. A time-space scheduling model for optimizing recurring bulk railcar deliveries [J]. Transportation Research Part B,2008,42(5):438-454
[119]Shi Qiang Liu, Erhan Kozan. Scheduling trains as a blocking parallel-machine job shop scheduling problem[J].Computers & Operations Research,2009, 36(10):2840-2852
[120]Valentina Cacchiani, Alberto Caprara, Paolo Toth. Scheduling extra freight trains on railway networks[J].Transportation Research Part B,2010,44(2):215-231
[121]Francesco Corman, Andrea D'Ariano, Dario Pacciarelli, Marco Pranzo. A tabu search algorithm for rerouting trains during rail operations[J].Transportation Research Part B,2010,44(1):175-192
[122]刘梅林.用电子计算机进行铁路空车调配的探讨[J].铁道运输与经济,1987,6：29-32.
[123]汤代炎.空车调配方案的研究——匈牙利法的一个应用[J].长沙铁道学院学报,1990,9(4)：20-25.
[124]任民,王彦,杜文.空车调整最小费用的合理分摊[J].西南交通大学学报1998,33(2)：214-218.
[125]李文权,杜文.优化空车调配问题的数学模型[J].系统工程理论与实践,1998,10：1-5.
[126]林柏梁,胡安洲.重空车流运行组织的协同优化理论及模型[J].铁道学报,1998,20(5)：9-14.
[127]党建武.神经网络在铁路空车调度问题中的应用[J].兰州铁道学院学报,1999,18(1)：77-85.
[128]叶玉铃,季令.市场经济下空车流调整问题[J].上海交通大学学报.2000,34(增刊)：19-22
[129]纪嘉伦,林柏梁,李福志,果鹏文.用重心优化法求解铁路网上空车调配问题[J].铁道学报,2001,23(3)：109-113.
[130]果鹏文,林柏梁,余洋.大规模路网上空车调配的区段中心优化法[J].中国铁道科学,2001,22(2)：122-128.
[131]牛惠民,胡安洲.铁路枢纽车流组织的非线性0-1规划模型及算法[J].铁道学报,2001,23(3)：8-12.
[132]牛惠民.铁路枢纽重空车流组织的协调优化模型及遗传算法[J].铁道学报,2001,23(4)：12-16.
[133]王亚宁,张喜.铁路空车调整的算法模型及软件实现[J].研究与开发,2001,7：6-9.
[134]刘洪涛.技术计划空车调整的数学模型[J].TMIS工程,2002,10：29-31.
[135]熊红云,鲁五一,温红艳.铁路空车调配问题的遗传启发算法[J].中国铁道科学,2002,23(4)：118-121.
[136]果鹏文,褚江,林柏梁.用振荡法解大规模路网上的空车调配问题[J].中国铁道科学,2002,23(4)：111-117.
[137]张喜,张全寿.基于知识约束的空车调整优化方法研究[J].铁道学报,2003,25(6)：14-20.
[138]杜艳平,陈光伟.大规模路网上空车调整的分阶段优化模型[J].铁道运输与经济,2004,26(4)：59-62.
[139]李宗平.铁路货运空重车调整优化模型与算法研究[J].学术动态.2005.3：1-7
[140]李宗平.铁路货运空重车调整优化模型与算法研究-续[J].学术动态.2005.4：3-8
[141]梁栋,林柏梁,严贺祥,李俊卫.车种代用情况下的铁路空车调配研究[J].铁道学报,2005,27(4)：1-5.
[142]雷中林,何世伟,宋瑞,蔡靖.铁路空车调配问题的随机机会约束模型及遗传算法[J].铁道学报,2005,27(5)：1-5
[143]孙焰,姜磊.具有能力限制的路网重车流径路优化方法[J].铁道运输与经济,2005,25(12)：82-84
[144]纪丽君,林柏梁,乔国会.基于路网的多车种空车调配优化方案研究[J].铁道运输与经济,2008,30(7)：85-87
[145]林柏梁,熊天文,朱志国.给定调车线数量条件下的列车编组方案优化[J].中国铁道科学,1993,14(4)：23-31.
[146]林柏梁.具有非线性改编费用的列车编组计划优化[J].铁道学报,1996,18(增刊)：37-42.
[147]Dorigo M. Optimization, learning and natural algorithms[D].Department of Electronics, Politecnico di Milano, Italy,1992
[148]Colorni A, Dorigo M, Maniezzo V. An Investigation of some properties of an "Ant algorithm". Proceedings of the Parallel Problem Solving From Nature Conference (PPSN92). Brussels, Belgium:Elsevier Publishing,1992:509-520
[149]邢文训,谢金星.现代优化计算方法[M].北京：清华大出版社,2005
[150]杨丽锦.浅析蚁群算法的原理及应用方向[J].电脑知识与技术,2009,2(5)：1455-1456
[151]薛锋.编组站调度系统配流协同优化理论与方法研究[D].成都：西南交通大学博士学位论文,2009：134-135
[152]武交峰.应用遗传算法提高蚁群算法性能的研究[D].太原理工大学硕士学位论文.2007
[153]徐红梅.蚁群算法的改进及其在连续空间优化中的应用[D].烟台大学硕士学位论文.2008
[154]杨雅琪.可拓变换在蚁群算法参数选择中的应用[D].大连海事大学硕士学位论文.2008
[155]李金汉.蚁群优化算法及其应用研究[D].哈尔滨理工大学硕士学位论文.2008
[156]张喜.铁路空车调整综合优化模型与智能决策方法的研究[D].北京：北京交通大学博士学位论文,2004.
[157]孟繁臣.哈尔滨铁路局空车调整计划计算机编制方法研究[D].北京：北京交通大学博士学位论文,2004
[158]汪镭,吴启迪.蚁群算法在连续空间寻优问题求解中的应用[J].控制与决策,2003,18(1)：45-48.
[159]魏平,熊伟清.用于一般函数优化的蚁群算法[J].宁波大学学报,2001,14(4)：52-55
[160]詹士昌.蚁群算法及其在连续性空间优化问题中的应用.浙江大学硕士学位论文
[161]李士勇,陈永强,李研.蚁群算法及其应用[M].哈尔滨：哈尔滨工业大学出版社,2004
[162]陈峻,沈洁,秦玲等.基于分布均匀度的自适应蚁群算法[J].软件学报,2003,14(8)：1379-1387
[163]黄维.铁路货运站实行物流化运营的研究[D].成都：西南交通大学,2005
[164]铁道部统计中心.中华人民共和国铁道部2008年铁道统计公报[J].中国铁路,2009,6：3-9
[165]冯芬玲.铁路重载运输发展动因及组织策略研究[D].长沙：中南大学,2009
[166]孟繁臣.铁路车流结构分析与设计[J].铁道运输与经济,2009,8(31)：28-31