Paper Info
Title
Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps
Abstract
The uncapacitated multi-facility Weber problem is concerned with locating m facilities in the Euclidean plane and allocating the demands of n customers to these facilities with the minimum total transportation cost. This is a non-convex optimization problem and difficult to solve exactly. As a consequence, efficient and accurate heuristic solution procedures are needed. The problem has different types based on the distance function used to model the distance between the facilities and customers. We concentrate on the rectilinear and Euclidean problems and propose new vector quantization and self-organizing map algorithms. They incorporate the properties of the distance function to their update rules, which makes them different from the existing two neural network methods that use rather ad hoc squared Euclidean metric in their updates even though the problem is originally stated in terms of the rectilinear and Euclidean distances. Computational results on benchmark instances indicate that the new methods are better than the existing ones, both in terms of the solution quality and computation time.
Year
DOI
Venue
2006
10.1057/palgrave.jors.2601962
JORS
Keywords
Field
DocType
reliability,information technology,computer science,information systems,location,project management,logistics,communications technology,operations research,production,management science,investment,forecasting,scheduling,inventory,operational research,marketing
Heuristic,Computer science,Euclidean distance,Metric (mathematics),Self-organizing map,Vector quantization,Heuristics,Optimization problem,Weber problem,Operations management
Journal
Volume
Issue
ISSN
57
1
0160-5682
Citations 
PageRank 
References 
2
0.44
9
Authors
6
Name
Order
Citations
PageRank
Necati Aras146230.62
k c ozk inodot220.44
sac inodot3312.47
idot4101.36
k alt inodot5362.93
nel6312.47