An Application of Genetic Algorithm for Facility Location Problem with A-distance in a Competitive Environment
-
- UNO Takeshi
- Graduate School of Engineering, Hiroshima University
-
- SAKAWA Masatoshi
- Graduate School of Engineering, Hiroshima University
-
- KATO Kosuke
- Graduate School of Engineering, Hiroshima University
-
- KATAGIRI Hideki
- Graduate School of Engineering, Hiroshima University
-
- CHO Kazutaka
- Graduate School of Engineering, Hiroshima University
Bibliographic Information
- Other Title
-
- 競合環境下でのA‐距離施設配置問題に対する遺伝的アルゴリズムの応用
- キョウゴウ カンキョウ カ デ ノ A キョリ シセツ ハイチ モンダイ ニ タイスル イデンテキ アルゴリズム ノ オウヨウ
Search this article
Description
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
-
- Transactions of the Institute of Systems, Control and Information Engineers
-
Transactions of the Institute of Systems, Control and Information Engineers 20 (3), 106-113, 2007
THE INSTITUTE OF SYSTEMS, CONTROL AND INFORMATION ENGINEERS (ISCIE)
- Tweet
Details 詳細情報について
-
- CRID
- 1390001205166947968
-
- NII Article ID
- 10020046728
-
- NII Book ID
- AN1013280X
-
- ISSN
- 2185811X
- 13425668
-
- NDL BIB ID
- 8684435
-
- Text Lang
- ja
-
- Data Source
-
- JaLC
- NDL Search
- Crossref
- CiNii Articles
- KAKEN
-
- Abstract License Flag
- Disallowed