A perturbation-based heuristic for the capacitated multisource Weber problem
From MaRDI portal
Publication:864040
DOI10.1016/j.ejor.2005.09.050zbMath1127.90048OpenAlexW2058023679MaRDI QIDQ864040
Zaitul Marlizawati Zainuddin, Said Salhi
Publication date: 12 February 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://kar.kent.ac.uk/5280/1/120_Salhi.pdf
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (12)
Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems ⋮ An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem ⋮ A two-echelon joint continuous-discrete location model ⋮ 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 ⋮ Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm ⋮ 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 ⋮ Local improvement in planar facility location using vehicle routing ⋮ The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem
Cites Work
- Unnamed Item
- Heuristics for the capacitated plant location model
- ADD-heuristics' starting procedures for capacitated plant location models
- A genetic algorithm based approach for the uncapacitated continuous location-allocation problem
- Lagrangean heuristics for location problems
- Lagrangean heuristics applied to a variety of large capacitated plant location problems
- A Cross Decomposition Algorithm for Capacitated Facility Location
- An efficient heuristic procedure for the capacitated warehouse location problem
- Heuristic Methods for Location-Allocation Problems
- Constructive heuristics for the uncapacitated continuous location-allocation problem
- The Transportation-Location Problem
- Capacitated location-allocation problems on a line
This page was built for publication: A perturbation-based heuristic for the capacitated multisource Weber problem
