A hybrid method for the Probabilistic Maximal Covering Location-Allocation Problem
Year of publication: |
2015
|
---|---|
Authors: | Pereira, Marcos A. ; Coelho, Leandro C. ; Lorena, Luiz Antonio Nogueira ; Souza, Ligia C. de |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 57.2015, p. 51-59
|
Subject: | Facility location | Congested systems | Hybrid algorithm | Adaptive large neighborhood search | Exact method | Queueing maximal covering location–allocation model | PMCLAP | Betriebliche Standortwahl | Firm location choice | Warteschlangentheorie | Queueing theory | Standorttheorie | Location theory | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Engpass | Bottleneck |
-
Optimal location of multi-server congestible facilities operating as M/E r/m/N queues
Marianov, Vladimir, (2009)
-
An, Shi, (2015)
-
Generalization of the restricted planar location problems : unified metaheuristic algorithms
Farham, Mohammad Saleh, (2018)
- More ...
-
A parallel variable neighborhood search for α-neighbor facility location problems
Chagas, Guilherme O., (2023)
-
A parallel variable neighborhood search for α-neighbor facility location problems
Chagas, Guilherme O., (2024)
-
A decomposition approach for the probabilistic maximal covering location-allocation problem
Assis Corrêa, Francisco de, (2009)
- More ...