A review of congestion models in the location of facilities with immobile servers
From MaRDI portal
Publication:859675
DOI10.1016/j.ejor.2006.04.044zbMath1163.90417OpenAlexW2125890200MaRDI QIDQ859675
Brian Boffey, Luis Gonzalo Acosta Espejo, Roberto Diéguez Galvão
Publication date: 16 January 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.04.044
Related Items
Service system design for managing interruption risks: a backup-service risk-mitigation strategy, Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion, Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion, Benders decomposition without separability: a computational study for capacitated facility location problems, Efficient solution of a class of location-allocation problems with stochastic demand and congestion, Bi-objective vibration damping optimization for congested location-pricing problem, Facility location under service level constraints for heterogeneous customers, The design of a reliable and robust hierarchical health service network using an accelerated Benders decomposition algorithm, Robust design of service systems with immobile servers under demand uncertainty, Responsive make‐to‐order supply chain network design, Designing service system networks with interruption risks, Linear formulations and valid inequalities for a classic location problem with congestion: a robust optimization application, A capacitated biobjective location problem with uniformly distributed demands in the UAV‐supported delivery operation, A portfolio optimization approach to design of congested multi‐service networks with application in community healthcare: fractional 0‐1 programming, Logistics for diagnostic testing: an adaptive decision-support framework, Modeling and solving an economies‐of‐scale service system design problem, Competitive Facility Location with Selfish Users and Queues, OR models in urban service facility location: a critical review of applications and future developments, A hybrid hypercube - genetic algorithm approach for deploying many emergency response mobile units in an urban network, A congested capacitated multi-level fuzzy facility location problem: an efficient drone delivery system, Multi-objective multi-layer congested facility location-allocation problem optimization with Pareto-based meta-heuristics, Emergency service systems: The use of the hypercube queueing model in the solution of probabilistic location problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A center location problem with congestion
- Capacitated emergency facility siting with multiple levels of backup
- Location-allocation on congested networks
- An integer programming model for the allocation of databases in a distributed computer system
- Multiobjective programming and planning
- The queueing maximal availability location problem: A model for the siting of emergency vehicles
- Equity measurement in facility location analysis: A review and framework
- The gradual covering decay location problem on a network.
- Upper and lower bounds for the single source capacitated location problem.
- Location of multiple-server congestible facilities for maximizing expected demand, when services are non-essential
- Location models for airline hubs behaving as \(M/D/c\) queues.
- A multiperiod two-echelon multicommodity capacitated plant location problem
- On the single-assignment \(p\)-hub center problem
- A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
- A probabilistic quality of service constraint for a location model of switches in ATM communications networks
- A repeated matching heuristic for the single-source capacitated facility location problem
- A note on solutions to the maximal expected covering location problem
- Location of preventive health care facilities
- Algorithms for a facility location problem with stochastic customer demand and immobile servers
- Location-allocation of multiple-server service centers with constrained queues or waiting times
- The ex-post evaluation of the minimum local reliability level: An enhanced probabilistic location set covering model
- Load balancing and capacity constraints in a hierarchical location model
- The Stochastic Queue p-Median Problem
- The Maximal Expected Covering Location Problem: Revisited
- The convexity of the mean queue size of the M/M/c queue with respect to the traffic intensity
- The Maximal Covering Location Problem with Capacities on Total Workload
- Optimal 2-Facility Network Districting in the Presence of Queuing
- An efficient implementation of the “partan” variant of the linear approximation method for the network equilibrium problem
- Single Server Queueing-Location Models with Rejection
- The Hierarchical Service Location Problem
- Approximating the Performance of Urban Emergency Service Systems
- Allocation of queuing facilities using a minimax criterion
- Capacitated service and regional constraints in location-allocation modeling
- The congested facility location problem
- A note on the allocation of queuing facilities using a minisum criterion
- An algorithm to locate perinatal facilities in the municipality of Rio de Janeiro
- Allocating servers to facilities, when demand is elastic to travel and waiting times
- Capacity planning with congestion effects
- Hierarchical location-allocation models for congested systems
- A new method for solving capacitated location problems based on a set partitioning approach
- The generalized maximal covering location problem
