An efficient algorithm for facility location in the presence of forbidden regions

DOI10.1016/0377-2217(94)00297-5zbMath0916.90177OpenAlexW2035643830MaRDI QIDQ1266516

Tom M. Cavalier, Steven E. Butt

Publication date: 7 October 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)00297-5

zbMATH Keywords

constrained optimizationnonconvex programmingheuristiclocationfacilitiesclassical Weber problemforbidden region

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items (29)

Constrained location of competitive facilities in the plane ⋮ Extensions to the Weber problem ⋮ 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 cutting plane algorithm for the site layout planning problem with travel barriers ⋮ 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 ⋮ Exact and approximate heuristics for the rectilinear Weber location problem with a line barrier ⋮ 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. ⋮ Fuzzy group decision-making for facility location selection. ⋮ 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 ⋮ The obnoxious facilities planar \(p\)-median problem ⋮ Planar weber location problems with line barriers ⋮ Multicommodity flows and Benders decomposition for restricted continuous location problems ⋮ 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 ⋮ A discretization result for some optimization problems in framework spaces with polyhedral obstacles and the Manhattan metric ⋮ Successive computation of some efficient locations of the Weber problem with barriers ⋮ Facility placement with sub-aisle design in an existing layout ⋮ The rectilinear distance Weber problem in the presence of a probabilistic line barrier ⋮ A continuous location-allocation problem with zone-dependent fixed cost ⋮ Planar location problems with block distance and barriers

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• Finding shortest paths in the plane in the presence of barriers to travel (for any \(l_ p\)-norm)
• Shortest paths in the plane with convex polygonal obstacles
• Shortest paths in Euclidean graphs
• Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle
• \(L_ 1\) shortest paths among polygonal obstacles in the plane
• 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
• Location-Allocation Problems
• Finding minimum rectilinear distance paths in the presence of barriers
• An Output-Sensitive Algorithm for Computing Visibility Graphs
• Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel
• Link-Length Minimization in Networks
• A note on Fermat's problem

This page was built for publication: An efficient algorithm for facility location in the presence of forbidden regions