Mixed planar/network facility location problems
From MaRDI portal
We examine a modeling framework for facility location problems which allows for a mixture of planar and network components. Travel follows Manhattan travel directions within planar regions. Properties of this new representation are developd, and the p-median problem is analyzed in this context. Other location problems and modeling considerations are also briefly discussed.
Recommendations
- Locating Facilities on the Manhattan Metric with Arbitrarily Shaped Barriers and Convex Forbidden Regions
- scientific article; zbMATH DE number 849181
- Extensions to the planar \(p\)-median problem
- Capacitated facility location/network design problems.
- Weber problems with mixed distances and regional demand
Cites work
- Facility Locations with the Manhattan Metric in the Presence of Barriers to Travel
- Finding efficient solutions for rectilinear distance location problems efficiently
- Finding minimum rectilinear distance paths in the presence of barriers
- Locating a Mobile Server Queueing Facility on a Tree Network
- Locating Facilities on the Manhattan Metric with Arbitrarily Shaped Barriers and Convex Forbidden Regions
- Optimal Server Location on a Network Operating as an M/G/1 Queue
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
Cited in
(18)- On the accuracy of demand point solutions to the planar, Manhattan metric, p-median problem, with and without barriers to travel
- Weber problems with alternative transportation systems
- Locating a facility on a network with multiple median-type objectives
- Corrigendum to ``Simultaneous location of a service facility and a rapid transit line [Computers \& Operations Research 38 (2) (2011) 525-538]
- Multicriteria semi-obnoxious network location problems (MSNLP) with sum and center objectives
- Bichromatic 2-center of pairs of points
- A unified model for Weber problems with continuous and network distances
- Locating Facilities on the Manhattan Metric with Arbitrarily Shaped Barriers and Convex Forbidden Regions
- Single facility location problem with region-dependent distance metrics
- Gate points in continuous location between regions with different \(\ell _{p}\) norms
- The 1-center and 1-highway problem
- The 1-\textsc{Center} and 1-\textsc{Highway} problem revisited
- Conditional Location Problems on Networks and in the Plane
- Composite Regions of Feasibility for Certain Classes of Distance Constrained Network Location Problems
- Geographical information systems and location science
- On the distance between random events on a network
- Simultaneous location of a service facility and a rapid transit line
- Finding rectilinear least cost paths in the presence of convex polygonal congested regions
This page was built for publication: Mixed planar/network facility location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1093516)
