基于边需求的抢修分队选址问题

摘要

为解决机动作战背景下抢修分队的合理选址问题,提高战场装备抢修的时效性,基于不确定决策理论中的拉普拉斯准则以及网络上任意一点均有可能发生任务需求的假设,以整个机动交通网的覆盖率最大为目标,构建了一种新的双重覆盖标准选址模型；设计了边需求下的覆盖率计算方法,采用分区域聚类的方法构造初始解,用改进的遗传禁忌算法精确求解,并加入启发式策略,避免搜索过程中产生大量不可行解.结果表明,所提出的算法计算量小,在不增加网络维度的情况下,解决了边需求选址模型的精度问题.%To solve the problem of rational location of repairing units and improve the timeliness of the battlefield-repairing, a new location model with double coverage standards was constructed based on Laplace criterion of uncertainty decision and aiming at the maximum of edge covering ratio of the whole road network by supposing that task demands occur at any point of the network. An improved genetic-tabu algorithm was designed to solve this model. A group of initial solutions was obtained by the area-dividing clustering method. To avoid the generation of too many infeasible solutions in searching, the heuristic strategy was adopted at cross choosing. The results show that the proposed algorithm has a low computational complexity, and the precision problem of the location model based on edge demands is solved without increasing the network dimensions.