A guided reactive GRASP for the capacitated multi-source Weber problem
From MaRDI portal
Publication:622155
DOI10.1016/j.cor.2010.10.015zbMath1205.90180OpenAlexW2081814812WikidataQ57933448 ScholiaQ57933448MaRDI QIDQ622155
Gábor Nagy, Martino Luis, Said Salhi
Publication date: 31 January 2011
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.10.015
Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
The optimal solution set of the multi-source Weber problem ⋮ The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches ⋮ Variable neighborhood search: the power of change and simplicity ⋮ A projected Weiszfeld algorithm for the box-constrained Weber location problem ⋮ On the convergence of the Cooper's algorithm ⋮ Location and allocation based branch and bound algorithms for the 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 ⋮ The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods ⋮ The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem
Cites Work
- A reactive GRASP with path relinking for capacitated clustering
- 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
- A reactive GRASP for a commercial territory design problem with multiple balancing requirements
- Region-rejection based heuristics for the capacitated multi-source Weber problem
- The rectilinear distance Weber problem in the presence of a probabilistic line barrier
- A probabilistic heuristic for a computationally difficult set covering 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.
- Greedy randomized adaptive search procedures
- Semi-greedy heuristics: An empirical study
- On the Complexity of Some Common Geometric 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
- What you should know about location modeling
- Global Optimization Procedures for the Capacitated Euclidean and lp Distance Multifacility Location-Allocation Problems
- A squared-euclidean distance location-allocation problem
- Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances
- Heuristic Methods for Location-Allocation Problems
- Constructive heuristics for the uncapacitated continuous location-allocation problem
- The Transportation-Location Problem
- Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
