Abstract
Defensive location problem (DLP) is an optimal location problem in a competitive environment. DLPs considered in former studies are problems such that target for offense is single. In this paper, we extend DLP to a problem in cases that targets for offense are two or more. We formulate such DLP as a multi-objective programming problem, so an optimal location for the extended DLP is defined by Pareto optimal solution. In order to find Pareto optimal solutions for the extended DLP efficiently, we propose to apply taboo search algorithm. Moreover, in order to find a Pareto optimal solution which satisfies for the decision maker, we use interactive fuzzy satisfying method proposed by Sakawa and Yano. Effectiveness of the proposal solving method is verified by applying to some numerical examples for DLPs.