基于多蚁群并行优化的网络路径规划研究  

Research on Network Path Planning Algorithms Based on Multi-Ant Colonies' Parallel Optimization

作　　者：黄泽汉[1,2] 谭跃进[1] 

机构地区：[1]国防科学技术大学信息系统与管理学院,湖南长沙410073 [2]海军工程大学管理工程系,湖北武汉430033

出　　处：《计算机工程与科学》2011年第9期100-104,共5页Computer Engineering & Science

基　　金：国家自然科学基金资助项目(70501032)

摘　　要：在军事后勤、应急救灾中,需要同时为多个任务、多批次物资运输制定保障方案,该问题可归结为多源多汇问题,是NP-C的。本文提出一种基于多蚁群并行优化的网络路径规划算法,按照一定的策略对关键网络资源进行调度分配,尽可能为每一个任务规划满足网络属性约束及用户服务质量要求的独立网络路径,使任务完成率最高。仿真示例验证了该模型和算法的正确性。The traffic manager needs to plan a scheme for each mission in military support or emergency, which is a multi-source multi-destination problem. It is NP-C. A new network path planning algorithm based on multi-ant colonies＇ parallel optimization is presented. According to a certain scheduling policy for key network resources, finding a feasible path which satisfies the constraint of transportation properties and the constraint of service quality for each support task, and a scheme which makes the morest missions be successful is planned. Finally, an example is used to validate the model and algorithms.

关 键 词：物流保障网络 路径规划 并行优化 独立路径 

分 类 号：TP399[自动化与计算机技术—计算机应用技术]