基于蚁群算法的高原地区车辆运输路径优化问题  

Routing Optimization Problem of Vehicle Transport in Plateau Region Based on Ant Colony Algorithm

作　　者：凌云翔[1,2] 宋志远[1] 张世海[1] 马力[2] 

机构地区：[1]中国人民武装警察部队警官学院,四川成都610213 [2]国防科技大学信息系统工程重点实验室,湖南长沙410073

出　　处：《计算机与现代化》2016年第9期77-82,共6页Computer and Modernization

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

摘　　要：以高原地区救援物资运输为背景,从提升部队精细化保障能力落脚点出发,针对当前高原地区后勤运输存在的不足,利用优化蚁群算法对高原地区后勤保障中的运输线路选择问题进行深入研究。建立高原地区救援物资运输按时供给函数模型(VRPTW),并通过运输案例验证模型和算法的可行性和有效性。最后运用项目管理软件(Project 2013)对运输方案的日程安排和资源分配进行统筹和管理,实现运输时间最短和运输效益最高的双重目标。Taking the transport of relief supplies to plateau region as study background, this paper is from the starting point of promoting the delicate logistics support capability of CAPF. In view of the current disadvantages in logistics transportation, the ar- my logistics transportation route-choice problem of Sichuan Tibet regions is studied by using optimized ant colony algorithm. Func- tion model of plateau stability troop logistics transportation supply on time is set up and the feasibility and effectiveness of the model and algorithm is verified through transportation cases. At last, project management software （ Project 2013 ） is used to man- age the material transportation schemes and resource allocation, thus, the dual goals of the shortest transportation time and the highest transportation efficiency are realized.

关 键 词：高原地区运输 蚁群算法 路径优化 PROJECT 2013 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]