检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]东南大学交通学院,南京210096 [2]西南交通大学运输工程系,成都610031 [3]郑州大学系统科学与数学系,郑州450052
出 处:《系统工程学报》2000年第1期38-43,共6页Journal of Systems Engineering
基 金:中国博士后科学基金资助项目;河南省教委自然科学基础研究项目!( 97110 0 0 4)
摘 要:研究铁路车站作业计划编制过程中 ,如何编制调机运用计划的关键问题 .通过分析运用调机时区集合上的偏序结构特点 ,可以知道使用调机问题的实质是偏序集合的全序分解问题 .利用偏序集合的传递性构造调机运用的有向图——传递图 ,再将调机运用问题转化为有向图的有向路分解问题 .对于传递图构造它对应的偶图——无向偶图 ,将传递图的有向路分解问题转化为其对应偶图的匹配问题 ,最后 ,利用偶图最大匹配问题的算法解决调机运用问题 .The key problem of how to make the plan of using yard engines in the process of making operative plans for the station is studied in this paper. That can become decomposition partially ordered set into totally ordered subset by analyzing the characteristics of partially ordered relation construction on partially ordered set. The directed graph or transitive graph is constructed by transitivity of partially ordered set. Then, the problem of using yard engines becomes the problem of directed paths decomposition for directed graph. This problem becomes the matching of the bipartite graph that is constructed after the directed graph and is called the bipartite graph of the directed graph. Finally, the problem of using yard engines is solved with the matching algorithm.
分 类 号:U291[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249