摘要
编制动车组运用和检修计划是客运专线运输组织的关键任务，直接关系到客运专线的安全运营和服务品质。动车组的运用和检修方式与既有机车车辆差别很大，呈现运营效率高、检修标准严、运用检修一体化的特点，提出了诸多亟待解决的动车组运用检修计划新问题。论文以目前我国动车组的运用检修实践为背景，在列车运行图确定的前提下，开展动车组运用检修计划优化方法的研究，通过制定合理的运用检修计划，严格执行检修规程，确保动车组的安全性，提高动车组的利用率以及动车运用所（动车基地）的检修能力，论文主要工作包括：
总结了动车组运用计划和检修计划优化问题的既有研究成果及局限性。论述了我国动车组的运用检修过程及其运用计划和检修计划的编制业务，并以实际情况为背景，总结出5类动车组运用计划和检修计划优化问题。
从5类动车组运用计划和检修计划优化问题中，提炼出两类通用的优化问题：带状态约束的旅行商问题和带拓扑约束的车间调度问题，给出了这两类问题的数学描述，并设计了求解问题的构造图和基于最大最小蚁群优化算法的通用求解方法，为具体的动车组运用计划和检修计划优化问题奠定了基础。
提出了动车组运用交路计划的优化模型，将原问题转化为带状态约束的旅行商问题，设计了列车接续网络和求解算法，实现了运用交路计划的自动优化编制，减少了运用交路的数量和检修次数，提高了动车组的利用率。
在动车组连续担当某一运用交路模式下，提出了分别编制动车组运用计划和日常检修计划的优化模型，并分别设计了问题的求解算法；在动车组在多个运用交路之间套跑模式下，提出了一体化编制运用计划和日常检修计划的优化模型和求解算法，减少了动车组的使用数量和检修成本。
基于带拓扑约束的车间调度问题，提出了动车运用所调车作业计划的优化模型，设计了调车任务拓扑图生成算法、最优调车任务调度序列的求解算法和调车计划的转化算法，有效优化了运用所的调车过程并提高了关键检修设备的吞吐量。
提出了高复杂度的动车组高级检修车间调度优化模型，设计了检修任务拓扑图生成算法、最优检修任务调度序列求解算法和车间调度计划的转换算法，实现了高级检修车间调度计划的自动优化编制，提高了计划的编制质量。
Operation and maintenance schemes of Electric Multiple Units (EMUs) are amongthe key issues for the organization work of Passenger Dedicated Lines and play a hugeimpact on the security, efficiency and service quality of Passenger Dedicated Lines.Compared with the existing rolling stock, EMUs’ operation and maintenance presentmuch difference, including their higher efficiency, stricter maintenance standard, andjointly organizing operation and maintenance process, which raises new problems forscheduling the operation and maintenance schemes of EMUs. Based on the actualbusiness of CRH EMUs’ operation and maintenance process, under the premise of traindiagram of Passenger Dedicated Lines, aiming at formulating sound operation andmaintenance schemes, strictly enforcing maintenance regulation, assuring EMUs’security, and enhancing EMUs’ efficiency and the capacity of EMU depots (EMUbases), this dissertation researched the optimization problems of the operation andmaintenance schemes of EMUs. The main work of this dissertation can be summarizedas:
This dissertation reviewed the existing research results of the optimizationproblems of the operation and maintenance schemes of EMUs and their limitations,stated the related business of CRH EMUs’ actual operation and maintenance process,and summarized five optimization problems of the operation and maintenance schemesof EMUs.
From the five problems, two general problems (State-Constrained TravelingSalesman Problem and Topology-Constrained Job Shop Scheduling Problem) wereextracted, and their mathematical description along with general solving methods basedon MMAS were given, which laid the foundation for the five problems.
This dissertation established an optimization model for the Route SchedulingProblem of EMUs, transformed the original problem into the State-ConstrainedTraveling Salesman Problem, designed the continual network of train, put forward asolving method based on MMAS, realized automation of Routing Scheme of EMUs,reduced the number of routes, and increased the utilization ratio of EMUs.
Under the premise of routing scheme and the regulation of the routinemaintenance (level-1and level-2) of EMUs, this dissertation researched two modes for planning the Operational Scheme and Routine Maintenance Scheme of EMUs. In theFixed Assignment Mode, the two schemes were uncoupled and planned separately,while in the Agile Assignment Mode, the two schemes could not be uncoupled and hadto be jointly scheduled. This dissertation constructed optimization models, designedsolving algorithms for each mode, and decreased the number of EMUs and cost ofroutine maintenance.
Based on the Topology-Constrained Job Shop Scheduling Problem, An integeroptimization model for Shunting Operation Scheduling Problem within EMUs Depotwas established, shunting tasks topology graph generation algorithm, solving algorithmof optimal scheduling sequence of shunting tasks, and Shunting Operation Schemetransformation algorithm were put forward, by which the process of shunting withinEMUs depot was streamlined and the unnecessary occupation time of the critical trackarea was reduced.
An integer optimization model for high complexity Overhaul Job Shop SchedulingProblem of EMUs was established, overhaul tasks topology graph generation algorithm,solving algorithm of optimal scheduling sequence of overhaul tasks, and Overhaul JobShop Scheme transformation algorithm were put forward, by which the schedulingprocess of overhaul of EMUs was improved.
引文
[1]史天运，张洪宇，贾利民.日本铁路智能运输系统(RITS)-CyberRail框架及研究现状[J].中国铁道科学，2003，24(6)：82-88.
[2]史天运.铁路高速客运专线信息系统总体框架研究[J].交通运输系统工程与信息，2005，5(1)：92-106.
[3] Desrochers M., Savelsbergh J.P.. A Classifications Scheme for Vehiele Routing and SchedulingProblem [J]. European Journal of Operational Research,1990,46:322-332.
[4] Assad A.A.. Modeling and Improvement Issues in Vehiele Routing: method and studies [J].Management Science and System,1998,16:456-469.
[5] Desrochers M., Soumis F.. The Multiple Vehicle Dial-a-Ride Problem [J]. Computer-AidedTransit Seheduling Lecture Notes in Economics and Mathematical System,1998,308:15-27.
[6] Freling R., Paixao J.M.P.. Models and Algorithms for Single-Depot Vehicle Seheduling [J].Transportation Seience,2001,35(2):165-180.
[7] Fabri A.. On dynamic Pickup and Delivery Vehicle Routing with Several Time Windows andWaiting Time [J]. Transportation Research Part B,2006,40(1):335-350.
[8]蔡延光，钱积新，孙优贤.智能运输调度系统模型库构造与管理[J].系统工程理论与实践，2000，9：83-90.
[9]贾永基.车辆调度问题优化算法研究[D].上海交通大学，2004.
[10] Bamhart C., Jenlg L.. Branch-and-Price: Column Generation for Solving Huge IntegerPrograms [J]. Operations Research,1998,46(3):316-329.
[11] Bartholomew Biggs M., Wilson S.P.. Global Optimization Approaches to an Aireraft RoutingProblem [J]. European Journal of Operational Research,2003,146(1):417-431.
[12] Boland N., Dumitreseu I.. Aceelerated Label Setting Algorithms for the Elementary ResourceConstrained Shortest Path Problem [J]. Operations Research Letters,2006,34(3):58-68.
[13] Bamhart C., Airline Sehedule Planning [EB/OL]. http://www.core.org.cn/OewWeb/Global/all-courses.html.
[14]崔炳谋.机车周转图的计算机优化算法[J].铁路计算机应用，1999，2：18-24.
[15]李致中，孙焰.用电子计算机铺画最优机车周转图[J].铁道运输与经济，1988，(5)：12-15.
[16]史峰，胡安洲.机车周转图的线性配置算法[J].铁道学报，1996，4：18-24.
[17]闫海峰.编制机车周转图的优化模型[J].中国铁道科学，2006，27(4)：123-128.
[18]梁栋，林柏梁，严贺祥，等.车种代用情况下的铁路空车调配研究[J].铁道学报，2005，27(4)：l-5.
[19]琳柏梁，胡安洲.重空车流运行组织的协同优化理论及模型[J].铁道学报，1998，20(5)：9-14.
[20]李文权，杜文，周贤伟.优化空车调配问题[J].西南交通大学学报，1998，33(4)：383-386.
[21]施其洲，施勇.具有双向、空重车流的路网车流径路多目标标线性规划模型及算例[J].铁道学报，1999(1)：2-10.
[22] Bussieck M.R., Winter T.,Zimmermann U.T.. Discrete Optimization in Public rail Transport [J].Mathematical Programming,1997,79:415-444.
[23] Sehrijver A.. Minimum Circulation of Railway Stock [J]. CWI Quarterly l993,6:205-221.
[24] Abbink E., Berg B.V.D.,Kroon L.,Salomon M.. Allocation of Railway Rolling Stock forPassenger Trains [J]. Transportation Science,2004,38(l):3341.
[25] Arianna A., Groot R., Leo Kroon., Sehrijver A.. Efficient Circulation of Railway RollingStockC Transportation Science,2006,40(3):378-391.
[26] Fioole P.J., Leo Kroon., Alexander Sehrijver. A Rolling Stock Circulation Model for Combiningand Splitting of Passenger Trains [J]. European Journal of Operational Researeh,2006,174(2):1281-1297.
[27] Peeters M., Kroon L.. Circulation of Railway Rolling Stock: A Branch-and-Price Approach [J].Computers&Operational Research,2008,35(2):538-556.
[28] Maroti G., Kroon L.. Maintenance Routing for Train Units: The Transition Model [J].Transportation Seience,2005,39(4):518-525.
[29] Maroti G., Kroon L.. Maintenance Routing for Train Units: The Interchange Model [J].Computers&Operational Research,2007,34:1121-1140.
[30] Sung Pil Hong, Kyung Min Kim, Kyung Sik Lee. A Pragmatic Algorithm for the Train-SetRouting: The Case of Korea High-Speed Raiway [J]. Omega,2009,37(3):637-645.
[31]赵鹏，胡安洲，杨浩.高速铁路动车组的不固定区段使用问题[J].铁道学报，1997，19(2)：15-19.
[32]赵鹏，胡安洲，杨浩.高速铁路动车组不固定区段使用条件下周转优化问题的研究[J].北方交通大学学报，1997，21(6)：621-624.
[33]赵鹏.高速铁路动车组和乘务员运用问题的研究[D].北京：北方交通大学，1998.
[34]赵鹏，张逸南.铁路动车组的运用问题研究[J].北京交通大学学报.2009(33)3：6-9
[35]聂磊.高速铁路列车运行调整优化理论与方法[D].北京：北方交通大学，1999.
[36]聂磊，赵鹏，杨浩，等.高速铁路动车组运用的研究[J].铁道学报，2001，23(3)：l-7.
[37]赵鹏，富井规雄.动车组运用计划及其编制算法[J].铁道学报，2003，25(3)：l-7.
[38]赵鹏，富井规雄.基于概率局域搜索的动车组平日运用计划编制算法[J].系统工程理论与实实践，2004，(2)：123-129.
[39]赵鹏，富井规雄.基于路段交换的多基地动车组运用计划的编制算法[J].铁道学报，2004，26(l)：7-11.
[40]李鹏.基于交路互换的客运专线动车组检修计划的研究[M].北京交通大学，2009.
[41]王莹.动车组运用计划和乘务计划的优化方法研究[D].北京：北京交通大学，2009.
[42]张才春.成网条件下客运专线动车组运用的研究[D].北京：北京交通大学，2010.
[43]张才春，陈建华，花伟.基于不同检修能力的动车组运用计划研究[J].中国铁道科学，2010，31(5)：131-133.
[44]花伟，张才春.动车组簇式运用方式研究[J].铁道运输与经济，2010，32(8)：76-80.
[45]张才春，花伟，陈建华.双修制下的动车组运用计划编制研究[J].铁道学报，2010，32(3)：l6-19.
[46]张杰，陈韬.客运专线动车组运用计划的计算机编制[J].西南交通大学学报，2006，41(5)：635-640.
[47]耿敬春，肖荣国，倪少权.客运专线动车组周期性运用计划编制的研究[J].铁道学报，2006，28(4)：17-21.
[48]曾向阳，吕林剑.基于主客观赋权法的动车组运用计划优选研究[J].兰州交通大学学报，2010，29(6)：150-153.
[49]史峰，周文梁，郁宇卫.客运专线动车组运用计划优化模型与算法[J].铁道学报，2011，33(1)：8-12.
[50]谢美全，毛保华，何天健.多交路动车组周转模型研究[J].交通运输系统工程与信息，2010，10(3)：50-57.
[51]陈华群，唐协.基于匈牙利算法的高速动车组周转模型及算法的研究[J].西南民族大学学报，2005，31(5)：759-782.
[52]陈华群，唐协.应用神经网络优化高速铁路动车组周转的研究[J].中国安全生产科学技术，2006，2(2)：46-49.
[53]陈华群.动车组运用计划编制系统相关问题研究[M].西南交通大学，2007.
[54]郁宇卫.客运专线动车组运用计划优化研究[M].中南大学，2009.
[55]佟璐，聂磊，赵鹏.蚁群算法在动车组运用问题中的应用[J].交通运输系统工程与信息，2009，9(6)：161-167.
[56]陈玲娟.遗传算法在动车组运用计划编制中的应用[J].交通运输工程与信息，2009，7(2)：67-71.
[57]杨军，杨浩，卢海波.遗传算法在动车组周转优化模型中的应用[J].铁道运输与经济，2004，26(7)：65-67.
[58]陈广秀，毛旭，陈立君.动车组编制计划系统研究与设计[J].铁道运输与经济，2007，29(1)：31-37.
[59]潘锋，王慈光.评价指标的探讨动车组交路计划有关问题研究[J].铁道运输与经济，2007，29(8)：37-43.
[60]吴冰芝.客运专线动车组运用优化研究[J].交通运输工程与信息，2011，9(2)：78-82.
[61] Shimada, Nobuaki. Rolling stock maintenance for safe and stable transport [J]. JapaneseRailway Engineering,2006,57:4-7.
[62] Wolf, A. J.. Relation between the quality offered and the maintenance of the rolling stock [J].Rail International,1989,20(1):133-137.
[63] Tsuji Yasutaka,Kuroda Masahiro,Imoto Yoshitaka. Rolling stock planning for passenger trainsbased on ant colony optimization [J]. Transactions of the Japan Society of Mechanical Engineers,2010,76:397-406.
[64] Sriskandarajah C., Jardine A.K.S.,Chan C.K.. Maintenance scheduling of rolling stock using agenetic algorithm [J]. Journal of the Operational Research Society,1998,49(11):1130-1145.
[65] Stuchly, V., Grencik, J.,Poprocky, R.. Railway vehicle maintenance and information systems [J].Advances in Transport,2000,7:885-894.
[66] Budai, G., Dekker, R.. A dynamic approach for planning preventive railway maintenanceactivities [J]. Advances in Transport,2004,15:323-332.
[67] Jeong, W., Kim, G.,Park, S.H.. RCM system modeling in developing an advanced urban EMU[J]. IET International Conference on Railway Engineering,2008,1:255-259.
[68] Miao, J., Yu, Y., Wang, Y.. A heuristic algorithm for the circulation plan of railway electricalmotor units [J]. WIT Transactions on the Built Environment,2010,114:877-888.
[69] Cheng Yung Hsiang,Tsao Hou Lei. Rolling stock maintenance strategy selection, spares parts'estimation, and replacements' interval calculation [J]. International Journal of Production Economics,2010,128(1):404-412.
[70] Goeun Park, Won Young Yun, Young Jin Han. Optimal Preventive Maintenance Intervals of aRolling Stock System [J]. Proceedings of2011International Conference on Quality, Reliability, Risk,Maintenance, and Safety Engineering,2011,9:427-430.
[71] Ren Ping, Li Nan, Gao Liqun. Optimal Planning for the Double-Track Train Scheduling Basedon Chaotic Particle Swarm Optimization [J]. Fifth International Conference on Natural Computation,2009,1:182-198.
[72] N.T. Bala Krishnan. A Simulation Model for Maintenance Planning [J]. Proceedings of theAnnual Reliability and Maintainability Symposium,1992,15:109-118.
[73] M. Gomez-Parra1, C.Sancho, P.Mu oz-Condes. Predictive Maintenance Techniques toDetermine dirt in Railway Traction Motors Using Radial Stray Flux Analysis [J].2009IEEE EnergyConversion Congress and Exposition,2009,25:248-255.
[74] Tatsuhiro Sato, Tomoe Tomiyama, Toyohisa Morita. Lagrangian Relaxation Method forNetwork Flow Modeled Crew and Vehicle Rescheduling [J]. Proceedings-2nd IEEE InternationalConference on Advanced Computer Control,2010,1:403-408.
[75] S.M. Rezvanizaniani, M. Valibeigloo1, M. Asghari1, J. Barabady. Reliability CenteredMaintenance for Rolling Stock: A Case Study in Coaches’Wheel Sets of Passenger Trains of IranianRailway [J].2008IEEE International Conference on Industrial Engineering and EngineeringManagement,2008,20:516-520.
[76] Hongliang Zhang, Peng Zhao, Hao Yang, ling Yang. Distribution of Electric Multiple UnitMaintenance Base of High-Speed Railway [J]. Proceedings of2008IEEE International Conferenceon Service Operations and Logistics, and Informatics,2008,17(1):959-964.
[77] Zhenhuan He. Research on Improved Greedy Algorithm for Train Rescheduling [J]. SeventhInternational Conference on Computational Intelligence and Security,2009,7:1197-1200.
[78] Markus Bohlin, Malin Forsgren, Anders Holst. Reducing Vehicle Maintenance Using ConditionMonitoring and Dynamic Planning [J].4th IET International Conference on Railway ConditionMonitoring,2008,2:208-219.
[79] Xiaofei Ma, Guang Cheng. The Planning Optimization for Maintenance and Repairment ofRailway-cars in Jinan Railway Bureau [J].2011IEEE18th International Conference on IndustrialEngineering and Engineering Management,2011,2:865-868.
[80] Xiaofei Ma, Wei Li. The Reassignment Planning for Maintenance and Repairment ofRailway-cars in Jinan Railway Bureau [J]. International Conference on Management and ServiceScience,2011,6:319-316.
[81]曾向阳.客运专线动车组运用计划优选及运用修优化研究[M].西南交通大学，2011.
[82]王莹，刘军，苗建瑞.基于列生成算法的动车组检修计划优化[J].中国铁道科学，2010，31(2)：115-120.
[83]黄志彤.动车组运用及检修机构布局与规模确定的研究[M].西南交通大学.2009.
[84]傅八路，周志勇，黄小钢.武广铁路客运专线动车组运用效率与检修基地规模研究[J].铁道标准设计，2010(1)：32-37.
[85]李加棋.武广客专长沙动车运用所临修库设计研究[J].交通科技，2010，23(2)：124-127.
[86]李波.动车所一、二级检修作业能力优化[J].中国铁路，2008(12)：28-30.
[87] Cook S.A.. The Complexity of Theorem Proving Procedures [C]. The proceedings of the ThirdAnnual ACM Symposium on the Theory of Computing,1971:151-158.
[88] Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G.. Recent Developments in DeterministicSequence and Scheduling: a Survey [J]. Determinstic and Stochastic Scheduling.1982:35-73.
[89] Blazewicz J., Ecker K.H., Schmidt G., et al.Scheduling in Computer and ManufacturingSystems [M]. Second Revised Edtition,1996.
[90] Garey M.R, Johnson D. S.. Computers and Intractability: a Guide to the Theory ofNP-Comleteness [J]. San Francisco,1979.
[91] Nelson R., Holloway C., Wong R.. Centralized Scheduling and Priority ImplementationHeuristics for a Dynamic Job Shop Model with Due Dates and Variable Processing Time [J]. IIETransactions,1977,9(1):96-102.
[92] Brucker P, Schlie R. Job-Shop Scheduling with Multi-purpose Machines [J]. Computing,1990,45(4):369-375.
[93]王凌．车间调度及其遗传算法[M]．清华大学出版社，2003：138-144．
[94]曾强.离散制造企业批量生产车间调度智能优化研究[D].重庆：重庆大学，2010.
[95]王书锋，邹益仁.车间作业调度JSSP技术问题简明综述[J].系统工程理论与实践，2003，1：49-55.
[96] Ashour S., Hiremath S. R.. Branch-and-Bound Approach to the Job-Shop Scheduling Problem[J].International Journal of Production Research,1973,11(1):47-58.
[97] Chen M.. A Mathematical Programming Model for System Reconfiguration in a DynamicCellular Manufacturing Environment [J]. Annals of Operation Research,1998,77:109-128.
[98] Jackson J.R. Scheduling a Production Line to Minimize Maximum Tardiness [J]. ResearchReport43, Management Science Research Projects,University of California,Los Angeles,USA,1955.
[99] Panwalkar S.. A Survey of Scheduling Rules [J]. Operation Research,1977,25(1):45-61.
[100] Montazeri M.,Van W.L.N.. Analysis of Scheduling Rules for an FMS. International Journal ofProduction Research [J],1990,28:785-802.
[101] Kanet J. J.. Expert System in Production Scheduling[J]. European Journal of OperationalResearch,1987,29:51-59.
[102] Kim M., Lee I.B. On-line Rescheduling System for Multi-Purpose Processes [J].China-KoreaJoint Workshop on Process Systems Engineering. Hangzhou, China,1997:84-89.
[103] Drotos M., Erdos G.,Kis T.. Computing Lower and Upper Bounds for Large-scale IndustrialJob Shop Scheduling Problem [J]. European Journal of Operational Research,2009,197(1):296-306.
[104] Artiba A.,Riane F.. An Application of Planning and Scheduling Multi-model Approach forChemical Industry [J]. Computers in Industry,1998,36(3):209-229.
[105] Foo S.Y, Takefuji Y.,Szu H.. Job-Shop Scheduling Based on Modified Tank-Hopfield LinearProgramming Networks [J]. Engineering Applications of Artificial Intelligence,1994,7(3):321-327.
[106] Jain A.S., Meeran S.. Job-Shop Scheduling Using Neural Networks [J]. International Journalof Production Research,1998,36(5):1249-1272.
[107] Ibrahim S., El Baz M.A., Esh E.. Neural Networks for Job Shop Scheduling Problems [J].Journal of Engineering and Applied Science,2009,56(2):169-183.
[108]周辉仁，郑丕谔，安小会，等.基于遗传算法求解Job Shop调度优化的新方法[J].系统仿真学报，2009，21(11)：3295-3306.
[109]席卫东，乔兵，朱剑英.基于改进遗传算法的柔性作业车间调度[J].哈尔滨工业大学学报，2007，39(7)：1151-1153.
[110]蔡良伟，李霞. Job Shop调度问题的遗传退火算法[J].系统工程与电子技术，2004，26(11)：1698-1700.
[111] Alberto Colorni, Marco Dorigo, Vittorio Maniezzo. Ant system for Job-shop Scheduling [J].Belgian Journal of Operations Research, Statistics and Computers Science,1994:1-14.
[112] Cochran J.K., Horng S.M., Fowler J. W.. A Multi-Population Genetic Algorithm to SolveMulti-Objective Scheduling Problems for Parallel Machines [J]. Computers&Operations Research,2003,30(7):1087-1102.
[113]Li Yongming, Zeng Xiaoping. Multi-Population Co-Genetic Algorithm with DoubleChain-Like Agents Structure for Parallel Global Numerical Optimization[J]. Applied Intelligence,2010,32(3):292-310.
[114] Sakawa M., Kubota R.. Fuzzy Programming for Multi-Objective Job Shop Scheduling withFuzzy Processing Time and Fuzzy Due Date Through Genetic Algorithm [J]. European Journal ofOperational Research,2000,12(2):393-407.
[115] Vincent T., Nicolas M., Fabrice T.. An Ant Colony Optimizaiton Algorithm to Sovle a2-Machine Bicriteria Flow Shop Scheduling Problem [J]. European Journal of Operational Research,2002,142(2):250-257.
[116]谢志强，刘胜辉，乔佩利.基于ACPM和BFSM的动态Job-Shop调度算法[J].计算机研究与发展，2003，40(7)：79-85.
[117]谢志强，杨静，杨光.可动态生成具有优先级工序集的动态Job-Shop调度算法[J].计算机学报，2008，31(3)：508-515.
[118] Xie Zhi Qiang, Yang Guang, Tan Guang Yu. An Algorithm of JSSP with Dynamic Collectionof Job with Priority [J]. Proceedings of the International Technology and Innovation Conference,2006Advanced Manufacturing Technologies. Hangzhou, China,2006:106-11.
[119]谢志强，杨静，周勇，等.基于工序集的动态关键路径多产品制造调度算法[J].计算机学报，2011，34(2)：406-412.
[120] Kroon L.J., Romeijn, H.E. Zwaneveld, P.J. Routing trains through railway stations: complexityissues [J]. European Journal of Operational Research,1997,98:458-498.
[121] De Luca Cardillo. k l-list τ colouring of graphs [J]. European Journal of Operational Research,1998,106:160-164.
[122] Zwaneveld P.J. Railway Planning and Allocation of Passenger Lines [D]. Rotterdam School ofManagement.1997.
[123] Zwaneveld P.J., Kroon L.G., Romeijn,H.E., et al. Routing Trains Through Railway Stations:Model Formulation and Algorithms [J]. Transportation Science,1996,30:181-194.
[124] Zwaneveld P.J., Kroon L.G., Van Hoesel C.P.M. Routing Trains Through a Tailway StationBased on a Node Packing Model [J]. European Journal of Operational Research,2001,128:14-33.
[125]史峰，谢楚农，于桂芳.铁路车站咽喉区进路排列优化方法[J].铁道学报，2004，26(4)：5-9.
[126]史峰，陈彦，秦进.铁路客运站到发线运用和接发车进路排列方案综合优化[J].中国铁道科学，2009，30(6)：108-113.
[127]史峰，陈彦，秦进.铁路客运站列车过站径路与调机运用整体优化[J].中国铁道科学，2010，31(3)：111-119.
[128]陈彦.铁路客运站列车过站径路与调机运用优化[D].中南大学，2011.
[129]龙建成，高自友，马建军，等．铁路车站进路选择优化模型及求解算法的研究[J]．铁道学报，2007，29(5)：6-l3.
[130]吕红霞，倪少权，纪洪业．技术站调度决策支持系统的研究--到发线的合理使用[J]．西南交通大学学报，2000，35(3)：255-258．
[131]吕红霞.铁路大型客运站作业计划智能编制的优化技术和方法研究[D].成都：西南交通大学，2008.
[132]吕红霞，何大可，陈韬.基于蚁群算法的客运站到发线运用计划编制方法[J].西南交通大学学报，2008，43(2)：153-158.
[133]徐杰，杜文，李冰.铁路区段站到发线运用计划安排的优化算法[J].系统工程理论方法应用，2003，12(3)：253-256.
[134]徐杰，杜文.基于遗传算法的区段站到发线运用优化安排[J].中国铁道科学，2003，24(2)：109-114.
[135]徐洪泽，燕永田，徐立新.计算机联锁控制系统的进路生成算法研究[J].北方交通大学学报，1998，22(5)：94-98.
[136]王正彬，杜文.铁路技术站到发线运用调整模型及算法[J].西南交通大学学报，2006，41(2)：202-205.
[137]崔炳谋，马钧培，张朴.编组站进路调度优化算法[J].中国铁道科学，2007，29(3)：100-104.
[138]崔炳谋.编组站综合自动化若干问题的研究[D].铁道部科学研究院，2007.
[139]陈建鑫.客运专线车站作业计划协同优化方法研究[M].北京交通大学，2007.
[140]苗建瑞，蒋熙，于勇，等.铁路车站场列车到发与调车作业过程仿真的研究[J].北方交通大学学报，2000.
[141]钟雁，张全寿.铁路编组站调车作业计划决策支持系统的研究[J].铁道学报，1994，16(4)：15-21.
[142]何世伟，宋瑞，朱松年.铁路编组站日班计划网络流规划模型及算法[J].铁道学报，1995，17(4)：22-30.
[143]李映红，吴世贵，彭其渊.货物列车编组计划网络模型的建立及算法[J].西南交通大学学报，2002，37(1)：72-80.
[144]丁昆.研发中的编组站综合集成自动化系统(CIPS)[J].铁路通信信号，2005，1:56-60.
[145]乐逸祥，周磊山.通用铁路大站技术作业仿真模型和方法的研究[J].系统仿真学报，2003，12：88-93.
[146] Assad A. A.. Modelling of Rail Networks: Toward a Routing/Makeup Model [J].Transportation Research,1980,14(2):101-114.
[147] Keaton M.H.. Designing Rail Road Operating Plans: Lagrangian Relaxation and HeuristieApproaeh [J]. Transportation Research,1989,23(6):415-431.
[148] Keaton M.H.. Designing Rail Road Operating Plans: a Dual Adjustement Method forImplementing Lagrangian Relaxation [J]. Transportation Research,1992,26(4):263-279.
[149] Arkin E M, Silverberg E B. Scheduling Jobs with Fixed Start and End Times[J]. Discrete Appl.Math.,1987,18:1-8.
[150] Gupta U.I, Lee D.T, Leung J.Y.T. An optimal Solution for the Channel Assignment Problem[J].IEEE Transactions Comput,1979, C-28:807-810.
[151] Sasamoto T, Toyoizumi T. Statistical Mechanics of an NP-Complete Problem: Subset Sum [J].Journal of PhysicsA: Mathematical and General,2003,10:9555-9567.
[152] Koulamas C. Single Machine Scheduling with Time Windows and Earliness/TardinessPenalties [J]. European Journal of Operational Research,1996,91(1):190-202.
[153] Arkin E M, Silverberg E B. Scheduling Jobs with Fixed Start and End Times [J]. DiscreteApplied Mathematics,1987,18:1-8.
[154] Carey M., Carville S. Testing schedule performance and reliability for train stations[J]. Journalof the Operational Research Society,2000,51(6),666-682.
[155] Carey M., Crawford I. Scheduling trains through a series of busy complex stations. ResearchReport. Faculty of Business and Management, University of Ulster, N.Ireland.2000.
[156]盖玲.组合优化中的逆目标问题[D].浙江大学，2007.
[157]李相勇.车辆路径问题模型及算法研究[D].上海交通大学，2007.
[158]高永超.智能优化算法的性能及搜索空间研究[D].山东大学，2007.
[159]李宏.求解几类复杂组合优化问题的进化算法及其应用[D].西安电子科技大学，2009.
[160]葛宏伟.基于计算智能的若干组合优化问题研究[D].吉林大学，2006.
[161]王凌.智能优化算法及其应用[M].清华大学出版社，2001.
[162]段海滨.蚁群算法原理及其应用[M].科学出版社，2006.
[163]张惟皎.基于群智能理论的聚类分析及其应用研究[D].铁道科学研究院，2005.
[164]刘彦鹏.蚁群优化算法的理论研究及其应用[D].浙江大学，2007.
[165]寇晓丽.群智能算法及其应用研究[D].西安电子科技大学，2009.
[166]孔民.蚁群优化算法及其应用[D].上海交通大学，2007.
[167] A Colomi,M．Dorigo,V. Maniezzo．Distributed optimization by ant colonies [J]．Proceedingsofthe1st European Conference onArtificial Life,1991,134-142．
[168] L．M．Gambardella, M．Derigo．Ant-Q:A Reinforcement Learning Approach to the TravelingSalesman Problem [J]．proceedings of the12th International Conference&Machine Learning,1995,252-260．
[169] M．Dorigo．V Maniezzo, A. Colorni．Ant system: Optimization by a Colony of CooperatingAgents[J]．LEEE Transactions on Systems,1996．26(1):29-41．
[170] Luca Maria Gambardella,Marco Dorigo. Solving Symmetric and Asymmetric TSPs by AntColonies [J]. IEEE Conference on Evolutionary Computation,1996(96):1-6.
[171] Stutzle T,Hoos H. MAX-MIN ant system and local search for the traveling salesman problem[J]. Proceedings of the IEEE International Conference on Evolutionary Computation andEvolutionary programming Conference,1997:309-314.
[172] M. Birattari, G. Di Caro, M. Dorigo. Toward the Formal Foundation of Ant Programming [J].Third Internat. Workshop, Lecture Notes in Computer Science,2002,2463:188-201.
[173] C. Blum. Theoretical and Practical Aspects of Ant Colony Optimization [D]. Dissertations inArtificial Intelligence,2004.
[174] C. Blum, Beam-ACO-Hybridizing Ant Colony Optimization with Beam Search: anApplication to Open Shop Scheduling [J]. Computer Operation Research,2005,32(6):1565-1591.
[175] C. Blum, M. Dorigo. Deception in Ant Colony Optimization [J]. Fourth Internat. Workshop onAnt Colony Optimization and Swarm Intelligence,2004,3172:119-130.
[176] C. Blum, M. Dorigo. The Hyper-Cube Framework for Ant Colony Optimization [J]. IEEETrans. Systems, Man, Cybernet.-Part B,2004,34(2):1161-1172.
[177] C. Blum, M. Dorigo. Search bias in ant colony optimization: on the Role ofCompetition-Balanced Systems [J]. IEEE Trans. Evol. Comput.,2005,9(2):159-174.
[178] C. Blum, A. Roli. Metaheuristics in combinatorial optimization: overview and conceptualcomparison [J]. ACM Comput. Surveys,2003,35(3):268-308.
[179] C. Blum, M. Sampels, Ant Colony Optimization for FOP shop scheduling: a Case Study onDifferent Pheromone Representations [J]. Proc.2002Congr. on Evolutionary Computation(CEC'02),2002:1558-1563.
[180] J.-L. Deneubourg, S. Aron, S. Goss. The Self-Organizing Exploratory Pattern of the ArgentineAnt [J]. Insect Behav.,1990,3:159-168.
[181] G. Di Caro, M. Dorigo. AntNet: Distributed Stigmergetic Control for CommunicationsNetworks [J]. Artif. Intel. Res.,1998,9:317-365.
[182] M. Dorigo. Optimization, Learning and Natural Algorithms [D], Dipartimento di Elettronica,1992.
[183] M. Dorigo, L.M. Gambardella. Ant Colony System: a Cooperative Learning Approach to theTraveling Salesman Problem [J]. IEEE Trans. Evol. Comput.,1997,1(1):53-66.
[184] M. Dorigo, V. Maniezzo, A. Colorni. Ant System: Optimization by a Colony of CooperatingAgents [J]. IEEE Trans. Systems, Man, Cybernet.-Part B,1996,26(1):29-41.
[185] M. Dorigo, M. Zlochin, N. Meuleau. Updating ACO Pheromones Using Stochastic GradientAscent and Cross-Entropy Methods [J]. Applications of Evolutionary Computing,2002,2279:21-30.
[186] L.M. Gambardella, M. Dorigo. Ant Colony System Hybridized with a New Local Search forthe Sequential Ordering Problem [J]. INFORMS. Comput.,2000,12(3):237-255.
[187] L.M. Gambardella, E.D. Taillard, G. Agazzi. MACS-VRPTW: a Multiple Ant Colony Systemfor Vehicle Routing Problems with Time Windows [J]. New Ideas in Optimization,1999,12:63-76.
[188] W.J. Gutjahr. A Graph-Based Ant System and Its Convergence [J]. Future Gen. Comput.Systems,2000,16(9):873-888.
[189] W.J. Gutjahr. ACO Algorithms with Guaranteed Convergence to the Optimal Solution [J].Inform. Process. Lett,2002,82(3):145-153.
[190] J.H. Holland. Adaption in Natural and Artificial Systems [M]. The University of MichiganPress, Ann Harbor, MI,1975.
[191] M.I. Jordan. Learning in Graphical Models [M]. MIT Press, Cambridge, MA,1998.
[192] L. Kallel, B. Nandts, A. Rogers. Theoretical Aspects of Evolutionary Computing [M]. NaturalComputing Series, Springer, Berlin, Germany,2001.
[193] S. Kirkpatrick, C.D. Gelatt, M.P. Vecchi. Optimization by Simulated Annealing [J]. Science,1983,220(4598):671-680.
[194] V. Maniezzo. Exact and Approximate Nondeterministic Tree-Search Procedures for theQuadratic Assignment problem [J]. INFORMS J. Comput.,1999,11(4):358-369.
[195] V. Maniezzo, A. Colorni. The Ant System Applied to the Quadratic Assignment Problem [J].IEEE Trans. Data Knowledge Eng,1999,11(5):769-778.
[196] D. Merkle, M. Middendorf. Modelling ACO: Composed Permutation Problems [J]. ThirdInternat. Workshop, Lecture Notes in Computer Science,2002,2463:149-162.
[197] D. Merkle, M. Middendorf. Modelling the Dynamics of Ant Colony Optimization Algorithms[J]. Evol. Comput.,2002,10(3):235-262.
[198] D. Merkle, M. Middendorf. Competition Controlled Pheromone Update for Ant ColonyOptimization [J]. Fourth Internat. Workshop on Ant Colony Optimization and Swarm Intelligence,Lecture Notes in Computer Science,2004,3172:95-105.
[199] D. Merkle, M. Middendorf, H. Schmeck. Ant Colony Optimization for Resource-ConstrainedProject Scheduling [J]. IEEE Trans. Evol. Comput.,2002,6(4):333-346.
[200] N. Meuleau, M. Dorigo. Ant Colony Optimization and Stochastic Gradient Descent [J]. FutureGen. Comput. Systems,2002,8(2):103-121.
[201] T. Stutzle. An Ant Approach to the Flow Shop Problem [J]. Fifth European Congr. onIntelligent Techniques and Soft Computing,1998,1560-1564.
[202] T. Stutzle, M. Dorigo. A Short Convergence Proof for a Class of ACO Algorithms [J]. IEEETrans. Evol. Comput.,2002,6(4):358-365.
[203] T. Stutzle, H.H. Hoos. MAX-MIN Ant System [J]. Future Gen. Comput. Systems,2000,16(8):889-914.
[204] M. Zlochin, M. Birattari, N. Meuleau. Model-Based Search for Combinatorial Optimization: aCritical Survey [J]. Ann. Oper. Res.,2004,131(1-4):373-395.
[205] Dirk Sudholt. Theory of swarm intelligence [J], Proceedings of the13th annual conferencecompanion&Genetic and evolutionary computation,2011,16:1381-1410.
[206] Marta S.R. Monteiro, Dalila B.M.M. Fontes, Fernando A.C.C.. Fontes An Ant ColonyOptimization Algorithm to Solve the Minimum Cost Network Flow Problem with Concave CostFunctions [J]. Proceedings of the13th annual conference&Genetic and evolutionary computation,2011,13:139-146.
[207]李莉，王克奇.基于改进型蚁群算法的MFJSSP研究[J].计算机应用研究，2011，17(4)：22-30.