Queueing maximal covering location-allocation problem: an extension with \textit{M/G/1} queueing systems (Q764792)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Queueing maximal covering location-allocation problem: an extension with \textit{M/G/1} queueing systems |
scientific article; zbMATH DE number 6014715
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Queueing maximal covering location-allocation problem: an extension with \textit{M/G/1} queueing systems |
scientific article; zbMATH DE number 6014715 |
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
0 references
0 references
0 references
0 references
0 references
0.8152461647987366
0 references
0.8056278824806213
0 references
0.795819878578186
0 references
0.7822620272636414
0 references
