Queueing maximal covering location-allocation problem: an extension with \textit{M/G/1} queueing systems
From MaRDI portal
Publication:764792
Summary: We consider the queueing maximal covering location-allocation problem (QM-CLAP) with an \textit{M/G/1} queueing system. We first formulate the problem as a binary quadratic programming problem and then propose a new solution procedure based on decomposition of the problem into smaller binary quadratic sub-problems. The heuristic procedure GRASP is used to solve the sub-problems, as well as the entire model. Some computational results are also presented.
Recommendations
- A decomposition approach for the probabilistic maximal covering location-allocation problem
- A note on solutions to the maximal expected covering location problem
- The Maximal Expected Covering Location Problem: Revisited
- Allocation of queuing facilities using a minimax criterion
- scientific article; zbMATH DE number 6501360
Cites work
- A bibliography for some fundamental problem categories in discrete location science
- A decomposition approach for the probabilistic maximal covering location-allocation problem
- A location model for a facility operating as anM/G/k queue
- A new method for solving capacitated location problems based on a set partitioning approach
- A probabilistic heuristic for a computationally difficult set covering problem
- A queueing-location model with expected service time dependent queueing disciplines
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- Ambulance location and relocation models.
- An annotated bibliography of GRASP – Part I: Algorithms
- An annotated bibliography of GRASP-Part II: Applications
- Computing approximate solutions of the maximum covering problem with GRASP
- Greedy randomized adaptive search procedures
- scientific article; zbMATH DE number 1803757 (Why is no real title available?)
- scientific article; zbMATH DE number 1803764 (Why is no real title available?)
- scientific article; zbMATH DE number 3522951 (Why is no real title available?)
- scientific article; zbMATH DE number 1253041 (Why is no real title available?)
- Locating emergency services with different priorities: the priority queuing covering location problem
- Location-allocation on congested networks
- Optimal Server Location on a Network Operating as an M/G/1 Queue
- Queueing maximal covering location-allocation problem: an extension with \textit{M/G/1} queueing systems
- Review, extension and prediction in emergency service siting models
- The queueing maximal availability location problem: A model for the siting of emergency vehicles
- The Stochastic Queue p-Median Problem
- The stochastic queue center problem
Cited in
(4)- A decomposition approach for the probabilistic maximal covering location-allocation problem
- A note on solutions to the maximal expected covering location problem
- An M/M/c queue model for hub covering location problem
- Queueing maximal covering location-allocation problem: an extension with \textit{M/G/1} queueing systems
This page was built for publication: Queueing maximal covering location-allocation problem: an extension with \textit{M/G/1} queueing systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q764792)
