Constructive heuristics for the uncapacitated continuous location-allocation problem
From MaRDI portal
Publication:4658472
DOI10.1057/palgrave.jors.2601176zbMath1131.90407OpenAlexW2076266895MaRDI QIDQ4658472
No author found.
Publication date: 16 March 2005
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601176
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (16)
Simulation and optimization of ant colony optimization algorithm for the stochastic uncapacitated location-allocation problem ⋮ An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem ⋮ A perturbation-based heuristic for the capacitated multisource Weber problem ⋮ A guided reactive GRASP for the capacitated multi-source Weber problem ⋮ A planar facility location-allocation problem with fixed and/or variable cost structures for rural electrification ⋮ Accelerating the convergence in the single-source and multi-source Weber problems ⋮ A cellular heuristic for the multisource Weber problem. ⋮ Self-organizing feature maps for solving location--allocation problems with rectilinear distances. ⋮ On the convergence of the Cooper's algorithm ⋮ 2-facility manifold location routing problem ⋮ A new local search for continuous location problems ⋮ A hierarchical algorithm for the planar single-facility location routing problem ⋮ Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm ⋮ Region-rejection based heuristics for the capacitated multi-source Weber problem ⋮ A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfaces ⋮ A continuous location-allocation problem with zone-dependent fixed cost
This page was built for publication: Constructive heuristics for the uncapacitated continuous location-allocation problem
