区段站阶段计划自动编制模型和算法研究
|
摘要
车站的调度指挥人员是通过车站作业计划来进行运输组织的，阶段计划是铁路车站作业计划之一。一个好的阶段计划应该反映出本阶段的工作重点，并按照列车编组计划的要求，把车流及时编成各种列车，保证本阶段的所有出发列车都能正点发车，并能合理地安排列车解编顺序以及利用到发线接发列车。目前我国区段站阶段计划的编制仍然停留在手工编制的层次上，编制速度慢，并且技术作业图表也主要是采用手工绘制，劳动量也高。阶段计划编制的自动化在现场中具有很大的实用价值，它将有效地提高阶段计划的编制速度及质量，进而提高路网的通过能力，并能很大程度上减轻车站调度员的工作负担。
要研究计算机自动编制阶段计划，必须分析铁路区段站的作业系统，通晓区段站作业系统的工作过程，找到区段站中作业组织之间的规律，才有可能编制出理想的作业计划。本文首先介绍了区段站必需的设备，及各种作业过程和全站的协调作业，为研究阶段计划的计算机自动编制打下基础。
应用计算机系统实现阶段计划的自动编制，在理论和实际应用上都很有意义。在实际应用中可以克服由于人的思维方式的不同以及专业素质的高低对计划编制质量的影响，提高车站的调度水平；在理论上可以进一步丰富和发展区段站作业计划编制的内容，推动数学理论向前发展。为了更好地说明下文所要解决的关键问题——建立合理的数学模型和寻找有效可行的算法，本文阐述了算法和启发式算法的理论基础，并扼要地介绍了遗传算法、模拟退火算法的主要思想和在解题过程中应用的重要参数，以及图的着色理论；及其在作业计划编制中应用的可能性。
对有关文献中建立的车流组织的网络模型进行分析，指出其不合理性。在现场调研的基础上对站调推算车流的思维活动进行全面的分析，找出其中可以借鉴的规律，得到对区段站应用计算机编制作业计划的必须的理论。依据上文提炼的理论，仿照现代经济社会中的交易活动，提出列车推算中的虚拟价格和收益函数，得到简单可行的车流推算模型。在车流推算的基础上，从应用计算机模拟区段站调度员思维的角度出发，通过分析车列占用调车机车时区集合的特点，使用划分时间片的方法建立合适的调车机车安排的图论模型，将调机运用问题转化为顶点具有加权的图的K-着色问题。将模拟退火算法和演化算法混合起来运用于该问题，设计有序的字符串编码方法，构造了基于罚函数的适应度函数，采用交叉和变异等技术，求解该模型。并提出了车列占用时区调整的相关算法。参照调车机车运用计划的求解，建立到发
西南交通大学博士研究主学位论文 第11 页
线占用安排的数学模型，并将贪婪着色算法和演化算法混合起来运用于该问
题，取得满意解。
在应用计算机实现算法中，提出了计算机编制阶段计划系统本质上是一
个决策支持系统（DSS）。按照计算机实现的一般步骤，首先对该系统的结构
功能进行分析：把区段站的作业计划编制过程看作是若干个组合优化问题的
启发式搜索过程；为系统提供一个友好的人机交互界面；有关数据和规则在
系统中的表达。然后规划系统的总体结构和系统各部分的功能。最后给出系
统决策必须要经历几的个阶段与算法的实例和结果。
The stage plan for railway depot station is one of the operative plans, by which the dispatchers in the station manage all transportation work. A high-quality operative plan should focus on the important tasks, organize car flow into all kind of trains according to the demands of the marshalling plan, ensure that all departure trains leave station on time, schedule exactly the decomposing and marshalling of all trains and suitably arrange all trains to occupy the arrival and departure lines. At present, railway depot station daily-shift operative plans are drawn up manually, which is inefficient, and the dispatchers draw the plan chart by hand, which is toilsome. Therefore, the realization of automatically making the daily-shift plan with computer is practical value on the spot, which is conducive to increase the speed of making plan and improve quality of operative plan, upgrade the capacity of railway and greatly lessen the dispatcher's physical work.
In order to study the problem of automatically making railway locomotive station operative plan and making a high quality plan, above all, we ought to analyze the operation system of the station, know thoroughly the procedures of operation system and make acquainted with regulations of all the work of the stations. Thus, the paper introduces all the essential facilities, the procedure of all operations, such as marshalling, decomposing, fetching and delivering train, of the stations and coordinate work of all department, so that the working of automatically making stage plan with computer is well grounded on.
It is significant in theory and in effect that automatically making operative plan with computer. The spottiness of plans workout can be avoided because of people's different thought patterns and professional characteristics, in effect; In theory, the method of making operative plan for district stations will be further developed and the relative mathematics theories will be boosted. To better elucidate the following critical problems -- building the rational mathematics model and searching the effective algorithms, this paper sets forth the basis of algorithms and heuristic algorithm. Meanwhile it compendiously introduces the main principles of genetic algorithm and the stimulated annealing algorithm, principal parameters during the course of solving problems and vertex coloring
theory.
This paper analyzes the network model of cars flow organization related to my work, which was presented in the references and points out that it is improper. Analyzing in detail the mental activities, which the dispatchers have during the course of dispatching, I find out the rules used for reference and the essential theory meeting the demand of operative plans with computers aided. According to the regulations above, the paper presents the virtual price and profit function in the course of selecting cars for the departing trains and the model of the grouping cars into arrival trains. Based on the conclusion of organizing into trains and simulating the thoughts of dispatchers in district stations, this paper analyzes the features of time sets of shunting locomotives, constructs the reasonable graph model in the way of making out time sets, and converts it into the problem of graph coloring. The paper exploits then method of combining the simulated annealing algorithm with genetic algorithm for the question and designs the coding way which based on ordinal characters, builds up fitness function on the basis of penalty function, adopts the basal technology, such as crossover, mutation etc. to deal with the model and put forward adjustable algorithms for trains occupying time sets. Consulting on the method of arrangement of shunting locomotives, the mathematical model of the arrival and departure lines occupying arrangement is set up. I apply the hybrid algorithm that combines greedy-selector into genetic algorithm to the question and get satisfactory answers.
During the process of algorithm realization with computer, this paper draws a conclusion, which the syste
要研究计算机自动编制阶段计划，必须分析铁路区段站的作业系统，通晓区段站作业系统的工作过程，找到区段站中作业组织之间的规律，才有可能编制出理想的作业计划。本文首先介绍了区段站必需的设备，及各种作业过程和全站的协调作业，为研究阶段计划的计算机自动编制打下基础。
应用计算机系统实现阶段计划的自动编制，在理论和实际应用上都很有意义。在实际应用中可以克服由于人的思维方式的不同以及专业素质的高低对计划编制质量的影响，提高车站的调度水平；在理论上可以进一步丰富和发展区段站作业计划编制的内容，推动数学理论向前发展。为了更好地说明下文所要解决的关键问题——建立合理的数学模型和寻找有效可行的算法，本文阐述了算法和启发式算法的理论基础，并扼要地介绍了遗传算法、模拟退火算法的主要思想和在解题过程中应用的重要参数，以及图的着色理论；及其在作业计划编制中应用的可能性。
对有关文献中建立的车流组织的网络模型进行分析，指出其不合理性。在现场调研的基础上对站调推算车流的思维活动进行全面的分析，找出其中可以借鉴的规律，得到对区段站应用计算机编制作业计划的必须的理论。依据上文提炼的理论，仿照现代经济社会中的交易活动，提出列车推算中的虚拟价格和收益函数，得到简单可行的车流推算模型。在车流推算的基础上，从应用计算机模拟区段站调度员思维的角度出发，通过分析车列占用调车机车时区集合的特点，使用划分时间片的方法建立合适的调车机车安排的图论模型，将调机运用问题转化为顶点具有加权的图的K-着色问题。将模拟退火算法和演化算法混合起来运用于该问题，设计有序的字符串编码方法，构造了基于罚函数的适应度函数，采用交叉和变异等技术，求解该模型。并提出了车列占用时区调整的相关算法。参照调车机车运用计划的求解，建立到发
西南交通大学博士研究主学位论文 第11 页
线占用安排的数学模型，并将贪婪着色算法和演化算法混合起来运用于该问
题，取得满意解。
在应用计算机实现算法中，提出了计算机编制阶段计划系统本质上是一
个决策支持系统（DSS）。按照计算机实现的一般步骤，首先对该系统的结构
功能进行分析：把区段站的作业计划编制过程看作是若干个组合优化问题的
启发式搜索过程；为系统提供一个友好的人机交互界面；有关数据和规则在
系统中的表达。然后规划系统的总体结构和系统各部分的功能。最后给出系
统决策必须要经历几的个阶段与算法的实例和结果。
The stage plan for railway depot station is one of the operative plans, by which the dispatchers in the station manage all transportation work. A high-quality operative plan should focus on the important tasks, organize car flow into all kind of trains according to the demands of the marshalling plan, ensure that all departure trains leave station on time, schedule exactly the decomposing and marshalling of all trains and suitably arrange all trains to occupy the arrival and departure lines. At present, railway depot station daily-shift operative plans are drawn up manually, which is inefficient, and the dispatchers draw the plan chart by hand, which is toilsome. Therefore, the realization of automatically making the daily-shift plan with computer is practical value on the spot, which is conducive to increase the speed of making plan and improve quality of operative plan, upgrade the capacity of railway and greatly lessen the dispatcher's physical work.
In order to study the problem of automatically making railway locomotive station operative plan and making a high quality plan, above all, we ought to analyze the operation system of the station, know thoroughly the procedures of operation system and make acquainted with regulations of all the work of the stations. Thus, the paper introduces all the essential facilities, the procedure of all operations, such as marshalling, decomposing, fetching and delivering train, of the stations and coordinate work of all department, so that the working of automatically making stage plan with computer is well grounded on.
It is significant in theory and in effect that automatically making operative plan with computer. The spottiness of plans workout can be avoided because of people's different thought patterns and professional characteristics, in effect; In theory, the method of making operative plan for district stations will be further developed and the relative mathematics theories will be boosted. To better elucidate the following critical problems -- building the rational mathematics model and searching the effective algorithms, this paper sets forth the basis of algorithms and heuristic algorithm. Meanwhile it compendiously introduces the main principles of genetic algorithm and the stimulated annealing algorithm, principal parameters during the course of solving problems and vertex coloring
theory.
This paper analyzes the network model of cars flow organization related to my work, which was presented in the references and points out that it is improper. Analyzing in detail the mental activities, which the dispatchers have during the course of dispatching, I find out the rules used for reference and the essential theory meeting the demand of operative plans with computers aided. According to the regulations above, the paper presents the virtual price and profit function in the course of selecting cars for the departing trains and the model of the grouping cars into arrival trains. Based on the conclusion of organizing into trains and simulating the thoughts of dispatchers in district stations, this paper analyzes the features of time sets of shunting locomotives, constructs the reasonable graph model in the way of making out time sets, and converts it into the problem of graph coloring. The paper exploits then method of combining the simulated annealing algorithm with genetic algorithm for the question and designs the coding way which based on ordinal characters, builds up fitness function on the basis of penalty function, adopts the basal technology, such as crossover, mutation etc. to deal with the model and put forward adjustable algorithms for trains occupying time sets. Consulting on the method of arrangement of shunting locomotives, the mathematical model of the arrival and departure lines occupying arrangement is set up. I apply the hybrid algorithm that combines greedy-selector into genetic algorithm to the question and get satisfactory answers.
During the process of algorithm realization with computer, this paper draws a conclusion, which the syste
引文
1 李文权．铁路区段站日工作计划优化模型及其算法的研究．西南交通大学博士学位论文．1997
2 O. Gulbrodsen. Optimal planning of marshalling yard by operation research. PROC, 1963:226～233
3 R. S. McGaughey., Planning locomotive and car distribution, Rail Int., 1973, 1213～1218
4 S. Yagar & Fracisico, A Efficiency Sequence of Classification Yard Hump, Transp. Res. Vol24, 1989
5 T. Crainic, J, Ferland and J.Rousseav. A tactical planning model for rail freight transportation, Tans. Sci., 1984(18): 165～183
6 M. H. Keaton. Designing Optimal Railroad Operating Plans: Lagrangian Relaxation and Heuristice Approaches. Trans. Res.(B), 1989(23): 443～452
7 M. H. Keaton. Designing railroad operating plans: A dual adjustment method for implementing lagrangian relaxation. Trans. Sci., 1992(26):263～279
8 王慈光．车站技术作业整体统筹模型．铁道运输与经济．1996，Vol．18(4)
9 中国铁道管理学院，日本国际协力事业团合编．铁路编组站自动化系统 YACS. 中国铁道出版社，1991
10 索尼科夫(苏)．编组站工作强化．王鹤鸣译．中国铁道出版社．1987
11 刘军．铁路编组站作业计划滚动式智能化编制方法的研究．北方交通大学博士学位论文．1993
12 周克勤，铁路分局列车日班计划数据自动化处理研究，铁道部科学研究院研究报告，1983
13 钟雁．一个基于动态模型的计划决策支持系统。北方交通大学学报，1995(19)：401～406
14 钟雁，张全寿．铁路编组站调车作业计划决策支持系统的研究．铁道学报，1994(16)：76～82
15 何世伟．铁路枢纽作业计划的优化编制——编组站作业计算与枢纽日班计划的模型及算法研究．西南交通大学博士学位论文，1996
16 汪文锋．成都东站阶段计划编制的计算机辅助决策系统的研究．西南交通大学硕士学位论文，1997
17 龚文平．编组站阶段计划自动化编制若干问题的研究．西南交通大学硕士论文．1999
18 胡刚．编组站阶段计划自动编制与调整的研究．西南交通大学硕士论文．2000
19 王慈光．用表上作业法求解编组站配流问题的研究．铁道学报．2002，Vol．24(4)：1～5
20 惠莉．西安东编组站调度决策支持系统的研究．西南交通大学硕士论文．1997
21 张全寿．编组站货车实时信息系统．中国铁道出版社，1997
22 方洪武．计算机编制区段站日计划研究．西南交通大学硕士论文，1994
23 冯焕，何勋隆．铁路站场及枢纽．中国铁道出版社，1994：60～77．
24 国家标准局．标准轨距铁路机车车辆限界分类及基本尺寸．中国标准出版社，1984
25 国家标准局．标准轨距铁路建筑限界分类及基本尺寸．中国标准出版社，1984
26 铁道部第三勘测设计院．区段站设计．中国铁道出版社，1980
27 黄孝章，胡思继．编组站调车场尾部咽喉区优化设计方法研究．北方交通大学学报．1998，Vol22(3)：63～67
28 严蔚敏，吴伟民．数据结构．清华大学出版社，1992
29 王晓东编著．数据结构与算法设计．电子工业出版社，2002．
30 AILed V. Aho, Hohn E. Hopcroft, and Jeffrey D. Ullman: Data Structres and Algorithms, Addison—Wesley,1983
31 邢文训，谢金星．现代优化计算方法．清华大学出版社．1999
32 李文，王哲明，刘林．图顶点 m 着色的改进算法．天津理工学院学报．1998，Vol．14(3)：59～62
33 Hillier, F.S. and Leiberman, G.J., Introduction to Operations Research, Holden-Day, San Francisco, CA, 1967
34 Prasanna Jog, P., et. al., The Effects of Population Size, Heuristic Crossover, and Local Improvement on a Genetic Algorithm for the Traveling Salesman Problem, 1989
35 李军，郭耀煌．物流配送车辆优化调度理论与方法．中国物资出版社．2001
36 Reeves CR(Ed).Modern Heuristic Techniques for Combinatorial Problems. Oxford: Blackwell Scientific Publications, 1993
37 Holland J H. Adaptation in Natural and Artificial Systems. MIT, 1975
38 程润伟，玄光男．遗传算法与工程设计．科学出版社．2000
39 Goldberg D E. Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, MA, Addison - Wisely, 1989
40 周明，孙树栋．遗传算法原理及其应用．国防工业出版社，1996
41 陈国良，王煦法，庄镇泉等．遗传算法及其应用．科学出版社，1996
42 Jomikow C Z, Michalewicz Z. An Experimental Comparison of Binary and Floating Point Representations in Genetic A1 gorithm. Proc of ICGA, 1991: 31-36
43 陈恩红，遗传算法的若干理论问题研究，软件学报，1997，增刊
44 李军，谢秉磊，郭耀煌．基于自然数编码的模式理论研究，西南交通大学学报，1999，Vol．5(9)：77～80
45 李军，谢秉磊，郭强．自然数编码遗传算法的某些理论问题研究．中国学术期刊，1999，Vol．5(9)：1155～1156
46 徐杰，杜文等．基于遗传算法的区段站到发线运用优化安排．中国铁道科学．2003．2
47 谭志杨．遗传算法的计算效率分析．交通与计算机，2001．6：17～19
48 Alberto B., Marco D., Implicit Parallelism in Genetic Algorithms, Artificial. Intelligence. 1993, Vol. 61
49 Gunter Rudolph, Conyergence Analysis of Canonical Genetic Algorithms, IEEE Transaction.
50 Michael D. V., Generalizing the Notion of Schema in Genetic Algorithms, Artificial Intelligence, 1991, No.5
51 恽为民，席裕庚．遗传算法的全局收敛性和计算效率分析．控制理论应用，1996(4)
52 Zbigniew Michalewicz, Genetic algorithms + Data Structures = Evolution programs, Third Edition, Springer-verlag Berlin Heidelberg, 1996
53 Clayton L. B., David E. G., An Analysis of Reproduction and Crossover in a Binary-coded Genetic Algorithm, Proceedings of the Third International conference on genetice algorithms, 1989
54 纪树新，钱积新等．车间作业调度遗传算法中的交叉算子研究．控制与决策，1998，Vol．18
55 刘勇，康立山，陈毓屏著．非数值并行算法(第一册)模拟退火算法．科学
出版社，1994
56 袁健，李明成．模拟退火法临界温度估算及整体最优化新算法．南京航空航天大学学报，1997．10：500～505
57 谢云．模拟退火算法的原理及实现．高等学校计算数学学报，1999，9(3)：212～218
58 李修睦．图论导引．华中工学院出版社，1982
59 肖位枢．图论及其算法．航空工业出版社，1993：172～176
60 李力，罗予频等．一种图简化方法及其与遗传算法的混合运用．电子学报．1997(25)
61 J. A. Bondy, U.S.R. Murty. Graph theory with applications. American Elsevier, 1976
62 Jensen TR, Tort B. Graph coloring problems. New York: Awiley-Interscience Publication, 1995
63 J A Bondy, U.S.R. Mruty. Graph theory with applications. The Macmillan Press LTD. London, Basingtokea and New York, 1976
64 Gibbons. A algorithm graph theory. Cambridge University Press. 1985
65 刘勇，康立山，陈毓屏．非数值并行算法(第二册)——遗传算法．科学出版社．1995
66 黄小原，肖四汉等．遗传算法在列车占线问题中的应用，信息与控制，1996(5)
67 胡卫明，徐俊华，何志均．κ-着色问题及其均场退火求解算法．软件学报．2000(11)：256～259
68 王琳，虞厥邦．基于遗传机制的图着色分配算法的研究．云南大学学报．2000(22)：255～258
69 I. Gersbakh and H.I. Stem. Minimal resources for fixed and variable job schedules. Oper. Res., 1978 (26): 68～75
70 M. Fischetti, M. S. Martello and P. Toth. The fixed job scheduling problem constraints. Oper. Res., 1989(37): 395～403
71 M. Fischetti, M. S. Martello and P. Toth. Approximation algorithms for fixed job schedule problems. Oper. Res., 1992:96～108
72 胡东彦．编组站闩班计划专家系统．北方交通大学硕士论文．1988
73 易文平．编组站系统优化．北方交通大学博士学位论文．1992
74 林尧瑞．专家系统原理与实践．清华大学出版社，1998
75 滕传琳．管理运筹学．中国铁道出版社．1986
76 黄克毅，吴培德．铁道概论．中国铁道出版社．1983
77 邵健，梁春采．车站调度员工作．中国铁道出版社．1990
78 郑时德，吴汉琳．铁路行车组织．第三版．中国铁道出版社．1991
79 胡思继．铁路行车组织．中国铁道出版社．2000
80 编组站作业组织．人民铁道出版社．1976
81 M.A.Turquist, M.S.Dadkin. Queuing models of classification and connection delay in rail yard. Trans. Sci., 1982(16):207～230
82 T. Crainic, J. A. Ferland and J. M. Rousseau. A Tactical Planning Model for Rail Freight Transportation. Trans. Sci. 1984(18): 165～184
83 T. S. Glickman and H. D. Sherall, Large-scale network distribution of pooled empty freight cars over time with limited substitution and equitable benefits. Transp. Res. 1985(19B): 85～94
84 P. J. Detax and T. G. Crainic. Survey paper: a review of empty flows and fleet management models in freight transportation. Trans. Sci. 1987(21): 227～247
85 Dejan Jovanovic. Improving railroad on-time performance: models, algorithms and applications. Ph. D. Dissertation, University of Pennsylvania, 1990
85 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
87 张全寿．铁路编组站站调决策支持系统的研究．北方交通大学学报，1989(2)
88 W. P. Allman. A computer simulation model for railroad freitht transportation system. Proc. 4th. Int. Conf. Ops. Res., 1966:339～351
89 李林山．用微机编制铁路分局日班计划的研究．北方交通大学硕士论文，1991．
90 C. D. Marland. Applications of expert systems for railway maintenance: scheduling rail relay. Trans. Res., 1989(24A(I))
91 J. Dejan and T. H. Partrick. Scan: a decesion support system for railroad scheduling, IEEE ASME Joint Railroad Conf., 1989
92 范征．编组站作业优化决策支持系统．西南交通大学硕士论文，1993
93 R. S. Mcgaughey, Planning locomotive and car distributon. Rail. Int., 1973:
1213～1218
94 A. E. Haghani. A combined model of train routing, makeup and empty car distribution. Ph. D. Dissertation. Northwester nUniversity, 1986
95 何世伟．铁路枢纽作业轮廓计划优化模型及算法．西南交通大学学报．1995(5)：566～572
96 朱松年．用误差分析的方法改进车站技术作业过程的查定．西南交通大学学报．1978(3)
97 马振华．现代应用数学手册——运筹学与最优化理论卷．清华大学出版社，1998．
98 曹家明，范征，毛节铭．编组站作业优化决策支持系统——解体子系统[J]．铁道学报．1993，Vol．15：66～73．
99 林尧瑞，张钹，石纯一．专家系统原理与实践．清华大学出版社，1988：223～241
100 刘军．一类复杂规划问题的分层规划方法．北方交通大学学报，1995，19(3)
101 李文权，王炜，杜文，林诒勋．铁路技术站调机运用模型及算法．系统工程学报．2000，15(3)
102 孙晚华，郑时德．编组站到达流生成方法的研究．北方交通大学学报，Vol．18(4)，499～505
103 何世伟，宋瑞，胡安洲．编组站阶段计划刚性与柔性优化的协调研究．铁道学报．1999，Vol．21(4)：1～8
104 何世伟，宋瑞，朱松年．编组站阶段计划解编作业优化模型及算法．铁道学报．1997，Vol．19(3)：1～8
105 史峰，孔庆钤，胡安洲．车流径路与编组计划综合优化的网络方法．铁道学报．1997，Vol．19(1)：1～6
106 果鹏文，林柏梁，余洋．大规模路网上空车调配的区段中心优化法．中国铁道科学，Vol．22(2)：123～128
107 韩祯祥，文福栓．模拟进化优化方法极其应用．计算机科学，1995，No．2
108 孙艳丰，王众托．遗传算法在优化问题中的应用研究进展．控制与决策，1996，Vol．11(4)：425～430
109 田军，寇纪松，李敏强。遗传算法在运筹学领域的应用研究进展与展望．系统工程学报，1998，Vol．13(2)：101～106
110 王熙法，庄镇泉等．遗传算法与遗传规划．冶金出版社，1996
111 席裕庚，柴天佑．遗传算法综述．控制理论与应用，1996(6)
112 张晓，戴冠中等．遗传算法种群多样性的分析研究．控制理论与应用 1998(1)
113 周远晖，陆玉昌等．基于克服过早收敛的自适应并行遗传算法．清华大学学报，1998(6)
114 杨兆升，姜桂艳．遗传算法在最优控制动态交通分配中的应用．系统工程理论与实践．1998，Vol．18(4)：117～121
115 王小平，曹立明．遗传算法——理论、应用与软件实现．西安交通大学出版社．2002
116 冯旭东，陈方．遗传算法的程序设计与实现，微机发展，1997(6)
117 Gorrest s, Mitchell M. What Makes a Problem Hard for a Genetic Algorithm? Proceedings of the Fourth International Conference on Genetic Algorithms, CA,Morgan Kaufman, 1991:120～131
118 章坷，刘贵忠．交叉位置非等概率选取的遗传算法．信息与控制，1997，26(1)：53～60
119 王秀峰．实数编码的遗传算法及其在逆变器馈电交流电机中的应用．自动化学报．1998，15(1)：17～22
120 Kuo T, Hwang S Y. A Genetic Algorithm with Deceptive Selection in Genetic Algorithms. Proceedings of the Fifth International Conference on Genetic Glgorithms, Morgan Kaufmann: 65～69
121 Deb K, Goldberg D E. Sufficient Conditions for Deceptive and Easy Binary Functions: Annals of Mathematics and Artificial Intelligence, 1994, 10(4):385～408
122 Mahfoud S W. Population Size and Genetic Drift in Fitness Sharing. Foundations of Genetic Algorithms, Morgan Kaufmann Publisher, 1994:185～223
123 王正志，薄涛．进化计算．国防科技大学出版社．2000
124 Hillier, F.S. and Leiberman, G.J., Introduction to Operations Research, Holden-Day, San Francisco, CA, 1967
125 Prasanna Jog, P., et. al.. The Effects of Population Size, Heuristic Crossover, and Local Improvement on a Genetic Algorithm for the Traveling Salesman Problem, 1989
126 Eckart Zitzler. Evolutionary Algorithms for Multiobjective Optimization:
Methods and Applications. A Dissertation Submitted to the Swiss Federal Institute of Technology Zurich for the degree of Doctor of Technical Sciences. 1999
127 N. Srinivas and K. Deb. Multiobjective Optimization Using Nondominated Sorting in Genetic Algorithms. Evolutionary Computation, 1994, Vol.2(3):221～248
128 Jerey Horn, Nicholas Nafpliotis, and David E. Goldberg. A Niched Pareto Genetic Algorithm for Multiobjective Optimization. In Proceedings of the First IEEE Conference on Evolutionary Computation, IEEE World Congress on Computational Computation. Piscataway, NJ. IEEE Press, 1994(1): 82～87
129 G. T. Parks and I. Miller. Selective Breeding in a Multiobjective Genetic Algorithm. Parallel Problem Solving from Nature PPSN V, Berlin, 1998: 250～259
130 E. Zitzler, K. Deb, and L. Thiele. Comparison of Multiobjective Evolutionary Algorithms: Empirical Results. Evolutionary Computation, 2000, Vol.8(2): 173～195
131 E. Zitzler and L. Thiele. Multiobjective Evolutionary Algorithms: A Comparative Case Study and the Strength Pareto Approach. IEEE Transactions on Evolutionary Computation, 1999, Vol.3(4): 257～271.
132 Frank Kursawe. A Variant of Evolution Strategies for Vector Optimization. In H.-P. Schwefel and R. M"anner, editors, Parallel Problem Solving from Nature. Berlin, Springer, 1991: 193～197
133 Jomikow C Z, Michalewicz Z. An Experimental Comparison of Binary and Floating Point Representations in Genetic Algorithm. Proc of ICGA, 1991:31～36
134 Reeves CR(Ed).Modern Heuristic Techniques for Combinatorial Problems. Oxford: Blackwell Scientific Publications, 1993
135 Srinivas M, Patnaik L. M. Adaptive Probabilities of Crossover and Mutations in GAs. IEEE Trans. On SMC, 1994, 24(4): 656～667
136 Goldberg D E, Korb B, Deb K. Messy Genetic Algorithms: Motibvation, Analysis and First results. Complex systems, 1989(3): 493～530
137 J. David Schaer. Multiple Objective Optimization with Vector Evaluated
Genetic Algorithms. In John J. Grefenstette, editor, Proceedings of an International Conference on Genetic Algorithms and Their Applications. Pittsburgh, PA. Sponsored by Texas Instruments and U.S. Navy Center for Applied Research in Articial Intelligence (NCARAI), 1985: 93～100
138 Carlos M. Fonseca and Peter J. Fleming. Genetic algorithms for multiobjective optimization: Formulation, discussion and generalization. In Stephanie Forrest, editor, Proceedings of theFifih International Conference on Genetic Algorithms. San Mateo, California. Morgan Kaufmann, 1993: 416～423
139 吕红霞等．技术站调度决策支持系统的研究——到发线的合理使用[J]．西南交通大学学报．2000，Vol．35：255～258．
140 James F. Allen. Towards a general theory of action and time. Artifical Intelligence. 1984. Vol.23:123～154
141 J. F. Allen. Analyzing intention in utterances. Artificial Intelligence. 1980. Vol. 15:143～178
142 Mays. E., A modal temporal logic for reasoning about change. Proc. 21st Meeting, Association for Computational Linguistics (MIT, Cambridhe, CA), 1983
143 Jensen TR, Toff B. Graph coloring problems. New York: Awiley-Interscience Publication, 1995
144 Bondy J A, Mruty USR. Graph theory with application. The Macmillan Press LTD. London, Basingtokea and New York, 1976
145 Gibbons. A algorithm graph theory. Cambridge University Press. 1985
146 Hsiao-liang Fang. Investigating genetic algorithms for scheduling. Dissertation of Ph. D. of University of Edimburg.
147 Michael P. Fourman. Compaction of symbolic layout using genetic algorithms. Proceedings of an International Conference on Genetic Algorithms and Their Applications, Pittsburgh, PA. Sponsored by Texas Instruments and U.S. Navy Center for Applied Research in Articial Intelligence (NCARAI). 1985:141～153
148 J. D. Knowles and D. W. Corne. The pareto archived evolution strategy: A new baseline algorithm for pareto multiobjective optimisation. In Congress on Evolutionary Computation(CEC99), Piscataway, NJ. IEEE Press, 1999,
Vol.1: 98～105
149 P. Hajela and C.-Y. Lin. Genetic search strategies in multicriterion optimal design. Structura Optimization, 1992, Vol.4:99～107
150 Hisao Ishibuchi and Tadahiko Murata. Multi-objective genetic local search algorithm. In Proceedings of 1996 IEEE International Conference on Evolutionary Computation (ICEC'96), Piscataway, NJ. IEEE Press, 1996: 119～124
151 Eckart Zitzler, Marco Laumanns, and Lothar Thiele. Improving the strength pareto evolutionary algorithm. Technical Report 103, Computer Engineering and Networks Laboratory (TIK), Swiss Federal Institute of Technology (ETH) Zurich, Gloriastrasse 35, CH-8092 Zurich, Switzerland, May 2001.
152 G. Rudolph and A. Agapie. Convergence properties of some multiobjective evolutionary algorithms. In Congress on Evolutionary Computation (CEC 2000), Piscataway, NJ. IEEE Press, 2000, Vol.2:1010～1016
153 Marco Laumanns, Lothar Thiele, Kalyanmoy Deb, and Eckart Zitzler. On the convergence and diversity-preservation properties of multi-objective evolutionary algorithms. Technical Report 108, Computer Engineering and Networks Laboratory (TIK), Swiss Federal Institute of Technology (ETH) Zurich, Gloriastrasse 35, CH-8092 Zurich, Switzerland, May 2001.
154 K. Deb, S. Agrawal, A. Pratap, and T. Meyarivan. A fast elitist nondominated sorting genetic algorithm for multi-objective optimization: NSGA-Ⅱ. Parallel Problem Solving from Nature PPSN Ⅵ, Berlin. Springer.
155 Carlos A. Coello Coello. Constraint-handling using an evolutionary multi-objective optimization technique. Civil Engineering and Environmental Systems, 2000, Vol. 17:319～346.
156 Jonathan Wright and Heather Loosemore. An infeasibility objective for use in constrained pareto optimization. Proceedings of the First International Conference on Evolutionary Multi-CriterionOptimization (EMO 2001), Lecture Notes in Computer Science, Berlin. Springer-Verlag, 2001, Vo1.1993:256～268
157 Carlos M. Fonseca and Peter J. Fleming. Multiobjective optimization and multiple constraint handling with evolutionary algorithms part I: A unied formulation. IEEE Transactions onSystems, Man, and Cybernetics, 1998,
Vol.28(1):26～37.
158 Kalyanmoy Deb. Multi-objective optimization using evolutionary algorithms. Wiley, Chichester, UK, 2001.
159 Kaisa Miettinen. Nonlinear multiobjective optimization. Kluwer, Boston, 1999.
160 E. Zitzler, K. Deb, L. Thiele, C. A. Coello Coello, and D. Come. Proceedings of theFirst International Conference on Evolutionary Multi-Criterion Optimization (EMO 2001), Lecture Notes in Computer Science, Berlin, Germany, 2001, Vol.1993
161 Stefan Bleuler, Martin Brack, Lothar Thiele, and Eckart Zitzler. Multiobjective genetic programming: reducing bloat by using SPEA2. In Congress on Evolutionary Computation (CEC-2001), Piscataway, NJ. IEEE, 2001: 536～543.
162 Wolfgang Banzhaf, Peter Nordin, Robert E. Keller, and Frank D. Francone. Genetic Programming, 1998
163 L. Hennig, C. B"uche, and E. Sch"afer. Degradation of phytochrome and the high irradiance response in arabidopsis: A genetic analysis. Plant, Cell and Environment, 2000, Vol.23:727～734
164 严余松．单线铁路平行运行图通过能力的遗传算法．2000，Vol．35(3)：277～279
165 刘强．编制摘挂列车调车作业计划软件的开发．铁道运输与经济．2000(2)：22～29
166 刘昆，颜钢锋．采用混合策略遗传算法求解一类资源约束最短时间调度问题．系统工程．2000．Vol．18(6)：33～37
167 颜钢锋，孟睿，刘昆．采用混合单亲遗传算法求解一类资源——时间优化问题．系统工程理论与实践．2001(11)：75～79
168 陈莉．混合遗传算法及应用．四川师范大学学报．1998．Vol．21(5)：553～558
169 杨莉．混合遗传算法设计方法的探讨．湖北师范学院学报．2000，Vol．20(3)：69～73
170 乔建忠，雷为民等．混合遗传算法研究及其应用．小型计算机系统．1998，Vol．19(12)：14～19
171 Hesser J, Miunner R. Investigation of M-Heuristic for Optimal Mutation Probabilities. In: Proc Int Conf on Parallel Problem Solving from Nature,
Netherlands, 1992.
172 Schradoph N N, Belew RK. Dynamic Paremeter's Encoding for Genetic Algorithms. Machine Learning, 1992,9(1):9～21
173 Mahfoud S W. Crowding and Pre-selection Revisited. In: Proc Int on Parallel Problem Solving from Nature, Netherlands, 1992
174 黄梯云．智能决策支持系统．电子工业出版社．2001
175 刘晶珠．决策支持系统导论．哈尔滨工业大学出版社，1990
176 张雪风等．决策支持系统中的模型及模型库管理系统．计算机研究与发展．1993(3)
177 P.E.Lehner. Investigating Theories of Decision Support: Aperspective. Information and Decision Technologies. 1989(15)
178 Fedoriwicz. Representing Modeling Knowledge in an Intelligent Decision Support Systems. Decision Support Systems. 1986,Vol.2(1): 3～14
179 Ghiaseddin. An Environment for Development of Decision Support Systems. Decidion Support Systems. 1986:195～212
180 Blanning. An Entity-relationship Approach to Model Management. Decision Support Sytems. 1986(2): 65～72
181 Jian Ma. An Object-oriented Modeling Framework for Model Management. Decision Support Systems. 1995(13): 133～139.
182 周泓．决策支持系统的多层知识表达与分布式求解研究．系统工程．1995，13(1)：55～58
183 J. Fedorowies, G.B. Wukkuans. Representing Modeling Knowledge in an Intelligent Decision Support System. Decision Support Systems. 1986(1)
184 R. H. Bonczek, C. W. Holsapple, A. B. Whinston. Future Direction of Decision Support Systems. Decision sciences. 1980: Vol. 11(4)
185 李东．一个基于知识的 DSS 模型管理系统概念框架．系统工程理论与实践．1990，Vol．4：42～47
186 1 Robert H. Bonczek, Chyde W. Holsapple, Andrew B. Whinston. Foundations of Decision Support Sytems. Academic Press Inc.
187 William C. House. Decision Support Systems: A Data-based, Model Oriented, User Developed Discipline. Petrocelli Books, 1983
188 Robert J. Thierauf. Decision Support Systems for Effective Planning and Control a Case Study Approach. Psentice-Hall, Inc.
189 冉毅群．管理科学及决策方法．吉林大学出版社．1988
190 黄孟藩．决策概论．浙江教育出版社．1989
191 朱克强．企业发展战略规划模式及其基于知识的决策支持系统设计．中国人民大学博士学位论文．1992
192 顾培亮．决策支持系统设计思想的探讨．决策与决策支持系统．1992，Vol．2(2)
193 陈文伟，黄金来，陈元．决策支持系统新式结构体系．决策与决策支持系统．1998，Vol．1(3)：54～60
194 肖勇，陈意云．用遗传算法构造决策树．计算机研究与发展．1998，Vol．35(1)：49～52
195 W. B. Rouse, W. H. Copy. A Theory-based Approzch to Supporting Design Taking and Problem Solving. Information and Decision Technologies. 1989(15)
196 刘建国，刘晶珠，黄梯云．微型机决策支持系统生成器的设计研究．哈尔滨工业大学学报．1991，Vol．24(1)
197 李一军．基于框架知识库的 IDSS 研究．哈尔滨工业大学博士论文．1991
198 E. A. Woods. A Knowledge Representation Framework Integrating Qualitative Reasoning and State Space Modeling. Decision Support Systems and Qualitative Reasoning. 1991
199 刘金兰等，关于决策支持系统开发项目的风险分析．决策与决策支持系统．1994，Vol．4(2)：105～109
200 王孝通，杨德礼，邓贵仕．模型管理核心问题研究．决策与决策支持系统．1996，Vol．6(2)：15～24
201 吴菲，黄梯云．遗传算法在基于二元决策树的模型选择中的应用．管理科学学报，1999，Vol．22：57～61
202 刘树安，郑秉霖，王梦光等．改进 Gas 在大规模资源分配问题中的应用．信息与控制，1998，27(4)109～112
2 O. Gulbrodsen. Optimal planning of marshalling yard by operation research. PROC, 1963:226～233
3 R. S. McGaughey., Planning locomotive and car distribution, Rail Int., 1973, 1213～1218
4 S. Yagar & Fracisico, A Efficiency Sequence of Classification Yard Hump, Transp. Res. Vol24, 1989
5 T. Crainic, J, Ferland and J.Rousseav. A tactical planning model for rail freight transportation, Tans. Sci., 1984(18): 165～183
6 M. H. Keaton. Designing Optimal Railroad Operating Plans: Lagrangian Relaxation and Heuristice Approaches. Trans. Res.(B), 1989(23): 443～452
7 M. H. Keaton. Designing railroad operating plans: A dual adjustment method for implementing lagrangian relaxation. Trans. Sci., 1992(26):263～279
8 王慈光．车站技术作业整体统筹模型．铁道运输与经济．1996，Vol．18(4)
9 中国铁道管理学院，日本国际协力事业团合编．铁路编组站自动化系统 YACS. 中国铁道出版社，1991
10 索尼科夫(苏)．编组站工作强化．王鹤鸣译．中国铁道出版社．1987
11 刘军．铁路编组站作业计划滚动式智能化编制方法的研究．北方交通大学博士学位论文．1993
12 周克勤，铁路分局列车日班计划数据自动化处理研究，铁道部科学研究院研究报告，1983
13 钟雁．一个基于动态模型的计划决策支持系统。北方交通大学学报，1995(19)：401～406
14 钟雁，张全寿．铁路编组站调车作业计划决策支持系统的研究．铁道学报，1994(16)：76～82
15 何世伟．铁路枢纽作业计划的优化编制——编组站作业计算与枢纽日班计划的模型及算法研究．西南交通大学博士学位论文，1996
16 汪文锋．成都东站阶段计划编制的计算机辅助决策系统的研究．西南交通大学硕士学位论文，1997
17 龚文平．编组站阶段计划自动化编制若干问题的研究．西南交通大学硕士论文．1999
18 胡刚．编组站阶段计划自动编制与调整的研究．西南交通大学硕士论文．2000
19 王慈光．用表上作业法求解编组站配流问题的研究．铁道学报．2002，Vol．24(4)：1～5
20 惠莉．西安东编组站调度决策支持系统的研究．西南交通大学硕士论文．1997
21 张全寿．编组站货车实时信息系统．中国铁道出版社，1997
22 方洪武．计算机编制区段站日计划研究．西南交通大学硕士论文，1994
23 冯焕，何勋隆．铁路站场及枢纽．中国铁道出版社，1994：60～77．
24 国家标准局．标准轨距铁路机车车辆限界分类及基本尺寸．中国标准出版社，1984
25 国家标准局．标准轨距铁路建筑限界分类及基本尺寸．中国标准出版社，1984
26 铁道部第三勘测设计院．区段站设计．中国铁道出版社，1980
27 黄孝章，胡思继．编组站调车场尾部咽喉区优化设计方法研究．北方交通大学学报．1998，Vol22(3)：63～67
28 严蔚敏，吴伟民．数据结构．清华大学出版社，1992
29 王晓东编著．数据结构与算法设计．电子工业出版社，2002．
30 AILed V. Aho, Hohn E. Hopcroft, and Jeffrey D. Ullman: Data Structres and Algorithms, Addison—Wesley,1983
31 邢文训，谢金星．现代优化计算方法．清华大学出版社．1999
32 李文，王哲明，刘林．图顶点 m 着色的改进算法．天津理工学院学报．1998，Vol．14(3)：59～62
33 Hillier, F.S. and Leiberman, G.J., Introduction to Operations Research, Holden-Day, San Francisco, CA, 1967
34 Prasanna Jog, P., et. al., The Effects of Population Size, Heuristic Crossover, and Local Improvement on a Genetic Algorithm for the Traveling Salesman Problem, 1989
35 李军，郭耀煌．物流配送车辆优化调度理论与方法．中国物资出版社．2001
36 Reeves CR(Ed).Modern Heuristic Techniques for Combinatorial Problems. Oxford: Blackwell Scientific Publications, 1993
37 Holland J H. Adaptation in Natural and Artificial Systems. MIT, 1975
38 程润伟，玄光男．遗传算法与工程设计．科学出版社．2000
39 Goldberg D E. Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, MA, Addison - Wisely, 1989
40 周明，孙树栋．遗传算法原理及其应用．国防工业出版社，1996
41 陈国良，王煦法，庄镇泉等．遗传算法及其应用．科学出版社，1996
42 Jomikow C Z, Michalewicz Z. An Experimental Comparison of Binary and Floating Point Representations in Genetic A1 gorithm. Proc of ICGA, 1991: 31-36
43 陈恩红，遗传算法的若干理论问题研究，软件学报，1997，增刊
44 李军，谢秉磊，郭耀煌．基于自然数编码的模式理论研究，西南交通大学学报，1999，Vol．5(9)：77～80
45 李军，谢秉磊，郭强．自然数编码遗传算法的某些理论问题研究．中国学术期刊，1999，Vol．5(9)：1155～1156
46 徐杰，杜文等．基于遗传算法的区段站到发线运用优化安排．中国铁道科学．2003．2
47 谭志杨．遗传算法的计算效率分析．交通与计算机，2001．6：17～19
48 Alberto B., Marco D., Implicit Parallelism in Genetic Algorithms, Artificial. Intelligence. 1993, Vol. 61
49 Gunter Rudolph, Conyergence Analysis of Canonical Genetic Algorithms, IEEE Transaction.
50 Michael D. V., Generalizing the Notion of Schema in Genetic Algorithms, Artificial Intelligence, 1991, No.5
51 恽为民，席裕庚．遗传算法的全局收敛性和计算效率分析．控制理论应用，1996(4)
52 Zbigniew Michalewicz, Genetic algorithms + Data Structures = Evolution programs, Third Edition, Springer-verlag Berlin Heidelberg, 1996
53 Clayton L. B., David E. G., An Analysis of Reproduction and Crossover in a Binary-coded Genetic Algorithm, Proceedings of the Third International conference on genetice algorithms, 1989
54 纪树新，钱积新等．车间作业调度遗传算法中的交叉算子研究．控制与决策，1998，Vol．18
55 刘勇，康立山，陈毓屏著．非数值并行算法(第一册)模拟退火算法．科学
出版社，1994
56 袁健，李明成．模拟退火法临界温度估算及整体最优化新算法．南京航空航天大学学报，1997．10：500～505
57 谢云．模拟退火算法的原理及实现．高等学校计算数学学报，1999，9(3)：212～218
58 李修睦．图论导引．华中工学院出版社，1982
59 肖位枢．图论及其算法．航空工业出版社，1993：172～176
60 李力，罗予频等．一种图简化方法及其与遗传算法的混合运用．电子学报．1997(25)
61 J. A. Bondy, U.S.R. Murty. Graph theory with applications. American Elsevier, 1976
62 Jensen TR, Tort B. Graph coloring problems. New York: Awiley-Interscience Publication, 1995
63 J A Bondy, U.S.R. Mruty. Graph theory with applications. The Macmillan Press LTD. London, Basingtokea and New York, 1976
64 Gibbons. A algorithm graph theory. Cambridge University Press. 1985
65 刘勇，康立山，陈毓屏．非数值并行算法(第二册)——遗传算法．科学出版社．1995
66 黄小原，肖四汉等．遗传算法在列车占线问题中的应用，信息与控制，1996(5)
67 胡卫明，徐俊华，何志均．κ-着色问题及其均场退火求解算法．软件学报．2000(11)：256～259
68 王琳，虞厥邦．基于遗传机制的图着色分配算法的研究．云南大学学报．2000(22)：255～258
69 I. Gersbakh and H.I. Stem. Minimal resources for fixed and variable job schedules. Oper. Res., 1978 (26): 68～75
70 M. Fischetti, M. S. Martello and P. Toth. The fixed job scheduling problem constraints. Oper. Res., 1989(37): 395～403
71 M. Fischetti, M. S. Martello and P. Toth. Approximation algorithms for fixed job schedule problems. Oper. Res., 1992:96～108
72 胡东彦．编组站闩班计划专家系统．北方交通大学硕士论文．1988
73 易文平．编组站系统优化．北方交通大学博士学位论文．1992
74 林尧瑞．专家系统原理与实践．清华大学出版社，1998
75 滕传琳．管理运筹学．中国铁道出版社．1986
76 黄克毅，吴培德．铁道概论．中国铁道出版社．1983
77 邵健，梁春采．车站调度员工作．中国铁道出版社．1990
78 郑时德，吴汉琳．铁路行车组织．第三版．中国铁道出版社．1991
79 胡思继．铁路行车组织．中国铁道出版社．2000
80 编组站作业组织．人民铁道出版社．1976
81 M.A.Turquist, M.S.Dadkin. Queuing models of classification and connection delay in rail yard. Trans. Sci., 1982(16):207～230
82 T. Crainic, J. A. Ferland and J. M. Rousseau. A Tactical Planning Model for Rail Freight Transportation. Trans. Sci. 1984(18): 165～184
83 T. S. Glickman and H. D. Sherall, Large-scale network distribution of pooled empty freight cars over time with limited substitution and equitable benefits. Transp. Res. 1985(19B): 85～94
84 P. J. Detax and T. G. Crainic. Survey paper: a review of empty flows and fleet management models in freight transportation. Trans. Sci. 1987(21): 227～247
85 Dejan Jovanovic. Improving railroad on-time performance: models, algorithms and applications. Ph. D. Dissertation, University of Pennsylvania, 1990
85 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
87 张全寿．铁路编组站站调决策支持系统的研究．北方交通大学学报，1989(2)
88 W. P. Allman. A computer simulation model for railroad freitht transportation system. Proc. 4th. Int. Conf. Ops. Res., 1966:339～351
89 李林山．用微机编制铁路分局日班计划的研究．北方交通大学硕士论文，1991．
90 C. D. Marland. Applications of expert systems for railway maintenance: scheduling rail relay. Trans. Res., 1989(24A(I))
91 J. Dejan and T. H. Partrick. Scan: a decesion support system for railroad scheduling, IEEE ASME Joint Railroad Conf., 1989
92 范征．编组站作业优化决策支持系统．西南交通大学硕士论文，1993
93 R. S. Mcgaughey, Planning locomotive and car distributon. Rail. Int., 1973:
1213～1218
94 A. E. Haghani. A combined model of train routing, makeup and empty car distribution. Ph. D. Dissertation. Northwester nUniversity, 1986
95 何世伟．铁路枢纽作业轮廓计划优化模型及算法．西南交通大学学报．1995(5)：566～572
96 朱松年．用误差分析的方法改进车站技术作业过程的查定．西南交通大学学报．1978(3)
97 马振华．现代应用数学手册——运筹学与最优化理论卷．清华大学出版社，1998．
98 曹家明，范征，毛节铭．编组站作业优化决策支持系统——解体子系统[J]．铁道学报．1993，Vol．15：66～73．
99 林尧瑞，张钹，石纯一．专家系统原理与实践．清华大学出版社，1988：223～241
100 刘军．一类复杂规划问题的分层规划方法．北方交通大学学报，1995，19(3)
101 李文权，王炜，杜文，林诒勋．铁路技术站调机运用模型及算法．系统工程学报．2000，15(3)
102 孙晚华，郑时德．编组站到达流生成方法的研究．北方交通大学学报，Vol．18(4)，499～505
103 何世伟，宋瑞，胡安洲．编组站阶段计划刚性与柔性优化的协调研究．铁道学报．1999，Vol．21(4)：1～8
104 何世伟，宋瑞，朱松年．编组站阶段计划解编作业优化模型及算法．铁道学报．1997，Vol．19(3)：1～8
105 史峰，孔庆钤，胡安洲．车流径路与编组计划综合优化的网络方法．铁道学报．1997，Vol．19(1)：1～6
106 果鹏文，林柏梁，余洋．大规模路网上空车调配的区段中心优化法．中国铁道科学，Vol．22(2)：123～128
107 韩祯祥，文福栓．模拟进化优化方法极其应用．计算机科学，1995，No．2
108 孙艳丰，王众托．遗传算法在优化问题中的应用研究进展．控制与决策，1996，Vol．11(4)：425～430
109 田军，寇纪松，李敏强。遗传算法在运筹学领域的应用研究进展与展望．系统工程学报，1998，Vol．13(2)：101～106
110 王熙法，庄镇泉等．遗传算法与遗传规划．冶金出版社，1996
111 席裕庚，柴天佑．遗传算法综述．控制理论与应用，1996(6)
112 张晓，戴冠中等．遗传算法种群多样性的分析研究．控制理论与应用 1998(1)
113 周远晖，陆玉昌等．基于克服过早收敛的自适应并行遗传算法．清华大学学报，1998(6)
114 杨兆升，姜桂艳．遗传算法在最优控制动态交通分配中的应用．系统工程理论与实践．1998，Vol．18(4)：117～121
115 王小平，曹立明．遗传算法——理论、应用与软件实现．西安交通大学出版社．2002
116 冯旭东，陈方．遗传算法的程序设计与实现，微机发展，1997(6)
117 Gorrest s, Mitchell M. What Makes a Problem Hard for a Genetic Algorithm? Proceedings of the Fourth International Conference on Genetic Algorithms, CA,Morgan Kaufman, 1991:120～131
118 章坷，刘贵忠．交叉位置非等概率选取的遗传算法．信息与控制，1997，26(1)：53～60
119 王秀峰．实数编码的遗传算法及其在逆变器馈电交流电机中的应用．自动化学报．1998，15(1)：17～22
120 Kuo T, Hwang S Y. A Genetic Algorithm with Deceptive Selection in Genetic Algorithms. Proceedings of the Fifth International Conference on Genetic Glgorithms, Morgan Kaufmann: 65～69
121 Deb K, Goldberg D E. Sufficient Conditions for Deceptive and Easy Binary Functions: Annals of Mathematics and Artificial Intelligence, 1994, 10(4):385～408
122 Mahfoud S W. Population Size and Genetic Drift in Fitness Sharing. Foundations of Genetic Algorithms, Morgan Kaufmann Publisher, 1994:185～223
123 王正志，薄涛．进化计算．国防科技大学出版社．2000
124 Hillier, F.S. and Leiberman, G.J., Introduction to Operations Research, Holden-Day, San Francisco, CA, 1967
125 Prasanna Jog, P., et. al.. The Effects of Population Size, Heuristic Crossover, and Local Improvement on a Genetic Algorithm for the Traveling Salesman Problem, 1989
126 Eckart Zitzler. Evolutionary Algorithms for Multiobjective Optimization:
Methods and Applications. A Dissertation Submitted to the Swiss Federal Institute of Technology Zurich for the degree of Doctor of Technical Sciences. 1999
127 N. Srinivas and K. Deb. Multiobjective Optimization Using Nondominated Sorting in Genetic Algorithms. Evolutionary Computation, 1994, Vol.2(3):221～248
128 Jerey Horn, Nicholas Nafpliotis, and David E. Goldberg. A Niched Pareto Genetic Algorithm for Multiobjective Optimization. In Proceedings of the First IEEE Conference on Evolutionary Computation, IEEE World Congress on Computational Computation. Piscataway, NJ. IEEE Press, 1994(1): 82～87
129 G. T. Parks and I. Miller. Selective Breeding in a Multiobjective Genetic Algorithm. Parallel Problem Solving from Nature PPSN V, Berlin, 1998: 250～259
130 E. Zitzler, K. Deb, and L. Thiele. Comparison of Multiobjective Evolutionary Algorithms: Empirical Results. Evolutionary Computation, 2000, Vol.8(2): 173～195
131 E. Zitzler and L. Thiele. Multiobjective Evolutionary Algorithms: A Comparative Case Study and the Strength Pareto Approach. IEEE Transactions on Evolutionary Computation, 1999, Vol.3(4): 257～271.
132 Frank Kursawe. A Variant of Evolution Strategies for Vector Optimization. In H.-P. Schwefel and R. M"anner, editors, Parallel Problem Solving from Nature. Berlin, Springer, 1991: 193～197
133 Jomikow C Z, Michalewicz Z. An Experimental Comparison of Binary and Floating Point Representations in Genetic Algorithm. Proc of ICGA, 1991:31～36
134 Reeves CR(Ed).Modern Heuristic Techniques for Combinatorial Problems. Oxford: Blackwell Scientific Publications, 1993
135 Srinivas M, Patnaik L. M. Adaptive Probabilities of Crossover and Mutations in GAs. IEEE Trans. On SMC, 1994, 24(4): 656～667
136 Goldberg D E, Korb B, Deb K. Messy Genetic Algorithms: Motibvation, Analysis and First results. Complex systems, 1989(3): 493～530
137 J. David Schaer. Multiple Objective Optimization with Vector Evaluated
Genetic Algorithms. In John J. Grefenstette, editor, Proceedings of an International Conference on Genetic Algorithms and Their Applications. Pittsburgh, PA. Sponsored by Texas Instruments and U.S. Navy Center for Applied Research in Articial Intelligence (NCARAI), 1985: 93～100
138 Carlos M. Fonseca and Peter J. Fleming. Genetic algorithms for multiobjective optimization: Formulation, discussion and generalization. In Stephanie Forrest, editor, Proceedings of theFifih International Conference on Genetic Algorithms. San Mateo, California. Morgan Kaufmann, 1993: 416～423
139 吕红霞等．技术站调度决策支持系统的研究——到发线的合理使用[J]．西南交通大学学报．2000，Vol．35：255～258．
140 James F. Allen. Towards a general theory of action and time. Artifical Intelligence. 1984. Vol.23:123～154
141 J. F. Allen. Analyzing intention in utterances. Artificial Intelligence. 1980. Vol. 15:143～178
142 Mays. E., A modal temporal logic for reasoning about change. Proc. 21st Meeting, Association for Computational Linguistics (MIT, Cambridhe, CA), 1983
143 Jensen TR, Toff B. Graph coloring problems. New York: Awiley-Interscience Publication, 1995
144 Bondy J A, Mruty USR. Graph theory with application. The Macmillan Press LTD. London, Basingtokea and New York, 1976
145 Gibbons. A algorithm graph theory. Cambridge University Press. 1985
146 Hsiao-liang Fang. Investigating genetic algorithms for scheduling. Dissertation of Ph. D. of University of Edimburg.
147 Michael P. Fourman. Compaction of symbolic layout using genetic algorithms. Proceedings of an International Conference on Genetic Algorithms and Their Applications, Pittsburgh, PA. Sponsored by Texas Instruments and U.S. Navy Center for Applied Research in Articial Intelligence (NCARAI). 1985:141～153
148 J. D. Knowles and D. W. Corne. The pareto archived evolution strategy: A new baseline algorithm for pareto multiobjective optimisation. In Congress on Evolutionary Computation(CEC99), Piscataway, NJ. IEEE Press, 1999,
Vol.1: 98～105
149 P. Hajela and C.-Y. Lin. Genetic search strategies in multicriterion optimal design. Structura Optimization, 1992, Vol.4:99～107
150 Hisao Ishibuchi and Tadahiko Murata. Multi-objective genetic local search algorithm. In Proceedings of 1996 IEEE International Conference on Evolutionary Computation (ICEC'96), Piscataway, NJ. IEEE Press, 1996: 119～124
151 Eckart Zitzler, Marco Laumanns, and Lothar Thiele. Improving the strength pareto evolutionary algorithm. Technical Report 103, Computer Engineering and Networks Laboratory (TIK), Swiss Federal Institute of Technology (ETH) Zurich, Gloriastrasse 35, CH-8092 Zurich, Switzerland, May 2001.
152 G. Rudolph and A. Agapie. Convergence properties of some multiobjective evolutionary algorithms. In Congress on Evolutionary Computation (CEC 2000), Piscataway, NJ. IEEE Press, 2000, Vol.2:1010～1016
153 Marco Laumanns, Lothar Thiele, Kalyanmoy Deb, and Eckart Zitzler. On the convergence and diversity-preservation properties of multi-objective evolutionary algorithms. Technical Report 108, Computer Engineering and Networks Laboratory (TIK), Swiss Federal Institute of Technology (ETH) Zurich, Gloriastrasse 35, CH-8092 Zurich, Switzerland, May 2001.
154 K. Deb, S. Agrawal, A. Pratap, and T. Meyarivan. A fast elitist nondominated sorting genetic algorithm for multi-objective optimization: NSGA-Ⅱ. Parallel Problem Solving from Nature PPSN Ⅵ, Berlin. Springer.
155 Carlos A. Coello Coello. Constraint-handling using an evolutionary multi-objective optimization technique. Civil Engineering and Environmental Systems, 2000, Vol. 17:319～346.
156 Jonathan Wright and Heather Loosemore. An infeasibility objective for use in constrained pareto optimization. Proceedings of the First International Conference on Evolutionary Multi-CriterionOptimization (EMO 2001), Lecture Notes in Computer Science, Berlin. Springer-Verlag, 2001, Vo1.1993:256～268
157 Carlos M. Fonseca and Peter J. Fleming. Multiobjective optimization and multiple constraint handling with evolutionary algorithms part I: A unied formulation. IEEE Transactions onSystems, Man, and Cybernetics, 1998,
Vol.28(1):26～37.
158 Kalyanmoy Deb. Multi-objective optimization using evolutionary algorithms. Wiley, Chichester, UK, 2001.
159 Kaisa Miettinen. Nonlinear multiobjective optimization. Kluwer, Boston, 1999.
160 E. Zitzler, K. Deb, L. Thiele, C. A. Coello Coello, and D. Come. Proceedings of theFirst International Conference on Evolutionary Multi-Criterion Optimization (EMO 2001), Lecture Notes in Computer Science, Berlin, Germany, 2001, Vol.1993
161 Stefan Bleuler, Martin Brack, Lothar Thiele, and Eckart Zitzler. Multiobjective genetic programming: reducing bloat by using SPEA2. In Congress on Evolutionary Computation (CEC-2001), Piscataway, NJ. IEEE, 2001: 536～543.
162 Wolfgang Banzhaf, Peter Nordin, Robert E. Keller, and Frank D. Francone. Genetic Programming, 1998
163 L. Hennig, C. B"uche, and E. Sch"afer. Degradation of phytochrome and the high irradiance response in arabidopsis: A genetic analysis. Plant, Cell and Environment, 2000, Vol.23:727～734
164 严余松．单线铁路平行运行图通过能力的遗传算法．2000，Vol．35(3)：277～279
165 刘强．编制摘挂列车调车作业计划软件的开发．铁道运输与经济．2000(2)：22～29
166 刘昆，颜钢锋．采用混合策略遗传算法求解一类资源约束最短时间调度问题．系统工程．2000．Vol．18(6)：33～37
167 颜钢锋，孟睿，刘昆．采用混合单亲遗传算法求解一类资源——时间优化问题．系统工程理论与实践．2001(11)：75～79
168 陈莉．混合遗传算法及应用．四川师范大学学报．1998．Vol．21(5)：553～558
169 杨莉．混合遗传算法设计方法的探讨．湖北师范学院学报．2000，Vol．20(3)：69～73
170 乔建忠，雷为民等．混合遗传算法研究及其应用．小型计算机系统．1998，Vol．19(12)：14～19
171 Hesser J, Miunner R. Investigation of M-Heuristic for Optimal Mutation Probabilities. In: Proc Int Conf on Parallel Problem Solving from Nature,
Netherlands, 1992.
172 Schradoph N N, Belew RK. Dynamic Paremeter's Encoding for Genetic Algorithms. Machine Learning, 1992,9(1):9～21
173 Mahfoud S W. Crowding and Pre-selection Revisited. In: Proc Int on Parallel Problem Solving from Nature, Netherlands, 1992
174 黄梯云．智能决策支持系统．电子工业出版社．2001
175 刘晶珠．决策支持系统导论．哈尔滨工业大学出版社，1990
176 张雪风等．决策支持系统中的模型及模型库管理系统．计算机研究与发展．1993(3)
177 P.E.Lehner. Investigating Theories of Decision Support: Aperspective. Information and Decision Technologies. 1989(15)
178 Fedoriwicz. Representing Modeling Knowledge in an Intelligent Decision Support Systems. Decision Support Systems. 1986,Vol.2(1): 3～14
179 Ghiaseddin. An Environment for Development of Decision Support Systems. Decidion Support Systems. 1986:195～212
180 Blanning. An Entity-relationship Approach to Model Management. Decision Support Sytems. 1986(2): 65～72
181 Jian Ma. An Object-oriented Modeling Framework for Model Management. Decision Support Systems. 1995(13): 133～139.
182 周泓．决策支持系统的多层知识表达与分布式求解研究．系统工程．1995，13(1)：55～58
183 J. Fedorowies, G.B. Wukkuans. Representing Modeling Knowledge in an Intelligent Decision Support System. Decision Support Systems. 1986(1)
184 R. H. Bonczek, C. W. Holsapple, A. B. Whinston. Future Direction of Decision Support Systems. Decision sciences. 1980: Vol. 11(4)
185 李东．一个基于知识的 DSS 模型管理系统概念框架．系统工程理论与实践．1990，Vol．4：42～47
186 1 Robert H. Bonczek, Chyde W. Holsapple, Andrew B. Whinston. Foundations of Decision Support Sytems. Academic Press Inc.
187 William C. House. Decision Support Systems: A Data-based, Model Oriented, User Developed Discipline. Petrocelli Books, 1983
188 Robert J. Thierauf. Decision Support Systems for Effective Planning and Control a Case Study Approach. Psentice-Hall, Inc.
189 冉毅群．管理科学及决策方法．吉林大学出版社．1988
190 黄孟藩．决策概论．浙江教育出版社．1989
191 朱克强．企业发展战略规划模式及其基于知识的决策支持系统设计．中国人民大学博士学位论文．1992
192 顾培亮．决策支持系统设计思想的探讨．决策与决策支持系统．1992，Vol．2(2)
193 陈文伟，黄金来，陈元．决策支持系统新式结构体系．决策与决策支持系统．1998，Vol．1(3)：54～60
194 肖勇，陈意云．用遗传算法构造决策树．计算机研究与发展．1998，Vol．35(1)：49～52
195 W. B. Rouse, W. H. Copy. A Theory-based Approzch to Supporting Design Taking and Problem Solving. Information and Decision Technologies. 1989(15)
196 刘建国，刘晶珠，黄梯云．微型机决策支持系统生成器的设计研究．哈尔滨工业大学学报．1991，Vol．24(1)
197 李一军．基于框架知识库的 IDSS 研究．哈尔滨工业大学博士论文．1991
198 E. A. Woods. A Knowledge Representation Framework Integrating Qualitative Reasoning and State Space Modeling. Decision Support Systems and Qualitative Reasoning. 1991
199 刘金兰等，关于决策支持系统开发项目的风险分析．决策与决策支持系统．1994，Vol．4(2)：105～109
200 王孝通，杨德礼，邓贵仕．模型管理核心问题研究．决策与决策支持系统．1996，Vol．6(2)：15～24
201 吴菲，黄梯云．遗传算法在基于二元决策树的模型选择中的应用．管理科学学报，1999，Vol．22：57～61
202 刘树安，郑秉霖，王梦光等．改进 Gas 在大规模资源分配问题中的应用．信息与控制，1998，27(4)109～112