Generalization of the restricted planar location problems: unified metaheuristic algorithms
From MaRDI portal
Publication:1654346
DOI10.1016/j.cor.2018.04.022zbMath1458.90456OpenAlexW2803454958MaRDI QIDQ1654346
Haldun Süral, Mohammad Saleh Farham, Cem Iyigun
Publication date: 8 August 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.04.022
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Weber problem in congested regions with entry and exit points
- On the use of the varignon frame for single facility Weber problems in the presence of convex barriers
- An efficient solution method for Weber problems with barriers based on genetic algorithms
- The \(p\)-median problem: a survey of metaheuristic approaches
- Finding rectilinear least cost paths in the presence of convex polygonal congested regions
- Variable neighbourhood search: methods and applications
- Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle
- An efficient algorithm for facility location in the presence of forbidden regions
- Facility Locations with the Manhattan Metric in the Presence of Barriers to Travel
- Locating Facilities on the Manhattan Metric with Arbitrarily Shaped Barriers and Convex Forbidden Regions
- TSPLIB—A Traveling Salesman Problem Library
- Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel
- Sequential Minimax Search for a Maximum
- A reduction result for location problems with polyhedral barriers
This page was built for publication: Generalization of the restricted planar location problems: unified metaheuristic algorithms
