A cellular heuristic for the multisource Weber problem.

DOI10.1016/S0305-0548(02)00095-3MaRDI QIDQ1422355zbMATH OpenFDO

Authors D. Massart

Publication date 14 February 2004

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

Full work available at URL https://doi.org/10.1016/S0305-0548(02)00095-3

zbMATH Keywords

Continuous spaceDiscrete approximationHeuristicLocation

Mathematics Subject Classification ID

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

Recommendations

• Constructive heuristics for the uncapacitated continuous location-allocation problem
• scientific article; zbMATH DE number 5501651
• New local searches for solving the multi-source Weber problem
• Heuristic solution of the multisource Weber problem as a \(p\)-median problem
• A perturbation-based heuristic for the capacitated multisource Weber problem

Cites work

• A computation procedure for the exact solution of location-allocation problems with rectangular distances
• A projection method for \(l_ p\) norm location-allocation problems
• An optimal method for solving the (generalized) multi-Weber problem
• Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems
• Constructive heuristics for the uncapacitated continuous location-allocation problem
• Exact and approximate solutions to the multisource weber problem
• Heuristic concentration: Two stage solution construction
• Heuristic Methods for Location-Allocation Problems
• Heuristic solution of the multisource Weber problem as a \(p\)-median problem
• scientific article; zbMATH DE number 1075641 (Why is no real title available?)
• scientific article; zbMATH DE number 2114492 (Why is no real title available?)
• Location-Allocation Problems

Cited in

(17)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1422355)