Planar weber location problems with line barriers
The author extends the family of continuous location problems by a location problem with barrier. This constraint location problem arises from a practical demand, when modelling of an investigated region as the complete plane is not realistic. This case emerges, when a natural obstacle as river, border line, highway or mountain range must be taken into consideration. In this paper only one line barrier with a finite set of passages is considered as a constraint of the problem. Under this restriction, the continuous weighted median problem is solved. The barrier influences the distance between any two points lying on the different sizes of the barrier, as the shortest path between them must necessarily pass one of the passages. This effect causes that this problem is non-convex on the contrary to the classical planar weighted median problem, in which the objective is to find a location in the plain so that the sum of weighted distances from the location to every facility from a given finite set be minimal. The author designed an approach, which replaces solution of the non-convex problem by solution of polynomial number of classical planar weighted median problems. An algorithm for instances with two passages and another more complex algorithm for instances with \(N\) passages are reported in the paper and, in addition, the author outlined other ways of possible studies concerning this family of problems.
- Planar Weber location problems with barriers and block norms
- Median location problem with two probabilistic line barriers: extending the Hooke and Jeeves algorithm
- Single-facility location problems with barriers
- An efficient solution method for Weber problems with barriers based on genetic algorithms
- A Bi-Objective Median Location Problem With a Line Barrier
- An efficient algorithm for facility location in the presence of forbidden regions
- Combinatorial algorithms for some 1-facility median problems in the plane
- Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle
- Facility Locations with the Manhattan Metric in the Presence of Barriers to Travel
- scientific article; zbMATH DE number 849181 (Why is no real title available?)
- Hull properties in location problems
- Locating Facilities on the Manhattan Metric with Arbitrarily Shaped Barriers and Convex Forbidden Regions
- Location Theory, Dominance, and Convexity
- Multicriteria planar location problems
- Optimal bin location and sequencing in printed circuit board assembly
- Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel
- Single facility collection depots location problem in the plane
- 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
- Algebraic properties of location problems with one circular barrier.
- Planar Weber location problems with barriers and block norms
- Rectilinear distance to a facility in the presence of a square barrier
- Extensions to the Weber problem
- Median location problem with two probabilistic line barriers: extending the Hooke and Jeeves algorithm
- Logistics distribution centers location problem and algorithm under fuzzy environment
- Successive computation of some efficient locations of the Weber problem with barriers
- Exact and approximate heuristics for the rectilinear Weber location problem with a line barrier
- The Weber problem in congested regions with entry and exit points
- A planar single facility location and border crossing problem
- A Bi-Objective Median Location Problem With a Line Barrier
- A capacitated location-allocation model for flood disaster service operations with border crossing passages and probabilistic demand locations
- Single-facility location problems with barriers
- Facility location in normed linear spaces
- A reduction result for location problems with polyhedral barriers
- Weber problems with high-speed lines
- Facility location models for distribution system design
- Planar location problems with block distance and barriers
- An efficient solution method for Weber problems with barriers based on genetic algorithms
This page was built for publication: Planar weber location problems with line barriers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2743666)
