システム制御情報学会論文誌
Online ISSN : 2185-811X
Print ISSN : 1342-5668
ISSN-L : 1342-5668
競合環境下でのA-距離施設配置問題に対する遺伝的アルゴリズムの応用
宇野 剛史坂和 正敏加藤 浩介片桐 英樹長 一孝
著者情報
ジャーナル フリー

2007 年 20 巻 3 号 p. 106-113

詳細
抄録

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.

著者関連情報
© システム制御情報学会
前の記事 次の記事
feedback
Top