A single facility location problem with a weighted maximin-minimax rectilinear distance
This paper provides an algorithm for locating a single facility in a region, where the objective function is composed of the weighted maximin and minimax rectilinear distances from a set of given demand points. This weighted objective function is applicable when the facility to be located is somewhat desirable but it should not be too close to the demand points, since it also has some undesirable effects. It has been proven in this paper, that it is enough to test for optimality all the intersection points of any two lines forming the equirectilinear distances between any pair of demand points or boundary lines of the region. The algorithm developed here tests these intersection points. The efficient set of points and their optimality range are found. This parametric form of the solution provides an optimal solution for any desired weight.
- An Efficient Computational Procedure for the Rectilinear MAXIMIN Location Problem
- Sorting weighted distances with applications to objective function evaluations in single facility location problems.
- Mixed integer programming-based solution procedure for single-facility location with maximin of rectilinear distance
- An Enhancement of the Drezner-Wesolowsky Algorithm for Single-Facility Location with Maximin of Rectilinear Distance
- OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS
- Analytical models for locating undesirable facilities
- A distance constrained p-facility location problem on the real line
- Semi-obnoxious single facility location in Euclidean space.
- Single facility location problems with unbounded unit balls
- Sorting weighted distances with applications to objective function evaluations in single facility location problems.
- A note on convergence in the single facility minisum location problem
- Using tropical optimization to solve constrained minimax single-facility location problems with rectilinear distance
- A mixed integer formulation for maximal covering by inclined parallelograms
- Algebraic solution of minimax single-facility constrained location problems with Chebyshev and rectilinear distances
- Location of a semi-obnoxious facility with elliptic maximin and network minisum objectives
- On the Weber facility location problem with limited distances and side constraints
- The weighted minimax location problem with set-up costs and extensions
- Line Segment Facility Location in Weighted Subdivisions
- scientific article; zbMATH DE number 5629773 (Why is no real title available?)
- A heuristic approach to the single facility maximin location problem
- An Enhancement of the Drezner-Wesolowsky Algorithm for Single-Facility Location with Maximin of Rectilinear Distance
- An Efficient Computational Procedure for the Rectilinear MAXIMIN Location Problem
- scientific article; zbMATH DE number 1253055 (Why is no real title available?)
- Is Linear Programming Necessary for Single Facility Location with Maximin of Rectilinear Distance?
- A Parametric 1-Maximin Location Problem
- Mixed integer programming-based solution procedure for single-facility location with maximin of rectilinear distance
- The Location of Undesirable Facilities
- An interactive solution approach for a bi-objective semi-desirable location problem
This page was built for publication: A single facility location problem with a weighted maximin-minimax rectilinear distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1085041)
