The Probabilistic Maximal Covering Location-Allocation Problem (PMCLAP) aims to locate facilities maximizing the number of people served and providing a good level of service. This means that customers would not have to wait longer than the wait time established or to wait in long lines. These parameters are influenced by the number of the requests for service and service time, both probabilistic. The PMCLAP is NP-Complete and in this paper we study bounds with a Lagrangean Relaxation with Clusters (LagClus). Instead of using a conflict graph to represent a problem, in this paper another strategy for the use of LagClus using a special graph called covering graph is proposed. This approach provides interesting bounds.
Lagrangean Relaxation; Lagrangean Relaxation with Clusters; Location Problems; Maximal Covering
