Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel
From MaRDI portal
Publication:4291466
DOI10.1287/trsc.28.1.70zbMath0799.90072OpenAlexW2100928864MaRDI QIDQ4291466
Publication date: 10 May 1994
Published in: Transportation Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/trsc.28.1.70
Related Items (37)
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 ⋮ The Weber obnoxious facility location model: a big arc small arc approach ⋮ Bicriteria and restricted 2-facility Weber problems ⋮ 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 ⋮ Location and layout planning. A survey ⋮ A maximum \(L_p\) distance problem ⋮ Metaheuristics: A bibliography ⋮ Exact and approximate heuristics for the rectilinear Weber location problem with a line barrier ⋮ Convex hull results on quadratic programs with non-intersecting constraints ⋮ 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 ⋮ The obnoxious facilities planar \(p\)-median problem ⋮ Planar weber location problems with line barriers ⋮ Multicommodity flows and Benders decomposition for restricted continuous location problems ⋮ Optimization of the norm of a vector-valued DC function and applications ⋮ 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 ⋮ Error bounds for the approximative solution of restricted planar location problems ⋮ Successive computation of some efficient locations of the Weber problem with barriers ⋮ Facility placement with sub-aisle design in an existing layout ⋮ An efficient algorithm for facility location in the presence of forbidden regions ⋮ Complexity results on planar multifacility location problems with 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 ⋮ Restricted center problems under polyhedral gauges ⋮ A continuous location-allocation problem with zone-dependent fixed cost ⋮ Planar location problems with block distance and barriers
This page was built for publication: Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel
