Queueing maximal covering location-allocation problem: an extension with \textit{M/G/1} queueing systems (Q764792): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1155/2011/605629 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2100743107 / rank | |||
Normal rank | |||
Revision as of 01:00, 20 March 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
