Generalization of the restricted planar location problems: unified metaheuristic algorithms

DOI10.1016/J.COR.2018.04.022zbMATH Open1458.90456OpenAlexW2803454958MaRDI QIDQ1654346FDOQ1654346

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

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

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)

Cites Work

• TSPLIB—A Traveling Salesman Problem Library
• Introduction to algorithms.
• An efficient solution method for Weber problems with barriers based on genetic algorithms
• The \(p\)-median problem: a survey of metaheuristic approaches
• Variable neighbourhood search: methods and applications
• Title not available (Why is that?)
• 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
• The Weber problem in congested regions with entry and exit points
• 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
• Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel
• Title not available (Why is that?)
• A reduction result for location problems with polyhedral barriers
• Finding rectilinear least cost paths in the presence of convex polygonal congested regions
• Sequential Minimax Search for a Maximum
• On the use of the varignon frame for single facility Weber problems in the presence of convex barriers

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

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)