Skip to main content
SpringerLink
Log in
Book cover

Applications of Soft Computing pp 347–356Cite as

A Genetic Algorithm for the Constrained Coverage Problem

  • Conference paper

Part of the book series: Advances in Intelligent and Soft Computing ((AINSC,volume 58))

Abstract

The coverage problem is one of the most important types of the facility location problems, which belongs in the NP-hard problems. In this paper, we present a genetic algorithm for solving the constrained coverage problem in continuous space. The genetic operators are novel operators and specially designed to solve the coverage problem. The new algorithm has a high convergence rate and finds the global optimum by a high probability. The algorithm is tested by several benchmark problems, the results of which demonstrate the power of algorithm.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Yang, S., Dai, F., Cardei, M., Wu, J.: On connected multiple point coverage in wireless sensor networks. Journal of Wireless Information Networks 13(4), 289–301 (2006)

    Article  Google Scholar 

  2. Bagheri, M.: Efficient k-coverage Algorithms for wireless sensor networks and their applications to early detection of forest. Master thesis, Simon Fraser University (2007)

    Google Scholar 

  3. So, A.M.-C., Ye, Y.: On solving coverage problems in a wireless sensor network using voronoi diagrams. In: Deng, X., Ye, Y. (eds.) WINE 2005. LNCS, vol. 3828, pp. 584–593. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  4. Ye, F., Zhong, G., Lu, S., Zhang, L.: PEAS: A robust energy conserving protocol for long-lived sensor networks. In: Int’l Conf. on Distributed Computing Systems (ICDCS) (2003)

    Google Scholar 

  5. Murray, A.T., O’Kelly, M.E., Church, R.L.: Regional service coverage modeling. Computer and Operation Research 35, 339–355 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  6. Hochbaum, D.S., Maass, W.: Fast approximation algorithms for a nonconvex covering problem. J. Algorithms 8, 305–323 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  7. Current, J., O’Kelly, M.: Locating emergency warning sirens. Decision Sciences 23, 221–234 (1992)

    Article  Google Scholar 

  8. Murray, A.T., O’Kelly, M.E.: Assessing representation error in point-based coverage modeling. Journal of Geographical Systems 4, 171–191 (2002)

    Article  Google Scholar 

  9. Mladenovi´c, N., Labbe, M., Hansen, P.: Solving the p-center problem with tabu search and variable neighborhood search. Networks 42, 48–64 (2003)

    Article  MathSciNet  Google Scholar 

  10. Elloumi, S., Labbe, M., Pochet, M.: A new formulation and resolution method for the p-center problem. INFORMS Journal on Computing 16(1), 84–94 (2004)

    Article  MathSciNet  Google Scholar 

  11. Chen, D., Chen, R.: New relaxation-based algorithms for the optimal solution of the continuous and discrete p-center problems. Computers and Operations Research (2008), doi:0.1016/j.cor.2008.03.009

    Google Scholar 

  12. Daskin, M.S.: Network and Discrete Location: Models, Algorithms and Applications. John Wiley, New York (1995)

    MATH  Google Scholar 

  13. Drezner, Z.: The p-center problem- heuristics and optimal algorithms. Journal of the Operational Research Society 35, 741–748 (1984)

    MATH  Google Scholar 

  14. Wei, H., Murray, A.T.: Solving the continuous space p-centre problem: planning application issues. IMA Journal of Management Mathematics 17, 413–425 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  15. Huang, C., Tseng, Y.: The Coverage Problem in a Wireless Sensor Network. Mobile Networks and Applications 10, 519–528 (2005)

    Article  Google Scholar 

  16. Hall, D.L., Llinas, J.: Handbook of Multisensor Data Fusion. CRC Press, Boca Raton (2001)

    Google Scholar 

  17. Zhao, Z., Govindan, R.: Understanding packet delivery performance in dense wireless sensor networks. In: Proc. of The Third ACM Conference on Embedded Networked Sensor Systems (Sensys 2003), Los Angeles, CA, pp. 1–13 (2003)

    Google Scholar 

  18. Deb, K.: Multi-Objective Optimization using Evolutionary Algorithms. John Wiley, Chichester (2001)

    MATH  Google Scholar 

  19. O’Rourke, J.: Computational Geometry in C, 2nd edn. Cambridge University Press, New York (1998)

    MATH  Google Scholar 

  20. Gowda, I., Kirkpatrick, D., Lee, D., Naamed, A.: Dynamic Voronoi Diagrams. IEEE Transactions on Information Theory 29, 724–731 (1983)

    Article  MATH  Google Scholar 

  21. Borglet, M.G., Borglet, C.: Notes on the Dynamic Bichromatic All-Nearest-Neighbors Problem. In: 23rd European Workshop on Computational Geometry, pp. 198–201 (2007)

    Google Scholar 

  22. Megiddo, N.: Linear-time algorithms for linear programming in R3 and related problems. SIAM Journal on Computation 12, 759–776 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  23. Homaifar, A., Lai, S.H., Qi, X.: Constrained optimization via genetic algorithms. Simulation 62(4), 242–254 (1994)

    Article  Google Scholar 

  24. Pelegrin, B., Canovas, L.: A new assignment rule to improve seed points algorithms for the continuous k-center problem. European Journal of Operational Research 104, 366–374 (1998)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory of Algorithms and Computational Geometry, Department of Mathematics and Computer Science, Amirkabir University of Technology, Tehran, Iran

    Mansoor Davoodi & Ali Mohades

  2. Faculty of Technology, Policy and Management, Delft University of Technology, The Netherlands

    Jafar Rezaei

Authors
  1. Mansoor Davoodi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ali Mohades
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jafar Rezaei
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Applied Science (SAS) Decision Engineering Centre, Cranfield University , MK43 0AL, Cranfield, Bedfordshire, UK

    Jörn Mehnen  & Ashutosh Tiwari  & 

  2. Dept. of Artificial Intelligence Faculty of Computer Science and Systems Engineering, Kyushu Institute of Technology Kawazu , 820-8502, Iizuka, Fukuoka, Japan

    Mario Köppen

  3. Computer Science Department School of Computing, Armstrong Atlantic State University , 31419, Savannah, GA, USA

    Ashraf Saad

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Davoodi, M., Mohades, A., Rezaei, J. (2009). A Genetic Algorithm for the Constrained Coverage Problem. In: Mehnen, J., Köppen, M., Saad, A., Tiwari, A. (eds) Applications of Soft Computing. Advances in Intelligent and Soft Computing, vol 58. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89619-7_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89619-7_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89618-0

  • Online ISBN: 978-3-540-89619-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation