摘要
根据图论理论生成符合时限要求的运输网络形图,构建了在运力约束下多种航空弹药的运输模型,并用KSHWC算法对模型进行求解,同时也运用单纯形法对无约束的情况进行了求解,并对两种求解结果进行了比较,发现KSHWC算法能够在容量限制的范围内,充分优化运输方案.
Transport network graph in accord with time restriction is built according to graph theory, and multiaviation ammunition transport model is constructed under the conveyance ability restriction. This paper solves the model with KSHWC algorithm and the model is solved with simplex method for nonrestmint case at the same time. Comparing two results, KSHWC algorithm is found to optimize transport scheme adequately under capability restriction.
出处
《系统工程理论与实践》
EI
CSCD
北大核心
2006年第6期124-129,134,共7页
Systems Engineering-Theory & Practice
关键词
航空弹药
运输模型
KSHWC算法
线性规划
单纯形法
aviation Ammunition
transport model
KSHWC algorithm
linear programming
simplex method
作者简介
刘金梅（1965-）,安徽怀宁人,现在南京理工大学机械工程学院攻读博士学位研究生,主要从事航空弹药保障运筹分析和贮存可靠性的研究工作.
