Location-allocation on congested networks
From MaRDI portal
Publication:1078058
DOI10.1016/0377-2217(86)90185-2zbMath0595.90013OpenAlexW2009787058MaRDI QIDQ1078058
Ronald R. Mandowsky, Oded Berman
Publication date: 1986
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(86)90185-2
logistics2-server districting heuristicconditions of congestionlocation-allocation decisions in networksoptimal districting policy
Related Items (13)
A review of congestion models in the location of facilities with immobile servers ⋮ A queueing-location model with expected service time dependent queueing disciplines ⋮ Finding an optimal core on a tree network with M/G/c/c state-dependent queues ⋮ A fuzzy queuing location model with a genetic algorithm for congested systems ⋮ A congested capacitated multi-level fuzzy facility location problem: an efficient drone delivery system ⋮ Hierarchical location-allocation models for congested systems ⋮ Allocating servers to facilities, when demand is elastic to travel and waiting times ⋮ The multiple server center location problem ⋮ Queueing maximal covering location-allocation problem: an extension with \textit{M/G/1} queueing systems ⋮ Heuristic methods and applications: A categorized survey ⋮ Locating and staffing service centers under service level constraints ⋮ Stochastic Analysis in Location Research ⋮ Locating repair shops in a stochastic environment
Cites Work
- State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
- Optimal Server Location on a Network Operating as an M/G/1 Queue
- Optimal 2-Facility Network Districting in the Presence of Queuing
- Heuristic Methods for Location-Allocation Problems
- Response Areas for Two Emergency Units
- On Insensitivities in Urban Redistricting and Facility Location
- A Method for Districting Among Facilities
This page was built for publication: Location-allocation on congested networks
