A cellular heuristic for the multisource Weber problem.

DOI10.1016/S0305-0548(02)00095-3zbMath1039.90033MaRDI QIDQ1422355

D. Massart

Publication date: 14 February 2004

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

Location; Heuristic; Continuous space; Discrete approximation

Mathematics Subject Classification ID

90B85: Continuous location

90C59: Approximation methods and heuristics in mathematical programming

Related Items

A guided reactive GRASP for the capacitated multi-source Weber problem, Region-rejection based heuristics for the capacitated multi-source Weber problem, Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations, Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem, Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm, A new local search for continuous location problems, Successive computation of some efficient locations of the Weber problem with barriers

Cites Work

• Unnamed Item
• Unnamed Item
• An optimal method for solving the (generalized) multi-Weber problem
• Heuristic solution of the multisource Weber problem as a \(p\)-median problem
• Heuristic concentration: Two stage solution construction
• A projection method for \(l_ p\) norm location-allocation problems
• Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems
• Location-Allocation Problems
• A computation procedure for the exact solution of location-allocation problems with rectangular distances
• Heuristic Methods for Location-Allocation Problems
• Constructive heuristics for the uncapacitated continuous location-allocation problem
• Exact and approximate solutions to the multisource weber problem