Table of Contents Author Guidelines Submit a Manuscript
Advances in Operations Research
Volume 2010, Article ID 120756, 12 pages
http://dx.doi.org/10.1155/2010/120756
Research Article

A Decomposition Heuristic for the Maximal Covering Location Problem

1Department of Mathematics, Engineering College (FEG), São Paulo State University (UNESP), 12516-410 Guaratinguetá, SP, Brazil
2Associate Laboratory of Applied Mathematics and Computation (LAC), Brazilian Institute for Space Research (INPE), 12201-970 São José dos Campos, SP, Brazil

Received 29 April 2009; Revised 5 January 2010; Accepted 12 February 2010

Academic Editor: George Steiner

Copyright © 2010 Edson Luiz França Senne et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. C. Toregas, R. Swain, C. ReVelle, and L. Bergman, “The location of emergency service facilities,” Operations Research, vol. 19, pp. 1363–1373, 1971. View at Google Scholar
  2. R. Church and C. ReVelle, “The maximal covering location problem,” Papers of the Regional Science Association, vol. 32, no. 1, pp. 101–118, 1974. View at Publisher · View at Google Scholar · View at Scopus
  3. D. J. Eaton, M. L. Hector, U. Sanchez, R. Lantigua, and J. Morgan, “Determining ambulance deployment in Santo Domingo. Dominican Republic,” Journal of the Operational Research Society, vol. 37, no. 2, pp. 113–126, 1986. View at Google Scholar · View at Scopus
  4. J. R. Current and M. O'Kelly, “Locating emergency warning sirens,” Decision Sciences, vol. 23, pp. 221–234, 1981. View at Google Scholar
  5. G. C. Moore and C. S. ReVelle, “The hierarchical service location problem,” Management Science, vol. 28, pp. 775–780, 1982. View at Google Scholar
  6. E. S. Hougland and N. T. Stephens, “Air pollutant monitor sitting by analytical techniques,” Journal of the Air Pollution Control Association, vol. 26, pp. 52–53, 1976. View at Google Scholar
  7. V. Marianov and D. Serra, “Probabilistic, maximal covering location-allocation models from congested systems,” Journal of Regional Science, vol. 38, no. 3, pp. 401–424, 1998. View at Google Scholar · View at Scopus
  8. V. Marianov and D. Serra, “Hierarchical location-allocation models for congested systems,” European Journal of Operational Research, vol. 135, no. 1, pp. 195–208, 2001. View at Publisher · View at Google Scholar · View at Scopus
  9. F. A. Corrêa and L. A. N. Lorena, “Using the constructive genetic algorithm for solving the probabilistic maximal covering location-allocation problem,” in Proceedings of the 1st Workshop on Computational Intelligence/SBRN, 2006, http://www.lac.inpe.br/~lorena/correa/Correa_Lorena_Wci_2006.pdf.
  10. M. Daskin, Network and Discrete Location: Models Algorithms and Applications, Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, New York, NY, USA, 1995. View at MathSciNet
  11. R. D. Galvão and C. ReVelle, “A Lagrangean heuristic for the maximal covering location problem,” European Journal of Operational Research, vol. 88, no. 1, pp. 114–123, 1996. View at Publisher · View at Google Scholar · View at Scopus
  12. L. A. N. Lorena and M. A. Pereira, “A Lagrangean/surrogate heuristic for the maximal covering location problem using Hillsman's edition,” International Journal of Industrial Engineering, vol. 9, no. 1, pp. 57–67, 2002. View at Google Scholar · View at Scopus
  13. R. D. Galvão, L. G. A. Espejo, and B. Boffey, “A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem,” European Journal of Operational Research, vol. 124, no. 2, pp. 377–389, 2000. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  14. R. G. I. Arakaki and L. A. N. Lorena, “A constructive genetic algorithm for the maximal covering location problem,” in Proceedings of the 4th Metaheuristics International Conference (MIC '01), pp. 13–17, Porto. Portugal, July 2001, http://www.lac.inpe.br/~lorena/arakaki/cgalap.pdf.
  15. C.-H. Chung, “Recent applications of the maximal covering location problem (MCLP) model,” Journal of the Operational Research Society, vol. 37, no. 8, pp. 735–746, 1986. View at Google Scholar · View at Scopus
  16. T. S. Hale and C. R. Moberg, “Location science research: a review,” Annals of Operations Research, vol. 123, no. 1–4, pp. 21–35, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  17. D. Serra and V. Marianov, “New trends in public facility location modeling,” Working Paper 755, Universitat Pompeu Fabra Economics and Business, 2004, http://www.econ.upf.edu/docs/papers/downloads/755.pdf. View at Google Scholar
  18. R. D. Galvão, “Uncapacitated facility location problems: contributions,” Pesquisa Operacional, vol. 24, pp. 7–38, 2004. View at Google Scholar
  19. G. M. Ribeiro and L. A. N. Lorena, “Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem,” Computers & Operations Research, vol. 34, no. 9, pp. 2695–2708, 2007. View at Publisher · View at Google Scholar · View at Scopus
  20. G. M. Ribeiro and L. A. N. Lorena, “Lagrangean relaxation with clusters for point-feature cartographic label placement problems,” Computers & Operations Research, vol. 35, no. 7, pp. 2129–2140, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  21. G. M. Ribeiro and L. A. N. Lorena, “Optimizing the woodpulp stowage using Lagrangean relaxation with clusters,” Journal of the Operational Research Society, vol. 59, no. 5, pp. 600–606, 2008. View at Publisher · View at Google Scholar · View at Scopus
  22. G. M. Ribeiro and L. A. N. Lorena, “Column generation approach for the point-feature cartographic label placement problem,” Journal of Combinatorial Optimization, vol. 15, no. 2, pp. 147–164, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  23. F. A. Corrêa, L. A. N. Lorena, and E. L. F. Senne, “Lagrangean relaxation with clusters for the uncapacitated facility location problem,” in Proceedings of the 13th CLAIO—Congreso Latino-Iberoamericano de Investigación Operativa, Montevideo, Uruguay, November 2006, http://www.lac.inpe.br/~lorena/correa/LagClus_UFLP_CLAIO2006.pdf.
  24. M. Held and R. M. Karp, “The traveling-salesman problem and minimum spanning trees: part II,” Mathematical Programming, vol. 1, no. 1, pp. 6–25, 1971. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  25. ILOG, “CPLEX 10.1.1: User's Manual,” France, 2006.
  26. G. Reinelt, The Traveling Salesman Problem: Computational Solutions for TSP Applications, vol. 840 of Lecture Notes in Computer Science, Springer, Berlin, Germany, 1984. View at MathSciNet
  27. G. Karypis and V. Kumar, “Multilevel k-way partitioning scheme for irregular graphs,” Journal of Parallel and Distributed Computing, vol. 48, no. 1, pp. 96–129, 1998. View at Google Scholar