An application of genetic algorithm for multi-dimensional competitive facility location problem

Competitive facility location problem has been studied in many literatures, which were dealt with problems considering location of some competitive facilities on at most two-dimensional space. In this study, we formulate competitive facility location problem in the situation that a new facility is located on a multi-dimensional space which has been already located several facilities. In order to find an optimal solution for the problem efficiently, first we show that one of optimal solutions is found by a combination problem, and then we use genetic algorithm with double structured strings to find approximate solution of the problem. In order to illustrate the efficiency of our proposing algorithm, results for numerical experiments are shown.