New heuristic methods for the capacitated multi-facility Weber problem

DOI10.1002/nav.20176zbMath1124.90016OpenAlexW2030977429MaRDI QIDQ3442870

Kuban Altmel, Necati Aras, Metin Orbay

Publication date: 23 May 2007

Published in: Naval Research Logistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.20176

zbMATH Keywords

heuristicslocation-allocationmixed integer linear programming

Mathematics Subject Classification ID

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

Related Items (16)

Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems ⋮ Global optimization algorithm for capacitated multi-facility continuous location-allocation problems ⋮ 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 ⋮ Solving a minisum single facility location problem in three regions with different norms ⋮ A projected Weiszfeld algorithm for the box-constrained Weber location problem ⋮ A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation ⋮ 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 ⋮ Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm ⋮ The capacitated multi-facility location–allocation problem with probabilistic customer location and demand: two hybrid meta-heuristic algorithms ⋮ 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 ⋮ The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem

Cites Work

• Unnamed Item

This page was built for publication: New heuristic methods for the capacitated multi-facility Weber problem