A distance-limited continuous location-allocation problem for spatial planning of decentralized systems
From MaRDI portal
Publication:1651515
DOI10.1016/j.cor.2017.06.013zbMath1391.90396OpenAlexW2631815431MaRDI QIDQ1651515
Ayse Selin Kocaman, Kagan Gokbayrak
Publication date: 12 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/37407
Integer programming (90C10) Continuous location (90B85) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (5)
A two-level off-grid electric distribution problem on the continuous space ⋮ Data driven hybrid evolutionary analytical approach for multi objective location allocation decisions: automotive green supply chain empirical evidence ⋮ A voltage drop limited decentralized electric power distribution network ⋮ Integrated optimization model for distribution network design: a case study of the clothing industry ⋮ A planar facility location-allocation problem with fixed and/or variable cost structures for rural electrification
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New heuristic algorithms for solving the planar \(p\)-median problem
- A new heuristic for solving the \(p\)-median problem in the plane
- New local searches for solving the multi-source Weber problem
- A continuous location-allocation problem with zone-dependent fixed cost
- An effective and simple heuristic for the set covering problem
- A GRASP algorithm to solve the unicost set covering problem
- Enhancing an algorithm for set covering problems
- Heuristic solution of the multisource Weber problem as a \(p\)-median problem
- A genetic algorithm for the set covering problem
- Simple Lagrangian heuristic for the set covering problem
- A projection method for \(l_ p\) norm location-allocation problems
- A surrogate heuristic for set covering problems
- A parallel genetic algorithm to solve the set-covering problem
- An algorithm for set covering problem
- The simple plant location problem: Survey and synthesis
- A new local search for continuous location problems
- Approximation algorithm for uniform bounded facility location problem
- On the Weber facility location problem with limited distances and side constraints
- A multiperiod set covering location model for dynamic redeployment of ambulances
- A 3-flip neighborhood local search for the set covering problem
- On the Complexity of Some Common Geometric Location Problems
- Medi-centre Location Problems
- Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
- Location-Allocation Problems
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- The Facility Location Problem with Limited Distances
- TSPLIB—A Traveling Salesman Problem Library
- A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
- Heuristic Methods for Location-Allocation Problems
- A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem
- The multi-source Weber problem with constant opening cost
- A Heuristic Method for the Set Covering Problem
- The Location of Emergency Service Facilities
- Algorithms for the set covering problem
- A modified Weiszfeld algorithm for the Fermat-Weber location problem
- Approximation algorithms for bounded facility location problems
This page was built for publication: A distance-limited continuous location-allocation problem for spatial planning of decentralized systems
