A guided reactive GRASP for the capacitated multi-source Weber problem

DOI10.1016/J.COR.2010.10.015zbMATH Open1205.90180DBLPjournals/cor/LuisSN11OpenAlexW2081814812WikidataQ57933448 ScholiaQ57933448MaRDI QIDQ622155FDOQ622155

Authors: Martino Luis, Gábor Nagy, 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

Recommendations

• Region-rejection based heuristics for the capacitated multi-source Weber problem
• New heuristic methods for the capacitated multi-facility Weber problem
• A perturbation-based heuristic for the capacitated multisource Weber problem
• Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
• Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem

zbMATH Keywords

learningcontinuous locationcapacitated locationreactive GRASPrestricted regions

Mathematics Subject Classification ID

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

Cites Work

• Heuristic solution of the multisource Weber problem as a \(p\)-median problem
• A genetic algorithm based approach for the uncapacitated continuous location-allocation problem
• Handbook of applied optimization
• Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps
• Title not available (Why is that?)
• Heuristic Methods for Location-Allocation Problems
• Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem
• An efficient solution method for Weber problems with barriers based on genetic algorithms
• A continuous location-allocation problem with zone-dependent fixed cost
• Region-rejection based heuristics for the capacitated multi-source Weber problem
• The rectilinear distance Weber problem in the presence of a probabilistic line barrier
• Title not available (Why is that?)
• On the Complexity of Some Common Geometric Location Problems
• A probabilistic heuristic for a computationally difficult set covering problem
• Greedy randomized adaptive search procedures
• What you should know about location modeling
• A reactive GRASP with path relinking for capacitated clustering
• A reactive GRASP for a commercial territory design problem with multiple balancing requirements
• Semi-greedy heuristics: An empirical study
• Title not available (Why is that?)
• 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
• A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem
• Heuristic methods for large centroid clustering problems
• New heuristic methods for the capacitated multi-facility Weber problem
• Title not available (Why is that?)
• Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
• Title not available (Why is that?)
• Global Optimization Procedures for the Capacitated Euclidean and l_p 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
• The Transportation-Location Problem
• A perturbation-based heuristic for the capacitated multisource Weber problem
• Constructive heuristics for the uncapacitated continuous location-allocation problem
• A cellular heuristic for the multisource Weber problem.

Cited In (13)

• Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem
• On the convergence of the Cooper's algorithm
• A projected Weiszfeld algorithm for the box-constrained Weber location problem
• Variable neighborhood search: the power of change and simplicity
• The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods
• 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
• Reactive GRASP for the strip-packing problem
• A perturbation-based heuristic for the capacitated multisource Weber problem
• 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
• The location-allocation problem of drone base stations
• The optimal solution set of the multi-source Weber problem

This page was built for publication: A guided reactive GRASP 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 Q622155)