高速铁路列车运行图网络协同编制优化方法与关键技术研究
|
摘要
列车运行图编制问题涉及部门众多、决策空间庞大,一直是铁路运输组织理论方法的难点问题。目前,我国高速铁路系统得到了快速的发展,与既有线相比,其高标准的运输服务质量要求需要高速铁路运营管理部门能够随着旅客运输市场的不断变化,统筹考虑列车运行计划、动车交路计划和车站进路生成计划,快速形成科学、合理的一体化运输组织方案。高速铁路列车运行图编制要求已经超越了单元编图系统和编图个体的能力。
以不断快速发展的计算机网络技术为基础发展而来的列车运行图网络协同编制模式,将为高速铁路列车运行图编制工作提出更高效的解决方案,它能够根据运输市场的频繁变动,快速的组建运行图编制动态联盟,经济、有效的制定高速铁路时空资源优化配置方案。不过,从目前国内外的研究进展和工作实践来看,高速铁路列车运行图网络化协同编制的研究还刚刚起步,其编制模式与协同工作机理、适应列车运行图网络协同编制的数学模型、同步编制的实时求解方法、基于网络的协同调整方法还很不成体系,应用系统的设计和实现等问题还需要大量的技术创新。
鉴于此,本文根据当前高速铁路列车运行图编制的特点和要求,对高速铁路列车运行图网络化协同编制的相关理论和关键技术展开研究和探讨,以期得到对高速铁路列车运行图编制工作有益的研究成果。具体研究内容为：
首先,在对高速铁路列车运行图网络协同编制的定义、内涵进行分析的基础上,提出了列车运行图网络协同编制的三维协同模型,从对象、时间和空间三个维度上,探讨了列车运行图网络协同编制的理论体系,指出了实现高速铁路列车运行图网络协同编制的关键要素。
其次,针对网络协同环境下高速铁路列车运行图编制问题呈现的空间分布特征,在运用资源分配理论分析了列车运行计划、动车组交路计划和车站进路安排计划的问题属性的基础上,基于约束满足理论(CSP)构建了该问题的分布式约束满足模型,设计了同步回溯求解框架,制定了软约束网络协作调整策略。为了满足网络协同编制对问题求解效率的要求,根据问题特点,结合约束满足求解方法和分布并行计算技术,分别设计了三个子问题优化方法：
(1)在列车运行计划问题求解研究中,本文利用协作网络计算资源,根据各分枝子问题无关性特点,设计了并行分支定界算法。利用析取图描述了列车运行过程,提出了基于弧一致性约束传播的区间占用冲突检测方法,给出了子任务生成策略,设计了基于拉格朗日算法的并行任务求解方法,研究了并行算法的实现机制和加速机制。
(2)在动车交路计划编制问题求解研究中,本文根据问题的多阶段决策特性,提出了基于蚁群算法的求解思路。针对随着运行线数量的增加,解构造图的规模以及蚂蚁生成解的计算量均成指数增长的情况,设计了粗粒度并行蚁群算法,以列车运行图网络协同编制系统为计算环境,利用分布式并行计算技术,将蚁群的搜索任务放置在不同的计算机上并行执行,互相合作的完成整个计算任务。
(3)在车站进路生成问题的求解的研究中,本文针对站场结构较为复杂的大型车站的进路生成问题,设计了一种并行回退算法,将原来十分集中的计算任务和较大的内存需求分配到参与并行计算的各台计算机上,有效缩短因发生回退而产生的额外搜索时间。
在针对软约束的网络协作调整研究中,本文分析了高速铁路列车运行图网络协同编制人机交互操作过程,详细讨论了协作调整过程中的数据一致性维护和死锁现象,给出了导致死锁产生的并发对象冲突和并发逻辑冲突定义,并提出了运行图协同编制环境下并发冲突的检测方法,设计了自动疏解、双方协商和第三方仲裁的分层并发控制机制。
最后,在系统实现和工程实践方面,阐述了基于.NET平台的高速铁路列车运行图网络协同编制原型系统框架结构,讨论了原型系统的基本功能设置、网络节点模块设计等问题。同时,基于某高速铁路列车运行图编制实际设计了编制任务,并将本文的研究成果在算例中进行应用,验证了方法的可行性。
Train scheduling problem was research hotspot and difficult points of transportation organization theory, since it includes numerous branch and large decision space. At present, the high speed railway system was developed quickly.High speed railway has some special efficiency and quality requirements compared with common railways., which is not in the power of unit ts system and individual worker.
With the development and mature of Internet and CSCW, networked collaborative train scheduling is becoming the trend of train scheduling pattern. According to transportation market fluctuation, NCTS could quickly organize train scheduling alliance which helps to set up time and space resources optimum allocation plan for high speed railway. Study of NCTS is still at a very early stage, the following issues needs deeply study:scheduling mode and collaborative work principals, mathematic model which adapted to NCTS, real time solving method, networked cooperative decision and adjustment method, and the design and realization of prototype system. According to characteristic and request of current high speed railway, this paper deeply studies the related theory and key technology of NCTS.
Firstly, this paper put forward basic concept of NCTS. Based on analysis of definition and scheduling mode of NCTS, a three-dimention collaborative modal was put forward to discuss the framework structure of NCTS on object, time and space.
Secondly, the property of timetable, rolling stock circulation and routing generation were analyzed based on resource allocation theory. In order to describe the spatial distribution features of NCTS under networked collaborative circumstance, a distribute constraint satisfaction modal was given based on CSP theory. And Synchronous Backtracking algorithm framework was put forward, meanwhile networked cooperative adjustment strategies was made. To meet the requirement of solving efficiency of NCTS, three sub-problem optimization method was proposed based on the combination of CSP method and distribute computing technology.
In the study of train timetable problem solving, this paper designed a distribute branch and bound algorithm according that branch notes are independent, using collaborative networked computing resources. The train running process was described by disjunctive graph, and a section occupation conflict detection method based on arc consistency was proposed, sub task generation strategy and distribute task solving method based on lagrange algorithm. Implementing mechanisms and accelerating mechanisms of distribute algorithm were studied.
In the study of rolling stock circulation problem solving, a solving thought based on ant colony algorithm was put forward according to its multistage decision property. This paper designed a coarse-grained distribute ant colony algorithm, since the scale of solution construction graph and the amount of computation increased exponentially. NCTS could be used as distribute computing circumstance, we put the search task on different computer respectively, using distribute computing technology, so the computers can finish the task collaborating with each other.
In the study of routing generation problem solving, a distribute parallel backtracing algorithm was proposed to solve big station routing problem with complex structure, which distribute the concentrate task to several parallel computer. And this could decrease computing time because of backtracing.
In the study of soft constraints networked cooperative adjustment, this paper analyzed the process of human machine interaction during networked cooperative train scheduling. The data consistency preservation and deadlock phenomenon were discussed in detail. Meanwhile, the detection method of concurrency conflict under the cooperative scheduling environment was proposed, and the stratified concurrency control automatic resolution, mutual negotiation and arbitration of party was put forward.
Finally, on the aspect of system realization and engineering practice, the prototype system framework of NCTS based on.NET was described, and the basic function and network note module were discussed. Meanwhile, a scheduling task based on some real high speed railway line was designed, and the research result was put into practice to validate the validity and feasibility of the method.
以不断快速发展的计算机网络技术为基础发展而来的列车运行图网络协同编制模式,将为高速铁路列车运行图编制工作提出更高效的解决方案,它能够根据运输市场的频繁变动,快速的组建运行图编制动态联盟,经济、有效的制定高速铁路时空资源优化配置方案。不过,从目前国内外的研究进展和工作实践来看,高速铁路列车运行图网络化协同编制的研究还刚刚起步,其编制模式与协同工作机理、适应列车运行图网络协同编制的数学模型、同步编制的实时求解方法、基于网络的协同调整方法还很不成体系,应用系统的设计和实现等问题还需要大量的技术创新。
鉴于此,本文根据当前高速铁路列车运行图编制的特点和要求,对高速铁路列车运行图网络化协同编制的相关理论和关键技术展开研究和探讨,以期得到对高速铁路列车运行图编制工作有益的研究成果。具体研究内容为：
首先,在对高速铁路列车运行图网络协同编制的定义、内涵进行分析的基础上,提出了列车运行图网络协同编制的三维协同模型,从对象、时间和空间三个维度上,探讨了列车运行图网络协同编制的理论体系,指出了实现高速铁路列车运行图网络协同编制的关键要素。
其次,针对网络协同环境下高速铁路列车运行图编制问题呈现的空间分布特征,在运用资源分配理论分析了列车运行计划、动车组交路计划和车站进路安排计划的问题属性的基础上,基于约束满足理论(CSP)构建了该问题的分布式约束满足模型,设计了同步回溯求解框架,制定了软约束网络协作调整策略。为了满足网络协同编制对问题求解效率的要求,根据问题特点,结合约束满足求解方法和分布并行计算技术,分别设计了三个子问题优化方法：
(1)在列车运行计划问题求解研究中,本文利用协作网络计算资源,根据各分枝子问题无关性特点,设计了并行分支定界算法。利用析取图描述了列车运行过程,提出了基于弧一致性约束传播的区间占用冲突检测方法,给出了子任务生成策略,设计了基于拉格朗日算法的并行任务求解方法,研究了并行算法的实现机制和加速机制。
(2)在动车交路计划编制问题求解研究中,本文根据问题的多阶段决策特性,提出了基于蚁群算法的求解思路。针对随着运行线数量的增加,解构造图的规模以及蚂蚁生成解的计算量均成指数增长的情况,设计了粗粒度并行蚁群算法,以列车运行图网络协同编制系统为计算环境,利用分布式并行计算技术,将蚁群的搜索任务放置在不同的计算机上并行执行,互相合作的完成整个计算任务。
(3)在车站进路生成问题的求解的研究中,本文针对站场结构较为复杂的大型车站的进路生成问题,设计了一种并行回退算法,将原来十分集中的计算任务和较大的内存需求分配到参与并行计算的各台计算机上,有效缩短因发生回退而产生的额外搜索时间。
在针对软约束的网络协作调整研究中,本文分析了高速铁路列车运行图网络协同编制人机交互操作过程,详细讨论了协作调整过程中的数据一致性维护和死锁现象,给出了导致死锁产生的并发对象冲突和并发逻辑冲突定义,并提出了运行图协同编制环境下并发冲突的检测方法,设计了自动疏解、双方协商和第三方仲裁的分层并发控制机制。
最后,在系统实现和工程实践方面,阐述了基于.NET平台的高速铁路列车运行图网络协同编制原型系统框架结构,讨论了原型系统的基本功能设置、网络节点模块设计等问题。同时,基于某高速铁路列车运行图编制实际设计了编制任务,并将本文的研究成果在算例中进行应用,验证了方法的可行性。
Train scheduling problem was research hotspot and difficult points of transportation organization theory, since it includes numerous branch and large decision space. At present, the high speed railway system was developed quickly.High speed railway has some special efficiency and quality requirements compared with common railways., which is not in the power of unit ts system and individual worker.
With the development and mature of Internet and CSCW, networked collaborative train scheduling is becoming the trend of train scheduling pattern. According to transportation market fluctuation, NCTS could quickly organize train scheduling alliance which helps to set up time and space resources optimum allocation plan for high speed railway. Study of NCTS is still at a very early stage, the following issues needs deeply study:scheduling mode and collaborative work principals, mathematic model which adapted to NCTS, real time solving method, networked cooperative decision and adjustment method, and the design and realization of prototype system. According to characteristic and request of current high speed railway, this paper deeply studies the related theory and key technology of NCTS.
Firstly, this paper put forward basic concept of NCTS. Based on analysis of definition and scheduling mode of NCTS, a three-dimention collaborative modal was put forward to discuss the framework structure of NCTS on object, time and space.
Secondly, the property of timetable, rolling stock circulation and routing generation were analyzed based on resource allocation theory. In order to describe the spatial distribution features of NCTS under networked collaborative circumstance, a distribute constraint satisfaction modal was given based on CSP theory. And Synchronous Backtracking algorithm framework was put forward, meanwhile networked cooperative adjustment strategies was made. To meet the requirement of solving efficiency of NCTS, three sub-problem optimization method was proposed based on the combination of CSP method and distribute computing technology.
In the study of train timetable problem solving, this paper designed a distribute branch and bound algorithm according that branch notes are independent, using collaborative networked computing resources. The train running process was described by disjunctive graph, and a section occupation conflict detection method based on arc consistency was proposed, sub task generation strategy and distribute task solving method based on lagrange algorithm. Implementing mechanisms and accelerating mechanisms of distribute algorithm were studied.
In the study of rolling stock circulation problem solving, a solving thought based on ant colony algorithm was put forward according to its multistage decision property. This paper designed a coarse-grained distribute ant colony algorithm, since the scale of solution construction graph and the amount of computation increased exponentially. NCTS could be used as distribute computing circumstance, we put the search task on different computer respectively, using distribute computing technology, so the computers can finish the task collaborating with each other.
In the study of routing generation problem solving, a distribute parallel backtracing algorithm was proposed to solve big station routing problem with complex structure, which distribute the concentrate task to several parallel computer. And this could decrease computing time because of backtracing.
In the study of soft constraints networked cooperative adjustment, this paper analyzed the process of human machine interaction during networked cooperative train scheduling. The data consistency preservation and deadlock phenomenon were discussed in detail. Meanwhile, the detection method of concurrency conflict under the cooperative scheduling environment was proposed, and the stratified concurrency control automatic resolution, mutual negotiation and arbitration of party was put forward.
Finally, on the aspect of system realization and engineering practice, the prototype system framework of NCTS based on.NET was described, and the basic function and network note module were discussed. Meanwhile, a scheduling task based on some real high speed railway line was designed, and the research result was put into practice to validate the validity and feasibility of the method.
引文
[1]发展改革委交通运输司.《中长期铁路网规划》.中国政府门户网站,www.gov.cn,2005,9.16.
[2]彭其渊.国内外计算机编制列车运动图的研究现状与发展展望[J].学术动态报道,1997,2,pp：16-18.
[3]吴锋刘文煌.混杂系统研究综述[J].系统工程,1997,15(2),pp：1-7.
[4]莫以为,萧德云.混合动态系统及其应用综述[J].控制理论与应用,2002,19(2).
[5]郑刚,谭民,宋永华.混杂系统的研究进展[J].控制与决策,2004,19(1),pp：7-11.
[6]Christian Liebchen and Rolf H. M¨ohring. The Modeling Power of the Periodic Event Scheduling Problem:Railway Timetables—and Beyond[J]. Computer-aided Systems in Public Transport,2008,pp:3-40.
[7]Maroti, G. Operations research models for railway rolling stock planning[D]. Eindhoven University of Technology,2006.
[8]夏平.客运专线乘务员运用计划编制研究[D].北京交通大学,2008.
[9]于得水.客运专线乘务计划编制系统的设计与实现[D].西南交通大学,2007.
[10]Jan-Willem Goossens, Stan van Hoesel. A Branch-and-Cut Approach for Solving Railway Line-Planning Problems[J]. TRANSPORTATION SCIENCE,2004,38(3),pp:379-393.
[11]彭其渊,杨明伦.中国铁路列车运行图系统的研究和设计[J].科学,1998,1,pp：76-78.
[12]郭富娥.论利用电子计算机编制列车运行图[J].铁道运输与经济,1992,1,pp：35-38.
[13]郭富娥.日本近期开发的列车运行图编制系统[J].中国铁路,1995,pp：38-40.
[14]郭富娥.中国铁道部和原苏联交通科技合作“应用电子计算机编制列车运行图”.铁道运输与经济,1992,pp：39-40.
[15]黎新华.单线区段列车运行图铺划与运行调整优化方法研究[D].中南大学博十学位论文,2005.
[16]彭其渊,杨明伦.单线实用货物列车运行图计算机编制系统[J].西南交通大学学报,1995,30(5),pp：537-542.
[17]郭富娥.利用计算机编制旅客列车运行方案[J].铁道学报.1993,15(2)：71-75.
[18]周小棋,郭富娥,王光华.计算机辅助编制旅客列车运行详图的研究[J].铁道学报.1992,3：65-71.
[19]马建军,周磊山.计算机编制网状线路列车运行图系统研究[J].铁道学报,2000,22(1),pp：7-11.
[20]郭富娥.计算机编制双线列运行图的研究[J].铁道运输与经济,1998,20(5),pp：26-27.
[21]倪少权,吕红霞,李浩.计算机编制列车运行图系统的研究[J].铁路运输与经济,2001,23(7),pp：32-35.
[22]倪少权,刘继勇.计算机编制列车运行图系统调整系统设计及实现[J].西南交通大学学报,2001,36(3),pp：240-244.
[23]Amit, I.Goldfarb, D.The timetable problem for railways[J]. Developments in Operations Research.1971,(2):379-387.
[24]Cordeau, J.F., Toth, P., Vigo, D. A survey of optimization models for train routing and scheduling.Transportation Science[J].1998,(32):380-404.
[25]Jovanovic, D., Harker, P.T.. Tactical scheduling of rail operations:the SCAN I system. Transportation Science.1991,(25):46-64.
[26]Carey, M., Lockwood, D. A model, algorithms and strategy for train pathing. Journal of the Operational Research Society.1995,(46):988-1005.
[27]Higgins, A., Kozan, E., Ferreira, L. Optimal scheduling of trains on a single line track. Transportation Research B.1996,(30):147-161.
[28]彭其渊,王宝杰.基于实用的一种网络列车运行图计算方法[J].西南交通大学学报,1999,34(5),pp：588-593.
[29]周磊山,胡思继.计算机编制网状线路列车运行图方法研究[J].铁道学报,1998,20(5),pp：15-21.
[30]Szpigel, B. Optimal Train Scheduling on a Single Track Railway. In M. Ross (Ed.), Operational Research'72. Amsterdam, the Netherlands.1973:343-352.
[31]Zhou, X.,& Zhong, M.. Bicriteria train scheduling for high-speed passenger railroad planning applications[J]. European Journal of Operational Research.2005,(167):752-771.
[32]Zhou, X.,& Zhong, M.. Single-track train timetabling with guaranteed optimality: Branch-and-bound algorithms with enhanced lower bounds[J]. Transportation Research,Part B.2007(41),320-341.
[33]Higgins, A. Optimisation of Train Schedules to Minimise Transit Time and Maximise Reliability. PhD thesis, Queensland University of Technology.1997.
[34]Higgins, A.,& Kozan, E.Heuristic techniques for single line train scheduling.Journal of Heuristics,1997,3,43-62.
[35]梁向阳.基于遗传算法的单线区段列车运行图优化及编制方法[M].西南交通大学硕士学位论文.1998.
[36]倪少权,杨明伦,彭其渊.列车运行图编制专家系统之研究[J].西南交通人学.1995,30(5)：550-556.
[37]祝明发.分布式人工智能[J].计算机研究与发展,1997,20(7),pp：7-18.
[38]张成奇,张敏捷.国际分布式人工智能研究进展[J].模式识别与人工智能,1993,6(2),99-107.
[39]石纯一,胡蓬.分布式人工智能回顾与展望[J].计算机科学,1992,4,pp：29-35.
[40]董斌,何博雄等.分布式人工智能与多智能体系统的研究与发展[J].西安工业学院院报,2000,20(4),pp：303-307.
[41]Frank. O. Two-way traffic on a single line of railway. Operations Research,1965,(14):801-811.
[42]Peat, Marwick, Mitchell & Co.Train dispatching simulation model:capabilities and description USA. Report No. DOT-FR-4-5014-1, March 1975, Prepared for Federal Railroad Administration, Department of Transportation, Washington, DC.1975.
[43]Rudd, D.A., Storry, A.J. Single track railway simulation, new models and old. Rail International June,1976:335-342.
[44]Petersen, E.R., Taylor, A.J., Martland, C.D.An introduction to computer-assisted train dispatch. Journal of Advanced Transportation 1986,(20):63-72.
[45]朱家荷.日本新干线列车运行模拟系统[J].中国铁路.1982,11：23-28.
[46]毛保华等.通用列车运行模拟软软件系统研究[J]．铁道学报.2000,22(1)：1-6.
[47]张琦,王建英.基于神经网络的高速列车运行模拟系统的研究[J].中国铁道科学.1998,19(3)：18-25.
[48]杨肇夏,蒋熙.列车运行及其组织模拟试验系统研究[J].铁道学报.1998,20(6)：1-8.
[49]陈军华.基于稳定性的客运专线运行图编制与评价问题研究[D].北京交通大学博士学位论文,2009.
[50]Assad, A.A.,1980. Models for rail transportation. Transportation Research B 14,101-114.
[51]Assad, A.A.,1981. Analytical models in rail transportation:an annotated bibliography. INFOR 19,59-80.
[52]Haghani, A.E.,1987. Rail freight transportation:a review of recent optimization models for train routing and empty car distribution. Journal of Advanced Transportation 21,147-172.
[53]E Abbink, B van den Berg, L Kroon. Allocation of Railway Rolling Stock for Passenger Trains[J]. TRANSPORTATION SCIENCE,2004,2,pp:33-41.
[54]Leo Kroon. Models for rolling stock planning. Research report, Utrecht, Netherlands. AMORE meeting Patras,2001,10.
[55]D Huisman. Adjusting the Rolling Stock Allocation in Case of Disruptions[D]. Erasmus University Rotterdam Bachelor Thesis,2009,7.
[56]Julie Jespersen Groth. Decision Support for the Rolling Stock Dispatcher[D]. Technical University of Denmark,2008.
[57]Gabriella Budai, Gabor Maroti, Rommert Dekker, Dennis Huisman and Leo Kroon. Rescheduling in passenger railways:the rolling stock rebalancing problem[D]. Journal of Scheduling,2010,11.
[58]Marc Peeters, Leo Kroon. Circulation of railway rolling stock:a branch-and-price approach[J]. Computers & Operations Research,2008,35,pp:538-556.
[59]赵鹏,杨浩,胡安洲.高速铁路动车组的不固定区段使用问题[J].铁道学报,1997,19(2)：15-19.
[60]赵鹏,胡安洲,杨浩.高速铁路动车组不固定区段使用条件下周转优化问题的研究[J].北方交通大学学报,1997,21(6)：621-624.
[61]聂磊,赵鹏,杨浩,胡安洲.高速铁路动车组运用的研究[J].铁道学报,2001,23(3)：1-7.
[62]Zhao P,N Tomii. An algorithm for train-set scheduling based on probabilistic local search[A]. In: J.Allan,R.J.hill. Computer in Railway Ⅷ[C]. Boston:WIT,2002.817-826.
[63]赵鹏,福井规雄.动车组运用计划及其编制算法[J].铁道学报,2003,25(3)：1-7.
[64]张杰,陈韬,施福根.客运专线动车组运用计划的计算机编制[J].西南交通大学学报,2006,41(4)：635-640.
[65]Zwaneveld, P., Kroon, J.L., Romeijn, H.E., Salomon, M. "Routing trains through railway stations:model formulation and algorithms". Transportation Science,1996,Vol.30(3), pp:181-194.
[66]Malachy Carey, Sinead Carville. "Scheduling and platforming trains at busy complex stations". Transportation Research Part A,2003,Vol.37, pp:195-224.
[67]李文权、王炜、程世辉.铁路编组站到发线运用的排序模型和算法[J].系统工程理论与实践.2000,20(6)：75-78.
[68]徐杰等.基于遗传算法的区段站到发线运用优化安排[J].中国铁道科学.2003,24(2),pp：109～114.
[69]谢楚农、黎新化．铁路客运站到发线运用优化研究[J].中国铁道科学.2004,25(5),pp：130～133.
[70]雷定猷、王栋、刘明翔.客运站股道运用优化模型及算法[J].交通运输工程学报.2007.7(5),pp：84～87.
[71]Yusin Lee,Chuen-Yih Chen.A heuristic for the train pathing and timetabling problem[J].Transportation part B,2009,43,pp:837-851.
[72]Haase, K., Desaulniers, G., Desrosiers, J.:Simultaneous vehicle and crew scheduling in urban mass transit systems. Transportation Science 35(3),286-303 (2001).
[73]Liebchen, C., Peeters, L.:Some practical aspects of periodic timetabling. In:Chamoni, P., Leisten, R., Martin, A., Minnemann, J., Stadtler, H. (eds.) Operations Research 2001, Springer, Heidelberg (2002).
[74]Christian Liebchen and Rolf H. M ohring:The Modeling Power of the Periodic Event Scheduling Problem:Railway Timetables and Beyond. Railway Optimization,2004,20,pp:3-40.
[75]石雨,杨浩.铁路客运专线运营调度系统体系结构[J].中国铁道科学.2007,1(28),pp：106-112.
[76]马建军.基于网状线路的京沪高速铁路列车运行图编制理论的研究[D].北京：北方交通大学,2002.
[77]轨道交通控制与安全国家重点实验室建成“客运专线列车运行计划一体化编制平台”.交通运输系统工程与信息,2008,6.
[78]Caprara A., Kroon L., Monaci M., Peeters M., Toth P.:Passenger Railway Optimization, in Barnhart C., Laporte G. (eds.):Transportation, Handbooks in Operations Research and Management Science 14 Elsevier (2007) 129-187.
[79]许红,马建军,龙建成.客运专线列车运行图编制模型及计算方法的研究[J].铁道学报.2007,29(2),pp：1-7.
[80]C. Liebchen and R. H. M"ohring. The modeling power of the periodic event scheduling problem: Railway timetables—and beyond. Technical report, TU Berlin,2004.
[81]张美华,李爱平,徐立云.协同生产计划调度系统及其关键技术[J].同济大学学报：自然科学版,2008,36(11),pp：1574-1578.
[82]于晓义,孙树栋,褚崴.基于并行协同进化遗传算法的多协作车间计划调度[J].计算机集成制造系统,2008,14(5),pp：991-1000.
[83]容芷君.基于群体决策的协同设计过程研究[D].华中科技大学,2007.
[84]李峰.支持群体工作的工作流系统关键技术研究[D].中国科学院,2001.
[85]Monplaisir,L. An integrated CSCW architecture for integrated product/process design and development[J].Robotics and Computer Integrated Manufacturing,1999,15,pp:145-153.
[86]Palm J.D. and Fields N.A. Guest Editors Introduction:Computer-Supported Cooerative Work.IEEE Computer,1994,27(5).pp:15-17.
[87]Rodden,T.CSCW:Theory, technology and applications[J].IEEE Computing Series,Peter Peregrius,Stevenge,UK,1993.
[88]Wilson,P.R. Feature Modeling Overiew. SIGGRAPH'90,1990,pp:17-22.
[89]史美林,向勇.计算机支持的协同工作理论与应用[M].北京：电子工业出版社,2000.
[90]史美林.计算机支持的协同工作：过去, 现在和未来[J].计算机研究与发展,1999.
[91]欧阳应秀.基于CSCW的CAD系统关键技术研究[D].浙江大学,2004.
[92]黄国言.协同工作(CSCW)下协作模型的研究[J].计算机工程与应用,2006,22,pp：83-86.
[93]张道春,刘弘.CSCW中一种多层次协同工作模型研究[J].计算机应用研究,2004,23(3),pp：59-61.
[94]汪惠芬.协同开发环境中CAD/CAM集成技术研究[D].南京理工大学,2001.
[95]刘巍巍.同步协同CAD/CAM系统及其关键技术研究[D].南京航空航天大学,2005.
[96]周晓峰.分布式计算技术综述[J].计算机时代,2004,12,pp：3-5.
[97]史何富,唐敏.整合分布式计算技术的协同CAD系统[J].计算机集成制造系统,2004,10,pp：428-436.
[98]毛保华,王保山.我国铁路列车运行计划集成编制方法研究[J].交通运输系统工程与信息,2009,4,pp：27-37.
[99]郝永平,宁汝新.基于协同环境下的冲突管理机制研究[J].计算机集成制造系统,2002,8,pp：299-302.
[100]徐向华.可适应的实时协同编辑系统若干问题研究[D].浙江大学,2005.
[101]祝建平,周磊山,乐逸祥.基于协作交互的列车运行图网络化编制系统[J].中国铁道科学,2010,1,(1)：139-144.
[102]Philippe Baptiste, W P M Nuijten. Constraint based scheduling:Applying Constraint Programming to scheduling problems[M]. Kluwer Academic Press,2001.
[103]Graham R L, Lawer E L,Lenstra J K, and Rinnooy Kan A H G. Optimization and approximation in deterministic sequencing and scheduling:A Survey. Annals of Discrete Mathmatics, 1979,5:287-326.
[104]EHLAARTS. A Computational Study of local Search Algorithms for Job Shop Scheduling.INFORMS Journal on Compution,1994,6(2),pp:118-125.
[105]Torsten Fahle,Ulrich Junker,Stefan E Karisch, Niklas Kohi. Constraint Promming Based Column Generation for Crew Assignment. Journal of Heuristics,2002,8,pp:59-81.
[106]刘涛.约束满足问题：算法和复杂性[D].中国科学院软件计算所,1994.
[107]D A Huffman. Impossible objects as nonsense sentences. Machine Intelligence,1971, 6:295-323.
[108]刘洋,贺仁杰,谭跃进.基于约束满足的多卫星调度模型研究[J].系统工程与电子技术,2004,26(8),pp：1076-1079.
[109]王秦辉,陈恩红,王煦法.分布式约束满足问题研究及其进展[J].软件学,2006,17(10),pp：2029-2039.
[110]FoxM.S. Constraint directed search:A case study of job shop scheduling. San Mateo. Calif.:MorganKaufinann.1987.
[111]郭冬芬,李铁克.基于约束满足的车间调度算法综述[J].计算机集成制造系统.2007,1(13),pp：117-125.
[112]段黎明,陈进,刘飞.基于约束分析的Job Shop调度算法的综述[J].重庆大学学报(自然科学版),1988,1(21).
[113]YOkooM.,DurfeeE.H.,IshidaT.,KuwabaraK.Distributed constraint satisfaction for formalizing distributed Problem solving.In:1 Zthlnt,1Conf.on Distributed ComPuting Systems(ICDCS'92). Los alamitos:IEEE ComPuter Soeiety Press,1992.614-621.
[114]于秦辉.约束满足及其分布式求解和应用研究[D].中国科学技术大学,2007,5.
[115]彭其渊,于培．网络列车运行图的数学模型及算法研究[J].铁道学报,2001,23(1),pp：1-8.
[116]金福才,胡思继.列车运行调整问题的无延迟调度算法研究[J].铁道学报,2005,25(2),pp：10-14.
[117]Shaw-Ching Changa, Yu-Chi Chungb. From timetabling to train regulation—a new train operation model[J]. Information and Software Technology,2005,7,pp:575-585.
[118]KPMG Peat Marwick, Koppelman, F.S.. Analysis of the market demand for high speed rail in the Quebec-Ontario corridor. Report produced for Ontario/Quebec Rapid Train Task Force, KPMG Peat Marwick, Vienna, VA.1990.
[119]赵强.单线铁路列车运行调整计划优化模型与算法研究[D].西南交通大学,1999.
[120]耿敬春,肖荣国,倪少权,牛会想.客运专线动车组周期性运用计划编制的研究[J].铁道学报,2006,8,pp：17-22.
[121]王莹.动车组运用计划和乘务计划的优化方法研究[D].北京交通大学,2008.
[122]Joern Pachl.Railway operation and control[D]. Technical Univercity Braunschweig,2002.
[123]YokooM.HirayamaK.Algorithms for distribute constraint satisfaction:A reviewAutonomous Agents and Multi-AgentSystems.2000,3(2),pp:185-207.
[124]YokooM.,DurirfeeE.H.,IshidaT.,KuwabaraK.Distribute constraint satisfaction for formalizing distributed Problem solving In:12thlnt,1 Conf.on Distributed ComPuting Systems(ICDCS'92). LosAlamitos:IEEE ComPuter Society Press,1992,pp:614-621.
[125]马鑫,梁艳春.基于GPGP协同机制的多Agent车间调度方法研究[J].计算机研究与发展,2008,45(3),pp：479-486.
[126]陈建军,杨振山.一种基于GPGP的多智能体协同框架[J].计算机应用研究,2004,21(6),pp：94-96.
[127]马礼,慈林林,葛根焰.多Agent系统中GPGP的协调机制研究[J].计算机工程与设计,2007,27(1),pp：33-36.
[128]Liu JM,Han J,Tang YY. Multi-Agent oriented constraint satisfaction. Artificial lntelligence,2002,136(1):101-144.
[129]Han J,Chen EH,Cai QS. Multi-Level strategy for maintaining arc consistency in problem solving and its implementation. Journal of Software,1998,9(8):622-627(in Chinese with English abstract).
[130]陈国良.并行算法的设计与分析[M].高等教育出版社,2009.
[131]Sadeh N, Sycara K, Xiong Y. Backtracking techniques for the job-shop scheduling constraint satisfaction problem[J]. Artificial Intelligence,1995,76:455—480.
[132]Sadeh N, FoxM S. Variable and value ordering heuristics for the job-shop scheduling constraint satisfaction problem[J]. Artificial Intelligence,1996,86:1—41.
[133]Beck J C, FoxMS. Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics[J]. Artificial Intelligence,2000,117:31—81.
[134]Nuijten W PM, Aarts EHL. A computational study of constraint satisfaction for multiple capacitated job-shop scheduling[J]. European Journal of Operational Research,1996,90:269—284.
[135]Varela R, Vela C R, Puente J, et al. A knowledge-based evolutionary strategy for scheduling problems with bottlenecks[J]. European Journal of Operational Research,2003,145:57—71.
[136]Oliveira E. Solving single-track railway scheduling problem using constraint programming[D]. Leeds, UK:The University of Leeds, School of Computing,2001.
[137]刘华荣.基于拉格朗日松弛的罩式炉排产优化问题的研究[D].东北大学,206.
[138]Carlier J,Pinson E.Adjustment heads and tails for the job shop Scheduling problem[J].European Journal of Operational Research,1994,78(3):146-161.
[139]Blazewicz J,Pesch E,Sterna M.The disjunctive graph machine representation of job shop scheduling problem[J].European Journal of Operational Research,2000,127(2):317-331.
[140]Andrea D'Ariano. Improving Real-Time Train Dispatching:Models, Algorithms and Applications[D]. Roma Tre University,2008.
[141]Carlier J,Pinson E. Adjustment heads and tails for job shop scheduling problem[J].Europen Journal of Operational Research,1994,78(3):146-161.
[142]Li C L,Lee C Y. Scheduling with agreeable release times and due dates on batch processing machine[J].Europen Journal of Operational Research,1997,96(3):546-569.
[143]Blazewicz J,Pesch E,Sterna M. The disjunctive graph machine representation of the job shop scheduling problem[J].Eurpean Journal of Operational Research.2000,127(2):317-331.
[144]R.Mareus. A Parallel implementation of ant colony optimization[J].Parallel and distributed computing,2002,62:1421-1432.
[145]Mads Andreas Hofman. Robustness in train scheduling[D]. IMM, DTU,2005.
[146]M Fischetti, D Salvagnin. Fast approaches to improve the robustness of a railway timetable[J]. Transportation Science,2009,142-157.
[147]Hofman, Mads. Robustness and Recovery in Train Scheduling-a Case Study from DSB S-tog a/s[J]. ATMOS 2006-6th Workshop on Algorithmic Methods and Models for Optimization of Railways[J].2006,pp:1-22.
[2]彭其渊.国内外计算机编制列车运动图的研究现状与发展展望[J].学术动态报道,1997,2,pp：16-18.
[3]吴锋刘文煌.混杂系统研究综述[J].系统工程,1997,15(2),pp：1-7.
[4]莫以为,萧德云.混合动态系统及其应用综述[J].控制理论与应用,2002,19(2).
[5]郑刚,谭民,宋永华.混杂系统的研究进展[J].控制与决策,2004,19(1),pp：7-11.
[6]Christian Liebchen and Rolf H. M¨ohring. The Modeling Power of the Periodic Event Scheduling Problem:Railway Timetables—and Beyond[J]. Computer-aided Systems in Public Transport,2008,pp:3-40.
[7]Maroti, G. Operations research models for railway rolling stock planning[D]. Eindhoven University of Technology,2006.
[8]夏平.客运专线乘务员运用计划编制研究[D].北京交通大学,2008.
[9]于得水.客运专线乘务计划编制系统的设计与实现[D].西南交通大学,2007.
[10]Jan-Willem Goossens, Stan van Hoesel. A Branch-and-Cut Approach for Solving Railway Line-Planning Problems[J]. TRANSPORTATION SCIENCE,2004,38(3),pp:379-393.
[11]彭其渊,杨明伦.中国铁路列车运行图系统的研究和设计[J].科学,1998,1,pp：76-78.
[12]郭富娥.论利用电子计算机编制列车运行图[J].铁道运输与经济,1992,1,pp：35-38.
[13]郭富娥.日本近期开发的列车运行图编制系统[J].中国铁路,1995,pp：38-40.
[14]郭富娥.中国铁道部和原苏联交通科技合作“应用电子计算机编制列车运行图”.铁道运输与经济,1992,pp：39-40.
[15]黎新华.单线区段列车运行图铺划与运行调整优化方法研究[D].中南大学博十学位论文,2005.
[16]彭其渊,杨明伦.单线实用货物列车运行图计算机编制系统[J].西南交通大学学报,1995,30(5),pp：537-542.
[17]郭富娥.利用计算机编制旅客列车运行方案[J].铁道学报.1993,15(2)：71-75.
[18]周小棋,郭富娥,王光华.计算机辅助编制旅客列车运行详图的研究[J].铁道学报.1992,3：65-71.
[19]马建军,周磊山.计算机编制网状线路列车运行图系统研究[J].铁道学报,2000,22(1),pp：7-11.
[20]郭富娥.计算机编制双线列运行图的研究[J].铁道运输与经济,1998,20(5),pp：26-27.
[21]倪少权,吕红霞,李浩.计算机编制列车运行图系统的研究[J].铁路运输与经济,2001,23(7),pp：32-35.
[22]倪少权,刘继勇.计算机编制列车运行图系统调整系统设计及实现[J].西南交通大学学报,2001,36(3),pp：240-244.
[23]Amit, I.Goldfarb, D.The timetable problem for railways[J]. Developments in Operations Research.1971,(2):379-387.
[24]Cordeau, J.F., Toth, P., Vigo, D. A survey of optimization models for train routing and scheduling.Transportation Science[J].1998,(32):380-404.
[25]Jovanovic, D., Harker, P.T.. Tactical scheduling of rail operations:the SCAN I system. Transportation Science.1991,(25):46-64.
[26]Carey, M., Lockwood, D. A model, algorithms and strategy for train pathing. Journal of the Operational Research Society.1995,(46):988-1005.
[27]Higgins, A., Kozan, E., Ferreira, L. Optimal scheduling of trains on a single line track. Transportation Research B.1996,(30):147-161.
[28]彭其渊,王宝杰.基于实用的一种网络列车运行图计算方法[J].西南交通大学学报,1999,34(5),pp：588-593.
[29]周磊山,胡思继.计算机编制网状线路列车运行图方法研究[J].铁道学报,1998,20(5),pp：15-21.
[30]Szpigel, B. Optimal Train Scheduling on a Single Track Railway. In M. Ross (Ed.), Operational Research'72. Amsterdam, the Netherlands.1973:343-352.
[31]Zhou, X.,& Zhong, M.. Bicriteria train scheduling for high-speed passenger railroad planning applications[J]. European Journal of Operational Research.2005,(167):752-771.
[32]Zhou, X.,& Zhong, M.. Single-track train timetabling with guaranteed optimality: Branch-and-bound algorithms with enhanced lower bounds[J]. Transportation Research,Part B.2007(41),320-341.
[33]Higgins, A. Optimisation of Train Schedules to Minimise Transit Time and Maximise Reliability. PhD thesis, Queensland University of Technology.1997.
[34]Higgins, A.,& Kozan, E.Heuristic techniques for single line train scheduling.Journal of Heuristics,1997,3,43-62.
[35]梁向阳.基于遗传算法的单线区段列车运行图优化及编制方法[M].西南交通大学硕士学位论文.1998.
[36]倪少权,杨明伦,彭其渊.列车运行图编制专家系统之研究[J].西南交通人学.1995,30(5)：550-556.
[37]祝明发.分布式人工智能[J].计算机研究与发展,1997,20(7),pp：7-18.
[38]张成奇,张敏捷.国际分布式人工智能研究进展[J].模式识别与人工智能,1993,6(2),99-107.
[39]石纯一,胡蓬.分布式人工智能回顾与展望[J].计算机科学,1992,4,pp：29-35.
[40]董斌,何博雄等.分布式人工智能与多智能体系统的研究与发展[J].西安工业学院院报,2000,20(4),pp：303-307.
[41]Frank. O. Two-way traffic on a single line of railway. Operations Research,1965,(14):801-811.
[42]Peat, Marwick, Mitchell & Co.Train dispatching simulation model:capabilities and description USA. Report No. DOT-FR-4-5014-1, March 1975, Prepared for Federal Railroad Administration, Department of Transportation, Washington, DC.1975.
[43]Rudd, D.A., Storry, A.J. Single track railway simulation, new models and old. Rail International June,1976:335-342.
[44]Petersen, E.R., Taylor, A.J., Martland, C.D.An introduction to computer-assisted train dispatch. Journal of Advanced Transportation 1986,(20):63-72.
[45]朱家荷.日本新干线列车运行模拟系统[J].中国铁路.1982,11：23-28.
[46]毛保华等.通用列车运行模拟软软件系统研究[J]．铁道学报.2000,22(1)：1-6.
[47]张琦,王建英.基于神经网络的高速列车运行模拟系统的研究[J].中国铁道科学.1998,19(3)：18-25.
[48]杨肇夏,蒋熙.列车运行及其组织模拟试验系统研究[J].铁道学报.1998,20(6)：1-8.
[49]陈军华.基于稳定性的客运专线运行图编制与评价问题研究[D].北京交通大学博士学位论文,2009.
[50]Assad, A.A.,1980. Models for rail transportation. Transportation Research B 14,101-114.
[51]Assad, A.A.,1981. Analytical models in rail transportation:an annotated bibliography. INFOR 19,59-80.
[52]Haghani, A.E.,1987. Rail freight transportation:a review of recent optimization models for train routing and empty car distribution. Journal of Advanced Transportation 21,147-172.
[53]E Abbink, B van den Berg, L Kroon. Allocation of Railway Rolling Stock for Passenger Trains[J]. TRANSPORTATION SCIENCE,2004,2,pp:33-41.
[54]Leo Kroon. Models for rolling stock planning. Research report, Utrecht, Netherlands. AMORE meeting Patras,2001,10.
[55]D Huisman. Adjusting the Rolling Stock Allocation in Case of Disruptions[D]. Erasmus University Rotterdam Bachelor Thesis,2009,7.
[56]Julie Jespersen Groth. Decision Support for the Rolling Stock Dispatcher[D]. Technical University of Denmark,2008.
[57]Gabriella Budai, Gabor Maroti, Rommert Dekker, Dennis Huisman and Leo Kroon. Rescheduling in passenger railways:the rolling stock rebalancing problem[D]. Journal of Scheduling,2010,11.
[58]Marc Peeters, Leo Kroon. Circulation of railway rolling stock:a branch-and-price approach[J]. Computers & Operations Research,2008,35,pp:538-556.
[59]赵鹏,杨浩,胡安洲.高速铁路动车组的不固定区段使用问题[J].铁道学报,1997,19(2)：15-19.
[60]赵鹏,胡安洲,杨浩.高速铁路动车组不固定区段使用条件下周转优化问题的研究[J].北方交通大学学报,1997,21(6)：621-624.
[61]聂磊,赵鹏,杨浩,胡安洲.高速铁路动车组运用的研究[J].铁道学报,2001,23(3)：1-7.
[62]Zhao P,N Tomii. An algorithm for train-set scheduling based on probabilistic local search[A]. In: J.Allan,R.J.hill. Computer in Railway Ⅷ[C]. Boston:WIT,2002.817-826.
[63]赵鹏,福井规雄.动车组运用计划及其编制算法[J].铁道学报,2003,25(3)：1-7.
[64]张杰,陈韬,施福根.客运专线动车组运用计划的计算机编制[J].西南交通大学学报,2006,41(4)：635-640.
[65]Zwaneveld, P., Kroon, J.L., Romeijn, H.E., Salomon, M. "Routing trains through railway stations:model formulation and algorithms". Transportation Science,1996,Vol.30(3), pp:181-194.
[66]Malachy Carey, Sinead Carville. "Scheduling and platforming trains at busy complex stations". Transportation Research Part A,2003,Vol.37, pp:195-224.
[67]李文权、王炜、程世辉.铁路编组站到发线运用的排序模型和算法[J].系统工程理论与实践.2000,20(6)：75-78.
[68]徐杰等.基于遗传算法的区段站到发线运用优化安排[J].中国铁道科学.2003,24(2),pp：109～114.
[69]谢楚农、黎新化．铁路客运站到发线运用优化研究[J].中国铁道科学.2004,25(5),pp：130～133.
[70]雷定猷、王栋、刘明翔.客运站股道运用优化模型及算法[J].交通运输工程学报.2007.7(5),pp：84～87.
[71]Yusin Lee,Chuen-Yih Chen.A heuristic for the train pathing and timetabling problem[J].Transportation part B,2009,43,pp:837-851.
[72]Haase, K., Desaulniers, G., Desrosiers, J.:Simultaneous vehicle and crew scheduling in urban mass transit systems. Transportation Science 35(3),286-303 (2001).
[73]Liebchen, C., Peeters, L.:Some practical aspects of periodic timetabling. In:Chamoni, P., Leisten, R., Martin, A., Minnemann, J., Stadtler, H. (eds.) Operations Research 2001, Springer, Heidelberg (2002).
[74]Christian Liebchen and Rolf H. M ohring:The Modeling Power of the Periodic Event Scheduling Problem:Railway Timetables and Beyond. Railway Optimization,2004,20,pp:3-40.
[75]石雨,杨浩.铁路客运专线运营调度系统体系结构[J].中国铁道科学.2007,1(28),pp：106-112.
[76]马建军.基于网状线路的京沪高速铁路列车运行图编制理论的研究[D].北京：北方交通大学,2002.
[77]轨道交通控制与安全国家重点实验室建成“客运专线列车运行计划一体化编制平台”.交通运输系统工程与信息,2008,6.
[78]Caprara A., Kroon L., Monaci M., Peeters M., Toth P.:Passenger Railway Optimization, in Barnhart C., Laporte G. (eds.):Transportation, Handbooks in Operations Research and Management Science 14 Elsevier (2007) 129-187.
[79]许红,马建军,龙建成.客运专线列车运行图编制模型及计算方法的研究[J].铁道学报.2007,29(2),pp：1-7.
[80]C. Liebchen and R. H. M"ohring. The modeling power of the periodic event scheduling problem: Railway timetables—and beyond. Technical report, TU Berlin,2004.
[81]张美华,李爱平,徐立云.协同生产计划调度系统及其关键技术[J].同济大学学报：自然科学版,2008,36(11),pp：1574-1578.
[82]于晓义,孙树栋,褚崴.基于并行协同进化遗传算法的多协作车间计划调度[J].计算机集成制造系统,2008,14(5),pp：991-1000.
[83]容芷君.基于群体决策的协同设计过程研究[D].华中科技大学,2007.
[84]李峰.支持群体工作的工作流系统关键技术研究[D].中国科学院,2001.
[85]Monplaisir,L. An integrated CSCW architecture for integrated product/process design and development[J].Robotics and Computer Integrated Manufacturing,1999,15,pp:145-153.
[86]Palm J.D. and Fields N.A. Guest Editors Introduction:Computer-Supported Cooerative Work.IEEE Computer,1994,27(5).pp:15-17.
[87]Rodden,T.CSCW:Theory, technology and applications[J].IEEE Computing Series,Peter Peregrius,Stevenge,UK,1993.
[88]Wilson,P.R. Feature Modeling Overiew. SIGGRAPH'90,1990,pp:17-22.
[89]史美林,向勇.计算机支持的协同工作理论与应用[M].北京：电子工业出版社,2000.
[90]史美林.计算机支持的协同工作：过去, 现在和未来[J].计算机研究与发展,1999.
[91]欧阳应秀.基于CSCW的CAD系统关键技术研究[D].浙江大学,2004.
[92]黄国言.协同工作(CSCW)下协作模型的研究[J].计算机工程与应用,2006,22,pp：83-86.
[93]张道春,刘弘.CSCW中一种多层次协同工作模型研究[J].计算机应用研究,2004,23(3),pp：59-61.
[94]汪惠芬.协同开发环境中CAD/CAM集成技术研究[D].南京理工大学,2001.
[95]刘巍巍.同步协同CAD/CAM系统及其关键技术研究[D].南京航空航天大学,2005.
[96]周晓峰.分布式计算技术综述[J].计算机时代,2004,12,pp：3-5.
[97]史何富,唐敏.整合分布式计算技术的协同CAD系统[J].计算机集成制造系统,2004,10,pp：428-436.
[98]毛保华,王保山.我国铁路列车运行计划集成编制方法研究[J].交通运输系统工程与信息,2009,4,pp：27-37.
[99]郝永平,宁汝新.基于协同环境下的冲突管理机制研究[J].计算机集成制造系统,2002,8,pp：299-302.
[100]徐向华.可适应的实时协同编辑系统若干问题研究[D].浙江大学,2005.
[101]祝建平,周磊山,乐逸祥.基于协作交互的列车运行图网络化编制系统[J].中国铁道科学,2010,1,(1)：139-144.
[102]Philippe Baptiste, W P M Nuijten. Constraint based scheduling:Applying Constraint Programming to scheduling problems[M]. Kluwer Academic Press,2001.
[103]Graham R L, Lawer E L,Lenstra J K, and Rinnooy Kan A H G. Optimization and approximation in deterministic sequencing and scheduling:A Survey. Annals of Discrete Mathmatics, 1979,5:287-326.
[104]EHLAARTS. A Computational Study of local Search Algorithms for Job Shop Scheduling.INFORMS Journal on Compution,1994,6(2),pp:118-125.
[105]Torsten Fahle,Ulrich Junker,Stefan E Karisch, Niklas Kohi. Constraint Promming Based Column Generation for Crew Assignment. Journal of Heuristics,2002,8,pp:59-81.
[106]刘涛.约束满足问题：算法和复杂性[D].中国科学院软件计算所,1994.
[107]D A Huffman. Impossible objects as nonsense sentences. Machine Intelligence,1971, 6:295-323.
[108]刘洋,贺仁杰,谭跃进.基于约束满足的多卫星调度模型研究[J].系统工程与电子技术,2004,26(8),pp：1076-1079.
[109]王秦辉,陈恩红,王煦法.分布式约束满足问题研究及其进展[J].软件学,2006,17(10),pp：2029-2039.
[110]FoxM.S. Constraint directed search:A case study of job shop scheduling. San Mateo. Calif.:MorganKaufinann.1987.
[111]郭冬芬,李铁克.基于约束满足的车间调度算法综述[J].计算机集成制造系统.2007,1(13),pp：117-125.
[112]段黎明,陈进,刘飞.基于约束分析的Job Shop调度算法的综述[J].重庆大学学报(自然科学版),1988,1(21).
[113]YOkooM.,DurfeeE.H.,IshidaT.,KuwabaraK.Distributed constraint satisfaction for formalizing distributed Problem solving.In:1 Zthlnt,1Conf.on Distributed ComPuting Systems(ICDCS'92). Los alamitos:IEEE ComPuter Soeiety Press,1992.614-621.
[114]于秦辉.约束满足及其分布式求解和应用研究[D].中国科学技术大学,2007,5.
[115]彭其渊,于培．网络列车运行图的数学模型及算法研究[J].铁道学报,2001,23(1),pp：1-8.
[116]金福才,胡思继.列车运行调整问题的无延迟调度算法研究[J].铁道学报,2005,25(2),pp：10-14.
[117]Shaw-Ching Changa, Yu-Chi Chungb. From timetabling to train regulation—a new train operation model[J]. Information and Software Technology,2005,7,pp:575-585.
[118]KPMG Peat Marwick, Koppelman, F.S.. Analysis of the market demand for high speed rail in the Quebec-Ontario corridor. Report produced for Ontario/Quebec Rapid Train Task Force, KPMG Peat Marwick, Vienna, VA.1990.
[119]赵强.单线铁路列车运行调整计划优化模型与算法研究[D].西南交通大学,1999.
[120]耿敬春,肖荣国,倪少权,牛会想.客运专线动车组周期性运用计划编制的研究[J].铁道学报,2006,8,pp：17-22.
[121]王莹.动车组运用计划和乘务计划的优化方法研究[D].北京交通大学,2008.
[122]Joern Pachl.Railway operation and control[D]. Technical Univercity Braunschweig,2002.
[123]YokooM.HirayamaK.Algorithms for distribute constraint satisfaction:A reviewAutonomous Agents and Multi-AgentSystems.2000,3(2),pp:185-207.
[124]YokooM.,DurirfeeE.H.,IshidaT.,KuwabaraK.Distribute constraint satisfaction for formalizing distributed Problem solving In:12thlnt,1 Conf.on Distributed ComPuting Systems(ICDCS'92). LosAlamitos:IEEE ComPuter Society Press,1992,pp:614-621.
[125]马鑫,梁艳春.基于GPGP协同机制的多Agent车间调度方法研究[J].计算机研究与发展,2008,45(3),pp：479-486.
[126]陈建军,杨振山.一种基于GPGP的多智能体协同框架[J].计算机应用研究,2004,21(6),pp：94-96.
[127]马礼,慈林林,葛根焰.多Agent系统中GPGP的协调机制研究[J].计算机工程与设计,2007,27(1),pp：33-36.
[128]Liu JM,Han J,Tang YY. Multi-Agent oriented constraint satisfaction. Artificial lntelligence,2002,136(1):101-144.
[129]Han J,Chen EH,Cai QS. Multi-Level strategy for maintaining arc consistency in problem solving and its implementation. Journal of Software,1998,9(8):622-627(in Chinese with English abstract).
[130]陈国良.并行算法的设计与分析[M].高等教育出版社,2009.
[131]Sadeh N, Sycara K, Xiong Y. Backtracking techniques for the job-shop scheduling constraint satisfaction problem[J]. Artificial Intelligence,1995,76:455—480.
[132]Sadeh N, FoxM S. Variable and value ordering heuristics for the job-shop scheduling constraint satisfaction problem[J]. Artificial Intelligence,1996,86:1—41.
[133]Beck J C, FoxMS. Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics[J]. Artificial Intelligence,2000,117:31—81.
[134]Nuijten W PM, Aarts EHL. A computational study of constraint satisfaction for multiple capacitated job-shop scheduling[J]. European Journal of Operational Research,1996,90:269—284.
[135]Varela R, Vela C R, Puente J, et al. A knowledge-based evolutionary strategy for scheduling problems with bottlenecks[J]. European Journal of Operational Research,2003,145:57—71.
[136]Oliveira E. Solving single-track railway scheduling problem using constraint programming[D]. Leeds, UK:The University of Leeds, School of Computing,2001.
[137]刘华荣.基于拉格朗日松弛的罩式炉排产优化问题的研究[D].东北大学,206.
[138]Carlier J,Pinson E.Adjustment heads and tails for the job shop Scheduling problem[J].European Journal of Operational Research,1994,78(3):146-161.
[139]Blazewicz J,Pesch E,Sterna M.The disjunctive graph machine representation of job shop scheduling problem[J].European Journal of Operational Research,2000,127(2):317-331.
[140]Andrea D'Ariano. Improving Real-Time Train Dispatching:Models, Algorithms and Applications[D]. Roma Tre University,2008.
[141]Carlier J,Pinson E. Adjustment heads and tails for job shop scheduling problem[J].Europen Journal of Operational Research,1994,78(3):146-161.
[142]Li C L,Lee C Y. Scheduling with agreeable release times and due dates on batch processing machine[J].Europen Journal of Operational Research,1997,96(3):546-569.
[143]Blazewicz J,Pesch E,Sterna M. The disjunctive graph machine representation of the job shop scheduling problem[J].Eurpean Journal of Operational Research.2000,127(2):317-331.
[144]R.Mareus. A Parallel implementation of ant colony optimization[J].Parallel and distributed computing,2002,62:1421-1432.
[145]Mads Andreas Hofman. Robustness in train scheduling[D]. IMM, DTU,2005.
[146]M Fischetti, D Salvagnin. Fast approaches to improve the robustness of a railway timetable[J]. Transportation Science,2009,142-157.
[147]Hofman, Mads. Robustness and Recovery in Train Scheduling-a Case Study from DSB S-tog a/s[J]. ATMOS 2006-6th Workshop on Algorithmic Methods and Models for Optimization of Railways[J].2006,pp:1-22.