摘要
集装箱运输的产生和发展使货物运输产生了新的变革,其优越性已得到全世界的公认。我国铁路集装箱运输与国外相比,仍存在较大差距。面对铁路集装箱运输存在的问题和当前的趋势,逐步改善运输条件,加快铁路集装箱运输系统的发展是十分必要的,而结点站的建设是实现铁路集装箱运输根本转变的关键所在。
结点站间集装箱班列运输组织的研究,对于指导我国铁路集装箱结点站设计、建设和运营具有重要作用。论文以理论研究为主,充分借鉴和参考以往的研究成果,采用系统的观点和类比的方法,运用运输组织、离散数学、最优化理论、系统科学等学科的相关理论,对结点站间集装箱班列组织相关的参数和模型展开了深入的研究。本论文的研究内容主要包括以下几个方面:
(1) 通过对国内外集装箱运输组织形式的分析,结合我国集装箱结点站的具体功能和作业流程,确定了结点站之间采用集装箱班列的运输组织形式和组织原则。深入分析铁路运输组织系统的结构、功能和特点,提出了铁路集装箱班列运输组织的客运化思想。
(2) 在分析和借鉴已有车流径路选择优化模型的基础上,构建了重箱流径路选择的多目标0-1优化模型,并经过对相关算法的研究和分析,选择DBFS和GP作为模型的求解方法。
(3) 运用随机过程的相关理论对集结过程进行分析,将集装箱的到达过程描述为一个典型的标值计数过程,为集装箱集结消耗与相关统计参数之间函数关系的研究,确立了相应的理论基础,并得出了集结消耗的计算公式。
(4) 通过对班列编成箱数的分析,得出箱流的重、空状态不会对班列的编成产生影响。系统分析了影响集装箱中转停留时间消耗的相关因素,并确定了相应的计算方法。
(5) 在分析和借鉴已有编组计划模型的基础上,系统的描述了模型的抽象数学结构,构建了班列开行方案的优化模型。在着重分析了相关算法的适应性和有效性后,提出用GA来求解模型的思路。将构建的优化模型转化为适宜GA的BLP,针对模型的特点设计了与之相适应的协同多群体GA,同时分析了算法的复杂性。
第n页
西南交通大学博士研究生学位论文
(6)对已有空载运输工具调配模型的不足进行了分析,为了解决重空箱
流径路的一致性要求,构建了重箱流径路和空箱调配的协同优化模型,提出采
用系统模拟的方法将模型转化为二级祸合反馈系统或二级串联反馈系统进行
处理的求解策略。
(7)通过对集装箱办理站的功能和作业流程分析,提出了结点站所在枢
纽范围内集装箱运输的三种不同形式,利用数学模型对它们进行比较后,得出
了方案选择和运输组织的原则。
论文的研究涵盖了关于结点站间集装箱班列开行方案优化的主要相关内
容,以期成为一个相对完整的理论体系,使之能为班列开行方案的优化与制定
提供一定的理论支持和参考,以及对结点站的建设起到一定的促进作用。
关键词:集装箱结点站;集装箱班列;运输组织;模型:算法
The superiority of containerized transport has already got generally acknowledging, that leads to a reform occurring in freight transportation field. Yet the greater disparity still exists when comparing the containerized transport mode of our country with abroad ones and other transport ways. Such being the case, it becomes very essential to gradually improve the requirements for transportation and to quicken the development of container transportation network. However, the key point to realize the radical conversion of the railway containerized transport lays in the construction of the railway network container freight stations (RNCFS).The study on containers transport organization between RNCFS counts much for guide of the design, construction, and operation of the RNCFS. The thesis takes theoretical research as the core, references the outcome of the past research and adopts the systematic view and analogy method, with applying such correlative theories as transport organizing, dispersed mathematics, optimization theory and systematic science, etc. to study deeply on the parameters and models relevant to containers transport organization between RNCFS. The contents of the thesis include the following several aspects mainly:(1) Through an analysis of organization forms of domestic and international containerized transport and the combination of concrete function and operation procedure of RNCFS, the transport organization mode and principle the block container train(BCT) being arranged between RNCFS are confirmed. Furthermore, on the basis of the thorough analysis of structure, function and characteristic of the railway organization network, puts forward the meaning of passengerized transport organizing of BCT organizing as well.(2) On the basis of analysis and reference to the optimization model of wagon flow routing, a multi-objective 0-1 programming model is established to deal with the loaded container routing, and at the same time, DBFS and GP as solving method are selected after the research
and analysis of relevant algorithm.(3) Employing relevant theory of stochastic process to analyze the accumulation process and describing arrival course of container as a typical mark value counting process, the thesis establishes the corresponding theoretical foundation for the research on functional relationship of container accumulation loss and relevant statistical parameters, in addition to draw calculation formula of accumulation loss.(4) Through analysis of the number of BCT, it has been concluded that whether container flow is loaded or empty won't affect the number of BCT. The corresponding calculating method is confirmed through the systematic analysis of the relevant factors influencing the time loss of detention in transit.(5) On the basis of analyzing and utilizing the existent classification planning model, the thesis describes its abstract mathematic structure and builds an optimization model for BCT scheduling. And then, after analyzing the adaptability and validity of relevant algorithms emphatically, brings forward the thinking solving the model with GA. Thus, the optimization model is turned to BLP suitable for GA and the cooperation multi-colony GA is designed to fit in with the peculiarity of the model, and at the same time, the complexity of the algorithm got analyzed.(6) To meet the consistency requirement of the loaded and empty BCT routing, the analysis of the disadvantages of the present empty transportation shunting model is carried and cooperated optimization model that blends empty container with loaded container routes is built. The solving strategy the thesis adopts is to transform the model into the second coupling feedback system or the second series feedback system with the use of systematic simulation means.(7) Through analyzing of the function and operating procedure of the container regional station, lays the three different form of container transport within the range of RNCFS pivot. In the end, the principle
引文
[1] 徐淑芬.发展集装箱运输——世界货物运输改革的总趋势[J].铁道装卸与集装箱运输.1991(2):6-11.
[2] 铁道部发展计划司.铁路集装箱中心站前期工作成果汇编[G].成都:铁道第二勘察设计院,2003:1-8,13-24,42-46,83-84,107-140,251-258,275-315,367-408.
[3] 杨国源.开办集装箱中转站发展海铁联运门到门运输[J].铁道装卸与集装箱运输.1991(1):18-20.
[4] 钟经华,钱馨一.我局国际集装箱联运的现状与发展对策[J].铁道装卸与集装箱运输.1991(1):20-22.
[5] 铁道第三勘测设计院.铁路集装箱结点站设计暂行规定[S].成都:铁道第二勘察设计院,2002:3-5,6-7.
[6] 铁道第三勘察设计院,《铁路集装箱结点站设计暂行规定》条文晚明[S].成都:铁道第二勘察设计院,2002.3,31-36.
[7] 叶宇海.上海港国际集装箱班轮运输市场的系统动力学模型与分析[D].上海交通大学,工学硕士.2003.
[8] 荣朝和,魏际刚,胡斌.集装箱多式联运与综合物流:形成机理及组织协调[M].北京:中国铁道出版社,2001.
[9] 朱晓宁.集装箱多式联运通道规划理论与方法[M].北京:中国铁道出版社,2002:88-96.
[10] Xie Ruhe and Tang Qiusheng. A Study for the Optimization of Container Liner Routes Transport Organization. In: Proceedag of ICCTS2002[C]. Kelvin C. P. ed. ASCE, 2002: 433-438.
[11] Guo Zijian, Yuan Yongbo and Liu Hangyi. A Port, Choise Model for International Container Transship Based on Genetic Algorithms [A]. In: Kelvin C. P. Wang ed. Proceedings of ICTTS 2002[C]. ASCE, 2002: 516-521.
[1
[12] 刘恒江.集装箱空箱调运分析[J].集装箱化.2001(10):11-13,26.
[13] 王平,武振业.集装箱调配系统的要素分析及目标评判[J].西南交通大学学报(社会科学版).2004,5(1):16-20.
[14] Shen W. S., Khoong C. M.. ADSS for empty container distribution planning [J]. Decision Support System. 1995, 15 (1): 75-82.
[15] Teoor Gabriel Crainic, Michel Gendreau, Pierre Dejax. Dynamic and stochastic models for the allocation of empty containers [J]. Journal of the Operational Research Society. 1992, 43 (10): 102-126.
[16] 周红梅,方芳.航运集装箱空箱调运优化模型的研究[J].武汉理工大学学报(交通科学与工程版).2003,27(3):384-387.
[17] 施欣.内陆集装箱运输环境下的空箱调运策略与租箱策略的数字仿真分析[J].交通运输工程学院.2002,2(2):114-119.
[18] Liu Zuoyi and Li Qin. Measures to Promotes Railway Container Transportation in China[A]. In: Proceedings of ICTTS 2002 [C], Kelvin C. P. Wang ed. ASCE, 2002: 413-418.
[19] Zhu Xiaoming and Yang Hualong. Forecasting Method of the Quantities of Export Container by Shenzhen Region[A]. In: Proceedings of ICTTS2003 [C]. Kelvin C. P. Wang ed. 2002: 510-515.
[20] Yang Zan and Zeng Zhaobao. The Planning and Management strategy for Chinese Container Terminals with Game Theory[A]. In: Kelvin C. P. Wang ede. Proceedangs of ICTTS 2002[C]. ASCE, 2002: 126-131.
[21] 张得志,谢如鹤,黄孝章.铁路集装箱空箱调度模型及求解算法[J].中国铁道科学,2003,24(3):125-129.
[22] 贺国先,刘凯,李民生.铁路集装箱空箱安全高效调拨的计算机算法[J].中国安全科学学报,2003,13(11):21-24
[23] 闫海峰,彭其渊,殷勇.集装箱班列编组计划优化模型研究[J].铁道学报.2003,25(5):14-18.
[24] 彭其渊,闫海峰,周勇.集装箱班列编组计划相关因素分析[J].中国铁道科学.2003,24(5):120-123.
[25] 周勇,彭其渊,闫海峰.结点站吸引范围内集装箱运输组织方式研究[J].中国铁道科学.2003,24(6),124-128.
[26] 谢保锋.铁路集装箱中转配装决策支持系统的研究[J].铁道学报.1999,21(0):14-18.
[27] 铁道第三勘察设计院.上海铁路集装箱结点站可行性研究说明书[R].天津:铁道第三勘察设计院,2002:1-3,14-15,49-52,56-58.
[28] 铁道第三勘察设计院.哈尔滨集装箱结点站可行性研究说明书[R].天津:铁道第三勘察设计院,2002:5-7,9-16,55-62,71-82.
[29] 周殿佩,张欣元.国外铁路集装箱运输[M].北京:中国铁道出版社,1981:1-9,41-89.
[30] 柯兹洛夫.集装箱运输管理自动化[M].蓝孙年,杨兆辉译.北京:中国铁道出版社,1992,1-39,65-76.
[31] 孙敏.集装箱运输业务[M].北京:人民交通出版社,1997:1-4.
[32] 郭文超.中国铁路集装箱运输[M].北京:中国铁道出版社,1996:34-57,71-89.
[33] 姜璐,李克强.简单巨系统演化理论[M],北京师范大学出版社,2002:243,255.
[34] 杨志刚.国际集装箱多式联运完备与法规[M].北京:人民交通出版社.2001:390-396 45-56.
[35] 许国志.系统科学.上海:上海科技教育出版社,2000:17-30,31-36,
[36] 许国志.系统科学与工程研究[M].上海:上海科技教育出版社,2000.
[37] 汪应洛.系统工程理论.方法与应用[M].北京:高等教育出版社,1998: 1-15.
[3
[38] 刘舒燕.交通运输系统工程[M].北京:人民交通出版社,2002:1-10,24-43.
[39] 林祖乙等.国际集装箱运输[M].北京:人民交通出版社,1997:1-35,261-300.
[40] 铁道第二勘察设计院,西南交通大学.铁道部经济规划研究院.铁路集装箱运输组织专题研究研究报告[R].成都:西南交通大学.2002.
[41] 中华人民共和国铁道部.铁路集装箱运输“十五”发展计划(铁计[2001]134号文附件4)[Z],2001.
[42] 李江灿.浅谈加快集装化运输的发展[J].铁道部与集装箱运输.1991(2):22-25.
[43] 索占鸿.铁路集装运输[M].北京:中国铁道出版社,2001:10-17,61-68.
[44] 中华人民共和国铁道部.集装化运输规章汇编[S].北京:中国铁道出版社,1995:1-16.
[45] 郑时德,吴汉琳.铁路行车组织[M].北京:中国铁道出版社,1996:40-44,98-100.
[45] 施其洲,施勇.具有双向、空重车流的路网车流径路多目标线性规划模型及算法[J].铁道学报.1999,21(1):1-8.
[46] 林柏梁.直达与区段列车编组计划及车流径路的整体优化方法[J].铁道学报.1996,18(5):1-7.
[47] 林柏梁,朱松年.路网上车流径路与列车编组计划的整体优化[J].铁道学报.1996,18(1):1-7.
[48] 施其洲.铁路网络系统运输能力与车流路径模型[J].铁道学报.1996,18(4):1-8.
[49] 林柏梁,朱松年,陈竹生等.路网上车流径路优化的0-1规划模型及其合理径路集生成集法[J].铁道学报.1997,19(1):7-12.
[50] 孙晚华,郑时德.铁路车流径路优化算法的研究[J].北方交通大学学报.1995,19(增刊):39-44.
[51] 史峰,孔庆钤,胡安洲.车流径路与编组计划综合优化的网络方法[J].铁道学报.1997,19(1):1-6.
[52] 林柏梁,彭辉,任保国.铁路网上带权重的车流径路优化方法[J].北方交通大学学报.1996,20(6):645-650.
[53] 林柏梁.车流运行径路与列车编组计划的整体优化模型及模拟退火算法[D].西南交通大学,工学博士.1994.
[54] 胡思继.铁路行车组织[M].北京:中国铁道出版社,1998:110-114,118-121,138-154.
[55] 孙晚华,张永臣.确定车流最短径路的CN模型及算法[J].铁道学报.1999,21(5):106-108.
[56] 查伟雄,秦作睿.路网上车流径路最优配流法[J].北方交通大学学报.1997,21(3):259-263.
[57] 李引珍,顾守淮.铁路网络两顶点间最短路径定向搜索算法[J].铁道学报.1997,19(2):25-27.
[58] 周培德.交通道路网中任意两点之间最短路径的快速算法[J].计算机工程与科学.2002,24(4):35-37.
[59] 张远福,时连强.车辆路径问题的一个启发式算法[J].河北建筑科技学院学报.2002,19(3):81-84.
[60] 王甦男,冯育麒.车流径路域研究[J].铁道学报.1996,18(增刊):20-24.
[61] 王苏男,宋伟,姜文生.最短路径算法的比较[J].系统工程与电子技术,1994年第5期:43-49.
[62] 徐建华.现代地理学中的数学方法[M].北京:中国科学出版社,2002.
[63] 《现代数学手册》编纂委员会.现代数学手册·经济数学卷[K]武汉:华中科技大学出版社,2001:211-240,241-270,305-348,349-397.
[64] 何邦模,王国玉,陈元龙等.关于车辆集结参数的研究[J].铁道运输与经济.1992,14(4):59-66.
[65] 王慈光.描述简单货车集结过程的群论模型[J].铁道学报.1994,16(3):66-77.
[66] 史峰,李致中.集结耗费的计算公式[J].铁道学报.1992,14(4):35-41.
[67] 邓永录,梁之舜.随机点过程及其应用[M].北京:科学出版社,1992:18-28,109-113,30-36,298-302,319-326.
[68] 侯振挺等.生灰过程[M].长沙:湖南科学技术出版社,2000:135.
[69] S.M.Sheldon M.Ross.随机过程(STOCHASTIC PROCESSES)[M].何声武,谢盛荣,程依紧译.北京:中国统计出版社:1997:734-40,89-96.
[70] 盛骤,谢式千,潘承毅.概率论与数理统计[M].北京:高等教育出版社,1993:99-125,316-324.
[71] 钟莱,刘文译.概率论教程[M].上海:上海科学技术出版社,1989.
[72] 《现代数学手册》编纂委员会.现代数学手册·随机数学卷[K]武汉:华中科技大学出版社,2000:49-106,537-594.
[73] 林柏梁.机车长交路条件下的技术站列车编组计划无调作业参数模型[J].铁道学报.1999,21(6):6-9.
[74] 曹家明.铁路网上车流组织的综合优化[D].西南交通大学,工学博士.1992.
[75] 朱松年,曹家明,赵强等.车流组织综合优化[J].铁道学报.1993,15(3):59-69.
[76] 朱松年.《离散数学规划》讲义[H].成都:西南交通大学.2000.
[77] 彼得·哈默,刘彦佩.组合最优化中的布尔方法[J].数学研究与评价.1990(10):300—313.
[78] Ronald N.Giere.用模型描述实在[A].见:Lorenzo Magnani,Nancy J.Nersessian,Paul Thagard.科学发现中的模型化推理[M].于祺明,王天 思译.北京:中国科学技术出版社,2001:157-174.
[7
[79] Vasilis Raisis.模型的扩展与辩护.Galileo Galilei的范例[A].见原:Loereuzo Magnani,Nancy J.Nersessim Paul Thagard.科学发现中的模型化推理[M].于祺明,王天恩译.北京:中国科学技术出版社,2001:137-174.
[80] 徐利台.数学方法论选讲[M].武汉:华中科技大学出版社,2002:15-20.
[81] 《数学辞海》编辑委员会.数学辞海[K].北京:中国科学技术出版社,2002:8-10,26-28,99-106,366-382,446-457.
[82] 陈志平,徐宗本.计算机数学——计算复杂性理论与NPC.NP区问题的求解[M].北京:科学出版社,2003:68-75,137-206,240-242.
[83] 王树禾.图论及其算法[M].合肥:中国科学技术大学出版社,1990:246-249.
[84] 《现代数学手册》编纂委员会.现代数学手册·近代数学卷[K].武汉:华中科技大学出版社,2001:107-146.
[85] Frank R. Giordano, Mamice D. Weir and William P. Fox. A first Course in Mathematical Modeling [M]. Third Edition. Bejing: China Machine Press, 2003.
[86] Diestel Reinhard, Graph Theory [M]. Second Edition. Springer-Vorlag New York,Inc.,2000.北京:世界图书出版公司分公司.2003.
[87] 史峰,李致中,孙焰等.列车编组计划网络优化方法[J].铁道学报.1994,16(2):74-79.
[88] 李映红,吴世贵,彭其渊.货物列车编组计划网络模型的建立及算法[J].西南交通大学学报.2002,37(1):68-71.
[89] 查伟雄,秦作睿.路网上列车编组计划的有利去向模型及其网络流算法[J].铁道学报.1998.20(2):12-18.
[90] 李静,王建中.组合最优化与车流组织方案[J].华北工学院学报.2001,22(2):116-120.
[91] 《现代数学手册》编纂委员会.现代数学手册·计算机数学卷[K] 武汉:华中科技大学出版社,2001:561-640,641-577,677-703,703-727.
[92] 姚瑞枫,宋玉阶.多维0-1背包问题的混合遗传算法[J].武汉科技大学学报(自然科学版).2003,26(2):114-117.
[93] 靖稳峰,魏红,段惠娣.遗传算法及其发展现状[J].西安工业学院学报.2000,20(3):230-235.
[94] 李敏强,寇纪淞,林丹,李书全.遗传算法的基本理论与应用[M].北京:科学出版社,2002:4-5,26-65,75-82,120-148,163-208,233-244,387-399.
[95] 田军,寇纪淞,李敏强.遗传算法在运筹学领域的应用研究进展与展望[J].系统工程学院.1998,13(2):101-106.
[96] K. A. De Jong. An analysis of the be hewer of a class of genetic adaptive systems[D]. Ph. D. Dissertation. University of Michigan, 1975.
[97] Dobzhansky.T.遗传学与神物起源[M].谈家桢等译.北京:科学出版社,1964.
[98] 黄海滨.遗传算法中遗传算子的分析[J].玉林师范学院学报(自然科学版).2001,22(3):17-20.
[99] D. E. Goldberg, K. Deb, H. Kargudta and G. Rapid. Harik. Aureate optimization of difficult problems using fast messy genetic algorithms[A]. In: L. D. whiteey ed. Proceedings of Fifth International Conference on Genetic Algorithms (ICGAS) [C], San Mateo, CA: Morgan Kaufman, 1993: 56-64.
[100] J. R. Koza. Genetic programmingl[M]. Cambridge, MA: The MIT Press, 1992.
[101] J. R. Koza. Genetic programming 1. Cambridge[M]. MA: The MIT Press, 1992.
[102] L. Davis. Handbook of genetic algorithms[K]. Van Nostrand Reinhold, New York, 1991.
[103] 李大卫.可重复自然数编码遗传算法的最优群体规模[J].鞍山钢铁学院学报.2000,23(6):419-423.
[104] D. E. Goldberg. Sizing populations for serial and parallel genetic algorithms[A]. In: J. D. Schaffer ed. Proceeding of the Third International Conference on Genetic Algorithms (ICGA3), Sam Mateo, CA: Morgan Kanfmann Publishers, 1989: 70-79.
[105] D. E. Goldberg and J. Richardson. Genetic algorithms with sharing for multi-model function optimization[A]. In: J. J. Grefenstette ed. Proceedings of the second International conference of Genetic Algorithms (ICGA2) [C]. Hillsdale, NJ: Lawrence Erlbaum Associates, 1987: 41-49.
[106] D. E. Goldberg and M. Rudnick. Genetic algorithms and the variance of fitness [J]. Complex Systems. 1991 (5): 265-278.
[107] J. D. Schaffer, L. J. Eshelman and D. offatt. Spurious correlations and premature convorgence[A]. In: G. (Ed) Rowlins. Foundations of Genetic Algorithms, san Mateo, CA: Morgan Kaufmann, 1991: 102-112.
[108] W. Feller. An introduction to probability theory and its applications[M], vol. 2. New York: John Wiley & Sons Inc, 1971.
[109] D. E. Goldberg, K. Deb and J. H. Clark. Genetic algorithms, noise, and the sizing of populations[J]. Complex Systems. 1992 (6): 333-362.
[110] B. Miller and D. E. Goldberg. Genetic algorithms, selection schemes, and the varying effects of noise[J]. Evolutionary Computation. 1996, 4 (2): 25-49.
[111] 杨林美,魏忠民,郭科等.初始群体雪风移遗传算法用于解混和整数非线性规划问题[J].物探化探计算技术.2003,25(3):253-258.
[112] 徐宗本,陈志平,章祥荪.遗传算法基础理论研究的新近发展[J].数学进展.2000,29(2):97-114.
[113] Y. Rabinovich and A. Wigderson. An analysis of a simple gonetic algorithms [A]. In Proceedings of the Fourth International Conferonce on Genetic Algorithms[C]. San Mates: Morgan Kauofmann, 1991: 215-221.
[1
[114] J. Suzuki. A Markov chain analysis on simple genetic algorithms[J]. IEEE Transactions on Systems, Man and Cybernetics. 1995 (25): 655—659.
[115] S. Voget. Theoretical analysis of genetic algorithms with infinite population size[J]. Complex Systems. 1996 (10): 167—183.
[116] Y. Gao Stochastic Model, Theoretical Analyses and Applications of Genetic Algorithms[D]. Xi'an Jiaotong University, Ph. D. 1997.
[117] R. Salomon Raising theoretical questions about the utility of genetic algorithm[A]. Evolutionary Programming 4, Lecture Notes in Computer Science 1213. 1997: 275-284.
[118] U. K. Chakraborty and D. K. Dastidar. Using reliability analysis to estimate the number of generations to convergence in genetic algorithms[J]. Information Processing Letters. 1993, 46: 199-209.
[119] H. Aytug and D. G. Koehler. Stopping critenia for finite length genetic algorithms [J]. INFORMS Journal on Computing, 1996, (8): 183-191.
[120] 傅清祥,王晓东.算法与数据结构[M].北京:电子工业出版社,2001:1-16,252-267,295-298.
[121] Michael Sipser.计算理论导引[M].张立界,王捍詹,黄雄译.北京:机械工业出版社,2000:112-124,147-174.
[122] C. A. Ankenbrandt. An extension to the theory of convergence and a proof of the time comptexity of genetic algorithms[A]. Foundations of Genetic Algorithms[M]. San Mateo: Morgan Kcufmann, 1991: 53-68.
[123] 解伟,王翼飞.混合遗传算法的收敛性研究[J].上海大学学报(自然科学版).1998,4(1):1-6.
[124] 韩炜,廖振鹏.一种全局优化算法:遗传算法——单线形法[J].地震工 程与工程振动.2001,21(2):6-12.
[1
[125] 韩万林,张幼蒂.遗传算法的改进[J].中国矿业大学学报.2000,29(1):102-105.
[126] 孙艳丰,郑加齐,王德兴等.基于遗传算法的约束优化方法评述[J].北方交通大学学报.2000,24(6):14-19.
[127] Hyun, Myung and Jong-Hwan Kim. Hy brid evoluationary programming for heavily constrained problems[J]. BioSystems, 1996 (38): 29-43.
[128] Z. Michalewiz. Genetic algorithms, numerical optimization, and constraints[A]. In: L. Eshelman ed. Proceadings of the Sixth International Conference on Genetic Algorithms[C]. San Mateo, CA: Morgan Kaufmann Publishers, 1995: 151-158.
[129] A. Homaifaw, S. Lai and X. Qi. Constrained optimization via genetic algorithms[J]. Simulation, 1994, 62 (4): 242-254.
[130] J. Joines and C. Houck. On the use of nonstationary penalty factions to solve nonlinear constrained optimization problems with Gas[A] In: Z. Michalewicz ed. Proceedings of the First International Conference on Evolutionary Computation[C]. Discatawa, NJ: IEEE Press, 1994: 569-584.
[131] D. Powell and M. Skolnick. Using genetic algorthms in engineering design optimization with nonlinear constraints[A]. In: S. Forest ed. Proceedings of the Sixth International Conference on Genetic Algorithms (ICGA6) [C], San Mateo, CA: Morgan Kaufmann Publishers, 1993: 424-430.
[132] 韩玉兵.遗传算法数学机理分析[J].河海大学学报,2001,29(3):92-94.
[133] 卓德保.基于遗传算法的复杂多峰函数优化[J].郑州航空工业管理学院学报.2003,21(2):14-16.
[134] O. Ben-Aged and C. E. Blair. Computational difficulties of bilevel linear programming[J]. Operations Research, 1990, 38: 556-560.
[135] 刘树安,尹新,郑秉霖等.二层线性规划问题的遗传算法求解[J].系统工程学报.1999,14(3):280-285.
[136] J. H. Holland. Adaptive in natural and artifical systems: An introductory analysis with applications to biology, control, and artifical intelligence[M]. 2nd edition. Cambridge, MA: MIT Press, 1992.
[137] J. J Grefenstette. Optimization of control parameters for genetic algorithms. IEEE Transoction on Systems[J]. Man, and Cybernetics, 1986, 16 (1): 122-128.
[138] M. Srinivas and L. M. Patnaik. Adaptive probabilities of crossover and mutation in genetic algorithms[J]. IEEE Transaction on Systems, Man, and Cybernetics, 1994, 24 (4): 656-667.
[139] W. M Spears and K. A DeJong. Dining with GAS: Operation lunch theorem. In[140], 1997.
[140] W. M. Spears. The role of mutation and recombination in evolutionary algorithms. Ph. D. thesis, George Mason University, Fairfax, VA, 1998.
[141] C.H.Papadimitriou,K.Steiglitz.组合最优化算法和复杂性[M].刘振宏,蔡茂诚译.北京:清华大学出版社,1998:163-167,198-207,395-439,559-586.
[142] 党建武.神经网络在铁路空车调度问题中的应用[J].兰州铁道学院学报.1999,18(1):77-85.
[143] 纪嘉伦,林柏梁,李福志等.用重心优化方法求解铁路网上空车调配问题[J].铁道学报.2001,22(3):109-113.
[144] 刘梅林.用电子计算机进行铁路空车调配的探讨[J].铁道运输与经济.1987,9(6):29-32.
[145] 张济民,施其洲.两阶段多目标空车调整决策支持系统分析[J].上海铁道学院学报.1990(1).
[146] 郭耀煌等.运筹学原理与方法[M].成都:西南交通大学出版社,1994:231-239.
[147] 熊红云,鲁五一,温红艳.铁路空车调配问题的遗传启发算法[J].中国铁道科学.2002,23(4):118-121.
[148] 果鹏文,褚江,林柏梁.用振荡法解大规模路网上的空车调配问题[J].中国铁道科学.2002,23(4):111-117.
[149] 果鹏文,林柏梁,余洋.大规模路网上空车调配的区段中心优化法[J].中国铁道科学.2001,22(2):122-128.
[150] 张喜,张作寿.基于知识约束的空车调整优化方法研究[J].铁道学报.2003,25(6):14-20.
[151] W. W. White, A. M. Bomberault. A network algorithm for empty freight car allocation [J]. IBM System Journal, 1969, 8 (2): 147-169.
[152] Misra SC. Linear Programming of Empety Wagon Disposition[J]. Rail International. 1972 (3): 274-281.
[153] 魏权龄,闫洪.广义最优化理论和模型[M].北京:科学出版社,2003:1-68.
[154] 严余松.铁路集装箱枢纽运输组织研究报告[R].成都:西南交通大学.2004.
[155] 牛惠民.铁路枢纽重空车流组织的协调优化模型及遗传算法[J].铁道学报.2001,23(4):12-16.
[156] 牛惠民,胡宠洲.铁路枢纽车流组织的非线性0-1规划模型及算法[J].铁道学报.2001,23(3):8-12.
[157] 严余松,唐莉,严余伟,罗平.枢纽小运转列车0-1规划模型及其遗传算法[J].系统工程.2000,18(6):67-70.
[158] 林柏梁,胡安洲.重空车流运行组织的协调优化理论及模型[J].铁道学报.1998,20(5):9-14.
[159] 阿库林尼契夫.数学方法在铁路运输中的应用[M].北京:中国铁道出版社,1980.
[160] 叶玉珍,季令.市场经济下空车流调整问题[J].上海交通大学学报.2000,34(增刊):19-26.
[161] Kaj Homborg, Martin Jobom, And T. Lundgren. Improved Empty Freight Car Distribution[J]. Transportation Science. 1998, 32 (2): 163-173.
[162] 李文权,杜文,周贤伟.优化空车调配问题[J].西南交通大学学报.1998,33(4):383-386.
[163] 王登刚,刘迎曦,李守巨.最优化问题全局寻优的混合遗传算法[J].力学学报.2002,34(3):469-473.
[164] 刘海林.大规模全有界变量单关联线性规划的分解算法[J].广东职业技术师范学院学报,2001(4):17-23.
[165] 钟守楠.遗传算法的收敛性与编码[J].武汉水利电力大学学报.2000,33(1):108-112.
[166] 谭志杨.遗传算法的计算效率分析[J].交通与计算机.2001,19(3):17-19.
[167] 杜文,周久军.带上层约束二层线性规划的遗传算法[J].武汉职业技术学院学报.2003,2(2):75-77.
[168] 纪树新.遗传算法解决组合优化问题的可行性研究[J].汽车科技,1999(148):37-39.
[169] 杨旭东,胡恒章,杜士勇.带有成长算子的遗传算法[J].哈尔滨工业大学学报.1999,31(5):44-47.
[170] 周永华,毛宗源.求解约束优化问题的分组比较遗传算法[J].华南理工大学学报(自然科学版).2003,31(2):38-43.
[171] 孙德海,贾鸿雁.网络各点间最短距离的矩阵算未能[J].哈尔滨师范大学自然科学学报.1998,14(2):24-26.
[172] 姜大立,杜文,朱松年.一类二次0-1规划模型的遗传算法[J].系统工程.1997,15(4):21-24.
[173] 杨亚红,刘三阳.非线性整数二层规划的一种算法[J].西安电子科技大学学报(自然科学版).2001,28(2):198-201.
[174] 朱朝艳,郭鹏飞,张旭.谈遗传算法的改进策略[J].辽宁工业学院学报.2001,21(5):15-16,23.
[175] 董聪,郭晓华.广义遗传算法的数学结构[J].中国科学基金(学科进展).1999(2):77-80.
[176] 曹俊,朱如鹏.一种改善遗传算法早熟现象的方法[J].上海大学学报(自然科学版).2003,9(3):229-231,237.
[177] 吴彤.自组织方法论研究[M].北京:清华大学出版社,2001.
[178] 铁道部发展计划司.中铁集装箱运输中心,铁道部及设计院赴加拿大考察铁路集装箱货场考察报告[R].北京:铁道部2003:10-29,35-36.
[179] 铁道部发展计划司.中铁集装箱运输中心,铁道部及各设计院赴美国铁路集装箱货场考察报告[R].北京:铁道部,2003:3-5,9.
[180] 陆汝钤.数学·计算·逻辑[M].长沙:湖南教育出版社,1998:85-94.
[181] 王正志,薄涛.进化计算[M].长沙:国际科技大学出版社,2000.
[182] 郑谏.当代数学的若干理论与方法[M].上海:华东理工大学出版社,2002:141-148.
[183] E.米涅卡.网络和图的最优化算法[M].李家滢,赵关旗译.北京:中国铁道出版社,1984:36-75.
[184] Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein. Introdnetion to Algorithms [M]. Second Edition. The MIT Press, 2002: 620-643.
[185] Zhu Songnian and Zhu Qiang. Network Decomposition and Maximum Independent Set Part Ⅰ: Theoritic Basis [J]. Journal of Southwest Jiaotong University. 2003, 38 (2): 103-121.
[1
[186] 任民.0-1规划的切割压缩寻优法[J].铁道运输与经济.1996,18(4):24-28.
[187] 青学江,熊天文,刘宗局.铁路运输最短径路的二阶求解[J].铁道运输与经济.1996,18(4):28-31.
[188] Masoud Yaghini. He Shiwei, Yang Hao and Hu Anzhou Optimizing Railroad Operating Plans: A compound Freight Routing and Train Scheduling Model[A]. In: Preceedings of ICTTS 2002 [C], Kelvim C. P. Wang ed. ASCE, 2002: 320-325.
[189] P. T. Chan, T. K. Ho and A. B. Rad. Optimization of class of Transportation Problems Using Genetic Algorithms. In: Proceeding of ICTTS 2002[C]. Kelvin C. E Wang ed. ASCE, 2002: 478-485.
[190] Melanie Mitchell. An introduction to genetic algorithms[M]. Cambridge, MA: The MIT Press, 1996.
[191] K. A. De Jong and W. M. Spears. A formal analysis of the role of multi-point crossover in genetic algorithms[J]. Annals of Mathematics and Artificial Intelligence. 1992, 5 (1): 1-26.
[192] W. M. Spears and K. A. DeJong. On the virtues of parameterized uniform crossover[A]. In: R. K. Belew and L. B. Booker eds. Proceedings of the Fourth International Conference on Genetic Algorithms (ICGAS) [S], Sam Mateo, CA: Morgan Kaufman Publishurs, 1991: 230-236.
[193] D. E. Goldberg. Genetic algorithms in search, optimization and machine learning[M]. MA: Addison—Wesley Publishing Company, 1989.
[194] De Jong K. A.. An analysis of the behavior of a class of genetic adaptive systems[D]. University of Michigan, Ph. D Dissertation. NO. 76-9381, 1975.
[195]K.A.DeJong, M.A.Potter and W.M.Spears. Using problem generators to explore the effects of epistasis[A]. In [260], 1997: 338-345.
[196]Reeves and Wright. Epistasis in genetic algorithms: experimental design perspective[A]. In L.J.Eshelman ed. Proceedings of the sixth International Corfrence on Genetic Algorithms (ICGA6) [C]. San Francisco, CA: Morgan Kaufmann Publishers, 1995: 217-224.
[197] Jones. Evolutionary algorithms, fitness landscapes and search[D]. University of New Mexico. Ph.D. thesis. 1995.
[198]D.Beasly, D.R.Bull and P.R.Martin. A sequential niche technique for multi-model function optimization [J]. Evolutionary Computation. 1993, 1 (2): 101-125.
[199]R.K.Belew and M.D.Vose. Fonndations of genetic algorithms 4 [M]. San Francisco, CA: Morgan Kaufmann Publishers, 1997.
[200] B.L.Miller and M.J.Shaw. Genetic Algorithms with dynamic niche sharing for multi-model function optimization [A]. In: IEEE International Conference on Evolutionary Compuation[C], Piscataway, NJ: IEEE Press, 1996: 786-791.
[201] Song Rui, He Shiwer and Yang Yongkai. Combined Genetic Algorithms for Solving the Location Problem of Public Transit Rescuing Centers[A]. In: Kelvin C.P.Wang ed. Proceedings of ICTTS 2002[C]. ASCE, 2002: 959-964.