编组站调度系统配流协同优化理论与方法研究
|
摘要
编组站综合自动化是整个铁路运输现代化的重要组成部分,已建成的成都北编组站综合集成自动化系统(CIPS系统)和建设中的新丰镇编组站综合自动化系统(SAM系统)代表了我国铁路编组站信息化的发展趋势,它们整合并集成我国目前编组站各种成熟的过程控制分系统,统一信息管理,建立信息共享平台,有机地构建成管控一体化的整体系统。编组站CIPS系统和SAM系统实际上包括作业控制自动化、数据处理自动化和调度指挥智能化三大部分。这三大部分实际上形成按功能划分的三个子系统,它们紧密相联,互相依托,共同构成编组站综合自动化系统。其中,调度指挥子系统本质上属于决策支持系统(DSS),而数据处理子系统本质上属于管理信息系统(MIS),二者虽有联系,但面向不同层次,实现不同目标,具有不同功能。编组站调度指挥子系统(简称“调度系统”)是编组站综合自动化系统的核心,只有从优化作业计划入手,改善编组站作业,才能发挥出编组站调度系统“神经中枢”的作用。编组站调度系统配流问题是一个老问题,国内外学者一直在研究但未得到很好的解决方案,虽取得了一定的成果,但各有偏重,未能很好地从编组站整体角度考虑综合优化,有待进一步完善。
论文立足铁路编组站工作实际,从编组站调度大系统的角度出发,深入研究配流协同优化问题。论文借鉴了国内外相关研究成果,以理论研究为主,首先总结分析编组站的车流组织规律以及配流机理,然后在编组站调度系统界定和边际假设的基础上,综合运用大系统优化理论、协同论、组合数学等理论和观点,对编组站各单项作业进行系统的分析,同时注重作业环节的协调,将单项作业关联起来作为一个整体进行研究。论文的主要研究工作包括以下几个方面:
1.在深入分析编组站作业特征和作业流程的基础上,总结了编组站的车流组织规律,并对编组站调度系统进行了界定。通过分析配流问题的组合优化性质以及出发车流的来源,进一步揭示了编组站配流的内部机理。
2.以确定的编组站作业时间标准为依据,分别按调机的台数、调机作业方式、考虑固定作业和调机干扰与否,给出了计算到达列车的最早可能解体时刻和出发列车的最晚必须编组时刻的算法。在此基础上,以解体方案树模型及回溯算法确定列车的解体顺序,并提出列车编组顺序的调整方法。以先编组出发列车的单个配流方案为主线,建立了解编方案同步调整与协调匹配的协同优化模型。
3.汲取大系统优化理论、协同论的观点和方法,对到调机运用、到发线运用、调车线运用、取送车作业等建立一系列既相关又相对独立的模型和算法,包括静态与动态配流协同优化、到发线运用与解编作业协同优化、调车线运用与解编作业协同优化、取送车作业与解编作业协同优化等内容;引入系统综合的思想,将所建模型和算法进行有效地整合,建立编组站配流的综合协同优化模型,体现出系统的整体涌现性,构建了比较完善的编组站配流优化理论体系。
4.针对双向编组站衔接方向较多、易产生折角车流的特点,利用数学方法对交换车进行处理,同时考虑到达列车的接入场、出发列车的出发场以及股道调整等问题。在既有双向编组站系统作业分工方案的基础上,对于到发列车需要调整作业地点的情况,建立协同模型进行优化,尽可能地减少折角车流给编组站带来的能力损耗,实现到达车流在全站范围内的合理分配。
5.通过研究遗传算法和蚁群算法的融合,设计出一种集时间效率和求解精度于一体的快速算法——基于信息熵和混沌理论的遗传—蚁群协同优化算法,应用于求解编组站调度系统配流优化问题。
6.对所设计的算法应用计算机程序进行实现,并对郑州北站大量的现场数据进行测试,结果表明该算法能够在较短的时间内生成合理的配流方案,充分验证了优化模型和算法的有效性和实用性。
论文采用先局部后整体、由定性到定量、分层逐步解决的研究方法,加强了模型和算法的针对性设计,体现了配流整体优化的原则。论文的研究涵盖了与配流相关的编组站作业优化的主要内容,形成了一个相对完整的理论体系。编组站调度系统配流协同优化研究,作为编组站调度指挥智能化的应用基础理论研究,是编组站配流理论的深化,对提高编组站调度决策水平,实现编组站调度指挥科学化、智能化具有十分重要的作用,同时为建立编组站智能调度系统奠定可靠的理论基础。编组站配流的优化可以实现车站车流资源的优化配置,大力提高运输生产效率,进而产生巨大的经济和社会效益,因此论文的研究成果具有广阔的应用前景。
The comprehensive automation of marshalling station is an important part of whole railway transportation modernization. Freight classification computer integrated process system (CIPS system) which has been built at Chengdubei marshalling station and the under-construction synthetic automation of marshalling station (SAM system) at Xinfengzhen is the development trend of the marshalling station informatization in China. These two kinds of systems integrate different maturity process control subsystem at present marshalling station. They unify information management, set up information sharing platform, and construct a whole system of integrated manage and control. The marshalling station CIPS system and SAM system include operation control automation, data processing automation, and dispatch and command intellectualization. These three major parts form three subsystems divided functionally in fact, they are closely linked, rely on each other, composite marshalling station comprehensive automatic system together. The dispatch and command subsystem belongs to DSS among them, and the data processing subsystem belongs to MIS in essence. The two have connections, but face different levels, realize different goals, and have different functions. The dispatch and command subsystem (abbreviated as "dispatching system) is a core of the comprehensive automatic system at Marshalling station. The function of "nerve center" of marshalling station dispatching system could be given play starting with optimizing operation plan and improving marshalling station operation. The wagon-flow allocation problem in marshalling station dispatching system is an old problem, and the domestic and international scholar keeps studying this problem but not achieving good solution. They has made certain achievement, but each laid particular stress on, fail to well optimize synthetically from the point of whole marshalling station, remain to perfect further.
This dissertation studies the collaborative optimization problem about wagon-flow allocation bases on the practical work of marshaling station, and proceeds from angle of marshalling station dispatch large scale system. The dissertation has drawn lessons from the domestic and international relevant research results, and researches mainly theory. The wagon-flow organization rule about marshaling station and the mechanism of wagon-flow allocation are summarized at first, then every individual operation of marshalling station is analyzed on the basis of defining marshalling station dispatching system and supposing margin, using synthetically the theories and views of large scale system optimal theory, cooperation theory and combinatorics, etc., and pay attention to the coordination of operation links at the same time, make individual operation related to research as a whole. The main research work of the dissertation includes the following several respect:
1. The wagon-flow organization rule about marshaling station is summarized on the basis of analyzing the operation characteristic and process of marshalling station, and then marshalling station dispatching system has defined. The internal mechanism of wagon-flow allocation have announced further through analyzing the combination optimization properties of wagon-flow allocation problem and the source of departure wagon-flow.
2. Based on determined the operation time standard of marshalling station, the method for computing the earliest possible sorting time of arrival trains and the latest possible time to start formation of departure trains under different shunting locomotive amount, shunting operations and whether considering fixed operation and shunting locomotive interfering or not is given. The sorting sequence is confirmed by sorting scheme tree model and backtracking algorithm on this basis, and then the adjustment method of the formation sequence is proposed. The individual wagon-flow allocation scheme of departure trains being classified first as the main line, the collaborative optimization model for the synchronous adjustment and harmonious matching of the sorting and formation schemes is build.
3. A series of relevant and relative independent models and algorithms for the utilization of shunting locomotive and arrival-departure track, placing-in and taking-out wagons operation, etc. are build using large scale system optimal theory and cooperation theory. The content of these models and algorithms is the collaborative optimization of static and dynamic wagon-flow allocation, the utilization of arrival-departure track and sorting-formatting operation, the utilization of shunting track and sorting-formatting operation, placing-in and taking-out wagons and sorting-formatting operation, etc. Introducing the thought of system integration, the built model and algorithm will be combined effectively, and then build integrated collaborative optimization model for wagon-flow allocation in marshalling station. The models embody the whole emerging of the system, and the more perfect theory system for the optimization of wagon-flow allocation in marshalling station is constructed.
4. The exchange wagons are solved using mathematics method according to the characteristics of link up direction more and existing angular wagon flow in bidirectional marshalling station, in the meantime several problems about the acceptance yard of arrival trains, the departure yard of departure trains and track adjustment are considered. On the basis of existing system operation division scheme of bidirectional marshalling station, the collaborative optimization model is built to optimize the adjustment of arrival and departure trains operation place, so as to reduce the loss of marshalling station capacity because of angular wagon flow, and realize the rational allocation of arrival wagon-flows in the range of marshalling station.
5. A kind of quick algorithm is designed through studying the integration of genetic algorithm and ant algorithm. The efficiency and precision of the algorithm are high in computation, and it is known as genetic and ant colony collaborative optimization algorithm based on information entropy and chaos theory, apply to wagon-flow allocation optimization problem of marshalling station dispatching system.
6. The designed algorithm is realized by computer program, and tested through mass field data of Zhengzhoubei station. The result indicates that this algorithm can produce the rational wagon-flow allocation scheme, and have fully proved the validity and practicability of the optimization model and algorithm.
The dissertation adopts the research method from local to global, from qualitative to quantitative, layered gradual solved, has strengthen the pertinence designs of the model and algorithm, and has reflected the principle of global optimization. The research of the dissertation has contained the main content of operation optimization correlated with wagon-flow allocation in marshalling station, has formed a relatively intact theory system. The study on collaborative optimization of wagon-flow allocation in marshalling station dispatching system, it is application foundation theory research of the intelligent of marshalling station dispatch and command, and it promotes marshalling station wagon-flow allocation theory. This research results contribute to improving dispatch decision level in marshalling station, realize the dispatch and command of marshalling station scientific and intelligent, and establish the reliable theory foundation for marshalling station intelligent dispatching system at the same time. The optimization of wagon-flow allocation in marshalling station can realize the rational distribution of station wagon-flow resources, and improve transportation production efficiency, and then produce the enormous economic and social benefit, so the research results of the dissertation have wide application prospects.
论文立足铁路编组站工作实际,从编组站调度大系统的角度出发,深入研究配流协同优化问题。论文借鉴了国内外相关研究成果,以理论研究为主,首先总结分析编组站的车流组织规律以及配流机理,然后在编组站调度系统界定和边际假设的基础上,综合运用大系统优化理论、协同论、组合数学等理论和观点,对编组站各单项作业进行系统的分析,同时注重作业环节的协调,将单项作业关联起来作为一个整体进行研究。论文的主要研究工作包括以下几个方面:
1.在深入分析编组站作业特征和作业流程的基础上,总结了编组站的车流组织规律,并对编组站调度系统进行了界定。通过分析配流问题的组合优化性质以及出发车流的来源,进一步揭示了编组站配流的内部机理。
2.以确定的编组站作业时间标准为依据,分别按调机的台数、调机作业方式、考虑固定作业和调机干扰与否,给出了计算到达列车的最早可能解体时刻和出发列车的最晚必须编组时刻的算法。在此基础上,以解体方案树模型及回溯算法确定列车的解体顺序,并提出列车编组顺序的调整方法。以先编组出发列车的单个配流方案为主线,建立了解编方案同步调整与协调匹配的协同优化模型。
3.汲取大系统优化理论、协同论的观点和方法,对到调机运用、到发线运用、调车线运用、取送车作业等建立一系列既相关又相对独立的模型和算法,包括静态与动态配流协同优化、到发线运用与解编作业协同优化、调车线运用与解编作业协同优化、取送车作业与解编作业协同优化等内容;引入系统综合的思想,将所建模型和算法进行有效地整合,建立编组站配流的综合协同优化模型,体现出系统的整体涌现性,构建了比较完善的编组站配流优化理论体系。
4.针对双向编组站衔接方向较多、易产生折角车流的特点,利用数学方法对交换车进行处理,同时考虑到达列车的接入场、出发列车的出发场以及股道调整等问题。在既有双向编组站系统作业分工方案的基础上,对于到发列车需要调整作业地点的情况,建立协同模型进行优化,尽可能地减少折角车流给编组站带来的能力损耗,实现到达车流在全站范围内的合理分配。
5.通过研究遗传算法和蚁群算法的融合,设计出一种集时间效率和求解精度于一体的快速算法——基于信息熵和混沌理论的遗传—蚁群协同优化算法,应用于求解编组站调度系统配流优化问题。
6.对所设计的算法应用计算机程序进行实现,并对郑州北站大量的现场数据进行测试,结果表明该算法能够在较短的时间内生成合理的配流方案,充分验证了优化模型和算法的有效性和实用性。
论文采用先局部后整体、由定性到定量、分层逐步解决的研究方法,加强了模型和算法的针对性设计,体现了配流整体优化的原则。论文的研究涵盖了与配流相关的编组站作业优化的主要内容,形成了一个相对完整的理论体系。编组站调度系统配流协同优化研究,作为编组站调度指挥智能化的应用基础理论研究,是编组站配流理论的深化,对提高编组站调度决策水平,实现编组站调度指挥科学化、智能化具有十分重要的作用,同时为建立编组站智能调度系统奠定可靠的理论基础。编组站配流的优化可以实现车站车流资源的优化配置,大力提高运输生产效率,进而产生巨大的经济和社会效益,因此论文的研究成果具有广阔的应用前景。
The comprehensive automation of marshalling station is an important part of whole railway transportation modernization. Freight classification computer integrated process system (CIPS system) which has been built at Chengdubei marshalling station and the under-construction synthetic automation of marshalling station (SAM system) at Xinfengzhen is the development trend of the marshalling station informatization in China. These two kinds of systems integrate different maturity process control subsystem at present marshalling station. They unify information management, set up information sharing platform, and construct a whole system of integrated manage and control. The marshalling station CIPS system and SAM system include operation control automation, data processing automation, and dispatch and command intellectualization. These three major parts form three subsystems divided functionally in fact, they are closely linked, rely on each other, composite marshalling station comprehensive automatic system together. The dispatch and command subsystem belongs to DSS among them, and the data processing subsystem belongs to MIS in essence. The two have connections, but face different levels, realize different goals, and have different functions. The dispatch and command subsystem (abbreviated as "dispatching system) is a core of the comprehensive automatic system at Marshalling station. The function of "nerve center" of marshalling station dispatching system could be given play starting with optimizing operation plan and improving marshalling station operation. The wagon-flow allocation problem in marshalling station dispatching system is an old problem, and the domestic and international scholar keeps studying this problem but not achieving good solution. They has made certain achievement, but each laid particular stress on, fail to well optimize synthetically from the point of whole marshalling station, remain to perfect further.
This dissertation studies the collaborative optimization problem about wagon-flow allocation bases on the practical work of marshaling station, and proceeds from angle of marshalling station dispatch large scale system. The dissertation has drawn lessons from the domestic and international relevant research results, and researches mainly theory. The wagon-flow organization rule about marshaling station and the mechanism of wagon-flow allocation are summarized at first, then every individual operation of marshalling station is analyzed on the basis of defining marshalling station dispatching system and supposing margin, using synthetically the theories and views of large scale system optimal theory, cooperation theory and combinatorics, etc., and pay attention to the coordination of operation links at the same time, make individual operation related to research as a whole. The main research work of the dissertation includes the following several respect:
1. The wagon-flow organization rule about marshaling station is summarized on the basis of analyzing the operation characteristic and process of marshalling station, and then marshalling station dispatching system has defined. The internal mechanism of wagon-flow allocation have announced further through analyzing the combination optimization properties of wagon-flow allocation problem and the source of departure wagon-flow.
2. Based on determined the operation time standard of marshalling station, the method for computing the earliest possible sorting time of arrival trains and the latest possible time to start formation of departure trains under different shunting locomotive amount, shunting operations and whether considering fixed operation and shunting locomotive interfering or not is given. The sorting sequence is confirmed by sorting scheme tree model and backtracking algorithm on this basis, and then the adjustment method of the formation sequence is proposed. The individual wagon-flow allocation scheme of departure trains being classified first as the main line, the collaborative optimization model for the synchronous adjustment and harmonious matching of the sorting and formation schemes is build.
3. A series of relevant and relative independent models and algorithms for the utilization of shunting locomotive and arrival-departure track, placing-in and taking-out wagons operation, etc. are build using large scale system optimal theory and cooperation theory. The content of these models and algorithms is the collaborative optimization of static and dynamic wagon-flow allocation, the utilization of arrival-departure track and sorting-formatting operation, the utilization of shunting track and sorting-formatting operation, placing-in and taking-out wagons and sorting-formatting operation, etc. Introducing the thought of system integration, the built model and algorithm will be combined effectively, and then build integrated collaborative optimization model for wagon-flow allocation in marshalling station. The models embody the whole emerging of the system, and the more perfect theory system for the optimization of wagon-flow allocation in marshalling station is constructed.
4. The exchange wagons are solved using mathematics method according to the characteristics of link up direction more and existing angular wagon flow in bidirectional marshalling station, in the meantime several problems about the acceptance yard of arrival trains, the departure yard of departure trains and track adjustment are considered. On the basis of existing system operation division scheme of bidirectional marshalling station, the collaborative optimization model is built to optimize the adjustment of arrival and departure trains operation place, so as to reduce the loss of marshalling station capacity because of angular wagon flow, and realize the rational allocation of arrival wagon-flows in the range of marshalling station.
5. A kind of quick algorithm is designed through studying the integration of genetic algorithm and ant algorithm. The efficiency and precision of the algorithm are high in computation, and it is known as genetic and ant colony collaborative optimization algorithm based on information entropy and chaos theory, apply to wagon-flow allocation optimization problem of marshalling station dispatching system.
6. The designed algorithm is realized by computer program, and tested through mass field data of Zhengzhoubei station. The result indicates that this algorithm can produce the rational wagon-flow allocation scheme, and have fully proved the validity and practicability of the optimization model and algorithm.
The dissertation adopts the research method from local to global, from qualitative to quantitative, layered gradual solved, has strengthen the pertinence designs of the model and algorithm, and has reflected the principle of global optimization. The research of the dissertation has contained the main content of operation optimization correlated with wagon-flow allocation in marshalling station, has formed a relatively intact theory system. The study on collaborative optimization of wagon-flow allocation in marshalling station dispatching system, it is application foundation theory research of the intelligent of marshalling station dispatch and command, and it promotes marshalling station wagon-flow allocation theory. This research results contribute to improving dispatch decision level in marshalling station, realize the dispatch and command of marshalling station scientific and intelligent, and establish the reliable theory foundation for marshalling station intelligent dispatching system at the same time. The optimization of wagon-flow allocation in marshalling station can realize the rational distribution of station wagon-flow resources, and improve transportation production efficiency, and then produce the enormous economic and social benefit, so the research results of the dissertation have wide application prospects.
引文
1 胡思继.铁路行车组织.中国铁道出版社,1998
2 吴家豪.铁路编组站系统设计优化.中国铁道出版社,1994
3 关振东.信息化与铁路运输.中国铁道出版社,2003
4 杜旭升.编组站综合自动化系统探讨.中国铁道学会.2004年自动化驼峰研讨会论文集.北京,2004:118-121
5 张全寿.编组站货车实时信息系统.中国铁道出版社,1997
6 丁昆.成都北编组站综合集成自动化系统.中国铁路.2006,(8):46-48
7 王耀杰.新丰镇编组站综合自动化系统.西铁科技.2008,(1):3-9
8 吴长厚,陶德高.铁路编组站自动化概述.铁道运输与经济.2006,28(2):6-8
9 马小宁,钟雁,麻克君.基于信息共享的编组站综合自动化系统.北京交通大学学报.2004,28(6):99-103
10 郝建青,张仲义,陈滨.基于车辆实时跟踪的编组站综合自动化系统集成方案的研究.铁道学报.2000,22(2):1-6
11 詹志文.编组站综合自动化系统运用分析和改进.铁道运输与经济.2003,25(8):27-29
12 陈洪.编组站综合自动化的发展方向探讨与研究.中国水运(理论版).2006,4(8):155-156
13 崔炳谋.编组站阶段计划编制系统几个问题的研究.兰州铁道学院学报.1996,15(2):64-68
14 崔叙,熊天文.编组站阶段计划IDSS的研究.铁路计算机应用.2001,(3):16-18
15 常军乾,倪少权,安冬.编组站阶段计划编制系统的智能控制方法.铁路计算机应用.2001,(5):8-10
16 杜艳平,陈光伟,孙键.车站班计划和阶段计划计算机编制方法的研究.铁路计算机应用.2004,13(7):1-3
17 何世伟,宋瑞,朱松年.编组站阶段计划解编作业优化模型及算法.铁道学报.1997,19(3):1-8
18 袁庆达,杜文,黎青松.区段站阶段计划的优化模型和算法.西南交通大学学报.2000,35(3):250-254
19 王明慧,赵强.编组站智能调度系统阶段计划优化模型及算法研究.铁道学报.2005,27(6):1-9
20 Measarovic M D,et al.Theory of hierarchical multilevel systems.New York:Academic Press,1970
21 Hasson M F.A development of a decomposed estimation algorithm for large scale system.International Journal of Systems Science.1983,14(3):269-279
22 叶秉如,方道南.大型多目标线性规划解法研究.水科学进展.1995,6(4):270-277
23 张启人,熊桂林.公共交通大系统建模与优化.系统工程.1986,4(6):25-39
24 罗晴,金福才,胡思继.列车运行调整问题的分解协调计算模型.北京交通大学学报.2004,28(6):87-89
25 娄山佐,史忠科.基于分解协调原理的大规模动态车辆调度.系统仿真学报.2006,18(4):998-1001
26 高文豪.大系统最优化.水利水电出版社,1991
27 戴明龙.大系统分解协调法与GM(1,1)模型在流域防洪联合调度中的耦合应用.四川大学硕士学位论文.2004
28 方道南,叶秉如.大系统多目标规划和风险决策的理论与方法.水利水电科技进展.1999,19(4):17-20
29 陈禹六.大系统理论及其应用.清华大学出版社,1988
30 H.哈肯著.协同学.徐锡申等译.原子能出版社,1984
31 郭治安,沈小峰.协同论.山西经济出版社,1991
32 H.Haken.Cooperative effects:Progress in Synergetics.North Helland,Amsterdam,1974
33 H.Haken.Cooperative effects in systems far from thermal equilibrium and in nonphysical system.Rev.Mod.Phys,1975
34 Kroo I,Altus S,Braun R,et al.Multidisciplinary optimization methods for aircraft preliminary design.AIAA-94-4325,FL:AIAA,1994
35 Braun R D,Kroo I.Development and application of the collaborative optimization architecture in a multidisciplinary design environment.NASA Iciam_rdb,International Congress on Industrial and Applied Mathematics,Hamburg,Germany,1995
36 Braun R D.Collaborative Optimization:An architecture for large-scale distributed design.Stanford:Stanford University,1996
37 Tappeta R V,Renaud J E.Multiobjective collaborative optimization.ASME Journal of Mechanical Design,1997,11(3):403-411
38 Kroo I,Manning V.Collaborative optimization:status and directions.AIAA-2000-4721,2000
39 王亦首,史彦军,滕弘飞.多学科设计优化研究进展.计算机集成制造系统.2005,11(6):751-756
40 白小涛,李为吉.基于近似技术的协同优化方法在机翼设计优化中的应用.航空学报.2006,27(5):847-850
41 于雄庆,薛飞,穆雪峰等.用遗传算法提高协同优化方法的可靠性.中国机械工程.2003,14(21):1808-1811
42 周盛强,向锦武.基于BP网络和Pareto遗传算法的多目标协同优化.机械设计与研究.2006,22(5):10-13
43 陈亚洲,高亮,周驰.基于粒子群优化和协同优化的多学科设计优化研究.机械科学与技术.2007,26(4):424-427
44 王焱,胡长斌.面向复杂系统的智能协同建模方法研究.济南大学学报(自然科学版).2006,20(3):280
45 Merriam-Webster Collegiate Dictionary.11th ed.Merriam-Webster,2003
46 X.Huang.Cooperative optimization for solving large scale combinatorial problems.Theory and Algorithms for Cooperative Systems,Series on Computers and Operations Research,World Scientific,2004:117-156
47 林柏梁,胡安洲.重空车流运行组织的协同优化理论及模型.铁道学报.1998,20(5):9-14
48 杨文胜.基于响应时间的供应链协同决策与优化模型研究.华中科技大学博士学位论文.2004
49 王俊刚,褚世新,余泉等.干线协调控制系统的绿信比协同优化模型研究.交通运输工程与信息学报.2005,3(2):13-18
50 保丽霞,杨兆升,胡键萌等.交通流诱导与控制协同的双目标优化模型及准最优求解算法.吉林大学学报(工学版).2007,37(2):319-324
51 杨维维,陈小前,姚雯等.基于多方法协作优化算法的飞机总体优化设计.航空计算技术.2006,36(6):1-4
52 唐茂,罗阳,刘胜青.作业车间调度问题中的协同优化算法.中国测试技术.2003,(1):43-45
53 胡仕成,徐晓飞,李向阳.项目优化调度的病毒协同进化遗传算法.软件学报.2004,15(1):49-57
54 李爱国.多粒子群协同优化算法.复旦学报(自然科学版).2004,43(5):923-925
55 杨瑞臣,周永付,云庆夏.寻找车辆最优路径的混合算法.交通运输工程学报.2005,5(1):102-105
56 张维存,郑丕谔,吴晓丹.蚁群遗传算法求解能力约束的柔性作业车间调度问题.计算机集成制造系统.2007,13(2):333-337
57 张全寿.编组站站调决策支持系统的研究.北方交通大学学报.1989,13(4):64-72
58 刘军.基于知识的编组站作业整体仿真策略的研究.北方交通大学学报.1992,16(3):40-45
59 段继达.车站班计划的自动编制.铁道运营技术.2000,6(3):99-101
60 邓小瑜,宋建业.铁路编组站日班计划计算机编制的研究.兰州铁道学院学报.2000,19(4):105-109
61 蒋熙,苗建瑞,于勇,杨肇夏.基于高层体系结构的铁路编组站综合仿真系统研究.系统仿真学报.2002,14(4):481-484
62 乐逸祥,周磊山.通用铁路大站技术作业仿真模型和方法的研究.系统仿真学报.2003,15(12):1787-1790
63 王莹,刘军.车站调度作业计划仿真建模的研究.铁路计算机应用.2005,14(9):1-4
64 刘强华.编组站作业大表自动生成系统的设计与实现.铁路计算机应用.2003,12(9):12-14
65 尉成荣,袁在兵.编组站技术作业大表自动生成系统的设计与实现.铁路技术创新.2004,(2):7-9
66 赵海宁,韩锋,周航.利用微机铺画编组站技术作业大表的实践.铁道运输与经济.2004,26(6):55-57
67 O.Gulboden.Optimal planning of marshalling yard by operation research.PROC,1963:226-233
68 O.Hein.A two-stage queuing model for a marshalling yard.Rail Int.,1972,(3):249-259
69 F.Clover,D.Karney and D.Klingman.Solving singly constrained transshipment problems.Trans.Scil,1978,24(12):1209-1220
70 Gupta U I,Lee D T and Leung J Y T.An optimal solution for the channel-assignment problem.IEEE Transactions on Computers.,1979,28(11):807-810
71 M.A.Turnquist,M.S.Dadkin.Queuing models of classification and connection delay in rail yard.Trans.Sci1,1982,(16):207-230
72 R.E.Hughes and W.B.Powell.Mitigating end effects in the dynamic vehicle allocation problem.Report EES-85-11,Department of Civil Engineering,Princeton University,Princeton,N.J.,1985
73 P.J.Detax and T.G.Crainic.Survey paper:a review of empty flows and fleet management models in freight transportation.Trans.Sci1,1987:227-247
74 K.C.Chih.A real time dynamic optimal freight car management simulation model of the multiple railroad multicommodity,temporal spatial network flow problem.Ph.D.Dissertation,Princeton University,1990
75 J.B.George and M.A.Turnquist.A model for fleet sizing and vehicle allocation.Trans.Sci1,1991,25(1)
76 B.D.Robert.Minimizing trailer-on-flat-car costs:a network optimization model.Trans.Sci1,1994,28(1)
77 Carey M.Extending a train patching algorithm from one-way to two-way track.Trans.Res.-B.,1994,(28):395-400
78 Higgins A,Kozan E,Ferreira L.Optimal scheduling of trains on a single track.Trans.Res.-B.,1996,(29):147-161
79 Michiel A Odijk.A constraint generation algorithm for the Construction of periodic railway timetables.Transportation Research Part B,1996,30(6):455-464
80 L G Kroon,H E Romerijn,P J Zwaneveld.Routing trains through railway stations:complexity issues.European Journal of Operational Reaseach,1997,(98):458-498
81 Elias Dahlhaus.The train marshalling problem.Discrete Applied Mathematics,2000,(103):41-54
82 Malachy Craey,Sinead Craville.Scheduling and plat forming trains at busy complex stations.Transportation Research Part A,2003,37(3):195-224
83 Ф.П.柯契涅夫.铁路行车组织.高家驹,杨明伦等译.中国铁道出版社,1985
84 E.A.索尼科夫.编组站工作强化.王鹤鸣译.中国铁道出版社,1987
85 #12
86 刘重庆.俄罗斯铁路信息化建设.中国铁路.2002,(3):34-36
87 Arjang A.Assad.Modeling of rail networks:Toward a routing/makeup model.Trans.Res.-B.,1980,14(1):101-114
88 M.A.Turnquist and M.S.Daskin.Queuing models of classification and connection delay in rail yards.Transp.Sci.,1982,(16):207-230
89 S.Yagar,F.F.Saccomanno and Q.Shi.An efficient sequencing model for humping in a rail yard.Trans.Res.-A.,1983,17(4):251-262
90 T.Gainic,J.Ferland,J.Rousseav.A tactical planning model for rail freight transportation.Trans.Sci.,1984,(18):165-183
91 M.H.Keaton.Designing optimal railroad operating plans:Lagrangian relaxation and heurist ice approaches.Trans.Res.-B.,1989,(23):415-431
92 M.H.Keaton.Designing railroad operating plans:A dual adjustment method for implementing lagrangian relaxation.Trans.Sci.,1992,(26):263-279
93 David R,Martinelli and Huanliang Teng.Optimization of railway operations using neural networks.Trans.Res.-C.,1995,4(1):33-49
94 Z.Z.Avramovic.Method for evaluating the strength of retarding steps on a marshaling yard hump.Eur.J.Operational Res.,1995,(85):504-514
95 中国铁道管理学院,日本国际协力事业团.铁路编组站自动化.中国铁道出版社,1991
96 魏华征.铁路运营管理现代化的发展水平和我国铁路的差距--21世纪铁路技术.中国铁道出版社,1995
97 周克勤.铁路分局列车日班计划数据自动化处理研究.铁道部科学研究院研究报告,1983
98 魏建华.摘挂调车钩计划专家系统的研究.北方交通大学硕士学位论文.1984
99 胡东彦.编组站班计划专家系统的研究.北方交通大学硕士学位论文.1989
100 王家俊.铁路编组站改编系统协调.铁道科学研究院硕士学位论文.1984
101 刘风先.编组站调车场股道数及改编能力合理负荷.北方交通大学硕士学位论文.1987
102 毛保华.编组站系统分析与优化.北方交通大学硕士学位论文.1987
103 张卫红.编组站的合理分工与点线能力协调.北方交通大学硕士学位论文.1989
104 李林山.利用微机辅助编制铁路分局日班计划的研究.北方交通大学硕士学位论文.1991
105 崔炳谋.铁路枢纽编组站分工优化数学模型及其应用的研究.兰州铁道学院硕士学位论文.1991
106 易文平.编组站系统优化.北方交通大学博士学位论文.1992
107 范征.丰台西编组站调度决策支持系统的研究--阶段计划解体照顾编组、出发.西南交通大学硕士学位论文.1993
108 吕红霞.技术站调度决策支持系统的研究--到发线的合理使用.西南交通大学硕士学位论文.1994
109 方洪武.计算机编制区段站日计划的研究.西南交通大学硕士学位论文.1994
110 李昕红.济南枢纽运输组织及优化.西南交通大学硕士学位论文.1994
111 钟雁,张全寿.铁路编组站调车作业计划决策支持系统的研究.铁道学报.1994,16(4):76-81
112 钟雁.一个基于动态模型的计划决策支持系统.北方交通大学学报.1994,18(4):477-483
113 王慈光.车站技术作业整体统筹模型.铁道运输与经济.1996,(4):71-74
114 郑时德,杨肇夏.编组站作业仿真及系统优化.中国铁道出版社,1996
115 惠莉.西安东编组站调度决策支持系统的研究--计算机辅助编制阶段计划.西南交通大学硕士学位论文.1997
116 彭越.用计算机编制车站阶段计划.西南交通大学硕士学位论文.1997
117 段继达.计算机实现铁路车站班计划自动编制的研究.西南交通大学硕士学位论文.1997
118 梁建.编组站调度指挥仿真系统.西南交通大学硕士学位论文.1997
119 张春迎.编组站调车作业系统仿真.西南交通大学硕士学位论文.1997
120 汪文锋.成都东站阶段计划编制的计算机辅助决策系统的研究.西南交通大学硕士学位论文.1997
121 王守慧.铁路分局日班计划智能编制理论和方法的研究.北方交通大学博士学位论文.1998
122 邓小瑜.编组站日班计划智能编制理论和方法的研究.兰州铁道学院硕士学位论文.1999
123 程英俊.计算机编制编组站阶段计划的研究.兰州铁道学院硕士学位论文.1999
124 龚文平.编组站阶段计划自动化编制若干问题的研究.西南交通大学硕士学位论文.1999
125 牛惠民.铁路枢纽编组站作业分工整体优化的研究.北方交通大学博士学位论文.1999
126 胡刚.编组站阶段计划自动编制与调整的研究.西南交通大学硕士学位论文.2000
127 常均乾.编组站阶段计划编制系统设计与若干技术的研究.西南交通大学硕士学位论文.2002
128 麻克君.基于信息共享的编组站运输组织模式的研究.北方交通大学硕士学位论文.2003
129 吴翠珑.试论编组站综合自动化系统的现状与发展趋势.北京交通大学硕士学位论文.2003
130 薛艳冰.铁路分局调度计算机辅助决策系统--技术站及区段管内日(班)列车工作计划研究.兰州铁道学院硕士学位论文.2003
131 李坚.编组站解体计划自动化系统的设计和实现.北京交通大学硕士学位论文.2004
132 杨涛.基于多Agent的编组站作业计划计算机编制方法和作业管理系统研究.北京交通大学硕士学位论文.2004
133 胡猛.计算机编制编组站阶段计划的模型和算法的研究.北京交通大学硕士学位论文.2006
134 李磊.计算机辅助编制阶段计划的研究.兰州交通大学硕士学位论文.2006
135 何自冬,郑力,张智海等.基于Agent的技术站站调决策支持系统.铁道运输与经济.2006,28(3):72-74
136 黎浩东.铁路编组站鲁棒性阶段计划编制研究.北京交通大学硕士学位论文.2008
137 胡兴宇.编组站作业计划优化编制若干问题研究.北京交通大学硕士学位论文.2008
138 刘军.铁路编组站作业计划滚动式智能化编制方法研究.北方交通大学博士学位论文.1993
139 何世伟.铁路枢纽作业计划的优化编制-编组站作业计划与枢纽日班计 划的模型及算法研究.西南交通大学博士学位论文.1996
140 李文权.铁路区段站日工作计划优化模型及其算法的研究.西南交通大学博士学位论文.1997
141 徐杰.区段站阶段计划自动编制模型和算法研究.西南交通大学博士学位论文.2003
142 乐逸祥.基于网络协作模式的编组站车站调度方法的研究.北京交通大学博士学位论文.2006
143 王正彬.区段站阶段计划调整模型与算法研究.西南交通大学博士学位论文.2007
144 张振儒.TMIS中车流推算方法的研究.铁路计算机应用.1998,7(2):29-31
145 范英书.利用TMIS系统实现计算机推算车流.铁道运输与经济.1999,(10):32-34
146 崔叙,熊天文.编组站阶段计划IDSS的车流推算方法研究.铁路计算机应用.2002,(11):24-26
147 熊巧.编组站站调IDSSG.铁道运输与经济.2004,26(10):55-57
148 陈刚.铁路编组站运营系统动态仿真.西南交通大学博士学位论文.2006
149 曹家明,范征,毛节铭.编组站作业优化决策支持系统--解体子系统.铁道学报.1993,15(4):66-72
150 王慈光.编组站列车解体方案的计数方法.铁道学报.2000,22(6):1-7
151 王慈光.用表上作业法求解编组站配流问题的研究.铁道学报.2002,24(4):1-5
152 王慈光.编组站静态配流网络模型.交通运输工程与信息学报.2003,1(2):67-71
153 王慈光.编组站动态配流模型与算法研究.铁道学报.2002,26(1):1-6
154 王明慧.编组站智能调度系统YIDS体系框架与关键技术优化理论研究.西南交通大学博士学位论文.2007
155 王世东,郑力,张智海等.编组站阶段计划自动编制的数学模型及算法.中国铁道科学.2008,29(2):120-124
156 牛惠民.双向编组站列车调度调整的优化模型及算法.中国铁道科学.2007,28(6):102-108
157 李文权,王炜,杜文等.铁路技术站调机运用模型及算法.系统工程学报.2000,15(1):38-43
158 徐杰,杜文,李宗平等.基于模拟退火算法和图着色的调车机车安排研究.铁道学报.2003,25(3):24-30
159 王振宏,崔炳谋,许广辉.基于不确定理论和混合智能算法的调车机车运用研究.铁道运输与经济.2006,28(12):87-89
160 王世东,郑力,张智海等.蚁群算法在调机运用计划中的应用.中国铁道科学.2007,28(3):104-108
161 青学江,马国忠.遗传算法在区段站到发线的应用研究.西南交通大学学报.1998,33(4):387-393
162 吕红霞,倪少权,纪红叶.技术站调度决策支持系统的研究--到发线的合理使用.西南交通大学学报.2000,35(3):255-258
163 李文权,王炜,程世辉.铁路编组站到发线运用的排序模型和算法.系统工程理论与实践.2000,20(6):75-78
164 徐杰,杜文,常均乾等.基于遗传算法的区段站到发线运用优化安排.中国铁道科学.2003,24(2):109-114
165 王正彬,杜文.铁路技术站到发线运用调整模型及算法.西南交通大学学报.2006,41(2):202-205
166 李磊,崔炳谋.基于混合算法的编组站到发线模型算法研究.交通运输工程与信息学报.2008,6(1):86-90
167 高资,杨明伦.确定树枝型专用线最优取送方案的探讨.西南交通大学学报.1981,(3):64-69
168 徐忠民,孔庆钤.直达列车取送车顺序的优化.北方交通大学学报.1988,(2):70-73
169 杜文,李文权.放射状专用线直达列车取送车问题的算法.西南交通大学学报.1995,30(5):503-508
170 王慈光.树枝形专用线取送车问题的研究.西南交通大学学报.1996,31(6):675-680
171 李文权,杜文.树枝状铁路专用线取送车问题的数学模型及算法.河南大学学报(自然科学版).1997,27(2):1-8
172 敬媛媛.树枝型专用线取送车算法的研究.成都大学学报(自然科学版).1998,17(4):36-42
173 宋建业.直达列车多点装卸取送顺序优化的表上移动法.兰州交通大学 学报.2002,21(1):76-79
174 余少鹤,李夏苗.货物作业车取送模型及算法研究.铁道运输与经济.2002,24(12):46-48
175 李智.基于改进型蚁群算法的货物作业车取送模型优化.铁道运输与经济.2004,26(4):73-76
176 石红国,彭其渊,郭寒英.树枝型专用线取送车问题的哈密尔顿图解法.中国铁道科学.2005,26(2):132-135
177 王慈光.放射形专用线非直达车流取送车问题研究.交通运输工程与信息学报.2006,4(3):16-23
178 王雅琳,李开峰,马杰等.遗传算法在企业铁路取送调车作业优化中的应用.系统工程.2007,25(3):94-99
179 黄向荣.树枝型专用线取送车的模型及算法研究.兰州交通大学学报.2007,26(3):51-54
180 杨信丰,李引珍.直达车流取送问题的模型及其算法.交通运输系统工程与信息.2008,8(2):103-107
181 靳磊.铁路树枝形专用线取送车作业优化.北京交通大学硕士学位论文.2008
182 王慈光.运输模型及优化.中国铁道出版社,2004
183 刘其斌,马桂贞.铁路车站及枢纽.中国铁道出版社,1999
184 杨介平.铁路运输能力的计算与利用.中国铁道出版社,2001
185 薛锋,王慈光.编组站配流相关问题分析.交通运输工程与信息学报.2008,6(4):29-33
186 郝建青.集成环境中编组站信息系统开发理论与优化方法研究.北方交通大学博士学位论文.2000
187 张宇.基于CIM思想的编组站综合自动化系统--编组站作业自动化CIMS的研究.北方交通大学博士学位论文.2000
188 沈志云.交通运输工程学(第一版).人民交通出版社,1999
189 任炳南.中国铁路车站工作实务全书.中国对外经济贸易出版社,1997
190 牛惠民,胡安洲.双向编组站系统作业分工的优化模型及算法.中国科学(E辑).1998,28(4):378-384
191 郭寒英.编组站工作可靠性研究.西南交通大学硕士学位论文.2003
192 刘仍奎.评价车站系统能力协调的新方法.北方交通大学学报.1994,18(4):459-463
193 毛保华,秦作睿.运输系统点线能力协调模型的研究.铁道学报.1996,18:97-101
194 何世伟,宋瑞,杨浩.列车提速对编组站运营工作的影响研究.铁道学报.2000,22(5):6-12
195 朱晓立,李夏苗.提速干线上编组站到解系统匹配与协调关系的研究.中国铁道科学.2004,25(4):112-115
196 朱晓立,李夏苗.提速干线上编组站出发子系统内部匹配与协调关系.中国铁道科学.2006,27(5):118-121
197 凌熙.多方向铁路编组站货车到达与集结规律研究.北京交通大学硕士学位论文.2006
198 薛锋,罗建.编组站能力与运行图能力的动态协调关系.铁道运输与经济.2008,30(7):76-79
199 彭其渊,王慈光.铁路行车组织.中国铁道出版社,2007
200 王栋.铁路客运站到发线运用自动编排设计.中南大学硕士学位论文.2007
201 郑州铁路局郑州北站等.编组站智能调度系统的研究与开发研制报告.郑州铁路局,2006
202 闫海峰,彭其渊.铁路客货运输组织系统特性的比较分析.交通运输工程与信息学报.2006,4(3):46-52
203 刘敏.确定工业编组站车列推峰最优顺序的两种方法.中国铁道科学.2001,22(6):50-52
204 刘敏.工业编组站解体车列选定的模糊综合评判.铁道学报.2002,24(2):12-16
205 薛锋,王慈光.编组站列车编组顺序的调整方法.铁道学报.2007,29(4):1-5
206 《运筹学》教材编写组.运筹学.清华大学出版社,2001
207 薛锋,王慈光,罗建等.编组站列车解体方案与编组方案的协调优化研究.铁道学报.2008,30(2):1-6
208 李士勇,陈永强,李研.蚁群算法及其应用.哈尔滨工业大学出版社,2004
209 丁建立,陈增强,袁著祉.遗传算法与蚂蚁算法的融合.计算机研究与发展.2003,40(9):1531-1536
210 孙玉明,李红璇.编制编组站调车场线路固定使用方案的探讨[J].铁道 运输与经济,2003,25(12):20-21
211 任勇.驼峰调车场线路固定使用方案的研究.太原科技,2003,(5):24-26
212 陈伯羽.铁路编组场线路固定使用方案优选方法研究.铁道科学与工程学报,2006,3(6):80-82
213 孙晚华.确定编组站调车场线路数的模拟方法.铁道学报,1996,18(增刊):105-108
214 牛惠民,胡安洲.双向编组站折角车流优化的模型和算法.北方交通大学学报.1998,22(6):38-42
215 Feng Xue,Ciguang Wang.A Method of Exchange Wagon-Flow Allocating in Bidirectional Marshalling Yards.The First International Conference on Transportation Engineering,Chengdu,China,July,2007.ASCE,United States:2241-2246
216 薛锋,王慈光,罗建.双向编组站静态配流的优化.西南交通大学学报.2008,43(2):159-164
217 刘宝碇,赵瑞清,王纲.不确定规划及应用.清华大学出版社,2003
218 章敬东.复杂优化问题中智能算法的分析与集成.华南理工大学博士学位论文.2003
219 高尚,杨静宇.群智能算法及其应用.中国水利水电出版社,2006
220 黄习樾,张著洪,何传江等.现代智能算法理论及应用.科学出版社,2005
221 丁建立,陈增强,袁著祉.遗传算法与蚂蚁算法融合的马尔可夫收敛性分析.自动化学报.2004,30(4):629-634
222 邵晓巍,邵长胜,赵长安.利用信息量留存的蚁群遗传算法.控制与决策.2004,19(10):1187-1193
223 龚道雄,阮晓钢.基于蚁群算法的基因联接学习遗传算法.计算机工程与应用.2004,(26):10-15
224 毛宁,顾军华,谭庆.蚁群遗传混合算法.计算机应用.2006,26(7):1692-1693
225 周鹏.带有单亲遗传特征的蚁群算法.计算机工程与设计.2007,28(9):2001-2002
226 刘立东,蔡淮.融入遗传算法的混合蚁群算法.计算机工程与设计.2008,29(5):1248-1252
227 Holland J H.Outline for a logical theory of adaptive systems.Journal of the Association for Computing Machinery, 1962,(3): 297-314
228 Bagley J D. The Behavior of Adaptive Systems Which Employ Genetic and Correlation Algorithms. Dissertation Abstracts International, 1967, 28(12),5106B
229 Holland J H. A new kind of turnpike theorem, Bulletin of the American Mathematical Society, 1969,(75): 1311-1317
230 Holland J H. Genetic algorithms and the optimal allocation of trials, SIAM Journal of Computing, 1973,(2):88-105
231 Holland J H. Adaptation in natural and artificial systems. MI: University of Michigan Press. 1975
232 De Jong K A. An Analysis of the Behavior of a Class of Genetic Adaptive Systems. Ph.D. Dissertation, University Microfilms,No.76-9381,University of Michigan, Ann Arber, 1975
233 Ackley D H, Hinton G E, Sejnowski T J. A learning algorithms for Boltzmann machines, Cognitive Sci., 1985(9):147-169
234 Fogarty J C. Varying the Probability of Mutation in Genetic Algorithms. In Proc 3rd Int Conf Genetic Algorithms, 1989:42-50
235 Davis L. Adaptive Operator Probabilities in Genetic Algorithms. In Proc 3rd Int Conf Genetic Algorithms, 1989:61-69
236 Sywerds G, Uniform in genetic algorithms, ICGA'89, Morgan Kaufmann,1989:2-9
237 Eiben A E, Aarts E H L, Hee K M V. Global Convergence of Genetic Algorithms: A Markov Chain Analysis. Schwefel H P, Manner R, Eds,Springer-Verlag, 1990:4-12
238 Whitley D, Stark weather D. Genetic II: A Distributed Genetic Algorithm.Expt J Theory, Art Intell. 1990, (2): 189-214
239 Fogel D B, Fogel I J, Porto V W. Evolving neural networks, Biol, Cybern,1990,(63):487-493
240 Belew R K, Booker L B. Proceeding of the Fourth international Conference on Genetic Algorithms and the Their Applications, Morgan Kaufmann, 1991
241 Hart W E, Belew R K. Optimizing an arbitrary function is hard for the genetic algorithm, ICGA'91, Morgan Kaufmann, 1991
242 Wilson S W, GA-easy does not imply steepest-ascent optimizable, ICGA'91, Morgan Kaufmann,1991
243 Vose M D,Liepins G E,Generalizing the notion of schemes in genetic algorithms,Artificial Intelligence,1991(50):385-396
244 Eshelmen L,Schaffer D.Preventing premature convergence in genetic algorithms by preventing incest algorithms,ICGA'91,Morgan Kaufmann,1991:115-122
245 Abdullah A R.A robust method for liner and nonlinear optimization based on genetic algorithm,Cybernetica,1991,(34):279-287
246 Holland J H.Genetic algorithms,Scientific American,1992,(4):44-50
247 Forrest S.Ed.Proc.Of the Fifth Intern.Conf.on Genetic Algorithms,San Mateo,CA:MorganKaufmann,1993
248 Fam Q B,Perov V L.New evolutionary genetic algorithms for NP-complete combinatorial optimization problems.Biol,Cybern,1993,(69):229-234
249 Srinival M,Patnaik L M.Genetic Algorithms:A Survey.Computer,1994,23:17-26
250 Srinival M,Patnaik L M.Adaptive Probabilities of Crossover and Mutation in Genetic Algorithm.IEEE Trans Syst Man,Cybern,1994,24(4):656-667
251 Smith,Derek,Stephanie Forrest,Alan Perelson.Immunological memory is associative.D.Dasgupta,Artificial Immune Systems and their Applications,Sprinaer-Verlaa,1998:10-115
252 Soojung Jung,A Genetic Algorithm for the vehicle routing problem with time-dependent travel times.Dissertation for the Faculty of Graduate School of the University of Maryland,College Park.2000
253 Castro L N,Von Zuben F J.Data mining:a heuristic approach,USA,dea group,2001
254 刘勇,康立山,陈毓屏.非数值并行算法(第二册)-遗传算法.科学出版社,1995
255 牛惠民,胡安洲.双向编组站车流接续的综合优化.铁道学报.1998,20(6):16-21
256 何世伟,宋瑞,胡安洲.编组站阶段计划刚性与柔性优化的协调研究.铁道学报.1999,21(4):1-8
257 崔炳谋,马钧培,张朴.编组站进路调度优化算法.中国铁道科学.2007,28(2):100-104
258 刘霆,何世伟,王保华等.编组站调度计划随机机会约束规划模型及算法研究.铁道学报.2007,29(4):12-17
259 王正彬,杜文,吴柏青等.基于解编顺序的阶段计划车流推算模型及算法.西南交通大学学报.2008,43(1):91-95
260 杨运贵,王慈光,薛锋.树枝形铁路专用线取送车问题的遗传算法研究.计算机工程与应用.2008,44(12):210-211
261 Dorigo M.Optimization,learning and natural algorithms.PhD Thesis,Department of Electronics,Politecnico di Milano,Italy,1992
262 Colorni A,Dorigo M,Maniezzo V.An Investigation of some properties of an "Ant algorithm".Proceedings of the Parallel Problem Solving From Nature Conference(PPSN92).Brussels,Belgium:Elsevier Publishing,1992:509-520
263 吴启迪,汪镭.智能蚁群算法及应用.上海科技教育出版社,2004
264 Dorigo M,Maniezzo V,Colorni A.The ant system:Optimization by a colony of cooperating agents.IEEE Transactions on Systems,Man,and Cybernetics-Part B,1996,26(1):29-41
265 Dorigo M,Gambardella L M.Ant colony system:A cooperative learning approach to the traveling salesman problem.IEEE Transactions on Evolutionary Computation,1997,1(1):53-66
266 Dorigo M,Gambardella L M.Ant colonies for the traveling salesman problem.Bio Systems,1997,43:73-81
267 Costa D,Hertz A.Ants can color graphs.Journal of the Operational Research Society,1997,48:295-305
268 Dorigo M.Heuristic from nature for hard combination optimization problems.International Transaction operational research,1998,3(1):1-21
269 Gambardella L M,Taillard E D,Dorigo M.Ant colonies for the quadratic assignment problem.Journal of The Operational Research Society,1999,50(2):167-176
270 Dorigo M,Caro G D,Gambardella LM.Ant Algorithms for Discrete Optimization.Artificial Life,1999,5(3):137-172
271 Maniezzo V,Carbonard A.Ant colony optimization:An overview.Informazione,University of Bologna,Italy,1999
272 Bullnheimer B,Hartl R F,Strauss C.An improved ant system algorithm for the vehicle routing problem. Annals of Operations Research, 1999, 89:319-328
273 Chang C S, TianL, Wen F S. A new approach to fault section estimation in power systems using ant system. Electric Power Systems Research, 1999,49(1):63-70
274 Merkle D, Middendorf M. An ant algorithm with a new pheromone evaluation rule for total tardiness problems, Real-World Applications of Evolutionary Computing, Proceeding 2000, 18(3): 287-296
275 Gutjahr W J. A graph-based ant system and its convergence. Future Gener.Comput. Syst., 2000,16(8):873-888
276 Stutzle T, Hoos HH. MAX-MIN ant system. Future Generation Computer Systems, 2000, 16(8):889-914
277 Dorigo M, Bonabeau E, Theraulaz G. Ant algorithms and stigmergy. Future Generation Computer Systems, 2000, 16: 851-871
278 Maniezzo V. An ants heuristic for the frequency assignment problem.Antonella Carbonaro Future Generation Computer Systems, 2000, (16):927-835
279 Cordone R, Maffioli F. Colored ant system and local search to design local telecommunication networks. Applications of Evolutionary Computing,Proceeding, 2001,2037:60-69
280 Talbi E G, Roux O, Fonlupt C, Robillard D. Parallel Ant Colonies for the quadratic assignment problem. Future Generation Computer Systems, 2001,17:441-449
281 Middendorf M, Reischle F, Schmeck H. Multi colony ant algorithms. Journal of Heuristics, 2002, 8(3):305-320
282 Thomas St(?)tzle, Marco Dorigo. A short convergence proof for a class of ACO algorithms. IEEE Transactions on Evolutionary Computation,2002,6(4):358-365
283 Walter J, Gutjahr. ACO algorithms with guaranteed convergence to the optimal solution, Information Processing Letters, 2002,82(2):145-153
284 Wang Lei, Wu Qidi. Performance evolution of ant system optimization process. Proc. 4thWCICA2002, IEEE press:2546-2550
285 Randall A. A parallel implementation of ant colony optimization. Journal of Parallel and Distributed Computing,2002,(62):1421-1432
286 Randall M,Montgomery J.Candidate set strategies for ant colony optimization.Technical Report,TR02-04,School of Information Technology,Bond Universtiy,2002
287 Meuleau N,Dorigo M.Ant colony optimization and stochastic gradient descent.Artif.Life,2002,8(2):103-121
288 Yang Xinbin,Sun Jingao,Huang Dao.A new clustering method based on ant colony algorithm.Proc.4thWCICA 2002,IEEE press:2223-2226
289 Walter J,Gutjahr.A converging ACO algorithm for stochastic combinatorial optimization,Proc.SAGA 2003.Eds.:A.Albrecht,K.Steinhoefl,Springer LNCS 2827,2003,9:10-25.
290 段海滨.蚁群算法原理及其应用.科学出版社,2005
291 高尚.蚁群算法理论、应用及其与其它算法的混合.南京理工大学博士学位论文.2005
292 武交峰.应用遗传算法提高蚁群算法性能的研究.太原理工大学硕士学位论文.2007
293 姜欢容.遗传蚁群混合算法及其在车间调度问题中的应用.武汉理工大学硕士学位论文.2007
294 吕红霞,何大可,陈韬.基于蚁群算法的客运站到发线运用计划编制方法.西南交通大学学报.2008,29(2):153-158
295 XUE Feng,LUO Jian,WANG Ciguang,et al.Ant Colony Optimization Algorithm for Solving Dynamic Wagon-Flows Allocating Problem in Marshalling Yard.International Conference of Chinese Logistics and Transportation Professionals 2008,Chengdu,China,October,2008.ASCE,United States:3900-3907
296 Abbattista F,Abbattista N,Caponetti L.Anevolutionary and cooperative agents model for optimization.Proceedings of the IEEE International Conference on Evolutionary Computation,1995,(2):668-671
297 White T,Pagurek B,Oppacher F.ASGA:improving the ant system by integration with genetic algorithms.Proceedings of the 3~(rd) Annual Genetic Programming Conference,1998,610-617
298 Li M,Wang H,Li P.Tasks mapping in multi-core based system:hybrid ACO&GA approach.Proceedings of the 5~(th) International Conference on ASIC, 2003,(1):335-340
299 Pilat M L,White T.Using genetic algorithms to optimize ACS-TSP.Proceedings of the 3~(rd) International Workshop on Ant Algotithms/ANTS2002,Lecture Notes in Computer Science,2002,2463:282-287
300 Acan A.GAACO:A GA+ACO hybrid for faster and better search capability.Proceedings of the 3~(rd) International Workshop on Ant Algotithms/ANTS2002,Lecture Notes in Computer Science,2002,2463:300-301
301 Gong D X,Ruan XG.A hybrid approach of GA and ACO for TSP.Proceedings of the 5~(th) World Congress on Intelligent Control and Automation,2004,(3):2068-2072
302 陈云飞,刘玉树,范洁.火力优化分配问题的小生境遗传蚂蚁算法.计算机应用.2005,25(1):206-209
303 Xiong Z H,Li S K,Chen J H.Hardware/Software partitioning based on dynamic combination of genetic algorithm and ant algorithm.Journal of Software,2005,16(4):503-512
304 赵扬帆.基于遗传算法和蚁群算法的网格任务调度策略.中国海洋大学硕士学位论文.2006
305 许国志,顾基发,车宏安.系统科学.上海教育出版社,2000
306 E N.洛伦兹著,刘式适,严中伟译.混沌的本质.气象出版社,1997
307 吴祥兴,陈忠.混沌学导论.上海科学技术文献出版社,1996
308 黄润生,黄浩.混沌及其应用(第二版).武汉大学出版社,2005
309 郝柏林.从抛物线谈起-混沌动力学引论.上海科技教育出版社,1993
310 袁晓辉,袁艳斌,王乘等.一种新型的自适应混沌遗传算法.电子学报.2006,(4):708-712
311 Blum C,Roli A.Metaheuristics in combinatorial optimization:Overview and conceptual comparison.Technical Report TR/IRIDIA/2001-13,October 2001
312 Srinivas M,Patnaik L M.Adaptive probabilities of crossover and mutation in genetic algorithms.IEEE Transactions on Systems,man and cybernetics.1994,26(4):656-667
313 杨波.基于混沌理论的遗传算法改进及应用研究.南京理工大学硕士学位论文.2003
314 徐精明,曹先彬,王煦法.多态蚁群算法.中国科学技术大学学报.2005,35(1):59-65
2 吴家豪.铁路编组站系统设计优化.中国铁道出版社,1994
3 关振东.信息化与铁路运输.中国铁道出版社,2003
4 杜旭升.编组站综合自动化系统探讨.中国铁道学会.2004年自动化驼峰研讨会论文集.北京,2004:118-121
5 张全寿.编组站货车实时信息系统.中国铁道出版社,1997
6 丁昆.成都北编组站综合集成自动化系统.中国铁路.2006,(8):46-48
7 王耀杰.新丰镇编组站综合自动化系统.西铁科技.2008,(1):3-9
8 吴长厚,陶德高.铁路编组站自动化概述.铁道运输与经济.2006,28(2):6-8
9 马小宁,钟雁,麻克君.基于信息共享的编组站综合自动化系统.北京交通大学学报.2004,28(6):99-103
10 郝建青,张仲义,陈滨.基于车辆实时跟踪的编组站综合自动化系统集成方案的研究.铁道学报.2000,22(2):1-6
11 詹志文.编组站综合自动化系统运用分析和改进.铁道运输与经济.2003,25(8):27-29
12 陈洪.编组站综合自动化的发展方向探讨与研究.中国水运(理论版).2006,4(8):155-156
13 崔炳谋.编组站阶段计划编制系统几个问题的研究.兰州铁道学院学报.1996,15(2):64-68
14 崔叙,熊天文.编组站阶段计划IDSS的研究.铁路计算机应用.2001,(3):16-18
15 常军乾,倪少权,安冬.编组站阶段计划编制系统的智能控制方法.铁路计算机应用.2001,(5):8-10
16 杜艳平,陈光伟,孙键.车站班计划和阶段计划计算机编制方法的研究.铁路计算机应用.2004,13(7):1-3
17 何世伟,宋瑞,朱松年.编组站阶段计划解编作业优化模型及算法.铁道学报.1997,19(3):1-8
18 袁庆达,杜文,黎青松.区段站阶段计划的优化模型和算法.西南交通大学学报.2000,35(3):250-254
19 王明慧,赵强.编组站智能调度系统阶段计划优化模型及算法研究.铁道学报.2005,27(6):1-9
20 Measarovic M D,et al.Theory of hierarchical multilevel systems.New York:Academic Press,1970
21 Hasson M F.A development of a decomposed estimation algorithm for large scale system.International Journal of Systems Science.1983,14(3):269-279
22 叶秉如,方道南.大型多目标线性规划解法研究.水科学进展.1995,6(4):270-277
23 张启人,熊桂林.公共交通大系统建模与优化.系统工程.1986,4(6):25-39
24 罗晴,金福才,胡思继.列车运行调整问题的分解协调计算模型.北京交通大学学报.2004,28(6):87-89
25 娄山佐,史忠科.基于分解协调原理的大规模动态车辆调度.系统仿真学报.2006,18(4):998-1001
26 高文豪.大系统最优化.水利水电出版社,1991
27 戴明龙.大系统分解协调法与GM(1,1)模型在流域防洪联合调度中的耦合应用.四川大学硕士学位论文.2004
28 方道南,叶秉如.大系统多目标规划和风险决策的理论与方法.水利水电科技进展.1999,19(4):17-20
29 陈禹六.大系统理论及其应用.清华大学出版社,1988
30 H.哈肯著.协同学.徐锡申等译.原子能出版社,1984
31 郭治安,沈小峰.协同论.山西经济出版社,1991
32 H.Haken.Cooperative effects:Progress in Synergetics.North Helland,Amsterdam,1974
33 H.Haken.Cooperative effects in systems far from thermal equilibrium and in nonphysical system.Rev.Mod.Phys,1975
34 Kroo I,Altus S,Braun R,et al.Multidisciplinary optimization methods for aircraft preliminary design.AIAA-94-4325,FL:AIAA,1994
35 Braun R D,Kroo I.Development and application of the collaborative optimization architecture in a multidisciplinary design environment.NASA Iciam_rdb,International Congress on Industrial and Applied Mathematics,Hamburg,Germany,1995
36 Braun R D.Collaborative Optimization:An architecture for large-scale distributed design.Stanford:Stanford University,1996
37 Tappeta R V,Renaud J E.Multiobjective collaborative optimization.ASME Journal of Mechanical Design,1997,11(3):403-411
38 Kroo I,Manning V.Collaborative optimization:status and directions.AIAA-2000-4721,2000
39 王亦首,史彦军,滕弘飞.多学科设计优化研究进展.计算机集成制造系统.2005,11(6):751-756
40 白小涛,李为吉.基于近似技术的协同优化方法在机翼设计优化中的应用.航空学报.2006,27(5):847-850
41 于雄庆,薛飞,穆雪峰等.用遗传算法提高协同优化方法的可靠性.中国机械工程.2003,14(21):1808-1811
42 周盛强,向锦武.基于BP网络和Pareto遗传算法的多目标协同优化.机械设计与研究.2006,22(5):10-13
43 陈亚洲,高亮,周驰.基于粒子群优化和协同优化的多学科设计优化研究.机械科学与技术.2007,26(4):424-427
44 王焱,胡长斌.面向复杂系统的智能协同建模方法研究.济南大学学报(自然科学版).2006,20(3):280
45 Merriam-Webster Collegiate Dictionary.11th ed.Merriam-Webster,2003
46 X.Huang.Cooperative optimization for solving large scale combinatorial problems.Theory and Algorithms for Cooperative Systems,Series on Computers and Operations Research,World Scientific,2004:117-156
47 林柏梁,胡安洲.重空车流运行组织的协同优化理论及模型.铁道学报.1998,20(5):9-14
48 杨文胜.基于响应时间的供应链协同决策与优化模型研究.华中科技大学博士学位论文.2004
49 王俊刚,褚世新,余泉等.干线协调控制系统的绿信比协同优化模型研究.交通运输工程与信息学报.2005,3(2):13-18
50 保丽霞,杨兆升,胡键萌等.交通流诱导与控制协同的双目标优化模型及准最优求解算法.吉林大学学报(工学版).2007,37(2):319-324
51 杨维维,陈小前,姚雯等.基于多方法协作优化算法的飞机总体优化设计.航空计算技术.2006,36(6):1-4
52 唐茂,罗阳,刘胜青.作业车间调度问题中的协同优化算法.中国测试技术.2003,(1):43-45
53 胡仕成,徐晓飞,李向阳.项目优化调度的病毒协同进化遗传算法.软件学报.2004,15(1):49-57
54 李爱国.多粒子群协同优化算法.复旦学报(自然科学版).2004,43(5):923-925
55 杨瑞臣,周永付,云庆夏.寻找车辆最优路径的混合算法.交通运输工程学报.2005,5(1):102-105
56 张维存,郑丕谔,吴晓丹.蚁群遗传算法求解能力约束的柔性作业车间调度问题.计算机集成制造系统.2007,13(2):333-337
57 张全寿.编组站站调决策支持系统的研究.北方交通大学学报.1989,13(4):64-72
58 刘军.基于知识的编组站作业整体仿真策略的研究.北方交通大学学报.1992,16(3):40-45
59 段继达.车站班计划的自动编制.铁道运营技术.2000,6(3):99-101
60 邓小瑜,宋建业.铁路编组站日班计划计算机编制的研究.兰州铁道学院学报.2000,19(4):105-109
61 蒋熙,苗建瑞,于勇,杨肇夏.基于高层体系结构的铁路编组站综合仿真系统研究.系统仿真学报.2002,14(4):481-484
62 乐逸祥,周磊山.通用铁路大站技术作业仿真模型和方法的研究.系统仿真学报.2003,15(12):1787-1790
63 王莹,刘军.车站调度作业计划仿真建模的研究.铁路计算机应用.2005,14(9):1-4
64 刘强华.编组站作业大表自动生成系统的设计与实现.铁路计算机应用.2003,12(9):12-14
65 尉成荣,袁在兵.编组站技术作业大表自动生成系统的设计与实现.铁路技术创新.2004,(2):7-9
66 赵海宁,韩锋,周航.利用微机铺画编组站技术作业大表的实践.铁道运输与经济.2004,26(6):55-57
67 O.Gulboden.Optimal planning of marshalling yard by operation research.PROC,1963:226-233
68 O.Hein.A two-stage queuing model for a marshalling yard.Rail Int.,1972,(3):249-259
69 F.Clover,D.Karney and D.Klingman.Solving singly constrained transshipment problems.Trans.Scil,1978,24(12):1209-1220
70 Gupta U I,Lee D T and Leung J Y T.An optimal solution for the channel-assignment problem.IEEE Transactions on Computers.,1979,28(11):807-810
71 M.A.Turnquist,M.S.Dadkin.Queuing models of classification and connection delay in rail yard.Trans.Sci1,1982,(16):207-230
72 R.E.Hughes and W.B.Powell.Mitigating end effects in the dynamic vehicle allocation problem.Report EES-85-11,Department of Civil Engineering,Princeton University,Princeton,N.J.,1985
73 P.J.Detax and T.G.Crainic.Survey paper:a review of empty flows and fleet management models in freight transportation.Trans.Sci1,1987:227-247
74 K.C.Chih.A real time dynamic optimal freight car management simulation model of the multiple railroad multicommodity,temporal spatial network flow problem.Ph.D.Dissertation,Princeton University,1990
75 J.B.George and M.A.Turnquist.A model for fleet sizing and vehicle allocation.Trans.Sci1,1991,25(1)
76 B.D.Robert.Minimizing trailer-on-flat-car costs:a network optimization model.Trans.Sci1,1994,28(1)
77 Carey M.Extending a train patching algorithm from one-way to two-way track.Trans.Res.-B.,1994,(28):395-400
78 Higgins A,Kozan E,Ferreira L.Optimal scheduling of trains on a single track.Trans.Res.-B.,1996,(29):147-161
79 Michiel A Odijk.A constraint generation algorithm for the Construction of periodic railway timetables.Transportation Research Part B,1996,30(6):455-464
80 L G Kroon,H E Romerijn,P J Zwaneveld.Routing trains through railway stations:complexity issues.European Journal of Operational Reaseach,1997,(98):458-498
81 Elias Dahlhaus.The train marshalling problem.Discrete Applied Mathematics,2000,(103):41-54
82 Malachy Craey,Sinead Craville.Scheduling and plat forming trains at busy complex stations.Transportation Research Part A,2003,37(3):195-224
83 Ф.П.柯契涅夫.铁路行车组织.高家驹,杨明伦等译.中国铁道出版社,1985
84 E.A.索尼科夫.编组站工作强化.王鹤鸣译.中国铁道出版社,1987
85 #12
86 刘重庆.俄罗斯铁路信息化建设.中国铁路.2002,(3):34-36
87 Arjang A.Assad.Modeling of rail networks:Toward a routing/makeup model.Trans.Res.-B.,1980,14(1):101-114
88 M.A.Turnquist and M.S.Daskin.Queuing models of classification and connection delay in rail yards.Transp.Sci.,1982,(16):207-230
89 S.Yagar,F.F.Saccomanno and Q.Shi.An efficient sequencing model for humping in a rail yard.Trans.Res.-A.,1983,17(4):251-262
90 T.Gainic,J.Ferland,J.Rousseav.A tactical planning model for rail freight transportation.Trans.Sci.,1984,(18):165-183
91 M.H.Keaton.Designing optimal railroad operating plans:Lagrangian relaxation and heurist ice approaches.Trans.Res.-B.,1989,(23):415-431
92 M.H.Keaton.Designing railroad operating plans:A dual adjustment method for implementing lagrangian relaxation.Trans.Sci.,1992,(26):263-279
93 David R,Martinelli and Huanliang Teng.Optimization of railway operations using neural networks.Trans.Res.-C.,1995,4(1):33-49
94 Z.Z.Avramovic.Method for evaluating the strength of retarding steps on a marshaling yard hump.Eur.J.Operational Res.,1995,(85):504-514
95 中国铁道管理学院,日本国际协力事业团.铁路编组站自动化.中国铁道出版社,1991
96 魏华征.铁路运营管理现代化的发展水平和我国铁路的差距--21世纪铁路技术.中国铁道出版社,1995
97 周克勤.铁路分局列车日班计划数据自动化处理研究.铁道部科学研究院研究报告,1983
98 魏建华.摘挂调车钩计划专家系统的研究.北方交通大学硕士学位论文.1984
99 胡东彦.编组站班计划专家系统的研究.北方交通大学硕士学位论文.1989
100 王家俊.铁路编组站改编系统协调.铁道科学研究院硕士学位论文.1984
101 刘风先.编组站调车场股道数及改编能力合理负荷.北方交通大学硕士学位论文.1987
102 毛保华.编组站系统分析与优化.北方交通大学硕士学位论文.1987
103 张卫红.编组站的合理分工与点线能力协调.北方交通大学硕士学位论文.1989
104 李林山.利用微机辅助编制铁路分局日班计划的研究.北方交通大学硕士学位论文.1991
105 崔炳谋.铁路枢纽编组站分工优化数学模型及其应用的研究.兰州铁道学院硕士学位论文.1991
106 易文平.编组站系统优化.北方交通大学博士学位论文.1992
107 范征.丰台西编组站调度决策支持系统的研究--阶段计划解体照顾编组、出发.西南交通大学硕士学位论文.1993
108 吕红霞.技术站调度决策支持系统的研究--到发线的合理使用.西南交通大学硕士学位论文.1994
109 方洪武.计算机编制区段站日计划的研究.西南交通大学硕士学位论文.1994
110 李昕红.济南枢纽运输组织及优化.西南交通大学硕士学位论文.1994
111 钟雁,张全寿.铁路编组站调车作业计划决策支持系统的研究.铁道学报.1994,16(4):76-81
112 钟雁.一个基于动态模型的计划决策支持系统.北方交通大学学报.1994,18(4):477-483
113 王慈光.车站技术作业整体统筹模型.铁道运输与经济.1996,(4):71-74
114 郑时德,杨肇夏.编组站作业仿真及系统优化.中国铁道出版社,1996
115 惠莉.西安东编组站调度决策支持系统的研究--计算机辅助编制阶段计划.西南交通大学硕士学位论文.1997
116 彭越.用计算机编制车站阶段计划.西南交通大学硕士学位论文.1997
117 段继达.计算机实现铁路车站班计划自动编制的研究.西南交通大学硕士学位论文.1997
118 梁建.编组站调度指挥仿真系统.西南交通大学硕士学位论文.1997
119 张春迎.编组站调车作业系统仿真.西南交通大学硕士学位论文.1997
120 汪文锋.成都东站阶段计划编制的计算机辅助决策系统的研究.西南交通大学硕士学位论文.1997
121 王守慧.铁路分局日班计划智能编制理论和方法的研究.北方交通大学博士学位论文.1998
122 邓小瑜.编组站日班计划智能编制理论和方法的研究.兰州铁道学院硕士学位论文.1999
123 程英俊.计算机编制编组站阶段计划的研究.兰州铁道学院硕士学位论文.1999
124 龚文平.编组站阶段计划自动化编制若干问题的研究.西南交通大学硕士学位论文.1999
125 牛惠民.铁路枢纽编组站作业分工整体优化的研究.北方交通大学博士学位论文.1999
126 胡刚.编组站阶段计划自动编制与调整的研究.西南交通大学硕士学位论文.2000
127 常均乾.编组站阶段计划编制系统设计与若干技术的研究.西南交通大学硕士学位论文.2002
128 麻克君.基于信息共享的编组站运输组织模式的研究.北方交通大学硕士学位论文.2003
129 吴翠珑.试论编组站综合自动化系统的现状与发展趋势.北京交通大学硕士学位论文.2003
130 薛艳冰.铁路分局调度计算机辅助决策系统--技术站及区段管内日(班)列车工作计划研究.兰州铁道学院硕士学位论文.2003
131 李坚.编组站解体计划自动化系统的设计和实现.北京交通大学硕士学位论文.2004
132 杨涛.基于多Agent的编组站作业计划计算机编制方法和作业管理系统研究.北京交通大学硕士学位论文.2004
133 胡猛.计算机编制编组站阶段计划的模型和算法的研究.北京交通大学硕士学位论文.2006
134 李磊.计算机辅助编制阶段计划的研究.兰州交通大学硕士学位论文.2006
135 何自冬,郑力,张智海等.基于Agent的技术站站调决策支持系统.铁道运输与经济.2006,28(3):72-74
136 黎浩东.铁路编组站鲁棒性阶段计划编制研究.北京交通大学硕士学位论文.2008
137 胡兴宇.编组站作业计划优化编制若干问题研究.北京交通大学硕士学位论文.2008
138 刘军.铁路编组站作业计划滚动式智能化编制方法研究.北方交通大学博士学位论文.1993
139 何世伟.铁路枢纽作业计划的优化编制-编组站作业计划与枢纽日班计 划的模型及算法研究.西南交通大学博士学位论文.1996
140 李文权.铁路区段站日工作计划优化模型及其算法的研究.西南交通大学博士学位论文.1997
141 徐杰.区段站阶段计划自动编制模型和算法研究.西南交通大学博士学位论文.2003
142 乐逸祥.基于网络协作模式的编组站车站调度方法的研究.北京交通大学博士学位论文.2006
143 王正彬.区段站阶段计划调整模型与算法研究.西南交通大学博士学位论文.2007
144 张振儒.TMIS中车流推算方法的研究.铁路计算机应用.1998,7(2):29-31
145 范英书.利用TMIS系统实现计算机推算车流.铁道运输与经济.1999,(10):32-34
146 崔叙,熊天文.编组站阶段计划IDSS的车流推算方法研究.铁路计算机应用.2002,(11):24-26
147 熊巧.编组站站调IDSSG.铁道运输与经济.2004,26(10):55-57
148 陈刚.铁路编组站运营系统动态仿真.西南交通大学博士学位论文.2006
149 曹家明,范征,毛节铭.编组站作业优化决策支持系统--解体子系统.铁道学报.1993,15(4):66-72
150 王慈光.编组站列车解体方案的计数方法.铁道学报.2000,22(6):1-7
151 王慈光.用表上作业法求解编组站配流问题的研究.铁道学报.2002,24(4):1-5
152 王慈光.编组站静态配流网络模型.交通运输工程与信息学报.2003,1(2):67-71
153 王慈光.编组站动态配流模型与算法研究.铁道学报.2002,26(1):1-6
154 王明慧.编组站智能调度系统YIDS体系框架与关键技术优化理论研究.西南交通大学博士学位论文.2007
155 王世东,郑力,张智海等.编组站阶段计划自动编制的数学模型及算法.中国铁道科学.2008,29(2):120-124
156 牛惠民.双向编组站列车调度调整的优化模型及算法.中国铁道科学.2007,28(6):102-108
157 李文权,王炜,杜文等.铁路技术站调机运用模型及算法.系统工程学报.2000,15(1):38-43
158 徐杰,杜文,李宗平等.基于模拟退火算法和图着色的调车机车安排研究.铁道学报.2003,25(3):24-30
159 王振宏,崔炳谋,许广辉.基于不确定理论和混合智能算法的调车机车运用研究.铁道运输与经济.2006,28(12):87-89
160 王世东,郑力,张智海等.蚁群算法在调机运用计划中的应用.中国铁道科学.2007,28(3):104-108
161 青学江,马国忠.遗传算法在区段站到发线的应用研究.西南交通大学学报.1998,33(4):387-393
162 吕红霞,倪少权,纪红叶.技术站调度决策支持系统的研究--到发线的合理使用.西南交通大学学报.2000,35(3):255-258
163 李文权,王炜,程世辉.铁路编组站到发线运用的排序模型和算法.系统工程理论与实践.2000,20(6):75-78
164 徐杰,杜文,常均乾等.基于遗传算法的区段站到发线运用优化安排.中国铁道科学.2003,24(2):109-114
165 王正彬,杜文.铁路技术站到发线运用调整模型及算法.西南交通大学学报.2006,41(2):202-205
166 李磊,崔炳谋.基于混合算法的编组站到发线模型算法研究.交通运输工程与信息学报.2008,6(1):86-90
167 高资,杨明伦.确定树枝型专用线最优取送方案的探讨.西南交通大学学报.1981,(3):64-69
168 徐忠民,孔庆钤.直达列车取送车顺序的优化.北方交通大学学报.1988,(2):70-73
169 杜文,李文权.放射状专用线直达列车取送车问题的算法.西南交通大学学报.1995,30(5):503-508
170 王慈光.树枝形专用线取送车问题的研究.西南交通大学学报.1996,31(6):675-680
171 李文权,杜文.树枝状铁路专用线取送车问题的数学模型及算法.河南大学学报(自然科学版).1997,27(2):1-8
172 敬媛媛.树枝型专用线取送车算法的研究.成都大学学报(自然科学版).1998,17(4):36-42
173 宋建业.直达列车多点装卸取送顺序优化的表上移动法.兰州交通大学 学报.2002,21(1):76-79
174 余少鹤,李夏苗.货物作业车取送模型及算法研究.铁道运输与经济.2002,24(12):46-48
175 李智.基于改进型蚁群算法的货物作业车取送模型优化.铁道运输与经济.2004,26(4):73-76
176 石红国,彭其渊,郭寒英.树枝型专用线取送车问题的哈密尔顿图解法.中国铁道科学.2005,26(2):132-135
177 王慈光.放射形专用线非直达车流取送车问题研究.交通运输工程与信息学报.2006,4(3):16-23
178 王雅琳,李开峰,马杰等.遗传算法在企业铁路取送调车作业优化中的应用.系统工程.2007,25(3):94-99
179 黄向荣.树枝型专用线取送车的模型及算法研究.兰州交通大学学报.2007,26(3):51-54
180 杨信丰,李引珍.直达车流取送问题的模型及其算法.交通运输系统工程与信息.2008,8(2):103-107
181 靳磊.铁路树枝形专用线取送车作业优化.北京交通大学硕士学位论文.2008
182 王慈光.运输模型及优化.中国铁道出版社,2004
183 刘其斌,马桂贞.铁路车站及枢纽.中国铁道出版社,1999
184 杨介平.铁路运输能力的计算与利用.中国铁道出版社,2001
185 薛锋,王慈光.编组站配流相关问题分析.交通运输工程与信息学报.2008,6(4):29-33
186 郝建青.集成环境中编组站信息系统开发理论与优化方法研究.北方交通大学博士学位论文.2000
187 张宇.基于CIM思想的编组站综合自动化系统--编组站作业自动化CIMS的研究.北方交通大学博士学位论文.2000
188 沈志云.交通运输工程学(第一版).人民交通出版社,1999
189 任炳南.中国铁路车站工作实务全书.中国对外经济贸易出版社,1997
190 牛惠民,胡安洲.双向编组站系统作业分工的优化模型及算法.中国科学(E辑).1998,28(4):378-384
191 郭寒英.编组站工作可靠性研究.西南交通大学硕士学位论文.2003
192 刘仍奎.评价车站系统能力协调的新方法.北方交通大学学报.1994,18(4):459-463
193 毛保华,秦作睿.运输系统点线能力协调模型的研究.铁道学报.1996,18:97-101
194 何世伟,宋瑞,杨浩.列车提速对编组站运营工作的影响研究.铁道学报.2000,22(5):6-12
195 朱晓立,李夏苗.提速干线上编组站到解系统匹配与协调关系的研究.中国铁道科学.2004,25(4):112-115
196 朱晓立,李夏苗.提速干线上编组站出发子系统内部匹配与协调关系.中国铁道科学.2006,27(5):118-121
197 凌熙.多方向铁路编组站货车到达与集结规律研究.北京交通大学硕士学位论文.2006
198 薛锋,罗建.编组站能力与运行图能力的动态协调关系.铁道运输与经济.2008,30(7):76-79
199 彭其渊,王慈光.铁路行车组织.中国铁道出版社,2007
200 王栋.铁路客运站到发线运用自动编排设计.中南大学硕士学位论文.2007
201 郑州铁路局郑州北站等.编组站智能调度系统的研究与开发研制报告.郑州铁路局,2006
202 闫海峰,彭其渊.铁路客货运输组织系统特性的比较分析.交通运输工程与信息学报.2006,4(3):46-52
203 刘敏.确定工业编组站车列推峰最优顺序的两种方法.中国铁道科学.2001,22(6):50-52
204 刘敏.工业编组站解体车列选定的模糊综合评判.铁道学报.2002,24(2):12-16
205 薛锋,王慈光.编组站列车编组顺序的调整方法.铁道学报.2007,29(4):1-5
206 《运筹学》教材编写组.运筹学.清华大学出版社,2001
207 薛锋,王慈光,罗建等.编组站列车解体方案与编组方案的协调优化研究.铁道学报.2008,30(2):1-6
208 李士勇,陈永强,李研.蚁群算法及其应用.哈尔滨工业大学出版社,2004
209 丁建立,陈增强,袁著祉.遗传算法与蚂蚁算法的融合.计算机研究与发展.2003,40(9):1531-1536
210 孙玉明,李红璇.编制编组站调车场线路固定使用方案的探讨[J].铁道 运输与经济,2003,25(12):20-21
211 任勇.驼峰调车场线路固定使用方案的研究.太原科技,2003,(5):24-26
212 陈伯羽.铁路编组场线路固定使用方案优选方法研究.铁道科学与工程学报,2006,3(6):80-82
213 孙晚华.确定编组站调车场线路数的模拟方法.铁道学报,1996,18(增刊):105-108
214 牛惠民,胡安洲.双向编组站折角车流优化的模型和算法.北方交通大学学报.1998,22(6):38-42
215 Feng Xue,Ciguang Wang.A Method of Exchange Wagon-Flow Allocating in Bidirectional Marshalling Yards.The First International Conference on Transportation Engineering,Chengdu,China,July,2007.ASCE,United States:2241-2246
216 薛锋,王慈光,罗建.双向编组站静态配流的优化.西南交通大学学报.2008,43(2):159-164
217 刘宝碇,赵瑞清,王纲.不确定规划及应用.清华大学出版社,2003
218 章敬东.复杂优化问题中智能算法的分析与集成.华南理工大学博士学位论文.2003
219 高尚,杨静宇.群智能算法及其应用.中国水利水电出版社,2006
220 黄习樾,张著洪,何传江等.现代智能算法理论及应用.科学出版社,2005
221 丁建立,陈增强,袁著祉.遗传算法与蚂蚁算法融合的马尔可夫收敛性分析.自动化学报.2004,30(4):629-634
222 邵晓巍,邵长胜,赵长安.利用信息量留存的蚁群遗传算法.控制与决策.2004,19(10):1187-1193
223 龚道雄,阮晓钢.基于蚁群算法的基因联接学习遗传算法.计算机工程与应用.2004,(26):10-15
224 毛宁,顾军华,谭庆.蚁群遗传混合算法.计算机应用.2006,26(7):1692-1693
225 周鹏.带有单亲遗传特征的蚁群算法.计算机工程与设计.2007,28(9):2001-2002
226 刘立东,蔡淮.融入遗传算法的混合蚁群算法.计算机工程与设计.2008,29(5):1248-1252
227 Holland J H.Outline for a logical theory of adaptive systems.Journal of the Association for Computing Machinery, 1962,(3): 297-314
228 Bagley J D. The Behavior of Adaptive Systems Which Employ Genetic and Correlation Algorithms. Dissertation Abstracts International, 1967, 28(12),5106B
229 Holland J H. A new kind of turnpike theorem, Bulletin of the American Mathematical Society, 1969,(75): 1311-1317
230 Holland J H. Genetic algorithms and the optimal allocation of trials, SIAM Journal of Computing, 1973,(2):88-105
231 Holland J H. Adaptation in natural and artificial systems. MI: University of Michigan Press. 1975
232 De Jong K A. An Analysis of the Behavior of a Class of Genetic Adaptive Systems. Ph.D. Dissertation, University Microfilms,No.76-9381,University of Michigan, Ann Arber, 1975
233 Ackley D H, Hinton G E, Sejnowski T J. A learning algorithms for Boltzmann machines, Cognitive Sci., 1985(9):147-169
234 Fogarty J C. Varying the Probability of Mutation in Genetic Algorithms. In Proc 3rd Int Conf Genetic Algorithms, 1989:42-50
235 Davis L. Adaptive Operator Probabilities in Genetic Algorithms. In Proc 3rd Int Conf Genetic Algorithms, 1989:61-69
236 Sywerds G, Uniform in genetic algorithms, ICGA'89, Morgan Kaufmann,1989:2-9
237 Eiben A E, Aarts E H L, Hee K M V. Global Convergence of Genetic Algorithms: A Markov Chain Analysis. Schwefel H P, Manner R, Eds,Springer-Verlag, 1990:4-12
238 Whitley D, Stark weather D. Genetic II: A Distributed Genetic Algorithm.Expt J Theory, Art Intell. 1990, (2): 189-214
239 Fogel D B, Fogel I J, Porto V W. Evolving neural networks, Biol, Cybern,1990,(63):487-493
240 Belew R K, Booker L B. Proceeding of the Fourth international Conference on Genetic Algorithms and the Their Applications, Morgan Kaufmann, 1991
241 Hart W E, Belew R K. Optimizing an arbitrary function is hard for the genetic algorithm, ICGA'91, Morgan Kaufmann, 1991
242 Wilson S W, GA-easy does not imply steepest-ascent optimizable, ICGA'91, Morgan Kaufmann,1991
243 Vose M D,Liepins G E,Generalizing the notion of schemes in genetic algorithms,Artificial Intelligence,1991(50):385-396
244 Eshelmen L,Schaffer D.Preventing premature convergence in genetic algorithms by preventing incest algorithms,ICGA'91,Morgan Kaufmann,1991:115-122
245 Abdullah A R.A robust method for liner and nonlinear optimization based on genetic algorithm,Cybernetica,1991,(34):279-287
246 Holland J H.Genetic algorithms,Scientific American,1992,(4):44-50
247 Forrest S.Ed.Proc.Of the Fifth Intern.Conf.on Genetic Algorithms,San Mateo,CA:MorganKaufmann,1993
248 Fam Q B,Perov V L.New evolutionary genetic algorithms for NP-complete combinatorial optimization problems.Biol,Cybern,1993,(69):229-234
249 Srinival M,Patnaik L M.Genetic Algorithms:A Survey.Computer,1994,23:17-26
250 Srinival M,Patnaik L M.Adaptive Probabilities of Crossover and Mutation in Genetic Algorithm.IEEE Trans Syst Man,Cybern,1994,24(4):656-667
251 Smith,Derek,Stephanie Forrest,Alan Perelson.Immunological memory is associative.D.Dasgupta,Artificial Immune Systems and their Applications,Sprinaer-Verlaa,1998:10-115
252 Soojung Jung,A Genetic Algorithm for the vehicle routing problem with time-dependent travel times.Dissertation for the Faculty of Graduate School of the University of Maryland,College Park.2000
253 Castro L N,Von Zuben F J.Data mining:a heuristic approach,USA,dea group,2001
254 刘勇,康立山,陈毓屏.非数值并行算法(第二册)-遗传算法.科学出版社,1995
255 牛惠民,胡安洲.双向编组站车流接续的综合优化.铁道学报.1998,20(6):16-21
256 何世伟,宋瑞,胡安洲.编组站阶段计划刚性与柔性优化的协调研究.铁道学报.1999,21(4):1-8
257 崔炳谋,马钧培,张朴.编组站进路调度优化算法.中国铁道科学.2007,28(2):100-104
258 刘霆,何世伟,王保华等.编组站调度计划随机机会约束规划模型及算法研究.铁道学报.2007,29(4):12-17
259 王正彬,杜文,吴柏青等.基于解编顺序的阶段计划车流推算模型及算法.西南交通大学学报.2008,43(1):91-95
260 杨运贵,王慈光,薛锋.树枝形铁路专用线取送车问题的遗传算法研究.计算机工程与应用.2008,44(12):210-211
261 Dorigo M.Optimization,learning and natural algorithms.PhD Thesis,Department of Electronics,Politecnico di Milano,Italy,1992
262 Colorni A,Dorigo M,Maniezzo V.An Investigation of some properties of an "Ant algorithm".Proceedings of the Parallel Problem Solving From Nature Conference(PPSN92).Brussels,Belgium:Elsevier Publishing,1992:509-520
263 吴启迪,汪镭.智能蚁群算法及应用.上海科技教育出版社,2004
264 Dorigo M,Maniezzo V,Colorni A.The ant system:Optimization by a colony of cooperating agents.IEEE Transactions on Systems,Man,and Cybernetics-Part B,1996,26(1):29-41
265 Dorigo M,Gambardella L M.Ant colony system:A cooperative learning approach to the traveling salesman problem.IEEE Transactions on Evolutionary Computation,1997,1(1):53-66
266 Dorigo M,Gambardella L M.Ant colonies for the traveling salesman problem.Bio Systems,1997,43:73-81
267 Costa D,Hertz A.Ants can color graphs.Journal of the Operational Research Society,1997,48:295-305
268 Dorigo M.Heuristic from nature for hard combination optimization problems.International Transaction operational research,1998,3(1):1-21
269 Gambardella L M,Taillard E D,Dorigo M.Ant colonies for the quadratic assignment problem.Journal of The Operational Research Society,1999,50(2):167-176
270 Dorigo M,Caro G D,Gambardella LM.Ant Algorithms for Discrete Optimization.Artificial Life,1999,5(3):137-172
271 Maniezzo V,Carbonard A.Ant colony optimization:An overview.Informazione,University of Bologna,Italy,1999
272 Bullnheimer B,Hartl R F,Strauss C.An improved ant system algorithm for the vehicle routing problem. Annals of Operations Research, 1999, 89:319-328
273 Chang C S, TianL, Wen F S. A new approach to fault section estimation in power systems using ant system. Electric Power Systems Research, 1999,49(1):63-70
274 Merkle D, Middendorf M. An ant algorithm with a new pheromone evaluation rule for total tardiness problems, Real-World Applications of Evolutionary Computing, Proceeding 2000, 18(3): 287-296
275 Gutjahr W J. A graph-based ant system and its convergence. Future Gener.Comput. Syst., 2000,16(8):873-888
276 Stutzle T, Hoos HH. MAX-MIN ant system. Future Generation Computer Systems, 2000, 16(8):889-914
277 Dorigo M, Bonabeau E, Theraulaz G. Ant algorithms and stigmergy. Future Generation Computer Systems, 2000, 16: 851-871
278 Maniezzo V. An ants heuristic for the frequency assignment problem.Antonella Carbonaro Future Generation Computer Systems, 2000, (16):927-835
279 Cordone R, Maffioli F. Colored ant system and local search to design local telecommunication networks. Applications of Evolutionary Computing,Proceeding, 2001,2037:60-69
280 Talbi E G, Roux O, Fonlupt C, Robillard D. Parallel Ant Colonies for the quadratic assignment problem. Future Generation Computer Systems, 2001,17:441-449
281 Middendorf M, Reischle F, Schmeck H. Multi colony ant algorithms. Journal of Heuristics, 2002, 8(3):305-320
282 Thomas St(?)tzle, Marco Dorigo. A short convergence proof for a class of ACO algorithms. IEEE Transactions on Evolutionary Computation,2002,6(4):358-365
283 Walter J, Gutjahr. ACO algorithms with guaranteed convergence to the optimal solution, Information Processing Letters, 2002,82(2):145-153
284 Wang Lei, Wu Qidi. Performance evolution of ant system optimization process. Proc. 4thWCICA2002, IEEE press:2546-2550
285 Randall A. A parallel implementation of ant colony optimization. Journal of Parallel and Distributed Computing,2002,(62):1421-1432
286 Randall M,Montgomery J.Candidate set strategies for ant colony optimization.Technical Report,TR02-04,School of Information Technology,Bond Universtiy,2002
287 Meuleau N,Dorigo M.Ant colony optimization and stochastic gradient descent.Artif.Life,2002,8(2):103-121
288 Yang Xinbin,Sun Jingao,Huang Dao.A new clustering method based on ant colony algorithm.Proc.4thWCICA 2002,IEEE press:2223-2226
289 Walter J,Gutjahr.A converging ACO algorithm for stochastic combinatorial optimization,Proc.SAGA 2003.Eds.:A.Albrecht,K.Steinhoefl,Springer LNCS 2827,2003,9:10-25.
290 段海滨.蚁群算法原理及其应用.科学出版社,2005
291 高尚.蚁群算法理论、应用及其与其它算法的混合.南京理工大学博士学位论文.2005
292 武交峰.应用遗传算法提高蚁群算法性能的研究.太原理工大学硕士学位论文.2007
293 姜欢容.遗传蚁群混合算法及其在车间调度问题中的应用.武汉理工大学硕士学位论文.2007
294 吕红霞,何大可,陈韬.基于蚁群算法的客运站到发线运用计划编制方法.西南交通大学学报.2008,29(2):153-158
295 XUE Feng,LUO Jian,WANG Ciguang,et al.Ant Colony Optimization Algorithm for Solving Dynamic Wagon-Flows Allocating Problem in Marshalling Yard.International Conference of Chinese Logistics and Transportation Professionals 2008,Chengdu,China,October,2008.ASCE,United States:3900-3907
296 Abbattista F,Abbattista N,Caponetti L.Anevolutionary and cooperative agents model for optimization.Proceedings of the IEEE International Conference on Evolutionary Computation,1995,(2):668-671
297 White T,Pagurek B,Oppacher F.ASGA:improving the ant system by integration with genetic algorithms.Proceedings of the 3~(rd) Annual Genetic Programming Conference,1998,610-617
298 Li M,Wang H,Li P.Tasks mapping in multi-core based system:hybrid ACO&GA approach.Proceedings of the 5~(th) International Conference on ASIC, 2003,(1):335-340
299 Pilat M L,White T.Using genetic algorithms to optimize ACS-TSP.Proceedings of the 3~(rd) International Workshop on Ant Algotithms/ANTS2002,Lecture Notes in Computer Science,2002,2463:282-287
300 Acan A.GAACO:A GA+ACO hybrid for faster and better search capability.Proceedings of the 3~(rd) International Workshop on Ant Algotithms/ANTS2002,Lecture Notes in Computer Science,2002,2463:300-301
301 Gong D X,Ruan XG.A hybrid approach of GA and ACO for TSP.Proceedings of the 5~(th) World Congress on Intelligent Control and Automation,2004,(3):2068-2072
302 陈云飞,刘玉树,范洁.火力优化分配问题的小生境遗传蚂蚁算法.计算机应用.2005,25(1):206-209
303 Xiong Z H,Li S K,Chen J H.Hardware/Software partitioning based on dynamic combination of genetic algorithm and ant algorithm.Journal of Software,2005,16(4):503-512
304 赵扬帆.基于遗传算法和蚁群算法的网格任务调度策略.中国海洋大学硕士学位论文.2006
305 许国志,顾基发,车宏安.系统科学.上海教育出版社,2000
306 E N.洛伦兹著,刘式适,严中伟译.混沌的本质.气象出版社,1997
307 吴祥兴,陈忠.混沌学导论.上海科学技术文献出版社,1996
308 黄润生,黄浩.混沌及其应用(第二版).武汉大学出版社,2005
309 郝柏林.从抛物线谈起-混沌动力学引论.上海科技教育出版社,1993
310 袁晓辉,袁艳斌,王乘等.一种新型的自适应混沌遗传算法.电子学报.2006,(4):708-712
311 Blum C,Roli A.Metaheuristics in combinatorial optimization:Overview and conceptual comparison.Technical Report TR/IRIDIA/2001-13,October 2001
312 Srinivas M,Patnaik L M.Adaptive probabilities of crossover and mutation in genetic algorithms.IEEE Transactions on Systems,man and cybernetics.1994,26(4):656-667
313 杨波.基于混沌理论的遗传算法改进及应用研究.南京理工大学硕士学位论文.2003
314 徐精明,曹先彬,王煦法.多态蚁群算法.中国科学技术大学学报.2005,35(1):59-65