铁路编组站鲁棒阶段计划编制及调整研究
|
摘要
编组站作为铁路运输重要的基层生产单位,铁路枢纽及干线畅通的关键环节,主要负责货物列车解体和编组作业,并按计划正点发车。编组站日常作业都是在车站作业计划指导下完成的,作为车站作业计划的核心,阶段计划的优化编制一直是编组站智能调度系统的关键环节和理论难点。在阶段计划编制和执行过程中,存在较多的不确定信息扰动。现有的研究成果没有系统地针对不确定环境下具有一定鲁棒性的阶段计划编制问题的研究,论文着重对鲁棒阶段计划编制及调整问题进行了研究,所做工作主要包括以下几个部分：
1.围绕铁路编组站阶段计划编制研究的特点和发展趋势,从阶段计划配流、调机运用、到发线运用、确定环境下和不确定环境下阶段计划的编制等几个方面,阐述了相关问题的研究现状,分析了铁路编组站阶段计划编制研究趋势,以及鲁棒阶段计划编制及调整研究的必要性。
2.阐述了铁路编组站阶段计划编制原理,并对计划信息的不确定性进行了详细分析。提出鲁棒阶段计划的概念,并对鲁棒阶段计划的特点及评价因素进行了阐述。基于此,构建鲁棒编组站阶段计划的编制框架,即“计划编制+计划调整”的基本框架。
3.研究了铁路编组站鲁棒阶段计划配流优化模型。选择出发列车满轴约束、列车解编作业时间和列车到发时刻的不确定性作为优化对象,对既有基本配流优化模型进行改进：首先根据列车编组计划,综合考虑出发列车总重和换长两个满轴条件,并从出发列车车辆数、运输效率两方面进行了拓展；其次,通过考虑车列的解编钩数、连挂次数等因素,对解编作业时间进行精确估算,使其计划值更接近实际值,以减少两者的偏差对计划编制和执行的影响；借鉴“公平性”目标来考虑列车到达时刻延误,优化待解时间在不同衔接方向到达列车之间的分布,提高计划适应列车延误影响的能力。通过综合考虑多种出发列车满轴约束、列车解编作业时间和列车到发时刻的不确定性,构建具有一定鲁棒性编组站阶段计划配流优化模型。
4.在所构建的阶段计划配流优化模型的基础上,增加对到发线运用的研究,形成鲁棒阶段计划编制优化模型。针对模型的特点、求解难度以及阶段计划编制对时效性的要求,将鲁棒阶段计划编制模型分解为解编方案编制优化模型、静态配流模型和到发线运用优化模型。并分别设计各模型的求解方法,如采用和声搜索算法求解解编方案编制优化模型,模拟退火算法求解静态配流模型,以及ILOG求解到发线运用优化模型。最后设计算例验证了模型及算法的有效性,通过对不同满轴约束对计算结果影响、车流冗余、列车解编作业时间以及到达列车待解时间等方面的分析可知,利用本文提出的研究方法编制的阶段计划具有较高的鲁棒性。
5.对铁路编组站阶段计划策略调整理论与方法进行了研究。在“计划编制+计划调整”的模式下,借鉴策略优化思想,构建编组站阶段计划策略调整理论与方法论框架,包括计划调整策略的结构及表示形式、策略条件分支的判断和选取、调整策略的参数化表示、策略元的定义和获取以及计划调整策略的提取和优化。其中在策略元的获取、调整策略的提取和优化中,对前文所设计方法进行改进,使其适应计划信息扰动的影响,形成动态环境下阶段计划调整策略求解方法。在阶段计划调整过程中,应突出调度员知识和经验的重要性,如可由调度员制定策略元、构建和选择策略结构、调整修订基本参数等。最后设计算例对所提出方法进行了验证。
Marshaling staions are the primary units of the railway network, and the key nodes of the rail hub and the main rail lines. The mainly works of marshaling stations are handling the classification and assembly of freight trains, and make sure the trains are departed on time according to the departure schedule. Those yards operations are all planed by yards dispatcher. There are two steps of yards plans in China, and the most important one is the stage plan. There are many uncertainties when formulate and carry out the stage plan. While few researches focus on this topics that the optimization of the stage plan under uncertainties. This dissertation studied the robustnees stage plan and plan adjustment for railway marshaling stations. The main works of this dissertation are as follows:
1. According to research trend of the stage plan for railway marshaling stations, the current situation as well as the necessity of the research on robust stage plan are reviewed and depicted. The review are based on five aspects, such as wagon-flow allocation, yard engines utilization, yard track utilization, and the stage plan optimization under certain and uncertain environment.
2. Analysised the theory of optimizating the stage plan of railway marshaling station. The necessity of the research on robust stage plan is depicted after the analysis of the uncertain of the plan information. The concepts, characteristic and evaluation factors are proposed. Based on them, the framework for robust stage plan is put forward, that is the framework of "plan formulation+plan adjustment" for marshaling station.
3. Robust wagon-flow allocation (WFA) models are studied. Three wagon-flow allocation models are proposed step by step. Firstly, a WFA model that considers different train size limitations of departure trains is formulated. The weight and length of departure trains are taken into account as the size limitation simultaneously. And the cars number and the freight value or benfit of departure trains are considered together for a more general WFA model. Secondly, a WFA model considers the uncertain of the breakup time of inbound trains and the makeup time of outbound trains is formulated. We estimate those time information more accurately by taking the cuts of trains, the classification process and assembly process into account. So the uncertain impacts on the stage plan can be reduced if the gaps of estimated and actual values are decreased. Thirdly, an equity objective function is introduced for the WFA model that considers the uncertain of arrival time of inbound trains. This equity objective function can optimiza the distribution of waiting time for classification of the inbound trains that from different directions.
4. Based on the robust WFA model, the robust stage plan optimization model is presented by adding the study of yard track utilization problem. Then the model is decomposed into three sub-models:yard engines utilization model, static WFA model, and yard track utilization model. And different algorithms are proposed for all models. For example, the harmony search for the yard engines utilization model and ILOG for the yard track utilization model. Then a numerical case is used to verify the proposed mathematical models and the solution algorithm. The robustness of the stage plan is analysised through the redundancy of cars, the gap between estimate and actual classification time and assembly time, and the waiting time of inbound trains for classification and so on.
5. The theory of strategy adjustment for stage plan is researched. Based on the framework of "plan formulation+plan adjustment", this dissertation proposed the theoretical and methodological framework of strategy adjustment for stage plan. This framework including the definitions, forms, conditional branches, and the definition of strategy meta and so on. The algorithms proposed in the previous sections are improved for adapting to the disturbance of the stage plan informations under the dynamic environment. The knowledge and experience of dispatcher must be highlighted during the adjustment of stage plan. For example, the strategy meta can be present by dispatcher, and the strategy must confirmed by dispatcher befor adopted. At last, some numerical case is used to verify the strategy adjustment framework and solution algorithm.
1.围绕铁路编组站阶段计划编制研究的特点和发展趋势,从阶段计划配流、调机运用、到发线运用、确定环境下和不确定环境下阶段计划的编制等几个方面,阐述了相关问题的研究现状,分析了铁路编组站阶段计划编制研究趋势,以及鲁棒阶段计划编制及调整研究的必要性。
2.阐述了铁路编组站阶段计划编制原理,并对计划信息的不确定性进行了详细分析。提出鲁棒阶段计划的概念,并对鲁棒阶段计划的特点及评价因素进行了阐述。基于此,构建鲁棒编组站阶段计划的编制框架,即“计划编制+计划调整”的基本框架。
3.研究了铁路编组站鲁棒阶段计划配流优化模型。选择出发列车满轴约束、列车解编作业时间和列车到发时刻的不确定性作为优化对象,对既有基本配流优化模型进行改进：首先根据列车编组计划,综合考虑出发列车总重和换长两个满轴条件,并从出发列车车辆数、运输效率两方面进行了拓展；其次,通过考虑车列的解编钩数、连挂次数等因素,对解编作业时间进行精确估算,使其计划值更接近实际值,以减少两者的偏差对计划编制和执行的影响；借鉴“公平性”目标来考虑列车到达时刻延误,优化待解时间在不同衔接方向到达列车之间的分布,提高计划适应列车延误影响的能力。通过综合考虑多种出发列车满轴约束、列车解编作业时间和列车到发时刻的不确定性,构建具有一定鲁棒性编组站阶段计划配流优化模型。
4.在所构建的阶段计划配流优化模型的基础上,增加对到发线运用的研究,形成鲁棒阶段计划编制优化模型。针对模型的特点、求解难度以及阶段计划编制对时效性的要求,将鲁棒阶段计划编制模型分解为解编方案编制优化模型、静态配流模型和到发线运用优化模型。并分别设计各模型的求解方法,如采用和声搜索算法求解解编方案编制优化模型,模拟退火算法求解静态配流模型,以及ILOG求解到发线运用优化模型。最后设计算例验证了模型及算法的有效性,通过对不同满轴约束对计算结果影响、车流冗余、列车解编作业时间以及到达列车待解时间等方面的分析可知,利用本文提出的研究方法编制的阶段计划具有较高的鲁棒性。
5.对铁路编组站阶段计划策略调整理论与方法进行了研究。在“计划编制+计划调整”的模式下,借鉴策略优化思想,构建编组站阶段计划策略调整理论与方法论框架,包括计划调整策略的结构及表示形式、策略条件分支的判断和选取、调整策略的参数化表示、策略元的定义和获取以及计划调整策略的提取和优化。其中在策略元的获取、调整策略的提取和优化中,对前文所设计方法进行改进,使其适应计划信息扰动的影响,形成动态环境下阶段计划调整策略求解方法。在阶段计划调整过程中,应突出调度员知识和经验的重要性,如可由调度员制定策略元、构建和选择策略结构、调整修订基本参数等。最后设计算例对所提出方法进行了验证。
Marshaling staions are the primary units of the railway network, and the key nodes of the rail hub and the main rail lines. The mainly works of marshaling stations are handling the classification and assembly of freight trains, and make sure the trains are departed on time according to the departure schedule. Those yards operations are all planed by yards dispatcher. There are two steps of yards plans in China, and the most important one is the stage plan. There are many uncertainties when formulate and carry out the stage plan. While few researches focus on this topics that the optimization of the stage plan under uncertainties. This dissertation studied the robustnees stage plan and plan adjustment for railway marshaling stations. The main works of this dissertation are as follows:
1. According to research trend of the stage plan for railway marshaling stations, the current situation as well as the necessity of the research on robust stage plan are reviewed and depicted. The review are based on five aspects, such as wagon-flow allocation, yard engines utilization, yard track utilization, and the stage plan optimization under certain and uncertain environment.
2. Analysised the theory of optimizating the stage plan of railway marshaling station. The necessity of the research on robust stage plan is depicted after the analysis of the uncertain of the plan information. The concepts, characteristic and evaluation factors are proposed. Based on them, the framework for robust stage plan is put forward, that is the framework of "plan formulation+plan adjustment" for marshaling station.
3. Robust wagon-flow allocation (WFA) models are studied. Three wagon-flow allocation models are proposed step by step. Firstly, a WFA model that considers different train size limitations of departure trains is formulated. The weight and length of departure trains are taken into account as the size limitation simultaneously. And the cars number and the freight value or benfit of departure trains are considered together for a more general WFA model. Secondly, a WFA model considers the uncertain of the breakup time of inbound trains and the makeup time of outbound trains is formulated. We estimate those time information more accurately by taking the cuts of trains, the classification process and assembly process into account. So the uncertain impacts on the stage plan can be reduced if the gaps of estimated and actual values are decreased. Thirdly, an equity objective function is introduced for the WFA model that considers the uncertain of arrival time of inbound trains. This equity objective function can optimiza the distribution of waiting time for classification of the inbound trains that from different directions.
4. Based on the robust WFA model, the robust stage plan optimization model is presented by adding the study of yard track utilization problem. Then the model is decomposed into three sub-models:yard engines utilization model, static WFA model, and yard track utilization model. And different algorithms are proposed for all models. For example, the harmony search for the yard engines utilization model and ILOG for the yard track utilization model. Then a numerical case is used to verify the proposed mathematical models and the solution algorithm. The robustness of the stage plan is analysised through the redundancy of cars, the gap between estimate and actual classification time and assembly time, and the waiting time of inbound trains for classification and so on.
5. The theory of strategy adjustment for stage plan is researched. Based on the framework of "plan formulation+plan adjustment", this dissertation proposed the theoretical and methodological framework of strategy adjustment for stage plan. This framework including the definitions, forms, conditional branches, and the definition of strategy meta and so on. The algorithms proposed in the previous sections are improved for adapting to the disturbance of the stage plan informations under the dynamic environment. The knowledge and experience of dispatcher must be highlighted during the adjustment of stage plan. For example, the strategy meta can be present by dispatcher, and the strategy must confirmed by dispatcher befor adopted. At last, some numerical case is used to verify the strategy adjustment framework and solution algorithm.
引文
[1]胡思继.铁路行车组织[M].北京：中国铁道出版社,1998.
[2]吴家豪.铁路编组站系统设计优化[M].北京：中国铁道出版社,1994.
[3]杨浩.铁路运输组织学[M].北京：中国铁道出版社,2001.
[4]汪晓霞,李红昌,王喆.国外铁路客货运管理信息系统比较分析及启示[J].铁道经济研究,2003,11(4)：28-30.
[5]张经化.铁路编组站现代化改造技术引进问题的探索[J].铁道运输与经济,2000，22(3)：36-37.
[6]Classification yard[EB/OL]. Http://en.wikipedia.org/wiki/Classification_yard.2010-10-12.
[7]Canadian pacific railway's streamlined railroad scheduling wins informs tech world series[EB/OL]. http://www.informs.org/Press/Phoenixrelease03b2.htm,2010-10-12.
[8]O.Gulbrodsen. Optimal Planning of Marshalling Yard by Operation Research[J]. PROC,1963: 226-233.
[9]S.Yagar, Fracisico. A Efficiency Sequence of Classification Yard Hump[J]. Transportation Research,124,1989.
[10]T.Crainic, J.Ferland, J.Rousseav. A Tactical Planning Model for Rail Freight Transportation[J]. Transportation Science,1984,18:165-183.
[11]A Assad Arjang. Modelling of Rail Networks:Toward a Routing/Makeup Model[J]. Transportation Research, Part B,1977,14(B):101-114.
[12]H.Keaton Mark. Designing Optimal Railroad Operating Plans:Lagrangian Relaxation and Heuristic Approach[J]. Transportation Research, Part B,1989,23:443-452.
[13]H.Keaton Mark. Designing Railroad Operation Plans:a Dual Adjustment Method for Implementing Heuristic Approach[J]. Transportation Research, Part B,1992,26(4):263-279.
[14]R Lentink, Fioole M., Jan Pieter. Applying Operations Research Techniques to Planning Train Shunting[R]. ERIM Report Series Reference,2003.
[15]O.Hein. A Two-stage Queuing Model for a Marshalling Yard[J]. Rail Int.,1972,(3):249-250.
[16]E.R.Petersen. Railroad Modeling Part Ⅰ:Prediction of Put-through Time[J]. Transportation Science,1977,11 (1):37-49.
[17]E.R.Peterseh. Railroad Modeling Part Ⅱ:The Effect of Yard Facilities on Congestion[J]. Transportation Science,1977,11 (1):50-59.
[18]Turnquist MA, Daskin MS. Queuing Models of Classification and Connection Delay in Rail Yards[J]. Transportation Science,1982,16(2):207-230.
[19]D.Martland. PMAKE Analysis:Prediction Rail Yard Time Distributions Using Probabilistic Train Connection Standards[J]. Transportation Science,1982,16,476-506.
[20]Deloitte, Haskins, and Sells. Rail terminal sequencing system[J]. Detail design manual, Freight Car Utilization Program, Association of American Railroads, Washington D.C.,1977.
[21]P. J. Wong, C. V. Elliott, and M. R. Hathorne. Demonstration of dynamic track assignment program[J]. Technical report, SRI International, Menlo Park, California 95025,1979.
[22]E. R. Kraft. A mixed integer optimization model to improve freight car classification in railroad yards. Working paper, OPIM Dept., Wharton School, University of Pennsylvania, Philadelphia, PA 19104,1993.
[23]Wang, X. Improving Planning for Railroad Yard, Forestry and Distribution[D]. Ph. D. Dissertation, Department of Operations and Information Management, Wharton School, University of Pennsylvania, Philadelphia, PA,1997.
[24]王慈光.用表上作业法求解编组站配流问题的研究[J].铁道学报,2002, 24(4)：1-5.
[25]王慈光.编组站静态配流网络模型[J].交通运输工程与信息学报,2003, 1(2)：67-71.
[26]崔叙,熊天文.编组站阶段计划IDSS的车流推算方法研究[J].铁路计算机应用,2002,11(11)：24-26.
[27]徐杰,杜文,刘春煌.铁路技术站车流推算模型和算法[M].中国铁道科学,2005, 26(4)：120-123.
[28]荆世明,吴健波.铁路编组站车流配流问题研究[M].铁道运输与经济,2008, 30(1)：83-86.
[29]景云,王慈光,王如义,唐建桥.运用学习规则求解编组站静态配流问题的研究[J].铁道运输与经济,2010, 32(1)：22-26.
[30]严余松,朱松年.铁路枢纽车流调度决策模型研究[J].铁道学报,2001,23(1)：9-12.
[31]王慈光.编组站动态配流模型与算法研究[J].铁道学报,2004, 26(1)：1-6.
[32]薛峰.编组站调度系统配流协同优化理论与方法研究[D].成都：西南交通大学,2006.
[33]薛锋,王慈光.编组站配流相关问题分析[J].交通运输工程与信息学报,2008, 6(4)：29-33,39.
[34]王正彬,杜文,吴柏青,羊艳.基于解编顺序的阶段计划车流推算模型及算法[J].西南交通大学学报,2008,43(1)：91-95.
[35]申永生,何世伟,王保华,穆美如.免疫算法求解编组站阶段计划配流问题研究[J].铁道学报,2009,31(4)：1-6.
[36]牛惠民,胡安洲.双向编组站车流接续的综合优化[J].铁道学报,1998,20(6)：16-21.
[37]彭其渊,赵军,韩雪松.技术站广义配流问题模型与算法[J].中国铁道科学,2010,31(2)：108-114.
[38]赵军,彭其渊,文超,徐进.技术站广义动态配流问题的遗传算法[J].铁道学报,2010,32(3)：9-15.
[39]赵军,彭其渊,文超,徐进.技术站广义动态配流问题的局部邻域算法[J].西南交通大学学报,2010,45(3)：486-492.
[40]赵军,韩雪松,彭其渊.技术站配流与调机运用综合问题的拉格朗日松弛算法[J].铁道学报,2011,33(11)：1-7.
[41]曹家明,范征,毛节铭.编组站作业优化决策支持系统-解体子系统[J].铁道学报,1993,15(4)：66-73.
[42]王慈光.编组站列车解体方案的计数方法[J].铁道学报,2000,22(6)：2-7.
[43]李文权,王炜,杜文,林诒勋.铁路技术站调机运用模型及算法[J].系统工程学报,2000,15(1)：38-43.
[44]徐杰,杜文,黎青松,周再玲.铁路区段站决策支持系统的研究-调车机车的合理安排[J].四川工业学院学报,2003,22(2)：11-14.
[45]王世东,郑力,张智海,田任然.蚁群算法在调机运用计划中的应用[J].中国铁道科学,2007,28(3)：104-109.
[46]赵小柠.基于时间窗的大型编组站取送调机作业优化研究[J].兰州交通大学学报,2008, 27(1)：76-79.
[47]李文权,王炜,程世辉.铁路编组站到发线运用的排序模型和算法[J].系统工程理论与实践,2000,20(6)：75-78.
[48]吕红霞,倪少权,纪洪业.技术站调度决策支持系统的研究-到发线的合理使用[J].西南交通大学学报,2000,35(3)：255-258.
[49]徐杰,杜文,李冰.铁路区段站到发线运用计划安排的优化算法[J].系统工程理论方法应用,2003,12(3)：253-256.
[50]徐杰,杜文,常军乾,文军,梁志杰.基于遗传算法的区段站到发线运用优化安排[J].中国铁道科学,2003,24(2)：109-114.
[51]谢楚农,黎新华.铁路客运站到发线运用优化研究[J].中国铁道科学,2004, 25(5)：130-133.
[52]王栋.铁路客运站到发线运用自动编排设计[D].长沙：中南大学,2007.
[53]吕红霞,何大可,陈韬.基于蚁群算法的客运站到发线运用计划编制方法[J].西南交通大学学报,2008,42(2)：153-158.
[54]史峰,陈彦,秦进,周文梁.铁路客运站到发线运用和接发车进路排列方案综合优化[J].中国铁道科学,2009,30(6)：108-113.
[55]刘军.铁路编组站作业计划滚动式智能化编制方法的研究[D].北京：北京交通大学,1993.
[56]崔炳谋.编组站阶段计划编制系统几个问题研究[J].兰州铁道学院学报,1996, 15(2)：64-68.
[57]何世伟.铁路枢纽作业计划的优化编制——编组站作业计划与枢纽日班计划的模型计算法研究[D].成都：西南交通大学,1996.
[58]何世伟.铁路编组站阶段计划优化模型的研究[J].铁道运输与经济,1996,18(4)：87-90.
[59]何世伟,宋瑞,朱松年.编组站阶段计划解编作业优化模型及算法[J].铁道学报,1997,19(3)：1-8.
[60]何世伟,宋瑞,朱松年.铁路编组站阶段计划编制的模型及其算法研究[J].系统工程理论与实践,1997,17(2)：88-94.
[61]Shiwei He, Rui Song, Sohail S.Chaudhry. An Integrated Dispatching Model for Rail Yards Operations[J]. Computers&Operations Research,2003,30(7):939-966.
[62]王明慧,赵强.编组站智能调度系统阶段计划优化模型及算法研究[J].铁道学报,2005,27(6)：1-9.
[63]王世东,郑力,张智海,刘书成.编组站阶段计划自动编制的数学模型及算法[J].中国铁道科学,2008,29(2)：120-125.
[64]袁庆达,杜文,黎青松.区段站阶段计划的优化模型和算法[J].西南交通大学学报,2000,35(3)：250-254.
[65]徐杰.区段站阶段计划自动编制模型和算法研究[D].成都：西南交通大学,2004.
[66]胡刚.编组站阶段计划自动编制与调整的研究[D].成都：西南交通大学,2000.
[67]常军乾.编组站阶段计划编制系统设计与若干技术的研究[D].成都：西南交通大学,2002.
[68]胡猛.计算机编制编组站阶段计划的模型和算法的研究[D].北京：北京交通大学,2006.
[69]胡兴宇.编组站作业计划优化编制若干问题研究[D].北京：北京交通大学,2008.
[70]牛惠民.双向编组站列车调度调整的优化模型及算法[J].中国铁道科学,2007,28(6)：102-108.
[71]刘宝碇,赵瑞清,王纲.不确定规划及应用[M].北京：清华大学出版社,2003.
[72]高尚,杨静宇.群智能算法及其应用[M].北京：中国水利水电出版社,2006.
[73]段海滨.蚁群算法原理及其应用[M].北京：科学出版社,2005.
[74]何世伟,宋瑞,胡安洲.编组站阶段计划刚性与柔性优化的协调研究[J].铁道学报,1999,21(4)：1-8.
[75]何世伟,宋瑞,鲁放,胡安州.铁路运输管理中的多机模糊排序问题及遗传算法研究[J].北京航空航天大学学报(社会科学版).2000,13(4)：4-10.
[76]王振宏,崔炳谋,许广辉.基于不确定理论和混合智能算法的调车机车运用研究[J].铁道运输与经济,2006,28(12)：87-89.
[77]刘霆,何世伟,王保华,安健.编组站调度计划随机机会约束规划模型计算法研究[J].铁道学报,2007,29(4)：12-17.
[78]黎浩东.铁路编组站鲁棒性阶段计划编制研究[D].北京：北京交通大学,2008.
[79]黎浩东,何世伟,宋瑞,郑锂.编组站阶段计划随机相关机会规划模型及算法[J].交通运输系统工程与信息,2010,10(1)：128-133.
[80]张全寿,铁路编组站站调决策支持系统的研究[J].北方交通人学学报,1989,13(4)：64-72.
[81]钟雁,张全寿.铁路编组站调车作业计划决策支持系统的研究[J].铁道学报,1994,16(4)：76-82.
[82]钟雁.一个基于动态模型的计划决策支持系统[J].北方交通大学学报,1994,18(4)：477-483.
[83]何世伟,宋瑞,赵强.铁路编组站阶段计划DSS研究[J].系统工程,1996,14(4)：62-66.
[84]崔叙,熊天文.编组站阶段计划IDSS的研究[J].铁路计算机应用,2001,10(3)：16-18.
[85]查伟雄,熊桂林,冷俊峰.列车编组计划决策支持系统的研究[J].交通运输系统工程与信息,2001,1(2)：124-128.
[86]崔炳谋,张朴,陈光伟.编组站综合自动化系统总体框架的研究[J].铁道运输与经济,2007,29(5)：42-46.
[87]何世伟,宋瑞,谭立刚,杨永凯,雷中林.枢纽编组站智能调度系统的设计与实现[J].北方交通大学学报,2002,26(5)：19-23.
[88]丁昆.成都北编组站综合集成自动化系统[J].中国铁路,2006,45(8)：46-48,56.
[89]编组站综合集成自动化系统(CIPS)概论[M].北京：北京全路通信信号研究设计院,2003.
[90]刘世,麻克军.计算机编制郑州北站阶段计划的研究与实现[J].铁路计算机应用, 2003,12(9)：158-160.
[91]王明慧.编组站智能调度系统YIDS体系框架与关键技术优化理论研究[D].成都：西南交通大学,2007.
[92]杨涛.基于多Agent的编组站作业计划计算机编制方法和作业管理系统研究[D].北京：北京交通大学,2004.
[93]邢科家.基于遗传算法和多Agent协同的调度指挥系统研究[D].北京：北京交通大学,2004.
[94]郝鹏飞.基于Multi-Agent编组站调度支持平台研究[D].北京：北京交通大学, 2006.
[95]薛锋,王慈光.编组站列车编组顺序的调整方法[J].铁道学报,2007,29(4)：1-5.
[96]薛锋,王慈光,罗建,赵强.编组站列车解体方案与编组方案的协调优化研究[J].铁道学报,2008,30(2)：1-6.
[97]彭其渊,赵军.技术站列车解编顺序的调整方法[J].西南交通大学学报,2009,44(3)：385-391.
[98]黎浩东,何世伟,麻克军.编组站调度信息对阶段计划的影响及计划调整研究[J].物流技术,2010,29(1)：45-48.
[99]景云.不确定条件下编组站调度系统配流模型及算法研究[D].成都：西南交通大学,2010.
[100]赵海宽.关于TMIS货物列车确保系统管理问题初探[J].铁道运输与经济,1999,11,30-31.
[101]A. Charnes, W.W. Cooper. Change-constrained programming[J]. Management Science,1959, 6(1):73-79.
[102]Liu B. Dependent-chance programming:A class of stochastic programming[J]. Computer & Mathematics with Applications,1997,34(2):89-104.
[103]A.L. Soyster. Convex programming with set inclusive constraints and applications to inexact linear programming [J]. Operation Research,1973,21:1154-1157.
[104]A. Ben-Tal, A. Nemirovski. Robust convex optimization[J]. Math. Operation Research.1998, 23:769-805.
[105]A. Ben-Tal, A.Nemirovski. Robust solutions of uncertain linear programs[J]. Operation Research Letter,1999,25:1-13.
[106]D. Bertsimas, M. Sim. The price of robustness[J]. Operations Research,2004,52(1):35-53.
[107]D. Bertsimas, M.Sim. Robust discrete optimization and network flows[J]. Mathematical Programming,2003, Ser.B 98:49-71.
[108]S. Cierone, GD.Angelo, G.Di Stefano, D. Frigioni, A. Navarra. Robust algorithms and price of robustness in shunting problems[J]. Technical Report ARRIVAL-TR-0072, ARRIVAL project,2007.
[109]A.L. Erera, J.C. Morales, M. Savelsbergh. Robust optimization of empty repositioning problem[J]. Operation Research,2009,57(2):468-483.
[110]M.S. Shafia, S.J. Sadjadi, A. Jamili. Robust train formation planning[J]. Proceedings of the Institution of Mechanical Engineers, Part F:Journal of Rail and Rapid Transit,2010.
[111]孙华.基于鲁棒优化的应急管理下的车辆路线问题的研究[D].开封：河南大学,2004.
[112]孙志明.基于鲁棒优化的电梯群控调度策略的研究[D].天津：天津大学,2006.
[113]王世东.编组站智能调度系统的研究[D].北京：清华大学,2009.
[114]孟润虎.编组站列车解编协调优化相关问题研究[D].成都：西南交通大学,2010.
[115]景云,王慈光,薛峰,牟峰.编组站列车溜放时间的估计方法[J].西南交通大学学报,2009,44(6)：900-905.
[116]王烁.考虑解编顺序的编组站阶段计划配流问题研究[D].北京：北京交通大学,2011.
[117]曹书波.调车作业计划优化方法研究[D].兰州：兰州交通大学,2003.
[118]宋建业.优化筛选摘挂列车编组调车方案的分析计算法[J].铁道学报,1999,21(3)：11-17.
[119]高四维,张殿业.一种新的调车作业原理——“消逆法”[J].铁道学报,2003,25(5)：1-7.
[120]李纬.摘挂列车调车计划的算法研究及实现[J].铁道运输与经济,2007,29(3)：79-81,84.
[121]孙焰,牟世斌,张俊杰,张方华.求选编钩计划最优下落方案的一种最短路算法[J].铁道运输与经济,2011,33(10)：64-69.
[122]张洪海,胡明华CDM GDP飞机着陆时隙多目标优化分配[J].系统管理学报,2009, 18(3)：302-308.
[123]张洪海,胡明华CDM ADGDP机场容量与时隙协同配置[J].系统工程理论与实践,2010,30(10)：1901-1908.
[124]Z.W. Geem, J.H. Kim, G.V. Loganathan. A New Heuristic Optimization Algorithm:Harmony Search[J]. Simulation,2001,76(2):60-68.
[125]J.H. Kim, Z.W. Geem, E.S. Kim. Parameter estimation of the nonlinear Muskingum model using harmony search[J]. Journal of the American Water Resources Association,2001,37(5): 1131-1138.
[126]Lee K.S., Geem Z.W. A new structural optimization method based on the harmony search algorithm[J]. Computers&Structures,2004,82(9):781-798.
[127]Lee K.S., Geem Z.W. A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice[J]. Computer Methods in Applied Mechanics and Engineering,2005,194(36):3902-3933.
[128]Mahdavi M, Fesanghary M, Damangir E. An improved harmony search algorithm for solving optimization problems[J]. Applied Mathematics and Computation,2007,188(2):1567-1579.
[129]M. Omran, M. Mahdavi. Global-best harmony search[J]. Applied Mathematics and Computation,2008,198(2):43-656.
[130]赵鹏军.优化问题的几种智能算法[D].西安：西安电子科技大学,2009.
[131]Wan Guohua. Single machine bicriteria scheduling-Theory and some selected problems [M]. Beijing:Science Press,2004.
[132]许瑞.基于蚁群优化算法的批调度问题研究[D].合肥：中国科学技术大学,2011.
[133]郭鹏,程文明,张则强.求解具有恶化工件单机调度问题的改进遗传算法[J].西南交通大学学报,2011,46(3)：506-511.
[134]王烁,何世伟,黎浩东,申永生.禁忌搜索算法在编组站调机运用计划中的应用[J].铁道运输与经济,2011,33(2)：83-87.
[135]Glover F. Tabu search:part I[J]. Journal on Computing,1989,1 (3):190-206.
[136]Blue J.A., Bennett K.P. Hybrid extreme point tabu search[J]. European Journal of Operational Research,1998,106(2/3):676-688.
[137]Sait S.M, Youssef H. Coms/Bicmos mixed design using tabu search[J]. Electronics Letters, 1998,34(14):1395-1396.
[138]Lutz C.M, Davis K.P, Sun M. Determining buffer location and size in production lines using tabu search[J]. European Journal of Operational Research,1998,106(2/3):301-316.
[139]Al-Sultan K.S, Fedjki C.A. A tabu search- based algorithm for the fuzzy clustering problem[J]. Pattern Recognition,1997,30(12):2023-2030.
[140]Kirkpatrick S, Gelatt C.D., Vecchi M.P. Optimization by simulated annealing[J]. Science,1983, 220(4598):671-680.
[141]Sayarshad H.R., Ghoseiri K. A simulated annealing approach for the multi-peoriodic rail-car fleet sizing problem[J]. Computer & Operation Research,2009,36(6):1789-1799.
[142]林柏梁,朱松年.优化编组计划的非线性0-1规划模型及模拟退火算法[J].铁道学报,1994,16(2)：61-66.
[143]林柏梁,田亚明,王志美.基于最远站法则的列车编组计划优化双层规划模型[J].中国铁道科学,2011,32(5)：108-113.
[144]张波,叶家玮,胡郁葱.模拟退款算法在路径优化问题中的应用[J].中国公路学报,2004,17(1)：79-81.
[145]胡大伟,朱志强,胡勇.车辆路径问题的模拟退火算法[J].中国公路学报,2006, 19(4)：123-126.
[146]张嘉敏,韩宝明.铁路列车占用车站股道时序优化研究[J].交通运输系统工程与信息,2011,11(3)：110-107.
[147]Bouzina K., Emmons H. Interval scheduling on identical machines[J]. Journal of Global Optimization,1996,9(30):379-393.
[148]Faigle U, Nawijn M. Note on scheduling intervals online[J]. Discrete Applied Mathematics, 1995,58(1):13-17.
[149]王正彬,杜文.铁路技术站到发线运用调整模型及算法[J].西南交通大学学报,2006,41(2)：202-205.
[150]刘克.实用马尔科夫决策过程[M].北京：清华大学出版社,2004.
[151]刑锦江.虚拟现实环境中的策略生成[D].北京：北京航空航天大学,2008.
[152]王慈光.运输模型及优化[M].北京：中国铁道出版社,2004.
[153]何世伟.新一代编组站调度系统的开发理念与实践[J].铁道货运,2010, 28(7)：5-11,21.
[154]武燕,王宇平,刘小雄,冶继民.求解动态优化问题的自组织进化算法[J].控制与决策,2009,24(5)：653-662.
[155]王洪峰,汪定伟,杨圣祥.动态环境中的进化算法[J].控制与决策,2007, 22(2)：127-131，137.
[156]C. Reeves, H. Karatza. Dynamic sequencing of a mult-iprocessor system:A genetic algorithm approach [C]. Proc of 1st Int Conf on Artificial Neural Nets and Genetic Algorithms. San Francisco:Morgan Kaufmann Publishers,1993:491-495.
[157]C. Bierwirth, H. Kopfer, D.C. Mattfeld. Genetic algorithm based scheduling in a dynamic manufacturing environment[C]. Proc of IEEE Conf on Evolutionary Computation. Piscataway: IEEE Service Center,1995:439-443.
[158]C. Bierwirth, D.C. Mattfeld. Production scheduling and rescheduling with genetic algorithms [J]. Evolutionary Computation,1999,7(1):1-18.
[159]H.G Cobb. An investigation into the use of hypermutation as an adaptive oper ator in genetic algorithms having continuous, time-dependent nonstationary environment [R]. Washington: Naval Research Laboratory,1990.
[160]R.W. Morrison, K.A. Jong de. Triggered hypermutation revisited[C]. Proc of Congress on Evolutionary Computation. Piscataway:IEEE Service Center,2000:1025-1032.
[161]J.J. Grefenstette. Genetic algorithms for changing environments[C]. Parallel Problem Solving from Nature. Brussels,1992:137-144.
[162]H.G. Cobb, J.J. Grefenstette. Genetic algorithms for tracking changing environments[C]. Proc of 5th Int on Genetic Algorithms. San Francisco:Morgan Kaufmann Publishers,1993: 523-530.
[163]R. Eriksson, B. Olsson. On the performance of evolutionary algorithms with life- time adaptation in dynamic fitness landscapes [C]. Proc of 2004 Congress on Evolutionary Computing. Piscataway:IEEE Service Center,2004:1293-1300.
[164]S.M. Gerratt, J.H. Walker. Genetic algorithms:Combining evolutionary and'non'-evolutionary methods in tracking dynamic global optima[C]. Proc of the Genetic and Evolutionary Computation Conf. San Francisco:Morgan Kaufmann Publishers,2002: 359-366.
[165]董泽清,刘克.无界报酬折扣半马氏模型最优策略的结构[J].中国科学(A辑),1985, 11：975-985.
[166]D.J. White. Markov Decision Processes[M]. Wiley Press, Chichester,1993.
[2]吴家豪.铁路编组站系统设计优化[M].北京：中国铁道出版社,1994.
[3]杨浩.铁路运输组织学[M].北京：中国铁道出版社,2001.
[4]汪晓霞,李红昌,王喆.国外铁路客货运管理信息系统比较分析及启示[J].铁道经济研究,2003,11(4)：28-30.
[5]张经化.铁路编组站现代化改造技术引进问题的探索[J].铁道运输与经济,2000，22(3)：36-37.
[6]Classification yard[EB/OL]. Http://en.wikipedia.org/wiki/Classification_yard.2010-10-12.
[7]Canadian pacific railway's streamlined railroad scheduling wins informs tech world series[EB/OL]. http://www.informs.org/Press/Phoenixrelease03b2.htm,2010-10-12.
[8]O.Gulbrodsen. Optimal Planning of Marshalling Yard by Operation Research[J]. PROC,1963: 226-233.
[9]S.Yagar, Fracisico. A Efficiency Sequence of Classification Yard Hump[J]. Transportation Research,124,1989.
[10]T.Crainic, J.Ferland, J.Rousseav. A Tactical Planning Model for Rail Freight Transportation[J]. Transportation Science,1984,18:165-183.
[11]A Assad Arjang. Modelling of Rail Networks:Toward a Routing/Makeup Model[J]. Transportation Research, Part B,1977,14(B):101-114.
[12]H.Keaton Mark. Designing Optimal Railroad Operating Plans:Lagrangian Relaxation and Heuristic Approach[J]. Transportation Research, Part B,1989,23:443-452.
[13]H.Keaton Mark. Designing Railroad Operation Plans:a Dual Adjustment Method for Implementing Heuristic Approach[J]. Transportation Research, Part B,1992,26(4):263-279.
[14]R Lentink, Fioole M., Jan Pieter. Applying Operations Research Techniques to Planning Train Shunting[R]. ERIM Report Series Reference,2003.
[15]O.Hein. A Two-stage Queuing Model for a Marshalling Yard[J]. Rail Int.,1972,(3):249-250.
[16]E.R.Petersen. Railroad Modeling Part Ⅰ:Prediction of Put-through Time[J]. Transportation Science,1977,11 (1):37-49.
[17]E.R.Peterseh. Railroad Modeling Part Ⅱ:The Effect of Yard Facilities on Congestion[J]. Transportation Science,1977,11 (1):50-59.
[18]Turnquist MA, Daskin MS. Queuing Models of Classification and Connection Delay in Rail Yards[J]. Transportation Science,1982,16(2):207-230.
[19]D.Martland. PMAKE Analysis:Prediction Rail Yard Time Distributions Using Probabilistic Train Connection Standards[J]. Transportation Science,1982,16,476-506.
[20]Deloitte, Haskins, and Sells. Rail terminal sequencing system[J]. Detail design manual, Freight Car Utilization Program, Association of American Railroads, Washington D.C.,1977.
[21]P. J. Wong, C. V. Elliott, and M. R. Hathorne. Demonstration of dynamic track assignment program[J]. Technical report, SRI International, Menlo Park, California 95025,1979.
[22]E. R. Kraft. A mixed integer optimization model to improve freight car classification in railroad yards. Working paper, OPIM Dept., Wharton School, University of Pennsylvania, Philadelphia, PA 19104,1993.
[23]Wang, X. Improving Planning for Railroad Yard, Forestry and Distribution[D]. Ph. D. Dissertation, Department of Operations and Information Management, Wharton School, University of Pennsylvania, Philadelphia, PA,1997.
[24]王慈光.用表上作业法求解编组站配流问题的研究[J].铁道学报,2002, 24(4)：1-5.
[25]王慈光.编组站静态配流网络模型[J].交通运输工程与信息学报,2003, 1(2)：67-71.
[26]崔叙,熊天文.编组站阶段计划IDSS的车流推算方法研究[J].铁路计算机应用,2002,11(11)：24-26.
[27]徐杰,杜文,刘春煌.铁路技术站车流推算模型和算法[M].中国铁道科学,2005, 26(4)：120-123.
[28]荆世明,吴健波.铁路编组站车流配流问题研究[M].铁道运输与经济,2008, 30(1)：83-86.
[29]景云,王慈光,王如义,唐建桥.运用学习规则求解编组站静态配流问题的研究[J].铁道运输与经济,2010, 32(1)：22-26.
[30]严余松,朱松年.铁路枢纽车流调度决策模型研究[J].铁道学报,2001,23(1)：9-12.
[31]王慈光.编组站动态配流模型与算法研究[J].铁道学报,2004, 26(1)：1-6.
[32]薛峰.编组站调度系统配流协同优化理论与方法研究[D].成都：西南交通大学,2006.
[33]薛锋,王慈光.编组站配流相关问题分析[J].交通运输工程与信息学报,2008, 6(4)：29-33,39.
[34]王正彬,杜文,吴柏青,羊艳.基于解编顺序的阶段计划车流推算模型及算法[J].西南交通大学学报,2008,43(1)：91-95.
[35]申永生,何世伟,王保华,穆美如.免疫算法求解编组站阶段计划配流问题研究[J].铁道学报,2009,31(4)：1-6.
[36]牛惠民,胡安洲.双向编组站车流接续的综合优化[J].铁道学报,1998,20(6)：16-21.
[37]彭其渊,赵军,韩雪松.技术站广义配流问题模型与算法[J].中国铁道科学,2010,31(2)：108-114.
[38]赵军,彭其渊,文超,徐进.技术站广义动态配流问题的遗传算法[J].铁道学报,2010,32(3)：9-15.
[39]赵军,彭其渊,文超,徐进.技术站广义动态配流问题的局部邻域算法[J].西南交通大学学报,2010,45(3)：486-492.
[40]赵军,韩雪松,彭其渊.技术站配流与调机运用综合问题的拉格朗日松弛算法[J].铁道学报,2011,33(11)：1-7.
[41]曹家明,范征,毛节铭.编组站作业优化决策支持系统-解体子系统[J].铁道学报,1993,15(4)：66-73.
[42]王慈光.编组站列车解体方案的计数方法[J].铁道学报,2000,22(6)：2-7.
[43]李文权,王炜,杜文,林诒勋.铁路技术站调机运用模型及算法[J].系统工程学报,2000,15(1)：38-43.
[44]徐杰,杜文,黎青松,周再玲.铁路区段站决策支持系统的研究-调车机车的合理安排[J].四川工业学院学报,2003,22(2)：11-14.
[45]王世东,郑力,张智海,田任然.蚁群算法在调机运用计划中的应用[J].中国铁道科学,2007,28(3)：104-109.
[46]赵小柠.基于时间窗的大型编组站取送调机作业优化研究[J].兰州交通大学学报,2008, 27(1)：76-79.
[47]李文权,王炜,程世辉.铁路编组站到发线运用的排序模型和算法[J].系统工程理论与实践,2000,20(6)：75-78.
[48]吕红霞,倪少权,纪洪业.技术站调度决策支持系统的研究-到发线的合理使用[J].西南交通大学学报,2000,35(3)：255-258.
[49]徐杰,杜文,李冰.铁路区段站到发线运用计划安排的优化算法[J].系统工程理论方法应用,2003,12(3)：253-256.
[50]徐杰,杜文,常军乾,文军,梁志杰.基于遗传算法的区段站到发线运用优化安排[J].中国铁道科学,2003,24(2)：109-114.
[51]谢楚农,黎新华.铁路客运站到发线运用优化研究[J].中国铁道科学,2004, 25(5)：130-133.
[52]王栋.铁路客运站到发线运用自动编排设计[D].长沙：中南大学,2007.
[53]吕红霞,何大可,陈韬.基于蚁群算法的客运站到发线运用计划编制方法[J].西南交通大学学报,2008,42(2)：153-158.
[54]史峰,陈彦,秦进,周文梁.铁路客运站到发线运用和接发车进路排列方案综合优化[J].中国铁道科学,2009,30(6)：108-113.
[55]刘军.铁路编组站作业计划滚动式智能化编制方法的研究[D].北京：北京交通大学,1993.
[56]崔炳谋.编组站阶段计划编制系统几个问题研究[J].兰州铁道学院学报,1996, 15(2)：64-68.
[57]何世伟.铁路枢纽作业计划的优化编制——编组站作业计划与枢纽日班计划的模型计算法研究[D].成都：西南交通大学,1996.
[58]何世伟.铁路编组站阶段计划优化模型的研究[J].铁道运输与经济,1996,18(4)：87-90.
[59]何世伟,宋瑞,朱松年.编组站阶段计划解编作业优化模型及算法[J].铁道学报,1997,19(3)：1-8.
[60]何世伟,宋瑞,朱松年.铁路编组站阶段计划编制的模型及其算法研究[J].系统工程理论与实践,1997,17(2)：88-94.
[61]Shiwei He, Rui Song, Sohail S.Chaudhry. An Integrated Dispatching Model for Rail Yards Operations[J]. Computers&Operations Research,2003,30(7):939-966.
[62]王明慧,赵强.编组站智能调度系统阶段计划优化模型及算法研究[J].铁道学报,2005,27(6)：1-9.
[63]王世东,郑力,张智海,刘书成.编组站阶段计划自动编制的数学模型及算法[J].中国铁道科学,2008,29(2)：120-125.
[64]袁庆达,杜文,黎青松.区段站阶段计划的优化模型和算法[J].西南交通大学学报,2000,35(3)：250-254.
[65]徐杰.区段站阶段计划自动编制模型和算法研究[D].成都：西南交通大学,2004.
[66]胡刚.编组站阶段计划自动编制与调整的研究[D].成都：西南交通大学,2000.
[67]常军乾.编组站阶段计划编制系统设计与若干技术的研究[D].成都：西南交通大学,2002.
[68]胡猛.计算机编制编组站阶段计划的模型和算法的研究[D].北京：北京交通大学,2006.
[69]胡兴宇.编组站作业计划优化编制若干问题研究[D].北京：北京交通大学,2008.
[70]牛惠民.双向编组站列车调度调整的优化模型及算法[J].中国铁道科学,2007,28(6)：102-108.
[71]刘宝碇,赵瑞清,王纲.不确定规划及应用[M].北京：清华大学出版社,2003.
[72]高尚,杨静宇.群智能算法及其应用[M].北京：中国水利水电出版社,2006.
[73]段海滨.蚁群算法原理及其应用[M].北京：科学出版社,2005.
[74]何世伟,宋瑞,胡安洲.编组站阶段计划刚性与柔性优化的协调研究[J].铁道学报,1999,21(4)：1-8.
[75]何世伟,宋瑞,鲁放,胡安州.铁路运输管理中的多机模糊排序问题及遗传算法研究[J].北京航空航天大学学报(社会科学版).2000,13(4)：4-10.
[76]王振宏,崔炳谋,许广辉.基于不确定理论和混合智能算法的调车机车运用研究[J].铁道运输与经济,2006,28(12)：87-89.
[77]刘霆,何世伟,王保华,安健.编组站调度计划随机机会约束规划模型计算法研究[J].铁道学报,2007,29(4)：12-17.
[78]黎浩东.铁路编组站鲁棒性阶段计划编制研究[D].北京：北京交通大学,2008.
[79]黎浩东,何世伟,宋瑞,郑锂.编组站阶段计划随机相关机会规划模型及算法[J].交通运输系统工程与信息,2010,10(1)：128-133.
[80]张全寿,铁路编组站站调决策支持系统的研究[J].北方交通人学学报,1989,13(4)：64-72.
[81]钟雁,张全寿.铁路编组站调车作业计划决策支持系统的研究[J].铁道学报,1994,16(4)：76-82.
[82]钟雁.一个基于动态模型的计划决策支持系统[J].北方交通大学学报,1994,18(4)：477-483.
[83]何世伟,宋瑞,赵强.铁路编组站阶段计划DSS研究[J].系统工程,1996,14(4)：62-66.
[84]崔叙,熊天文.编组站阶段计划IDSS的研究[J].铁路计算机应用,2001,10(3)：16-18.
[85]查伟雄,熊桂林,冷俊峰.列车编组计划决策支持系统的研究[J].交通运输系统工程与信息,2001,1(2)：124-128.
[86]崔炳谋,张朴,陈光伟.编组站综合自动化系统总体框架的研究[J].铁道运输与经济,2007,29(5)：42-46.
[87]何世伟,宋瑞,谭立刚,杨永凯,雷中林.枢纽编组站智能调度系统的设计与实现[J].北方交通大学学报,2002,26(5)：19-23.
[88]丁昆.成都北编组站综合集成自动化系统[J].中国铁路,2006,45(8)：46-48,56.
[89]编组站综合集成自动化系统(CIPS)概论[M].北京：北京全路通信信号研究设计院,2003.
[90]刘世,麻克军.计算机编制郑州北站阶段计划的研究与实现[J].铁路计算机应用, 2003,12(9)：158-160.
[91]王明慧.编组站智能调度系统YIDS体系框架与关键技术优化理论研究[D].成都：西南交通大学,2007.
[92]杨涛.基于多Agent的编组站作业计划计算机编制方法和作业管理系统研究[D].北京：北京交通大学,2004.
[93]邢科家.基于遗传算法和多Agent协同的调度指挥系统研究[D].北京：北京交通大学,2004.
[94]郝鹏飞.基于Multi-Agent编组站调度支持平台研究[D].北京：北京交通大学, 2006.
[95]薛锋,王慈光.编组站列车编组顺序的调整方法[J].铁道学报,2007,29(4)：1-5.
[96]薛锋,王慈光,罗建,赵强.编组站列车解体方案与编组方案的协调优化研究[J].铁道学报,2008,30(2)：1-6.
[97]彭其渊,赵军.技术站列车解编顺序的调整方法[J].西南交通大学学报,2009,44(3)：385-391.
[98]黎浩东,何世伟,麻克军.编组站调度信息对阶段计划的影响及计划调整研究[J].物流技术,2010,29(1)：45-48.
[99]景云.不确定条件下编组站调度系统配流模型及算法研究[D].成都：西南交通大学,2010.
[100]赵海宽.关于TMIS货物列车确保系统管理问题初探[J].铁道运输与经济,1999,11,30-31.
[101]A. Charnes, W.W. Cooper. Change-constrained programming[J]. Management Science,1959, 6(1):73-79.
[102]Liu B. Dependent-chance programming:A class of stochastic programming[J]. Computer & Mathematics with Applications,1997,34(2):89-104.
[103]A.L. Soyster. Convex programming with set inclusive constraints and applications to inexact linear programming [J]. Operation Research,1973,21:1154-1157.
[104]A. Ben-Tal, A. Nemirovski. Robust convex optimization[J]. Math. Operation Research.1998, 23:769-805.
[105]A. Ben-Tal, A.Nemirovski. Robust solutions of uncertain linear programs[J]. Operation Research Letter,1999,25:1-13.
[106]D. Bertsimas, M. Sim. The price of robustness[J]. Operations Research,2004,52(1):35-53.
[107]D. Bertsimas, M.Sim. Robust discrete optimization and network flows[J]. Mathematical Programming,2003, Ser.B 98:49-71.
[108]S. Cierone, GD.Angelo, G.Di Stefano, D. Frigioni, A. Navarra. Robust algorithms and price of robustness in shunting problems[J]. Technical Report ARRIVAL-TR-0072, ARRIVAL project,2007.
[109]A.L. Erera, J.C. Morales, M. Savelsbergh. Robust optimization of empty repositioning problem[J]. Operation Research,2009,57(2):468-483.
[110]M.S. Shafia, S.J. Sadjadi, A. Jamili. Robust train formation planning[J]. Proceedings of the Institution of Mechanical Engineers, Part F:Journal of Rail and Rapid Transit,2010.
[111]孙华.基于鲁棒优化的应急管理下的车辆路线问题的研究[D].开封：河南大学,2004.
[112]孙志明.基于鲁棒优化的电梯群控调度策略的研究[D].天津：天津大学,2006.
[113]王世东.编组站智能调度系统的研究[D].北京：清华大学,2009.
[114]孟润虎.编组站列车解编协调优化相关问题研究[D].成都：西南交通大学,2010.
[115]景云,王慈光,薛峰,牟峰.编组站列车溜放时间的估计方法[J].西南交通大学学报,2009,44(6)：900-905.
[116]王烁.考虑解编顺序的编组站阶段计划配流问题研究[D].北京：北京交通大学,2011.
[117]曹书波.调车作业计划优化方法研究[D].兰州：兰州交通大学,2003.
[118]宋建业.优化筛选摘挂列车编组调车方案的分析计算法[J].铁道学报,1999,21(3)：11-17.
[119]高四维,张殿业.一种新的调车作业原理——“消逆法”[J].铁道学报,2003,25(5)：1-7.
[120]李纬.摘挂列车调车计划的算法研究及实现[J].铁道运输与经济,2007,29(3)：79-81,84.
[121]孙焰,牟世斌,张俊杰,张方华.求选编钩计划最优下落方案的一种最短路算法[J].铁道运输与经济,2011,33(10)：64-69.
[122]张洪海,胡明华CDM GDP飞机着陆时隙多目标优化分配[J].系统管理学报,2009, 18(3)：302-308.
[123]张洪海,胡明华CDM ADGDP机场容量与时隙协同配置[J].系统工程理论与实践,2010,30(10)：1901-1908.
[124]Z.W. Geem, J.H. Kim, G.V. Loganathan. A New Heuristic Optimization Algorithm:Harmony Search[J]. Simulation,2001,76(2):60-68.
[125]J.H. Kim, Z.W. Geem, E.S. Kim. Parameter estimation of the nonlinear Muskingum model using harmony search[J]. Journal of the American Water Resources Association,2001,37(5): 1131-1138.
[126]Lee K.S., Geem Z.W. A new structural optimization method based on the harmony search algorithm[J]. Computers&Structures,2004,82(9):781-798.
[127]Lee K.S., Geem Z.W. A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice[J]. Computer Methods in Applied Mechanics and Engineering,2005,194(36):3902-3933.
[128]Mahdavi M, Fesanghary M, Damangir E. An improved harmony search algorithm for solving optimization problems[J]. Applied Mathematics and Computation,2007,188(2):1567-1579.
[129]M. Omran, M. Mahdavi. Global-best harmony search[J]. Applied Mathematics and Computation,2008,198(2):43-656.
[130]赵鹏军.优化问题的几种智能算法[D].西安：西安电子科技大学,2009.
[131]Wan Guohua. Single machine bicriteria scheduling-Theory and some selected problems [M]. Beijing:Science Press,2004.
[132]许瑞.基于蚁群优化算法的批调度问题研究[D].合肥：中国科学技术大学,2011.
[133]郭鹏,程文明,张则强.求解具有恶化工件单机调度问题的改进遗传算法[J].西南交通大学学报,2011,46(3)：506-511.
[134]王烁,何世伟,黎浩东,申永生.禁忌搜索算法在编组站调机运用计划中的应用[J].铁道运输与经济,2011,33(2)：83-87.
[135]Glover F. Tabu search:part I[J]. Journal on Computing,1989,1 (3):190-206.
[136]Blue J.A., Bennett K.P. Hybrid extreme point tabu search[J]. European Journal of Operational Research,1998,106(2/3):676-688.
[137]Sait S.M, Youssef H. Coms/Bicmos mixed design using tabu search[J]. Electronics Letters, 1998,34(14):1395-1396.
[138]Lutz C.M, Davis K.P, Sun M. Determining buffer location and size in production lines using tabu search[J]. European Journal of Operational Research,1998,106(2/3):301-316.
[139]Al-Sultan K.S, Fedjki C.A. A tabu search- based algorithm for the fuzzy clustering problem[J]. Pattern Recognition,1997,30(12):2023-2030.
[140]Kirkpatrick S, Gelatt C.D., Vecchi M.P. Optimization by simulated annealing[J]. Science,1983, 220(4598):671-680.
[141]Sayarshad H.R., Ghoseiri K. A simulated annealing approach for the multi-peoriodic rail-car fleet sizing problem[J]. Computer & Operation Research,2009,36(6):1789-1799.
[142]林柏梁,朱松年.优化编组计划的非线性0-1规划模型及模拟退火算法[J].铁道学报,1994,16(2)：61-66.
[143]林柏梁,田亚明,王志美.基于最远站法则的列车编组计划优化双层规划模型[J].中国铁道科学,2011,32(5)：108-113.
[144]张波,叶家玮,胡郁葱.模拟退款算法在路径优化问题中的应用[J].中国公路学报,2004,17(1)：79-81.
[145]胡大伟,朱志强,胡勇.车辆路径问题的模拟退火算法[J].中国公路学报,2006, 19(4)：123-126.
[146]张嘉敏,韩宝明.铁路列车占用车站股道时序优化研究[J].交通运输系统工程与信息,2011,11(3)：110-107.
[147]Bouzina K., Emmons H. Interval scheduling on identical machines[J]. Journal of Global Optimization,1996,9(30):379-393.
[148]Faigle U, Nawijn M. Note on scheduling intervals online[J]. Discrete Applied Mathematics, 1995,58(1):13-17.
[149]王正彬,杜文.铁路技术站到发线运用调整模型及算法[J].西南交通大学学报,2006,41(2)：202-205.
[150]刘克.实用马尔科夫决策过程[M].北京：清华大学出版社,2004.
[151]刑锦江.虚拟现实环境中的策略生成[D].北京：北京航空航天大学,2008.
[152]王慈光.运输模型及优化[M].北京：中国铁道出版社,2004.
[153]何世伟.新一代编组站调度系统的开发理念与实践[J].铁道货运,2010, 28(7)：5-11,21.
[154]武燕,王宇平,刘小雄,冶继民.求解动态优化问题的自组织进化算法[J].控制与决策,2009,24(5)：653-662.
[155]王洪峰,汪定伟,杨圣祥.动态环境中的进化算法[J].控制与决策,2007, 22(2)：127-131，137.
[156]C. Reeves, H. Karatza. Dynamic sequencing of a mult-iprocessor system:A genetic algorithm approach [C]. Proc of 1st Int Conf on Artificial Neural Nets and Genetic Algorithms. San Francisco:Morgan Kaufmann Publishers,1993:491-495.
[157]C. Bierwirth, H. Kopfer, D.C. Mattfeld. Genetic algorithm based scheduling in a dynamic manufacturing environment[C]. Proc of IEEE Conf on Evolutionary Computation. Piscataway: IEEE Service Center,1995:439-443.
[158]C. Bierwirth, D.C. Mattfeld. Production scheduling and rescheduling with genetic algorithms [J]. Evolutionary Computation,1999,7(1):1-18.
[159]H.G Cobb. An investigation into the use of hypermutation as an adaptive oper ator in genetic algorithms having continuous, time-dependent nonstationary environment [R]. Washington: Naval Research Laboratory,1990.
[160]R.W. Morrison, K.A. Jong de. Triggered hypermutation revisited[C]. Proc of Congress on Evolutionary Computation. Piscataway:IEEE Service Center,2000:1025-1032.
[161]J.J. Grefenstette. Genetic algorithms for changing environments[C]. Parallel Problem Solving from Nature. Brussels,1992:137-144.
[162]H.G. Cobb, J.J. Grefenstette. Genetic algorithms for tracking changing environments[C]. Proc of 5th Int on Genetic Algorithms. San Francisco:Morgan Kaufmann Publishers,1993: 523-530.
[163]R. Eriksson, B. Olsson. On the performance of evolutionary algorithms with life- time adaptation in dynamic fitness landscapes [C]. Proc of 2004 Congress on Evolutionary Computing. Piscataway:IEEE Service Center,2004:1293-1300.
[164]S.M. Gerratt, J.H. Walker. Genetic algorithms:Combining evolutionary and'non'-evolutionary methods in tracking dynamic global optima[C]. Proc of the Genetic and Evolutionary Computation Conf. San Francisco:Morgan Kaufmann Publishers,2002: 359-366.
[165]董泽清,刘克.无界报酬折扣半马氏模型最优策略的结构[J].中国科学(A辑),1985, 11：975-985.
[166]D.J. White. Markov Decision Processes[M]. Wiley Press, Chichester,1993.