Bicriteria single facility rectilinear location problems in the presence of a single forbidden region
This paper presents a solution procedure based on \textit{R. Hooke} and \textit{T. A. Jeeves} [J. Assoc. Comput. Mach. 8, 212-229 (1961; Zbl 0111.125)] direct search technique for a single source rectilinear location problem in the presence of one forbidden barrier of rectangular or circular configuration. No path is allowed through the barrier nor is a location permitted within it. A bicriteria objective function giving simultaneous consideration to minisum as well as minimax criteria is used. Computational experience is presented.
- scientific article; zbMATH DE number 1855792
- ISO-cost contours to facility location problems in the presence of circular and polygonal forbidden regions
- An equivalence result for single facility planar location problems with rectilinear distance and barriers
- The single facility location problem with minimum distance constraints
- An efficient algorithm for facility location in the presence of forbidden regions
- Facility location problems in the presence of two-circular forbidden regions with Euclidean distance norm.
- Facility location problems in the presence of single convex/non-convex polygonal barrier/forbidden region.
- ISO-cost contours to facility location problems in the presence of circular and polygonal forbidden regions
- A planar single facility location and border crossing problem
- Lower and upper bounds for the continuous single facility location problem in the presence of a forbidden region and travel barrier
This page was built for publication: Bicriteria single facility rectilinear location problems in the presence of a single forbidden region
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2265940)