基于蚁群算法的战时运输路径优化模型  

Model of the Transportation Path Optimization Based on the Ant Conoly Algorithm in Wartime

作　　者：杨英杰[1,2] 绳慧[1] 李想[1] 

机构地区：[1]军械工程学院装备指挥与管理系,石家庄050003 [2]军械工程学院研究生管理大队,石家庄050003

出　　处：《价值工程》2012年第4期319-321,共3页Value Engineering

摘　　要：针对多式联运,必经点等战时维修器材供应运输中的现实问题,考虑当各路段通行时间和运输方式转换时间为随机变量时,建立起了给定时间的最大置信水平约束下,以最小时间和费用为优化目标的随机机会约束模型,然后根据所建模型特点,基于随机模拟方法,设计了的模型求解的蚁群算法。算例结果表明:该模型和和算法具有有效性,能为确定战时交通运输路径提供有效的决策支持。Aiming at the practical problem about multi-modal,must cross points etc.of maintenance material supply transportation in wartime,considering ever passage crossing time and changing transportation modal time as the stochastic variable,the minimize the time and cost model of appointed transportation time credibility is built,then according as the characters of the models,design the ant colony algorithm to solve the models based on the stochastic simulation,the example validates the availability of the models and algorithm.

关 键 词：多式联运 时间 费用 置信水平 蚁群算法 

分 类 号：E8[军事]