大规模部队铁路输送研究
|
摘要
我军大规模部队机动的主要方式是铁路输送,要求在一定的路网条件下,依据一定的运输顺序,满足一定的军事和运输要求,短时间内完成分散配置的大批部队向相对集中的一个或多个方向的机动。大规模部队铁路输送运量大、时限紧、要求高,需要做到统筹规划、周密部署、精心组织,其中难点问题众多且关系复杂,急需对此进行深入研究。本文首次对大规模部队铁路输送问题进行了系统分析和理论总结,分析了大规模部队铁路输送的特点、需求与组织结构,阐述了决策优化的理论实质,研究解决了其中的难点和核心问题,提出相关模型与算法,并通过仿真进行验证。论文研究有助于相关决策的科学化与合理化,能够满足军事运输工作的要求,可为大规模部队铁路输送工作提供理论指导和方法借鉴。
论文主要研究以下问题:
(1)大规模部队铁路输送的基础理论研究。论文在分析输送特点、需求与运输条件的基础上,提出了包含决策层、执行层、控制层的分层组织结构,探讨了各层次的职能分工及相互关系。论文将大规模部队铁路输送的决策优化总结为两个基本问题:时间约束-最小容量输送问题(TMCTP)问题与容量约束-最短时间输送问题(CMTTP)问题,分析了两问题的优化处理流程和相互间的密切关系,为决策优化的进一步研究打下基础。
(2)大规模部队铁路输送的输送序列问题。论文在分析输送序列的意义、依据与原则的基础上,提出输送序列问题本质是偏序结构的拓扑排序,设计了“决策序列树”方法求解部队的输送序列,并通过算例给予验证。
(3)大规模部队铁路输送的输送径路问题。论文在分析输送径路选择的要求与原则基础上,提出知识库、案例库、模型推理机相结合的知识案例推理方法(KCBR)选择输送径路。针对多点至多点输送径路选择的不同类型问题,建立了时间-容量约束的最小费用流问题(TLMCFP)、分阶段-时间-容量约束的最小费用流问题(STLMCFP)、时间约束-最小容量费用流问题(TMCCFP)、分阶段-时间约束-最小容量费用流问题(STMCCFP)、最小时间-费用流问题(MTCFP)等模型作为推理基础,设计了“最小费用最早完成流增广”算法及相关改进算法求解上述模型。
(4)大规模部队铁路输送的运行计划问题。论文通过建立数学模型描述了军列运行计划安排问题,在此基础上设计了“固定点号”方法制定并优化运行计划。并基于“固定点号”方法建立了“车站对点号模型”、“多车站对点号模型”、“单径路点号模型”、“多径路点号模型”、“运行时刻模型”等模型。论文提出了分支定界算法和“贪婪点号算法”两种算法求解上述模型并给出算例。
(5)大规模部队铁路输送的仿真分析。论文提出了大规模部队铁路输送的Positivistic Petri网仿真模型,研究了列车仿真运行的模拟方法和对突发事件的处理方法,并结合算例对仿真结果进行了指标分析。
(6)大规模部队铁路输送的保障研究。论文讨论了部队铁路输送与相关保障之间的关系,研究了在考虑车底循环套用情况下车站的车辆需求,并建立了单车站与多车站车辆需求模型。
Rail transportation is the main form of stragetic army transportation of PLA,which under the conditions of the road network,based on certain transport sequence and meeting certain requirements of the military and transportation,transports a large number of troops of scattered distribution to the relatively concentrated areas in one or more direction in a short time.The stragetic army transportation has large shipment,tight time limitation and high requirements,which needs careful plan and organize.These difficult issues and complex relationships urgently need to be studied in-depth.This paper analyzed the characteristics,requirements and organizational structure of strategic army railway transportation,described their decision-making optimization of the essence of the theory,which studied a number of difficult and core issues,and proposed the establishment of related model algorithm and simulation for verification,seeking decision-making process more scientific and rationalization. Paper's main issues are on the following:
(1)To study basic theoretical research of stragetic army rail transportation.Paper analyzed the characteristics,demand and conditions of transport,and put forward hierarchical organizational structure including decision-making layer,implementation layer,control layer,by researching the the division functions and mutual relations of layers Paper summarized the problem in the decision-making two basic issues: Timed-Minimum Capacity Transport Problem(TMCTP)and Capacitied -Minimum Time Transport Problem(CMTTP)problem.Paper analyzed the optimizing processes of the two problems and the close relationship between each other,laying a foundation for further study of decision-making optimizing.
(2)To study the problem of troop transport sequence.Paper analyzed the meaning, principles and requirements of transport sequence,and proposed that the nature of the problem is topological sort from partial order into entire order.Paper designed the Decision-Making Sequence Tree Method(DMSTM)for the delivery of the sequence and to verify through example.
(3)To study the problems of the army transport routes of strategic.Based on analyzing the requirements and principles of route choicing,Paper put forword Knowledge&Case Based Reasoning(KCBR)method to choose trasnsport routes, combining KBS,CBS and model reasoning,and established some models as the push model rationale basis as follws:Time-capacitied Minimum Cost Flow Problem(TLMCFP),Stage Time-Capacitied Minimum Cost Flow Problem(STLMCFP), Timed Minimum Capacity&Cost Flow Problem(TMCCFP),Stage Timed Minimum Capacity&Cost Flow Problem(STMCCFP),Minimum Time&Cost Flow Problem(MTCFP).Paper designed the Minimum Cost Earliest Flow Augmentation Algorithm(MCEFAA)for solving the relevant models.
(4)To study the problem of operational plans of strategic army railway transport. The paper described a mathematical model operating plan,and designed the Fixed-Point Method(FPM)approaching to the development and optimization of operational plans. And based on FPM the paper established Station Point ModeI(SPM),Multi-Station Point Model(MSPM),Route Point Model(RPM),Multi-Route Point Model(MRPM), and Train Schedule Model(TSM)for some specific problems.To solve models above, the paper put forward branch and bound algorithm and Greedy Fixed-Point Algorithm(GFPA)and gave examples of the two algorithms.
(5)To simulate and analyze strategic army railway transport.The paper presented a positivistic petri nets simulation model of strategic army railway transportation,and studied the operation of the train simulation methods and the handling of unexpected events,and gave an example of simulation,the result of which are analyzed by indicators.
(6)To study relevant support of strategic army railway transport.Papers researched the relationship between the railway transportation and relevant support,and studied the cycle vehicle demand of stations,and established a single-station and multi-station vehicle demand model.
论文主要研究以下问题:
(1)大规模部队铁路输送的基础理论研究。论文在分析输送特点、需求与运输条件的基础上,提出了包含决策层、执行层、控制层的分层组织结构,探讨了各层次的职能分工及相互关系。论文将大规模部队铁路输送的决策优化总结为两个基本问题:时间约束-最小容量输送问题(TMCTP)问题与容量约束-最短时间输送问题(CMTTP)问题,分析了两问题的优化处理流程和相互间的密切关系,为决策优化的进一步研究打下基础。
(2)大规模部队铁路输送的输送序列问题。论文在分析输送序列的意义、依据与原则的基础上,提出输送序列问题本质是偏序结构的拓扑排序,设计了“决策序列树”方法求解部队的输送序列,并通过算例给予验证。
(3)大规模部队铁路输送的输送径路问题。论文在分析输送径路选择的要求与原则基础上,提出知识库、案例库、模型推理机相结合的知识案例推理方法(KCBR)选择输送径路。针对多点至多点输送径路选择的不同类型问题,建立了时间-容量约束的最小费用流问题(TLMCFP)、分阶段-时间-容量约束的最小费用流问题(STLMCFP)、时间约束-最小容量费用流问题(TMCCFP)、分阶段-时间约束-最小容量费用流问题(STMCCFP)、最小时间-费用流问题(MTCFP)等模型作为推理基础,设计了“最小费用最早完成流增广”算法及相关改进算法求解上述模型。
(4)大规模部队铁路输送的运行计划问题。论文通过建立数学模型描述了军列运行计划安排问题,在此基础上设计了“固定点号”方法制定并优化运行计划。并基于“固定点号”方法建立了“车站对点号模型”、“多车站对点号模型”、“单径路点号模型”、“多径路点号模型”、“运行时刻模型”等模型。论文提出了分支定界算法和“贪婪点号算法”两种算法求解上述模型并给出算例。
(5)大规模部队铁路输送的仿真分析。论文提出了大规模部队铁路输送的Positivistic Petri网仿真模型,研究了列车仿真运行的模拟方法和对突发事件的处理方法,并结合算例对仿真结果进行了指标分析。
(6)大规模部队铁路输送的保障研究。论文讨论了部队铁路输送与相关保障之间的关系,研究了在考虑车底循环套用情况下车站的车辆需求,并建立了单车站与多车站车辆需求模型。
Rail transportation is the main form of stragetic army transportation of PLA,which under the conditions of the road network,based on certain transport sequence and meeting certain requirements of the military and transportation,transports a large number of troops of scattered distribution to the relatively concentrated areas in one or more direction in a short time.The stragetic army transportation has large shipment,tight time limitation and high requirements,which needs careful plan and organize.These difficult issues and complex relationships urgently need to be studied in-depth.This paper analyzed the characteristics,requirements and organizational structure of strategic army railway transportation,described their decision-making optimization of the essence of the theory,which studied a number of difficult and core issues,and proposed the establishment of related model algorithm and simulation for verification,seeking decision-making process more scientific and rationalization. Paper's main issues are on the following:
(1)To study basic theoretical research of stragetic army rail transportation.Paper analyzed the characteristics,demand and conditions of transport,and put forward hierarchical organizational structure including decision-making layer,implementation layer,control layer,by researching the the division functions and mutual relations of layers Paper summarized the problem in the decision-making two basic issues: Timed-Minimum Capacity Transport Problem(TMCTP)and Capacitied -Minimum Time Transport Problem(CMTTP)problem.Paper analyzed the optimizing processes of the two problems and the close relationship between each other,laying a foundation for further study of decision-making optimizing.
(2)To study the problem of troop transport sequence.Paper analyzed the meaning, principles and requirements of transport sequence,and proposed that the nature of the problem is topological sort from partial order into entire order.Paper designed the Decision-Making Sequence Tree Method(DMSTM)for the delivery of the sequence and to verify through example.
(3)To study the problems of the army transport routes of strategic.Based on analyzing the requirements and principles of route choicing,Paper put forword Knowledge&Case Based Reasoning(KCBR)method to choose trasnsport routes, combining KBS,CBS and model reasoning,and established some models as the push model rationale basis as follws:Time-capacitied Minimum Cost Flow Problem(TLMCFP),Stage Time-Capacitied Minimum Cost Flow Problem(STLMCFP), Timed Minimum Capacity&Cost Flow Problem(TMCCFP),Stage Timed Minimum Capacity&Cost Flow Problem(STMCCFP),Minimum Time&Cost Flow Problem(MTCFP).Paper designed the Minimum Cost Earliest Flow Augmentation Algorithm(MCEFAA)for solving the relevant models.
(4)To study the problem of operational plans of strategic army railway transport. The paper described a mathematical model operating plan,and designed the Fixed-Point Method(FPM)approaching to the development and optimization of operational plans. And based on FPM the paper established Station Point ModeI(SPM),Multi-Station Point Model(MSPM),Route Point Model(RPM),Multi-Route Point Model(MRPM), and Train Schedule Model(TSM)for some specific problems.To solve models above, the paper put forward branch and bound algorithm and Greedy Fixed-Point Algorithm(GFPA)and gave examples of the two algorithms.
(5)To simulate and analyze strategic army railway transport.The paper presented a positivistic petri nets simulation model of strategic army railway transportation,and studied the operation of the train simulation methods and the handling of unexpected events,and gave an example of simulation,the result of which are analyzed by indicators.
(6)To study relevant support of strategic army railway transport.Papers researched the relationship between the railway transportation and relevant support,and studied the cycle vehicle demand of stations,and established a single-station and multi-station vehicle demand model.
引文
[1]王厚卿,张兴业主编.战役学.北京:国防大学出版社,2005,196-197
[2]总后勤部军事交通部.中国人民解放军军事交通史.北京:解放军出版社。1990
[3]柯斌,张玉环.铁路与战争.铁道知识,2002,4:33
[4]郑时德,吴汉琳主编.铁路行车组织.北京:中国铁道出版社,第三版,1991
[5]张琦,王建英.智能型自律分散调度集中系统研究.铁道通信信号,2003,39(5):1-2
[6]余远友,刘振华,何麟.点评战争动员-军事运输动员:美国战争生命线的“三补工程”.中国国防报,2005.2.1
[7]刘林山.新《四年一度防务评审》折射美军战略调整动向.现代军事,2006,4:16-20
[8]张振德.高技术战争军事交通运输[M].天津:天津科学技术出版社,1996:218-230
[9]张瑞泉.海湾战争美军后勤保障透视[A].北京:后勤学术杂志社,1991:59-64
[10]王跃波,程奇,焦全.美军战略运输能力概览及启示.国防交通工程与技术,2006,3:14-15
[11]燕涛,王萌.美军战略空运力量透视.海事大观,2006,10
[12]李瑛,于海涛.美军战略运输运输体制的主要特点.外国军事学术,2004,1:67-69
[13]陈学惠.外军作战与训练思维教程.军事科学出版社,2000,12
[14]潘目轩,吕德胜.美国发展军事输能力的特点研究.外国军事学术,2004,8:49-52
[15]Lieutenant Colonel John.P.sweetnam,Candian army.When Star do not Align.Military Review.March-April 2000,63
[16]Lieutenant Colonel Dwain A.Meyer,US Marine Corps,Retired.Military Review.January-February 2001,31
[17]许向阳.美国的铁路军事运输.中国国防报,2001年6月4日第4版
[18]孙晚华.铁路车流径路管理理论应用研究[学位论文].北方交通大学,2000:54-65,76-77
[19]史峰.铁路车流组织优化[学位论文].北方交通大学,1998:29-47
[20]林柏梁.车流运行径路与列车编组计划的整体优化模型及模型退火算法[学位论文].西南交通大学,1994
[21]林伯梁,彭辉,任保国.铁路网上带权重的车流径路优化方法.北方交通大学学报,1996,20(6):646-650
[22]孙焰,姜磊.具有能力限制的路网重车流径路优化方法.铁道运输与经济,2005,27(12):83-84
[23]赵瑜,郑时德.路网.上车流组织优化与调整.北方交通大学学报,1990,14(4):74-80
[24]张羽成,吕红霞,王宝杰.基于图论的列车运行径路分析与构造.西南交通大学学报,2000,35(3):273-276
[25]胡思继等.关于特定径路准编译系统的研究.北方交通大学学报,1996,20(2):226-229
[26]张华.特定经由标记语言的车流径路计算分析方法.铁道运输与经济,2000,22(7):31-33
[27]李欣,李洪瑞.铁路车流管理系统中的特定径路语言的研究.中国科协第五届青年学术年会论文集.2004
[28]吴毅.铁路运输径路计算机处理系统方案设计与研究.铁路计算机应用,2006,15(5)
[29]石玉峰.战时不确定性运输径路研究[学位论文].西南交通大学,2005
[30]石玉峰.基于模糊多目标决策理论的军事运输路径优化研究.交通运输工程与信息学报,2004,2(1):112-116
[31]石玉峰.战时随机运输时间路径优化研究.系统工程理论与实践,2005,4:133-136
[32]王旭.基于蚁群优化算法的路径规划问题研究[学位论文].北京工业大学,2004
[33]潘鲁宁,赵林度.基于MAS的物流运输路径动态规划.物流技术,2003,12:64-66
[34]陈挚.容量-时间网络的时间流问题[学位论文].国防科技大学,2004
[35]Anderson E J,Nash P,Philpott A B.A class of continuous network flow problems[J].Math.Oper.Res,1982,7:501-514
[36]Halpen J.Generalized dynamic flows[J].Networks,1979,9:133-167
[37]周磊山.计算机编制列车运行调整计划的理论与方法研究[学位论文].北京交通大学,1994
[38]彭其渊,朱松年,王培.网络列车运行图的数学模型及算法研究.铁道学报,2001,23(1):1-8
[39]倪少权,吕红霞,杨明伦.全路列车运行图编制系统设计的研究.西南交通大学学报,2003,6(3):332-335
[40]周磊山,胡思继,马建军,乐逸祥.计算机编制网状线路列车运行图方法研究.铁道学报,1998,20(5)
[41]席庆.计算机编制列车运行图分布式数据库系统规划与设计.西南交通大学学报,2000,35(3):264-267
[42]OH KYOUNG KWON,CARL D.MARTLAND and JOSEPH M.SUSSMAN.ROUTING AND SCHEDULING TEMPORAL AND HETEROGENEOUS FREIGHT CAR TRAFFIC ON RAIL NETWORKS.Transportation Research Part E(Logistics and Transportation Rev.),1998,34(2):101-115
[43]M.J.Dorfman,J.medanic.Scheduling Trains on a Railway Network Using a Discrete Event Model of Railway Traffic.Transportation Research Part B,2004,38:81-98
[44]M.A.Salido,M.Abril,F.Barber,L.Ingolotti,P.Tormos,A.Lova.Domain-dependent distributed models for railway scheduling.Knowledge Based System,2006
[45]David R.MartinellI and Hualiang Teng.Optimization of Railway Operations using Neural Network.Transpan.Res-C,1996,4(1):33-49
[46]G a bor Mar o ti,Leo Kroon.Maintenance routing for train units:The interchange model.Computers & Operations Research,2007,34:1121-1140
[47]Rob M.P,Goverde.Railway timetable stability analysis using max-plus system theory.Transportation Research Part B,2007,41:179-201
[48]Alessandro Chierici,Roberto Cordone.The demand-dependent optimization of regular train timetables.Electronic Notes in Discrete Mathematics,2004,17:99-104
[49]Andrea D'Ariano,Dario Pacciarelli,Marco Pranzo.A branch and bound algorithm for scheduling trains in a railway network.European Journal of Operational Research,2006:1-14
[50]MICHIEL A.ODIJK.A CONSTRAINT GENERATION ALGORITHM FOR THE CONSTRUCTION OF PERIODIC RAILWAY TIMETABLES.Transport Res.-B.1996,30(6),455-464
[51]孙秀德主编.军事后勤学.北京:解放军出版社,2002
[52]总后勤部司令部.战役后勤学.北京:解放军出版社,2001
[53]陈兆仁,鲍平鑫主编.军事运输学.北京:解放军出版社,2001
[54]鲍平鑫主编.铁路军事运输.北京:解放军出版社,1997
[55]总后勤部军事交通部.军事交通用语.北京:解放军出版社,2001
[56]蒋士良.初论制交通权.中国军事科学,2001.21
[57]中国统计出版社.中国统计年鉴-2006.http://www.stats.gov.cn/tjsj/ndsj/2006/indexch.htm
[58]叶先一,张福基.偏序集上的一种拓扑排序.数学研究,2005,38(4):440-443
[59]曲开社,翟岩慧.偏序集、包含度与形式概念分析.计算机学报,2006,29(2):119-226
[60]Alpern B,Hoover R,Rosen B,Sweeney P,Zadeck F D.Incrementalevaluation of computational circuits,in:Proc.lstAnnual ACM-SIAM Symp.on Discrete Algorithms,1990:32-42
[61]Jianjun 2hou,Martin Muller.Depth-First Discovery Algorithm for incremental topological sorting of directed acyclic graphs.Information Processing Letters.2003,88:195-200
[62]Alan Shuchat,Randy Shull,Ann N.Trenk,The fractional weak discrepancy of a partially ordered set.Discrete Applied Mathematics,2007,155:2227-2235
[63]朱立华,王汝传.AOV网中全拓扑排序算法的设计及应用.微机发展,2004,14(12):123-125
[64]李洪波,翟金刚.种有向图并行性拓扑排序算法.烟台师范学院学报,2005,21(3):168-171
[65]朱立华.并行拓扑排序算法PTSA的设计与实现.计算机工程与应用,2004,35:111
[66]于顺凤.一种有向权图的拓扑排序算法及其应用.南京气象学院学报,2002,25(5):711-714
[67]王晓瑛,魏正军,关于拓扑排序算法的讨论.西北大学学报,2002,32(4):344-347
[68]杨善林.智能决策方法与智能决策支持系统.科学出版社,2005:89-90
[69]湖知熊,徐玖平.运筹学-线性系统优化.科学出版社,2000:160
[70]徐瑞,徐晓飞,崔平远.基于时间约束网络的动态规划调度算法.计算机集成制造系统一CIMS,2004,10(1):188-194
[71]谢金星,邢文训.网络优化.清华大学出版社,1998:148-155
[72]Anderson E J,Nash P,Philpott A B.A class of continuous network flow problems[J].Math.Oper.Res,1982,7:501-514
[73]Ahuja P K,Magnanti T L and Odin J B.Network Flows:Theory,Algorithms,and Applications.Englewood Cliffs,New Jersey:Prentice Hall,1993
[74]Balakrishnan V K,Network Optimization.London:Chapman&Hall,1995
[75]Bertsekas D P.Linear Network Optimization:Algorithms and Codes.Masssachusetts,Cambridge:MIT Press,1991
[76]R.Horst.P.Mpardalos.N.V.Thoai.黄红选译.Introduction to global optimization 2nd Edition (全局优化引论),2000:297-300
[77]Evans J R,Minieka E.Optimization Algorithms for Networks and Graphs.2nd ed.New York:Marcel Dekker Inc,1992
[78]董振宁,孔淑兰.连续时间网络上的最小费用流问题.山东大学学报,2003,38(2):50-54
[79]罗冰洋,余志刚.一种多品种最小费用流求解方法的研究.物流技术,281(119):27-30
[80]Kaj Holmberg,Martin Joborn,Kennet Melin.Lagrangian based heuristics for the multicommodity network.ow problem with.fixed costs on paths.European Journal of Operational Research,2007:1-2
[81]Cremeans J.,Smith R.& Tyndall G.Optimal multicommodity network flows with resource allocation[J].Naval Research Logistics Quarterly,1970,17:269-280
[82]Assad A,Solving linear multicommodity flow problems[J].Proceeding of the IEEE internatiOnal COnf rence On circuits and Computers,1980:157-161
[83]Geofrion A&Graves G,Multicommodity distribution system design by Benders decomposition[J].management science,1974,20:822-844
[84]Kennington J&Shalaby M.An efective subgradient procedure minimal cost multicommodity network flows management science,1977,23:994-1004
[85]Graves G.&Mcbride R.The factorization approach to large scale linear programming.Mathematical Programming,1976.10:91-110
[86]Mehdi Ghatee,S.Mehdi Hashemi.Descent direction algorithm with multicommodity.flow problem for signal optimization and tra.c assignment jointly.Applied Mathematics and Computation,2007,188:555-566
[87]Abdulhakim F.Zantuti.The Capacity and Non-Simultaneously Multicommodity Flow Problemin Wide Area Network and Data Flow Management.computer society,2005
[88]李桂玲,朱晓莲.0/1背包问题.微型电脑应用,2007,23(4):12-14
[89]林鑫.基于0/1背包问题的讨论.微型电脑应用,2007,23(4):15-17
[90]王晓东.算法设计与分析.清华大学出版社,2003:107-141
[91]宋杰,程家兴,许中卫,周瑛.一种改进的贪婪式覆盖算法.计算机技术与发展.2006,16(8):113-115
[92]马云峰,刘勇,杨超.基于时间满意的集覆盖问题及若干贪婪算法应用研究.武汉科技大学学报,2006,29(6):631-635
[93]Queyranne M,Spieksma F,Tardella F.A general class of greedily solvable linear programs[J].Mathematics of Operation Research,1998.23:892-908
[94]Burkard R,Klinz B,Rudoolf R.Perspectives of Monge properties in optimization[J].Discrete Applied Mathematics,1996.70:95-161
[95]黄辉,梁国宏,张生,何尚录.求解一类线性规划问题的原始贪婪算法和对偶贪婪算法及其相互关系.兰州交通大学学报,2007,26(1):149-152
[96]曹化工,杨曼红.基于对象Petri网的工作流过程定义,[J].计算机辅助设计与图形学学报,2001,13(1):13-18
[97]X Li,F Lara-Rosano.Adaptive puzzy Petri netsfor dynamic knowledge representation and inference[J].Experts with Applications,2000,19:235-241.
[98]Shyi-Ming Chen.Weighted Fuzzy Reasoning Using Weighted Fuzzy Petri Nets[J].IEEE TRANSACTIONS ON KNOWIEDGE AND DATA.ENGINEERING,2002,14(2):386-397.
[99]X.F.Zha.An object-oriented knowledge based Petri net approach to intelligent integration of design and assembly planning.Artificial Intelligence in Engineering,2000,14:83-112
[100]A Camurri,P Franchi,M Vitale.An Object-oriented Approach to High-level Petri nets[J].Microprocessing and Microprogramming.1992,35:213-220
[101]Jonathan Lee,K.F.R.Liu,Y.-C.Wang,W.Chiang.Positivistic Petri nets as a basis for agent service description language[J].Fuzzy Sets and Systems,2004,144:105-126
[102]Janette Cardoso,Robert Valette,Didier Dubois.Possibilistic Petri Nets[J].IEEE Tratksactin on System,Man and Cybernetics-part B:Cybernetics,1999,29(5):573-582
[103]杜彦华,叶阳东.基于多Agent的分布式铁路运营仿真系统的分析[J].计算机应用,2002,22(2):55-58
[104]叶阳东,杜彦华,贾利民.面向对象Petri子网的列车群运行系统模型.中国铁道科学,2002,23(4):81-88
[105]叶阳东,贾利民.基于对象Petri网的列车运行模型及仿真[J].系统仿真学报,2002,14(2):132-135
[106]叶阳东,贾利民.带有对象的Petri网及其在列车运行模型建立中的应用[J].中国铁道科学,2001,22(3):15-20
[107]张恒巍,杜彦华,汤光明,张明清.基于多线程的列车群Petri网运行模型的实现.计算机应用,22(10):76-78
[108]中国人民解放军总参谋部,中国人民解放军总政治部,中国人民解放军总后勤部.中国人民解放军军语.中国人民解放军军事科学院,1997
[109]杨肇夏.计算机模拟及其应用.中国铁道出版社,1999,54-55
[2]总后勤部军事交通部.中国人民解放军军事交通史.北京:解放军出版社。1990
[3]柯斌,张玉环.铁路与战争.铁道知识,2002,4:33
[4]郑时德,吴汉琳主编.铁路行车组织.北京:中国铁道出版社,第三版,1991
[5]张琦,王建英.智能型自律分散调度集中系统研究.铁道通信信号,2003,39(5):1-2
[6]余远友,刘振华,何麟.点评战争动员-军事运输动员:美国战争生命线的“三补工程”.中国国防报,2005.2.1
[7]刘林山.新《四年一度防务评审》折射美军战略调整动向.现代军事,2006,4:16-20
[8]张振德.高技术战争军事交通运输[M].天津:天津科学技术出版社,1996:218-230
[9]张瑞泉.海湾战争美军后勤保障透视[A].北京:后勤学术杂志社,1991:59-64
[10]王跃波,程奇,焦全.美军战略运输能力概览及启示.国防交通工程与技术,2006,3:14-15
[11]燕涛,王萌.美军战略空运力量透视.海事大观,2006,10
[12]李瑛,于海涛.美军战略运输运输体制的主要特点.外国军事学术,2004,1:67-69
[13]陈学惠.外军作战与训练思维教程.军事科学出版社,2000,12
[14]潘目轩,吕德胜.美国发展军事输能力的特点研究.外国军事学术,2004,8:49-52
[15]Lieutenant Colonel John.P.sweetnam,Candian army.When Star do not Align.Military Review.March-April 2000,63
[16]Lieutenant Colonel Dwain A.Meyer,US Marine Corps,Retired.Military Review.January-February 2001,31
[17]许向阳.美国的铁路军事运输.中国国防报,2001年6月4日第4版
[18]孙晚华.铁路车流径路管理理论应用研究[学位论文].北方交通大学,2000:54-65,76-77
[19]史峰.铁路车流组织优化[学位论文].北方交通大学,1998:29-47
[20]林柏梁.车流运行径路与列车编组计划的整体优化模型及模型退火算法[学位论文].西南交通大学,1994
[21]林伯梁,彭辉,任保国.铁路网上带权重的车流径路优化方法.北方交通大学学报,1996,20(6):646-650
[22]孙焰,姜磊.具有能力限制的路网重车流径路优化方法.铁道运输与经济,2005,27(12):83-84
[23]赵瑜,郑时德.路网.上车流组织优化与调整.北方交通大学学报,1990,14(4):74-80
[24]张羽成,吕红霞,王宝杰.基于图论的列车运行径路分析与构造.西南交通大学学报,2000,35(3):273-276
[25]胡思继等.关于特定径路准编译系统的研究.北方交通大学学报,1996,20(2):226-229
[26]张华.特定经由标记语言的车流径路计算分析方法.铁道运输与经济,2000,22(7):31-33
[27]李欣,李洪瑞.铁路车流管理系统中的特定径路语言的研究.中国科协第五届青年学术年会论文集.2004
[28]吴毅.铁路运输径路计算机处理系统方案设计与研究.铁路计算机应用,2006,15(5)
[29]石玉峰.战时不确定性运输径路研究[学位论文].西南交通大学,2005
[30]石玉峰.基于模糊多目标决策理论的军事运输路径优化研究.交通运输工程与信息学报,2004,2(1):112-116
[31]石玉峰.战时随机运输时间路径优化研究.系统工程理论与实践,2005,4:133-136
[32]王旭.基于蚁群优化算法的路径规划问题研究[学位论文].北京工业大学,2004
[33]潘鲁宁,赵林度.基于MAS的物流运输路径动态规划.物流技术,2003,12:64-66
[34]陈挚.容量-时间网络的时间流问题[学位论文].国防科技大学,2004
[35]Anderson E J,Nash P,Philpott A B.A class of continuous network flow problems[J].Math.Oper.Res,1982,7:501-514
[36]Halpen J.Generalized dynamic flows[J].Networks,1979,9:133-167
[37]周磊山.计算机编制列车运行调整计划的理论与方法研究[学位论文].北京交通大学,1994
[38]彭其渊,朱松年,王培.网络列车运行图的数学模型及算法研究.铁道学报,2001,23(1):1-8
[39]倪少权,吕红霞,杨明伦.全路列车运行图编制系统设计的研究.西南交通大学学报,2003,6(3):332-335
[40]周磊山,胡思继,马建军,乐逸祥.计算机编制网状线路列车运行图方法研究.铁道学报,1998,20(5)
[41]席庆.计算机编制列车运行图分布式数据库系统规划与设计.西南交通大学学报,2000,35(3):264-267
[42]OH KYOUNG KWON,CARL D.MARTLAND and JOSEPH M.SUSSMAN.ROUTING AND SCHEDULING TEMPORAL AND HETEROGENEOUS FREIGHT CAR TRAFFIC ON RAIL NETWORKS.Transportation Research Part E(Logistics and Transportation Rev.),1998,34(2):101-115
[43]M.J.Dorfman,J.medanic.Scheduling Trains on a Railway Network Using a Discrete Event Model of Railway Traffic.Transportation Research Part B,2004,38:81-98
[44]M.A.Salido,M.Abril,F.Barber,L.Ingolotti,P.Tormos,A.Lova.Domain-dependent distributed models for railway scheduling.Knowledge Based System,2006
[45]David R.MartinellI and Hualiang Teng.Optimization of Railway Operations using Neural Network.Transpan.Res-C,1996,4(1):33-49
[46]G a bor Mar o ti,Leo Kroon.Maintenance routing for train units:The interchange model.Computers & Operations Research,2007,34:1121-1140
[47]Rob M.P,Goverde.Railway timetable stability analysis using max-plus system theory.Transportation Research Part B,2007,41:179-201
[48]Alessandro Chierici,Roberto Cordone.The demand-dependent optimization of regular train timetables.Electronic Notes in Discrete Mathematics,2004,17:99-104
[49]Andrea D'Ariano,Dario Pacciarelli,Marco Pranzo.A branch and bound algorithm for scheduling trains in a railway network.European Journal of Operational Research,2006:1-14
[50]MICHIEL A.ODIJK.A CONSTRAINT GENERATION ALGORITHM FOR THE CONSTRUCTION OF PERIODIC RAILWAY TIMETABLES.Transport Res.-B.1996,30(6),455-464
[51]孙秀德主编.军事后勤学.北京:解放军出版社,2002
[52]总后勤部司令部.战役后勤学.北京:解放军出版社,2001
[53]陈兆仁,鲍平鑫主编.军事运输学.北京:解放军出版社,2001
[54]鲍平鑫主编.铁路军事运输.北京:解放军出版社,1997
[55]总后勤部军事交通部.军事交通用语.北京:解放军出版社,2001
[56]蒋士良.初论制交通权.中国军事科学,2001.21
[57]中国统计出版社.中国统计年鉴-2006.http://www.stats.gov.cn/tjsj/ndsj/2006/indexch.htm
[58]叶先一,张福基.偏序集上的一种拓扑排序.数学研究,2005,38(4):440-443
[59]曲开社,翟岩慧.偏序集、包含度与形式概念分析.计算机学报,2006,29(2):119-226
[60]Alpern B,Hoover R,Rosen B,Sweeney P,Zadeck F D.Incrementalevaluation of computational circuits,in:Proc.lstAnnual ACM-SIAM Symp.on Discrete Algorithms,1990:32-42
[61]Jianjun 2hou,Martin Muller.Depth-First Discovery Algorithm for incremental topological sorting of directed acyclic graphs.Information Processing Letters.2003,88:195-200
[62]Alan Shuchat,Randy Shull,Ann N.Trenk,The fractional weak discrepancy of a partially ordered set.Discrete Applied Mathematics,2007,155:2227-2235
[63]朱立华,王汝传.AOV网中全拓扑排序算法的设计及应用.微机发展,2004,14(12):123-125
[64]李洪波,翟金刚.种有向图并行性拓扑排序算法.烟台师范学院学报,2005,21(3):168-171
[65]朱立华.并行拓扑排序算法PTSA的设计与实现.计算机工程与应用,2004,35:111
[66]于顺凤.一种有向权图的拓扑排序算法及其应用.南京气象学院学报,2002,25(5):711-714
[67]王晓瑛,魏正军,关于拓扑排序算法的讨论.西北大学学报,2002,32(4):344-347
[68]杨善林.智能决策方法与智能决策支持系统.科学出版社,2005:89-90
[69]湖知熊,徐玖平.运筹学-线性系统优化.科学出版社,2000:160
[70]徐瑞,徐晓飞,崔平远.基于时间约束网络的动态规划调度算法.计算机集成制造系统一CIMS,2004,10(1):188-194
[71]谢金星,邢文训.网络优化.清华大学出版社,1998:148-155
[72]Anderson E J,Nash P,Philpott A B.A class of continuous network flow problems[J].Math.Oper.Res,1982,7:501-514
[73]Ahuja P K,Magnanti T L and Odin J B.Network Flows:Theory,Algorithms,and Applications.Englewood Cliffs,New Jersey:Prentice Hall,1993
[74]Balakrishnan V K,Network Optimization.London:Chapman&Hall,1995
[75]Bertsekas D P.Linear Network Optimization:Algorithms and Codes.Masssachusetts,Cambridge:MIT Press,1991
[76]R.Horst.P.Mpardalos.N.V.Thoai.黄红选译.Introduction to global optimization 2nd Edition (全局优化引论),2000:297-300
[77]Evans J R,Minieka E.Optimization Algorithms for Networks and Graphs.2nd ed.New York:Marcel Dekker Inc,1992
[78]董振宁,孔淑兰.连续时间网络上的最小费用流问题.山东大学学报,2003,38(2):50-54
[79]罗冰洋,余志刚.一种多品种最小费用流求解方法的研究.物流技术,281(119):27-30
[80]Kaj Holmberg,Martin Joborn,Kennet Melin.Lagrangian based heuristics for the multicommodity network.ow problem with.fixed costs on paths.European Journal of Operational Research,2007:1-2
[81]Cremeans J.,Smith R.& Tyndall G.Optimal multicommodity network flows with resource allocation[J].Naval Research Logistics Quarterly,1970,17:269-280
[82]Assad A,Solving linear multicommodity flow problems[J].Proceeding of the IEEE internatiOnal COnf rence On circuits and Computers,1980:157-161
[83]Geofrion A&Graves G,Multicommodity distribution system design by Benders decomposition[J].management science,1974,20:822-844
[84]Kennington J&Shalaby M.An efective subgradient procedure minimal cost multicommodity network flows management science,1977,23:994-1004
[85]Graves G.&Mcbride R.The factorization approach to large scale linear programming.Mathematical Programming,1976.10:91-110
[86]Mehdi Ghatee,S.Mehdi Hashemi.Descent direction algorithm with multicommodity.flow problem for signal optimization and tra.c assignment jointly.Applied Mathematics and Computation,2007,188:555-566
[87]Abdulhakim F.Zantuti.The Capacity and Non-Simultaneously Multicommodity Flow Problemin Wide Area Network and Data Flow Management.computer society,2005
[88]李桂玲,朱晓莲.0/1背包问题.微型电脑应用,2007,23(4):12-14
[89]林鑫.基于0/1背包问题的讨论.微型电脑应用,2007,23(4):15-17
[90]王晓东.算法设计与分析.清华大学出版社,2003:107-141
[91]宋杰,程家兴,许中卫,周瑛.一种改进的贪婪式覆盖算法.计算机技术与发展.2006,16(8):113-115
[92]马云峰,刘勇,杨超.基于时间满意的集覆盖问题及若干贪婪算法应用研究.武汉科技大学学报,2006,29(6):631-635
[93]Queyranne M,Spieksma F,Tardella F.A general class of greedily solvable linear programs[J].Mathematics of Operation Research,1998.23:892-908
[94]Burkard R,Klinz B,Rudoolf R.Perspectives of Monge properties in optimization[J].Discrete Applied Mathematics,1996.70:95-161
[95]黄辉,梁国宏,张生,何尚录.求解一类线性规划问题的原始贪婪算法和对偶贪婪算法及其相互关系.兰州交通大学学报,2007,26(1):149-152
[96]曹化工,杨曼红.基于对象Petri网的工作流过程定义,[J].计算机辅助设计与图形学学报,2001,13(1):13-18
[97]X Li,F Lara-Rosano.Adaptive puzzy Petri netsfor dynamic knowledge representation and inference[J].Experts with Applications,2000,19:235-241.
[98]Shyi-Ming Chen.Weighted Fuzzy Reasoning Using Weighted Fuzzy Petri Nets[J].IEEE TRANSACTIONS ON KNOWIEDGE AND DATA.ENGINEERING,2002,14(2):386-397.
[99]X.F.Zha.An object-oriented knowledge based Petri net approach to intelligent integration of design and assembly planning.Artificial Intelligence in Engineering,2000,14:83-112
[100]A Camurri,P Franchi,M Vitale.An Object-oriented Approach to High-level Petri nets[J].Microprocessing and Microprogramming.1992,35:213-220
[101]Jonathan Lee,K.F.R.Liu,Y.-C.Wang,W.Chiang.Positivistic Petri nets as a basis for agent service description language[J].Fuzzy Sets and Systems,2004,144:105-126
[102]Janette Cardoso,Robert Valette,Didier Dubois.Possibilistic Petri Nets[J].IEEE Tratksactin on System,Man and Cybernetics-part B:Cybernetics,1999,29(5):573-582
[103]杜彦华,叶阳东.基于多Agent的分布式铁路运营仿真系统的分析[J].计算机应用,2002,22(2):55-58
[104]叶阳东,杜彦华,贾利民.面向对象Petri子网的列车群运行系统模型.中国铁道科学,2002,23(4):81-88
[105]叶阳东,贾利民.基于对象Petri网的列车运行模型及仿真[J].系统仿真学报,2002,14(2):132-135
[106]叶阳东,贾利民.带有对象的Petri网及其在列车运行模型建立中的应用[J].中国铁道科学,2001,22(3):15-20
[107]张恒巍,杜彦华,汤光明,张明清.基于多线程的列车群Petri网运行模型的实现.计算机应用,22(10):76-78
[108]中国人民解放军总参谋部,中国人民解放军总政治部,中国人民解放军总后勤部.中国人民解放军军语.中国人民解放军军事科学院,1997
[109]杨肇夏.计算机模拟及其应用.中国铁道出版社,1999,54-55