Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle
From MaRDI portal
Publication:1148209
DOI10.1016/0377-2217(81)90203-4zbMath0451.90042OpenAlexW2016082605MaRDI QIDQ1148209
Publication date: 1981
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(81)90203-4
algorithmnumerical resultsshortest pathcalculus of variationsfacility locationforbidden regionsconstrained Weber problemeuclidean distance
Related Items (36)
An efficient solution method for Weber problems with barriers based on genetic algorithms ⋮ The Weber problem in congested regions with entry and exit points ⋮ A planar single facility location and border crossing problem ⋮ Generalization of the restricted planar location problems: unified metaheuristic algorithms ⋮ Placing a finite size facility with a center objective on a rectangular plane with barriers ⋮ Median location problem with two probabilistic line barriers: extending the Hooke and Jeeves algorithm ⋮ Exact and approximate heuristics for the rectilinear Weber location problem with a line barrier ⋮ Reachability of locational Nash equilibria ⋮ Search region contraction of the Weber problem solution on the plane with rectangular forbidden zones ⋮ Optimization of location of interconnected facilities on parallel lines with forbidden zones ⋮ A guided reactive GRASP for the capacitated multi-source Weber problem ⋮ A projected Weiszfeld algorithm for the box-constrained Weber location problem ⋮ On the use of the varignon frame for single facility Weber problems in the presence of convex barriers ⋮ Algebraic properties of location problems with one circular barrier. ⋮ A capacitated location-allocation model for flood disaster service operations with border crossing passages and probabilistic demand locations ⋮ Genetic algorithm for obstacle location-allocation problems with customer priorities ⋮ Conditional facility location problems with continuous demand and a polygonal barrier ⋮ Location models with stochastic demand points ⋮ Facility location problems in the presence of two-circular forbidden regions with Euclidean distance norm. ⋮ The obnoxious facilities planar \(p\)-median problem ⋮ Planar weber location problems with line barriers ⋮ Multicommodity flows and Benders decomposition for restricted continuous location problems ⋮ Facility location problems in the presence of single convex/non-convex polygonal barrier/forbidden region. ⋮ Continuous location model of a rectangular barrier facility ⋮ The multi-facility location-allocation problem with polyhedral barriers ⋮ Rectilinear distance to a facility in the presence of a square barrier ⋮ A reduction result for location problems with polyhedral barriers ⋮ Supply facility and input/output point locations in the presence of barriers ⋮ Successive computation of some efficient locations of the Weber problem with barriers ⋮ Region-rejection based heuristics for the capacitated multi-source Weber problem ⋮ Facility placement with sub-aisle design in an existing layout ⋮ An efficient algorithm for facility location in the presence of forbidden regions ⋮ The rectilinear distance Weber problem in the presence of a probabilistic line barrier ⋮ Some personal views on the current state and the future of locational analysis ⋮ Finding shortest paths in the plane in the presence of barriers to travel (for any \(l_ p\)-norm) ⋮ Planar location problems with block distance and barriers
Cites Work
- Optimal location on a sphere
- Location-Allocation Problems
- Technical Note—Minisum Ip Distance Location Problems Solved via a Perturbed Problem and Weiszfeld's Algorithm
- Local convergence in Fermat's problem
- On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
- Heuristic Methods for Location-Allocation Problems
- Technical Note—Location Theory: A Selective Bibliography
- Link-Length Minimization in Networks
- On the Convergence of a Numerical Scheme for Solving Some Locational Equilibrium Problems
- A Simplex Method for Function Minimization
- Modelling Inter-city Road Distances by Mathematical Functions
- A note on Fermat's problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle
