Solution of Basic Facilities Locations Problem on A Continuous Plane Using Competitive Learning Method
-
- Kishimoto Tatsuya
- Univ. of Tokyo
Bibliographic Information
- Other Title
-
- 連続平面上における基本的施設配置問題の競合学習法を応用した解法
- レンゾク ヘイメンジョウ ニ オケル キホンテキ シセツ ハイチ モンダイ ノ
Search this article
Abstract
Realizing the ultimate convenience for both users and service providers in Regional Facilities Location Planning is desired. This paper is to suggest a new solution of the Facilities Location Problem on Discrete Demand Distribution using the Competitive Learning Method of neural networks. By this method, no more data conversion such as mesh is needed, the original discrete data of demand distribution is input and processed. Thus, no information loss and errors occurs, and it enables more detailed planning which corresponds to the real demand distribution. Also in this paper, the superiority of the Competitive Learning Method as k-means algorithm is experimentally proved. Finally, the effectiveness of the suggested method is confirmed by the application study on a ideal facilities location problem in Meguro ward.
Journal
-
- Journal of the City Planning Institute of Japan
-
Journal of the City Planning Institute of Japan 32 (0), 109-114, 1997-10-25
The City Planning Institute of Japan
- Tweet
Keywords
Details 詳細情報について
-
- CRID
- 1390001204214741376
-
- NII Article ID
- 10004546772
- 130006729571
- 10007466543
-
- NII Book ID
- AN10276504
-
- ISSN
- 21850593
- 09160647
-
- NDL BIB ID
- 4452144
-
- Text Lang
- ja
-
- Data Source
-
- JaLC
- NDL
- Crossref
- CiNii Articles
-
- Abstract License Flag
- Disallowed