Queueing maximal covering location-allocation problem: an extension with \textit{M/G/1} queueing systems (Q764792): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:26, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Queueing maximal covering location-allocation problem: an extension with \textit{M/G/1} queueing systems |
scientific article |
Statements
Queueing maximal covering location-allocation problem: an extension with \textit{M/G/1} queueing systems (English)
0 references
14 March 2012
0 references
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.
0 references
