Region-rejection based heuristics for the capacitated multi-source Weber problem

DOI10.1016/j.cor.2008.06.012zbMath1179.90333OpenAlexW2165788053WikidataQ57933446 ScholiaQ57933446MaRDI QIDQ1000993

Said Salhi, Martino Luis, Gábor Nagy

Publication date: 12 February 2009

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

Full work available at URL: https://doi.org/10.1016/j.cor.2008.06.012

zbMATH Keywords

continuous locationcapacitated locationrestricted regionsadaptive heuristics

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Related Items

On statistical bounds of heuristic solutions to location problems ⋮ Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems ⋮ A two-echelon joint continuous-discrete location model ⋮ 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 ⋮ A projected Weiszfeld algorithm for the box-constrained Weber location problem ⋮ Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem ⋮ Application of heuristic and metaheuristic algorithms in solving constrained Weber problem with feasible region bounded by arcs ⋮ Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem ⋮ A hierarchical algorithm for the planar single-facility location routing problem ⋮ The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods ⋮ Successive computation of some efficient locations of the Weber problem with barriers ⋮ Confidence in heuristic solutions? ⋮ The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem ⋮ A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A continuous location-allocation problem with zone-dependent fixed cost
• An efficient solution method for Weber problems with barriers based on genetic algorithms
• A perturbation-based heuristic for the capacitated multisource Weber problem
• Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle
• The fixed charge problem. I: A new heuristic method
• Heuristic solution of the multisource Weber problem as a \(p\)-median problem
• A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem
• Heuristic methods for large centroid clustering problems
• A genetic algorithm based approach for the uncapacitated continuous location-allocation problem
• A cellular heuristic for the multisource Weber problem.
• Lagrangean heuristics applied to a variety of large capacitated plant location problems
• Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps
• New heuristic methods for the capacitated multi-facility Weber problem
• Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
• Global Optimization Procedures for the Capacitated Euclidean and l_p Distance Multifacility Location-Allocation Problems
• An Algorithm for a Constrained Weber Problem
• Heuristic Methods for Location-Allocation Problems
• Constructive heuristics for the uncapacitated continuous location-allocation problem
• The Transportation-Location Problem