军事物流系统中定位-运输路线安排模型及算法  

Model and Algorithm for Location-Routing Problem of Military Logistics System

作　　者：高军[1] 刘晓蕾[1,2] 冀松娅 

机构地区：[1]军械工程学院装备指挥与管理系 [2]71770部队 [3]公安海警学院后勤管理系

出　　处：《数学的实践与认识》2012年第19期152-159,共8页Mathematics in Practice and Theory

摘　　要：考虑到战时物资需求的紧迫性和保障资源的有限性,从决策者的角度出发,以军事物流系统总体供应时间最短为目标,构建了两级军事配送网络的定位-运输路线安排模型,并给出一种启发式算法.算法分为两个阶段,首先利用蚁群算法和线性规划的方法解决运输路线安排问题,然后运用贪婪搜索算法解决军事物流配送中心选址问题.最终,将两种算法结合起来进行逐步搜索,从而得到模型的解,并运用实例说明了算法的有效性和可行性.Considering in the war military materials＇ demand exigency and logistics re- sources＇ limitation, an location-routing model of two-echelon military logistics system is presented from the view of decision-maker with the purpose of minimizing total system sup- ply time, and a heuristic algorithm is proposed to solve this model. The heuristic algorithm includes two steps. First, the optimal distribution routes are chosen by ant colony algo- rithm and linear programming. Second, the optimal location allocations are chosen by reedy dropping heuristic algorithm. Finally, a heuristic algorithm gradually search based on ant colony algorithm and reedy dropping heuristic algorithm to the optimal solution of model and example indicates the algorithm＇s validity and practicability.

关 键 词：军事物流系统 定位-运输路线问题 蚁群算法 贪婪取走启发算法 

分 类 号：E234[军事—军事理论] F252[经济管理—国民经济]