An Application of Genetic Algorithm for Facility Location Problem with A-distance in a Competitive Environment

DOI Web Site 19 References

Bibliographic Information

Other Title
  • 競合環境下でのＡ‐距離施設配置問題に対する遺伝的アルゴリズムの応用
  • キョウゴウ カンキョウ カ デ ノ A キョリ シセツ ハイチ モンダイ ニ タイスル イデンテキ アルゴリズム ノ オウヨウ

Search this article

Abstract

About studies of optimal location problem with competitiveness to other facilities, the distance between facilities and their customers is usually represented as Euclid distance. However, there are often cases that facility location given for facility location model with Euclid distance does not suit the actual condition of facility location in city area. In this paper, we suggest a new location model by introducing A-distance, proposed by Widmayer etc., which is the distance that directions that customers can move is limited. Because the formulated optimal location problem is difficult to solve immediately, we reformulate the problem to combinational problem to find one of the optimal solutions for the problem. The reformulated problem can be solved strictly, but it requires enormous computational time and costs for large scale problems. We construct an efficient solving method by applying genetic algorithm for non-linear 0-1 programming problem. Moreover, we show efficiency of the algorithm by using some numerical examples.

Journal

References(19)*help

See more

Related Projects

See more

Keywords

Details 詳細情報について

Report a problem

Back to top