Single- and multi-objective defensive location problems on a network
Single- and multi-objective defensive location problems on a network
复制标题
DOI：
10.1016/j.ejor.2007.04.003
复制
发表时间：
2008-07
期刊：
影响因子：
--
通讯作者：
Takeshi Uno;H. Katagiri
中科院分区：
文献类型：
--
作者：
Takeshi Uno;H. Katagiri
本文研究了一种新的最优选址问题，称为防御选址问题（DLP）。在DLP中，决策者确定防御设施，以防止她/他的敌人到达一个重要的地点，称为核心;例如，“一个国家的政府确定自卫基地，以防止她/他的侵略者到达该国的首都”。假设决策者所在区域为一个网络，核心为网络的一个顶点，设施定位者和敌人分别为决策者的上层和下层。然后，DLPs制定为双层0-1规划问题，以找到Stackelberg解决方案。为了有效地求解动态规划问题，提出了一种基于禁忌搜索的动态规划问题求解算法。所提出的解决方法的效率，通过应用的DLP的例子。此外，DLP扩展到多目标DLP，决策者需要同时保护多个核心。这样的DLP制定为多目标规划问题。为了寻求决策者对多目标DLP的满意解，提出了一种交互式模糊满意方法，并给出了该方法在多目标DLP实例中的应用结果。
This paper considers a new optimal location problem, called defensive location problem (DLP). In the DLPs, a decision maker locates defensive facilities in order to prevent her/his enemies from reaching an important site, called a core; for example, “a government of a country locates self-defense bases in order to prevent her/his aggressors from reaching the capital of the country.” It is assumed that the region where the decision maker locates her/his defensive facilities is represented as a network and the core is a vertex in the network, and that the facility locater and her/his enemy are an upper and a lower level of decision maker, respectively. Then the DLPs are formulated as bilevel 0-1 programming problems to find Stackelberg solutions. In order to solve the DLPs efficiently, a solving algorithm for the DLPs based upon tabu search methods is proposed. The efficiency of the proposed solving methods is shown by applying to examples of the DLPs. Moreover, the DLPs are extended to multi-objective DLPs that the decision maker needs to defend several cores simultaneously. Such DLPs are formulated as multi-objective programming problems. In order to find a satisfying solution of the decision maker for the multi-objective DLP, an interactive fuzzy satisfying method is proposed, and the results of applying the method to examples of the multi-objective DLPs are shown.