Heuristic solution of the multisource Weber problem as a p-median problem

Authors:
Pierre Hansen;Nenad Mladenović;íRic Taillard
Affiliations:
GERAD and ícole des Hautes ítudes Commerciales, 3000 chemin de la Côte-Sainte-Catherine,Montréal (Quebec) Canada H3T 2A7;GERAD and ícole des Hautes ítudes Commerciales, 3000 chemin de la Côte-Sainte-Catherine,Montréal (Quebec) Canada H3T 2A7;IDSIA, Corso Elvezia 36, CH-6900 Lugano, Switzerland
Venue:
Operations Research Letters
Year:
1998

Citing 5
Cited 15

Towards practical `neural' computation for combinatorial optimization problems

AIP Conference Proceedings 151 on Neural Networks for Computing
Global convergence of a generalized iterative procedure for the minisum location problem with Ip distances

Operations Research
A projection method for lp norm location-allocation problems

Mathematical Programming: Series A and B
A new adaptive multi-start technique for combinatorial global optimizations

Operations Research Letters
A polynomial time dual algorithm for the Euclidean multifacility location problem

Operations Research Letters

Heuristic Methods for Large Centroid Clustering Problems

Journal of Heuristics
An Efficient Neural Network Algorithm for the p-Median Problem

IBERAMIA 2002 Proceedings of the 8th Ibero-American Conference on AI: Advances in Artificial Intelligence
New stochastic models for capacitated location-allocation problem

Computers and Industrial Engineering
Cooperative Parallel Variable Neighborhood Search for the p-Median

Journal of Heuristics
Genetic subgradient method for solving location-allocation problems

Applied Soft Computing
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
Facility location-allocation problem in random fuzzy environment: Using (α,β) -cost minimization model under the Hurewicz criterion

Computers & Mathematics with Applications
Region-rejection based heuristics for the capacitated multi-source Weber problem

Computers and Operations Research
Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations

Computers and Operations Research
A guided reactive GRASP for the capacitated multi-source Weber problem

Computers and Operations Research
Single-Source Capacitated Multi-Facility Weber Problem-An iterative two phase heuristic algorithm

Computers and Operations Research
A new heuristic for solving the p-median problem in the plane

Computers and Operations Research
Heuristics for the single source capacitated multi-facility Weber problem

Computers and Industrial Engineering
Beam search heuristics for the single and multi-commodity capacitated Multi-facility Weber Problems

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Good heuristic solutions for large multisource Weber problems can be obtained by solving related p-median problems in which potential locations of the facilities are users locations and then solving Weber problems for the sets of users of each facility. Resume De bonnes solutions heuristiques pour des problemes de Weber Multisources de grande taille peuvent etre obtenues en resolvant des problemes de p-mediane correspondants ou les localisations potentielles des facilites sont les localisations des usagers puis en resolvant des problemes de Weber pour les ensembles d'usagers de chaque facilite.