Generalization of the restricted planar location problems: unified metaheuristic algorithms

DOI10.1016/J.COR.2018.04.022MaRDI QIDQ1654346zbMATH OpenOpenAlexFDO

Authors Mohammad Saleh Farham, Haldun Süral, 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

zbMATH Keywords

metaheuristicscongested regionsrestricted locationplanar single facility location problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Recommendations

• scientific article; zbMATH DE number 849181
• scientific article; zbMATH DE number 1560533
• The Weber problem in congested regions with entry and exit points
• Combinatorial algorithms for some 1-facility median problems in the plane
• Application of heuristic and metaheuristic algorithms in solving constrained Weber problem with feasible region bounded by arcs

Cites work

• scientific article; zbMATH DE number 1855792 (Why is no real title available?)
• scientific article; zbMATH DE number 849181 (Why is no real title available?)
• A reduction result for location problems with polyhedral barriers
• An efficient algorithm for facility location in the presence of forbidden regions
• An efficient solution method for Weber problems with barriers based on genetic algorithms
• Facility Locations with the Manhattan Metric in the Presence of Barriers to Travel
• Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle
• Finding rectilinear least cost paths in the presence of convex polygonal congested regions
• Introduction to algorithms.
• Locating Facilities on the Manhattan Metric with Arbitrarily Shaped Barriers and Convex Forbidden Regions
• On the use of the varignon frame for single facility Weber problems in the presence of convex barriers
• Sequential Minimax Search for a Maximum
• TSPLIB—A Traveling Salesman Problem Library
• Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel
• The Weber problem in congested regions with entry and exit points
• The \(p\)-median problem: a survey of metaheuristic approaches
• Variable neighbourhood search: methods and applications

Cited in

(2)

• Application of heuristic and metaheuristic algorithms in solving constrained Weber problem with feasible region bounded by arcs
• Good solutions to discrete noxious location problems via metaheuristics

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication: Generalization of the restricted planar location problems: unified metaheuristic algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1654346)