Self-organizing feature maps for solving location-allocation problems with rectilinear distances

Authors:
Kuang-Han Hsieh;Fang-Chih Tien
Affiliations:
Department of Management Science, Chinese Military Academy, FengShan, Kaohsiung 803, Taiwan, ROC;Department of Industrial Engineering and Management, National Taipei University of Technology, 1 Section 3, Chung-Hsiao E. Rd., Taipei, Taiwan, ROC
Venue:
Computers and Operations Research
Year:
2004

Citing 4
Cited 5

A projection method for lp norm location-allocation problems

Mathematical Programming: Series A and B
Hybrid evolutionary method for obstacle location-allocation

ICC&IE '94 Proceedings of the 17th international conference on Computers and industrial engineering
Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems

Computers and Operations Research - Special issue: artificial intelligence, evolutionary programming and operations research
Improvement and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem

Operations Research

Location model for CCA-treated wood waste remediation units using GIS and clustering methods

Environmental Modelling & Software
An application of a self-organizing model to the design of urban transport networks

Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology - Evolutionary neural networks for practical applications
Integrated use of fuzzy c-means and convex programming for capacitated multi-facility location problem

Expert Systems with Applications: An International Journal
Intra-pulse modulation recognition of unknown radar emitter signals using support vector clustering

FSKD'06 Proceedings of the Third international conference on Fuzzy Systems and Knowledge Discovery
Adaptive genetic algorithm for solving sugarcane loading stations with multi-facility services problem

Computers and Electronics in Agriculture

Quantified Score

Hi-index	0.01

Visualization

Abstract

This study deals with solving uncapacitated location-allocation (LA) problems with rectilinear distances by using a method based on Kohonen self-organizing feature maps (SOFMs). By treating LA problems as clustering problems, this method has the advantage of extracting the structure of the input data by a self-organizing process based on adaptation rules. In this paper, a heuristic method is constructed by using SOFMs with a guided refining procedure, and its performance is compared with simulated annealing. The experimental results using the proposed guided refining procedure to reinforce the SOFM method show that the proposed method is excellent in terms of quality of solution and speed of computation. In addition, the experimental results suggest that SOFMs may provide an excellent approach when generating initial solutions for other heuristic or exact algorithms. This conjecture is made because most of the solutions yielded by SOFM are close to the optimal solution in all experiments.