战场不确定环境下考虑敌方打击的后勤供应网络设计

摘要

In battlefield environment,the logistic centers built for commodity distribution are usually attacked by enemies,which brings much challenges to the optimization of supply networks. Motivated by this,the design problem for supply networks in uncertain battlefield environment is studied,in which the uncertainties from supply and demand are considered. An integer programming model is presented to formulate the problem,and a Lagrangian heuristic algorithm is developed to solve the problem. 50 small test examples (include 5 supply nodes,20 distribution nodes and 50 combat nodes)and 50 large examples(include 20 supply nodes,100 distribution nodes and 500 combat nodes) are used to test the efficiency and robustness of the algorithm. Computational results show that the Lagrangian heuristic algorithm can obtain near optimal solutions for the examples in short time.%在战场环境下，负责后勤物资分发与转运战场补给中心随时会受到敌方的打击，给后勤供应系统的设计优化带来了巨大挑战。鉴于此，研究了战场不确定环境下的后勤物资供应网络设计优化问题，考虑了供应和需求的不确定性，建立了优化问题的整数规划模型，并开发了基于拉格朗日松弛的启发式求解算法。采用50个小规模的测试用例（包含5个供应节点、20个候选补给中心节点以及50个作战单元节点）和50个大规模测试用例（包括20个供应节点、100个后勤补给中心节点以及500个作战单元节点）测试了算法的有效性与鲁棒性。计算结果显示基于拉格朗日的求解算法可以在短时间内给出问题的近似最优解。