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

DOI10.1016/J.COR.2008.06.012MaRDI QIDQ1000993zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Martino Luis, Said Salhi, 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)

Recommendations

• A perturbation-based heuristic for the capacitated multisource Weber problem
• New heuristic methods for the capacitated multi-facility Weber problem
• Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm
• Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
• A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach
• Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem
• Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem
• A branch-and-price algorithm for the multi-source Weber problem
• Heuristic solution of the multisource Weber problem as a \(p\)-median problem

Cites work

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

Cited in

(16)

• Application of heuristic and metaheuristic algorithms in solving constrained Weber problem with feasible region bounded by arcs
• On statistical bounds of heuristic solutions to location problems
• A projected Weiszfeld algorithm for the box-constrained Weber location problem
• A guided reactive GRASP for the capacitated multi-source Weber problem
• Successive computation of some efficient locations of the Weber problem with barriers
• The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods
• A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfaces
• Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm
• The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem
• Confidence in heuristic solutions?
• Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem
• Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems
• A hierarchical algorithm for the planar single-facility location routing problem
• A two-echelon joint continuous-discrete location model
• Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem
• The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches

This page was built for publication: Region-rejection based heuristics for the capacitated multi-source Weber problem

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