Name
Abstract | ||
|---|---|---|
The Maximal Covering Location Problem (MCLP) maximizes the population that has a facility within a maximum travel distance or time. Numerous extensions have been proposed to enhance its applicability, like the probabilistic model for the maximum covering location- allocation with constraint in waiting time or queue length for congested systems, with one or more servers per service center. This paper presents one solution procedure for that probabilistic model, considering one server per center, using a Hybrid Heuristic known as Clustering Search (CS), that consists of detecting promising search areas based on clustering. The computational tests provide results for network instances with up to 818 vertices. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/BF03024852 | Operational Research |
Keywords | DocType | Volume |
covering problems,congested systems,location problems,clustering search. | Journal | 7 |
Issue | ISSN | Citations |
3 | 1866-1505 | 4 |
PageRank | References | Authors |
0.44 | 8 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Francisco de Assis Corrêa | 1 | 13 | 1.35 |
| Antonio Augusto Chaves | 2 | 116 | 10.24 |
| Luiz Antonio Nogueira Lorena | 3 | 498 | 36.72 |