Hybrid heuristics for the probabilistic maximal covering location-allocation problem

@article{Corra2007HybridHF,
  title={Hybrid heuristics for the probabilistic maximal covering location-allocation problem},
  author={Francisco de Assis Corr{\^e}a and Antonio Augusto Chaves and Luiz Antonio Nogueira Lorena},
  journal={Operational Research},
  year={2007},
  volume={7},
  pages={323-343}
}
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 locationallocation 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… CONTINUE READING