基于改进蚁群算法的汽车抢修车巡回修理问题研究  

Research on Itinerate Repair Problem of Emergency Repair Vehicle Based on Improving Ant Colony Algorithm

作　　者：门君[1] 王连玉[1] 李忠光[1] 巴威 

机构地区：[1]军事交通学院装备保障系,天津300161 [2]65533部队,海城114200

出　　处：《军事交通学院学报》2011年第5期37-40,共4页Journal of Military Transportation University

摘　　要：利用蚁群理论对求解带时间窗的巡回修理问题进行了研究,建立了车辆巡回修理问题的数学模型,应用改进型蚂蚁算法实现了维修力量和行驶路线最优。The paper studied an improved ant colony algorithm to solute itinerate repair problem of emergency repair vehicle with time windows,established the model of vehicle itinerate repair,achieved optimal routing and optimal maintain force based on improving ant colony algorithm.

关 键 词：蚁群算法 巡回修理 抢修车 

分 类 号：E234[军事—军事理论]