首页 | 本学科首页   官方微博 | 高级检索  
     检索      

满意度最大条件下的战时保障补给站选址问题研究
引用本文:王文峰,谭林,郭波.满意度最大条件下的战时保障补给站选址问题研究[J].运筹与管理,2007,16(5):29-34.
作者姓名:王文峰  谭林  郭波
作者单位:国防科技大学,信息系统与管理学院,系统工程系,湖南,长沙,410073
摘    要:设施选址是装备保障系统构建过程中的重要决策步骤。文章首先分析了现代战争中装备保障设施尤其是终端补给站选址问题对形成装备保障快速反应能力的重要性,提出了以作战区域内所有作战单位的保障满意度最大为目标的有限补给站选址优化模型,作战单位对选址方案的保障满意度是从所需的资源数量和保障反应及时性两个方面进行考虑的。之后基于拉格朗日松弛算法设计了模型的启发式求解算法,实验结果表明该算法有效。

关 键 词:装备保障  选址-分配问题  部分覆盖  拉格朗日松弛
文章编号:1007-3221(2007)05-0029-06
修稿时间:2007-04-25

Research on the Equipment Support Point Location Problem in War with Maximal Satisfaction
WANG Wen-feng,TAN Lin,GUO Bo.Research on the Equipment Support Point Location Problem in War with Maximal Satisfaction[J].Operations Research and Management Science,2007,16(5):29-34.
Authors:WANG Wen-feng  TAN Lin  GUO Bo
Institution:Department of System Engineering, College of Information System and Management, Na tional University of Defense Technology, Changsha 410073, China
Abstract:Facility location decision is an important process to construct the equipment support system.Firstly,the paper analyzes the importance of facility location,especially the facilities which are the end suppliers,to the ability of rapid response of the support system.Then the location model of limited number of support points which is aimed at maximizing the support satisfaction of all the combat units in the battle zone is proposed.The model is formulated as an integer programming and the combat unit's satisfaction of a facility location plan is evaluated from both the quantity of resources needed and the timeliness requirement.A heuristic algorithm based on Lagrangean relaxation is provided and coded in MATLAB to solve the problem.The experiment indicates the algorithm is useful.
Keywords:equipments support  location-allocation problems  partial coverage  Lagrangean relaxation
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号