Locating Facilities on the Manhattan Metric with Arbitrarily Shaped Barriers and Convex Forbidden Regions

DOI10.1287/trsc.23.1.26zbMath0672.90044OpenAlexW2072733519MaRDI QIDQ3826334

Rajan Batta, Udatta S. Palekar, Anjan Ghose

Publication date: 1989

Published in: Transportation Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/trsc.23.1.26

zbMATH Keywords

network location logistics barriers p- median stochastic queue median convex forbidden regions Manhattan travel metric planar facility location problems

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Inventory, storage, reservoirs (90B05)

Related Items (27)

A fast algorithm for the rectilinear distance location problem ⋮ Mixed planar/network facility location problems ⋮ Extensions to the Weber problem ⋮ On the accuracy of demand point solutions to the planar, Manhattan metric, p-median problem, with and without barriers to travel ⋮ An efficient solution method for Weber problems with barriers based on genetic algorithms ⋮ Dominance rules for the optimal placement of a finite-size facility in an existing layout ⋮ The Weber problem in congested regions with entry and exit points ⋮ Bicriteria and restricted 2-facility Weber problems ⋮ 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 ⋮ Median location problem with two probabilistic line barriers: extending the Hooke and Jeeves algorithm ⋮ Contour line construction for a new rectangular facility in an existing layout with rectangular departments ⋮ A queueing-location model with expected service time dependent queueing disciplines ⋮ Algebraic properties of location problems with one circular barrier. ⋮ The obnoxious facilities planar \(p\)-median problem ⋮ Planar weber location problems with line barriers ⋮ A center location problem with congestion ⋮ Continuous location model of a rectangular barrier facility ⋮ 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 ⋮ 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 ⋮ Planar location problems with block distance and barriers

This page was built for publication: Locating Facilities on the Manhattan Metric with Arbitrarily Shaped Barriers and Convex Forbidden Regions