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

LocationHeuristicContinuous spaceDiscrete approximation

Mathematics Subject Classification ID

Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (14)

The optimal solution set of the multi-source Weber problem ⋮ A guided reactive GRASP for the capacitated multi-source Weber problem ⋮ The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches ⋮ On the convergence of the Cooper's algorithm ⋮ A new local search for continuous location problems ⋮ 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 ⋮ The location-allocation problem of drone base stations ⋮ Successive computation of some efficient locations of the Weber problem with barriers ⋮ 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 ⋮ A hybrid data mining metaheuristic for the p‐median problem ⋮ The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem ⋮ A branch-and-price approach for the continuous multifacility monotone ordered median problem

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

This page was built for publication: A cellular heuristic for the multisource Weber problem.