Facility Locations with the Manhattan Metric in the Presence of Barriers to Travel
From MaRDI portal
Publication:3670894
DOI10.1287/opre.31.4.652zbMath0521.90045OpenAlexW2157381307MaRDI QIDQ3670894
Ghazala Sadiq, Richard C. Larson
Publication date: 1983
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.31.4.652
optimal solutionlogisticsrectilinear distancerandom demandimpenetrable travel barriersplanar multiple facility location
Related Items (40)
A fast algorithm for the rectilinear distance location problem ⋮ Locating an n-server facility in a stochastic environment ⋮ Constrained location of competitive facilities in the plane ⋮ Mixed planar/network facility location problems ⋮ 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 ⋮ A cutting plane algorithm for the site layout planning problem with travel barriers ⋮ 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 ⋮ 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 ⋮ Exact and approximate heuristics for the rectilinear Weber location problem with a line barrier ⋮ Multidimensional Manhattan preferences ⋮ 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. ⋮ Genetic algorithm for obstacle location-allocation problems with customer priorities ⋮ Conditional facility location problems with continuous demand and a polygonal barrier ⋮ Planar weber location problems with line barriers ⋮ Finding rectilinear least cost paths in the presence of convex polygonal congested regions ⋮ Continuous location model of a rectangular barrier facility ⋮ Was Euclid an unnecessarily sophisticated psychologist? ⋮ Rectilinear distance to a facility in the presence of a square barrier ⋮ A reduction result for location problems with polyhedral barriers ⋮ The minisum location problem on an undirected network with continuous link demands ⋮ Geographical information systems and location science ⋮ Supply facility and input/output point locations in the presence of barriers ⋮ A discretization result for some optimization problems in framework spaces with polyhedral obstacles and the Manhattan metric ⋮ Facility placement with sub-aisle design in an existing layout ⋮ An efficient algorithm for facility location in the presence of forbidden regions ⋮ Solving Chance-Constrained Optimization Problems with Stochastic Quadratic Inequalities ⋮ 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 ⋮ Finding shortest paths in the plane in the presence of barriers to travel (for any \(l_ p\)-norm) ⋮ Implementing Larson and Sadiq's location model in a geographic information system ⋮ Planar location problems with block distance and barriers
This page was built for publication: Facility Locations with the Manhattan Metric in the Presence of Barriers to Travel
