A continuous location-allocation problem with zone-dependent fixed cost
From MaRDI portal
Publication:816411
DOI10.1007/s10479-005-2041-5zbMath1114.90054OpenAlexW1987959344MaRDI QIDQ816411
Publication date: 9 March 2006
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-005-2041-5
Related Items
Geometric partitioning and robust ad-hoc network design ⋮ A distance-limited continuous location-allocation problem for spatial planning of decentralized systems ⋮ Site selection in the US retailing industry ⋮ Exact and approximate heuristics for the rectilinear Weber location problem with a line barrier ⋮ A two-echelon joint continuous-discrete location model ⋮ A voltage drop limited decentralized electric power distribution network ⋮ 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 ⋮ Cooperative games in facility location situations with regional fixed costs ⋮ A planar facility location-allocation problem with fixed and/or variable cost structures for rural electrification ⋮ Combined land-use and water allocation planning ⋮ A fuzzy algorithm for continuous capacitated location allocation model with risk consideration ⋮ The multi-facility location-allocation problem with polyhedral barriers ⋮ A new local search for continuous location problems ⋮ New genetic algorithms based approaches to continuous \(p\)-median problem ⋮ A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand ⋮ The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods ⋮ Region-rejection based heuristics for the capacitated multi-source Weber problem ⋮ Local improvement in planar facility location using vehicle routing ⋮ The capacitated single-source p-center problem in the presence of fixed cost and multilevel capacities using VNS and aggregation technique ⋮ An elliptical cover problem in drone delivery network design and its solution algorithms ⋮ The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem
Cites Work
- Unnamed Item
- Unnamed Item
- Asymptotic behavior of the Weber location problem on the plane
- On the exact solution of large-scale simple plant location problems
- An efficient algorithm for facility location in the presence of forbidden regions
- Heuristic solution of the multisource Weber problem as a \(p\)-median problem
- Planar Weber location problems with barriers and block norms
- Lagrangean heuristics for location problems
- On the Complexity of Some Common Geometric Location Problems
- An Algorithm for a Constrained Weber Problem
- An Overview of Representative Problems in Location Research
- Location-Allocation Problems
- Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances
- Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel
- A perturbation heuristic for a class of location problems
- Constructive heuristics for the uncapacitated continuous location-allocation problem
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- A reduction result for location problems with polyhedral barriers
