Heuristic Methods for Large Centroid Clustering Problems
Journal of Heuristics
New stochastic models for capacitated location-allocation problem
Computers and Industrial Engineering
A heuristic method for large-scale multi-facility location problems
Computers and Operations Research
Self-organizing feature maps for solving location-allocation problems with rectilinear distances
Computers and Operations Research
Variable neighborhood search for the k-cardinality tree
Metaheuristics
Logistics distribution centers location problem and algorithm under fuzzy environment
Journal of Computational and Applied Mathematics
Modeling capacitated location-allocation problem with fuzzy demands
Computers and Industrial Engineering
Computers & Mathematics with Applications
The multi-facility location-allocation problem with polyhedral barriers
Computers and Operations Research
Region-rejection based heuristics for the capacitated multi-source Weber problem
Computers and Operations Research
Computers and Operations Research
Solving the multiple competitive facilities location and design problem on the plane
Evolutionary Computation
Spatial point process models for location-allocation problems
Computational Statistics & Data Analysis
VNS and second order heuristics for the min-degree constrained minimum spanning tree problem
Computers and Operations Research
Location problems optimization by a self-organizing multiagent approach
Multiagent and Grid Systems - Engineering Environments in Multiagent Systems
A guided reactive GRASP for the capacitated multi-source Weber problem
Computers and Operations Research
Particle swarm optimization for the continuous p-median problem
CIMMACS'07 Proceedings of the 6th WSEAS international conference on Computational intelligence, man-machine systems and cybernetics
Parallel algorithms for continuous multifacility competitive location problems
Journal of Global Optimization
Single-Source Capacitated Multi-Facility Weber Problem-An iterative two phase heuristic algorithm
Computers and Operations Research
Clustering and the perturbed spatial median
Mathematical and Computer Modelling: An International Journal
A new heuristic for solving the p-median problem in the plane
Computers and Operations Research
Variable neighborhood search for location routing
Computers and Operations Research
Journal of Intelligent Manufacturing
Heuristics for the single source capacitated multi-facility Weber problem
Computers and Industrial Engineering
A hybrid metaheuristic approach for the capacitated p-median problem
Applied Soft Computing
Determining the number of facilities for large-scale emergency
International Journal of Computing Science and Mathematics
A nested heuristic for parameter tuning in Support Vector Machines
Computers and Operations Research
| Hi-index | 0.00 |
The multisource Weber problem is to locate simultaneouslym facilities in the Euclidean plane to minimize the total transportation cost for satisfying the demand ofn fixed users, each supplied from its closest facility. Many heuristics have been proposed for this problem, as well as a few exact algorithms. Heuristics are needed to solve quickly large problems and to provide good initial solutions for exact algorithms. We compare various heuristics, i.e., alternative location-allocation (Cooper 1964), projection (Bongartz et al. 1994), Tabu search (Brimberg and Mladenovic 1996a),p-Median plus Weber (Hansen et al. 1996), Genetic search and several versions of Variable Neighbourhood search. Based on empirical tests that are reported, it is found that most traditional and some recent heuristics give poor results when the number of facilities to locate is large and that Variable Neighbourhood search gives consistently best results, on average, in moderate computing time.