Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
From MaRDI portal
Publication:3505940
DOI10.1057/palgrave.jors.2602262zbMath1167.90557OpenAlexW2053763399MaRDI QIDQ3505940
Necati Aras, İ. Kuban Altınel, Metin Orbay
Publication date: 11 June 2008
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.2602262
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (15)
Simulation and optimization of ant colony optimization algorithm for the stochastic uncapacitated location-allocation problem ⋮ Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ 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 ⋮ Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem ⋮ A new local search for continuous location problems ⋮ Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem ⋮ Distributions of rectilinear deviation distance to visit a facility ⋮ The location-allocation problem of drone base stations ⋮ Region-rejection based heuristics for the capacitated multi-source Weber problem ⋮ Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations ⋮ Clustering search algorithm for the capacitated centered clustering problem ⋮ The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem
This page was built for publication: Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
