The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches
From MaRDI portal
Publication:1695018
DOI10.1016/j.ejor.2017.04.004zbMath1380.90169OpenAlexW2604470732WikidataQ57934083 ScholiaQ57934083MaRDI QIDQ1695018
Said Salhi, Nader Azizi, Martino Luis, Chandra Ade Irawan
Publication date: 6 February 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://kar.kent.ac.uk/61599/1/The%20continuous%20single%20source%20location%20problem%20with%20capacity%20and%20zone.pdf
Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Single facility siting involving allocation decisions, Formulation and solution of a two-stage capacitated facility location problem with multilevel capacities, The location-allocation problem of drone base stations, The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods, The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A heuristic for BILP problems: the single source capacitated facility location problem
- Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem
- A hybrid firefly-genetic algorithm for the capacitated facility location problem
- A guided reactive GRASP for the capacitated multi-source Weber problem
- A continuous location-allocation problem with zone-dependent fixed cost
- On solving large instances of the capacitated facility location problem
- A perturbation-based heuristic for the capacitated multisource Weber problem
- Solving large \(p\)-median problems by a multistage hybrid approach using demand points aggregation and variable neighbourhood search
- Variable neighbourhood search: methods and applications
- Region-rejection based heuristics for the capacitated multi-source Weber problem
- Local improvement in planar facility location using vehicle routing
- The effect of ignoring routes when locating depots
- Heuristic solution of the multisource Weber problem as a \(p\)-median problem
- A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem
- A Lagrangean heuristic for a modular capacitated location problem
- A cellular heuristic for the multisource Weber problem.
- Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm
- Algorithms for the decomposition of a polygon into convex polygons
- An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems
- A new local search for continuous location problems
- A two-level evolutionary algorithm for solving the facility location and design \((1|1)\)-centroid problem on the plane with variable demand
- A fast swap-based local search procedure for location problems
- Bounds for the single source modular capacitated plant location problem
- On the Complexity of Some Common Geometric Location Problems
- A multi-objective heuristic approach for the casualty collection points location problem
- New heuristic methods for the capacitated multi-facility Weber problem
- Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
- Global Optimization Procedures for the Capacitated Euclidean and lp Distance Multifacility Location-Allocation Problems
- NP-Hard, Capacitated, Balanced p-Median Problems on a Chain Graph with a Continuum of Link Demands
- Location-Allocation Problems
- A squared-euclidean distance location-allocation problem
- Heuristic Methods for Location-Allocation Problems
- The multi-source Weber problem with constant opening cost
- The Transportation-Location Problem
