摘要
面向大范围、大规模的军用物资调度,为保障任务规划满足多个约束的可行路径,是NP-C问题。本文在详细分析物流保障网络传输属性的基础上,给出了约束参数的完整描述,建立了多约束路径规划数学模型,设计了一种带综合启发因子的蚁群优化算法。仿真实验表明,该算法搜索效率高,具有全局收敛性,经过有限次迭代能够获得可行解,对网络规模和约束参数选择具有较好的灵活性和扩展性。
Finding multi-constrained feasible paths for support tasks in scheduling military materials is a NP-complete problem. This paper analyzes the logistics support network transportation properties, describes its accurate constrained parameters, then, a new ant colony algorithm with integrated heuristic indices is designed. Simulation results indicate that this algorithm not only has a good efficiency and whole eonstringency for search, but also is adaptive to the constrained parameters of network scale and the quantity of constrained parameters.
出处
《系统工程》
CSCD
北大核心
2009年第6期91-94,共4页
Systems Engineering
基金
国家自然科学基金资助项目(70501032)
