Journal of Architecture and Planning (Transactions of AIJ)
Online ISSN : 1881-8161
Print ISSN : 1340-4210
ISSN-L : 1340-4210
AN ALGORITHM FOR MINI-POWER-SUM FACILITIES LOCATION PROBLEM IN CONTINUOUS SPACE
Tatsuya KISHIMOTO
Author information
JOURNAL FREE ACCESS

1999 Volume 64 Issue 521 Pages 301-308

Details
Abstract

Facilities location problem to minimize the power sum of distances between demand points and any facility is concerned. First, studies in literature are reviewed. Second, a new heuristic method for mini-power-sum problem, which is based on stochastic descent method and stochastic approximation method, is presented. Next, comparisons of algorithmic performance with famed methods: comparison with Cooper's Alternate method at power exponent r = 1.0, comparison with k-means algorithm as cluster analysis tool at r = 2.0, and comparison with Drezner's heuristic method for multi-source Mini-max problem at r = 50.0, are shown. Consequently the effectiveness and the priority of presented method are confirmed.

Content from these authors
© 1999 Architectural Institute of Japan
Previous article Next article
feedback
Top