|
|||||
|
|
| 军事物流系统中定位-运输路线安排模型及算法 | |
| 引用本文： | 高军,刘晓蕾,冀松娅.军事物流系统中定位-运输路线安排模型及算法[J].数学的实践与认识,2012,42(19). |
| 作者姓名： | 高军 刘晓蕾 冀松娅 |
| 作者单位： | 1. 军械工程学院装备指挥与管理系,河北石家庄,050003 2. 军械工程学院装备指挥与管理系,河北石家庄,050003;71770部队,山东泰安271000 3. 公安海警学院后勤管理系,浙江宁波,315800 |
| 摘 要： | 考虑到战时物资需求的紧迫性和保障资源的有限性,从决策者的角度出发,以军事物流系统总体供应时间最短为目标,构建了两级军事配送网络的定位-运输路线安排模型,并给出一种启发式算法.算法分为两个阶段,首先利用蚁群算法和线性规划的方法解决运输路线安排问题,然后运用贪婪搜索算法解决军事物流配送中心选址问题.最终,将两种算法结合起来进行逐步搜索,从而得到模型的解,并运用实例说明了算法的有效性和可行性. |
| 关 键 词： | 军事物流系统 定位-运输路线问题 蚁群算法 贪婪取走启发算法 |
Model and Algorithm for Location-Routing Problem of Military Logistics System |
|
| GAO Jun , LIU Xiao-lei , JI Song-ya.Model and Algorithm for Location-Routing Problem of Military Logistics System[J].Mathematics in Practice and Theory,2012,42(19). | |
| Authors: | GAO Jun LIU Xiao-lei JI Song-ya |
| Abstract: | Considering in the war military materials' demand exigency and logistics resources' 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 supply 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 algorithm 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. |
| Keywords: | military logistics system location-routing problem(LRP) ant colony algorithm greedy dropping heuristic algorithm |
| 本文献已被 万方数据 等数据库收录！ | |