检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张闯 李延通 曹军海 张强 刘毅 ZHANG Chuang;LI Yantong;CAO Junhai;ZHANG Qiang;LIU Yi(Department of Equipment Support and Remanufacturing, Army Academy of Armored Forces, Beijing 100072, China;School of Maritime Economics and Management, Dalian Maritime University, Dalian 116026, China;Beijing Institute of Tracking and Telecommunications Technology, Beijing 100094, China;Center for Strategic Evaluation Consultation, Academy of Military Sciences, Beijing 100091, China)
机构地区:[1]陆军装甲兵学院装备保障与再制造系,北京100072 [2]大连海事大学航运经济与管理学院,辽宁大连116026 [3]北京跟踪与通信技术研究,北京100094 [4]军事科学院战略评估咨询中心,北京100091
出 处:《兵器装备工程学报》2022年第5期151-157,共7页Journal of Ordnance Equipment Engineering
基 金:国防科技预研项目。
摘 要:由于战场环境的高度不确定性,野战仓库的供应能力存在因受敌打击等原因导致的中断风险。将野战仓库选址、部队需求分配及任务调度等融合为一类选址调度组合优化问题。考虑野战仓库的中断风险,以期望保障完成时间最小化为目标,构建了基于中断情境的混合整数规划模型。设计一种基于逻辑的Benders分解算法(LBBD),将问题分解为主问题和子问题,并通过生成和添加Benders切割的方式进行迭代求解。为验证所提出模型和算法的有效性,生成40个算例进行数值实验,结果表明:随着算例规模增大,模型求解效果迅速降低,直至无法获得可行解。LBBD算法对所有算例均能给出可行解,且与模型直接求解相比,期望保障完成时间最多减少70%以上。同时,与传统分阶段求解方法对比,采用组合优化的LBBD算法平均可降低期望保障完成时间29.44%,表明组合优化方法能够获得更好的全局解。With the high uncertainty of the battlefield environment,the supply capacity of an equipment warehouse is under disruption risks due to reasons like enemy attack.The material warehouse location,demand allocation and task scheduling were integrated into a combinatorial scheduling and location problem.Considering the disruption risks of material warehouses,a scenario-based mixed integer programming model was formulated to minimize the expected makespan.A logic-based Benders decomposition algorithm(LBBD)was designed to solve the problem.To verify the effectiveness of the models and algorithms,a numerical experiment was conducted based on 40 instances.The results of instances show that the performance of the model decreases quickly as the instances get larger,and it fails to solve some large-sized instances.LBBD can obtain feasible solutions for all the instances,and can reduce the expected makespan by more than 70%compared with the model.Moreover,the LBBD,which applies the combinatorial optimization principle,can reduce the expected makespan by 29.44%on average compared with the traditional sequential method,indicating that the combinatorial optimization method can obtain better global solutions.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.133.83.123