基于拓扑排序的部队输送序列问题研究  

Study on Troop Transportation Sequence by Topological Sorting

作　　者：吴晓东 杨斌[2] 朱桐生[3] 

机构地区：[1]军事交通学院联合投送系,天津300161 [2]军事交通学院研究生管理大队,天津300161 [3]驻郑州铁路局军事代表办事处,郑州450000

出　　处：《军事交通学院学报》2014年第7期19-24,共6页Journal of Military Transportation University

基　　金：国家科技支撑计划课题(2012BAG06B02)

摘　　要：部队输送应优先考虑输送序列,大规模输送的部队形成了一个偏序集。确定部队的输送序列就是进行偏序集的拓扑排序。建立序列树模型以描述部队输送序列要求,通过建立节点关系表、节点初始权重赋值、节点搜索排序方法进行拓扑排序,并设计算例进行验证。Sequence should be the first consideration in troop transportation. Troops of large-scale transportation form a poset. Troop transportation sequence is essentially the topological sorting of poset. A sequence tree model is built to describe the requirement of troop transportation sequence, while the topological sorting is made through building a node relationship table, initial node weight assignment and node search ranking method, and is verified with an example.

关 键 词：拓扑排序 输送序列 偏序集 

分 类 号：E234[军事—军事理论]