Efficient solution of a class of location-allocation problems with stochastic demand and congestion

DOI10.1016/j.cor.2014.02.014zbMath1348.90424OpenAlexW2024669865MaRDI QIDQ337037

Navneet Vidyarthi, Sachin Jayaswal

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2014.02.014

zbMATH Keywords

queueingservice system designlocation-allocationcongestionstochastic demandconstraint generation method

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Queues and service in operations research (90B22) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (18)

Service system design for managing interruption risks: a backup-service risk-mitigation strategy ⋮ Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion ⋮ Service system design with immobile servers, stochastic demand and concave-cost capacity selection ⋮ Facility location under service level constraints for heterogeneous customers ⋮ Robust design of service systems with immobile servers under demand uncertainty ⋮ Designing service system networks with interruption risks ⋮ Linear formulations and valid inequalities for a classic location problem with congestion: a robust optimization application ⋮ A portfolio optimization approach to design of congested multi‐service networks with application in community healthcare: fractional 0‐1 programming ⋮ An efficient optimization procedure for location-inventory problems with (S-1, S) policy and retrial demands ⋮ Modeling and solving an economies‐of‐scale service system design problem ⋮ Competitive Facility Location with Selfish Users and Queues ⋮ Managing congestion in a multi-modal transportation network under biomass supply uncertainty ⋮ A Stochastic Queueing Model for Capacity Allocation in the Hierarchical Healthcare Delivery System ⋮ Genetic algorithm for obstacle location-allocation problems with customer priorities ⋮ Alternate second order conic program reformulations for hub location under stochastic demand and congestion ⋮ Solving a two-stage stochastic capacitated location-allocation problem with an improved PSO in emergency logistics ⋮ Alternate solution approaches for competitive hub location problems ⋮ Considering short-term and long-term uncertainties in location and capacity planning of public healthcare facilities

Cites Work

• Unnamed Item
• Unnamed Item
• The impact of client choice on preventive healthcare facility network design
• Closest assignment constraints in discrete location problems
• Exact solution of a class of nonlinear knapsack problems
• A review of congestion models in the location of facilities with immobile servers
• A location-allocation problem for a web services provider in a competitive market
• Incorporating congestion in preventive healthcare facility network design
• An exact algorithm for the capacitated facility location problems with single sourcing
• The design of service systems with queueing time cost, workload capacities and backup service
• Solution procedures for the service system design problem
• 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
• Distribution network design: Selection and sizing of congested connections
• Locating emergency services with different priorities: the priority queuing covering location problem
• Facility location models for immobile servers with stochastic demand
• The multi-hour service system design problem

This page was built for publication: Efficient solution of a class of location-allocation problems with stochastic demand and congestion