Skip to main content
Springer Nature Link
Log in

A Nature Inspired Intelligent Water Drop Algorithm and Its Application for Solving The Set Covering Problem

  • Conference paper
  • First Online:
Artificial Intelligence Perspectives in Intelligent Systems

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 464))

  • 1200 Accesses

Abstract

The Set Covering Problem is a classic combinatorial problem which is looking for solutions to cover needs on a geographic area. In this paper, we applied new ideas to solve The Set Covering Problem. Intelligent Water Drop is a nature inspired algorithm based on water drops behavior on natural river systems and the events that change the nature of water drop and the river environment. It observes that a river can find an optimum path to its goal. The results of experiments seems to be promising with certain configurations for the instances given by OR-Library J.E. Beasley. In addition an innovation was introduced in the algorithm in order to obtain results. Also a heuristic undesirability chosen is presented in this paper.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Alijla, B.O., Lim, C.P., Wong, L.-P., Al-Betar, M.A., Khader, A.T.: A modified intelligent water drops algorithm and its application to optimization problems. Exp. Syst. Appl. 41, 6555–6569 (2014)

    Google Scholar 

  2. Beasley, J.: A lagrangian heuristic for set covering problems. Nav. Res. Logist. 37, 151–164 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  3. Caprara, A., Fischetti, M., Toth, P.: Algorithms for the set covering problem. Ann. Oper. Res. 98, 353–371 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  4. Crawford, B., Soto, R., Aballay, F., Misra, S., Johnson, F., Paredes, F.: Computational Science and Its Applications—ICCSA 2015: 15th International Conference, Banff, AB, Canada, June 22–25, 2015, Proceedings, Part IV, chapter A Teaching-Learning-Based Optimization Algorithm for Solving Set Covering Problems, pp. 421–430. Springer International Publishing, Cham (2015)

    Google Scholar 

  5. Crawford, B., Soto, R., Cuesta, R., Paredes, F.: Application of the artificial bee colony algorithm for solving the set covering problem. Sci. World J., Article ID 189164, 1–8 (2014)

    Google Scholar 

  6. Crawford, B., Soto, R., Olivares-Suárez, M., Paredes, F.: A binary firefly algorithm for the set covering problem. In: 3rd Computer Science On-line Conference 2014, Modern Trends and Techniques in Computer Science, vol. 285, pp. 65–73. Springer (2014)

    Google Scholar 

  7. Crawford, B., Soto, R., Monfroy, E.: Cultural algorithms for the set covering problem. In: Tan, Y., Shi, Y., Mo, H. (eds.) Advances in Swarm Intelligence, 4th International Conference. Lecture Notes in Computer Science, vol. 7929, pp. 27–34. Springer, Harbin, China (2013)

    Chapter  Google Scholar 

  8. Crawford, B., Soto, R., Peña, C., Palma, W., Johnson, F., Paredes, F.: Solving the set covering problem with a shuffled frog leaping algorithm. In: Nguyen, N.T., Trawinski, B., Kosala, R. (eds.) Intelligent Information and Database Systems—7th Asian Conference. LNCS, vol. 9012, pp. 41–50. Springer, Bali, Indonesia (2015)

    Google Scholar 

  9. Fleurent, C., Glover, F.: Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory. INFORMS J. Comput. 11(2), 198–204 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  10. Florios, Kostas, Mavrotas, George: Generation of the exact pareto set in multi-objective traveling salesman and set covering problems. Appl. Math. Comput. 237, 1–19 (2014)

    Article  MathSciNet  Google Scholar 

  11. Ren, Z., Feng, Z., Ke, L., Zhang, Z.: New ideas for applying ant colony optimization to the set covering problem. Comput. Ind. Eng., pp. 774–784 (2010)

    Google Scholar 

  12. Shah-Hosseini, H.: Problem solving by intelligent water drops. In: IEEE Congress on Evolutionary Computation, CEC 2007, pp. 3226–3231 (2007)

    Google Scholar 

  13. Shah-Hosseini, Hamed: Intelligent water drops algorithm: a new optimization method for solving the multiple knapsack problem. Int. J. Intell. Comput. Cybern. 1(2), 193–212 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  14. Shah-Hosseini, Hamed: A new optimization method for solving the multiple knapsack problem. Int. J. Intell. Comput. Cybern. 1(2), 193–212 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  15. ThangaMariappan L., Kesavamoorthy, R., ArunShunmugam, D.: Solving traveling salesman problem by modified intelligent water drop algorithm. In: International Conference on Emerging Technology Trends, vol. 2, pp. 18–23 (2007)

    Google Scholar 

Download references

Acknowledgments

The author Broderick Crawford is supported by grant CONICYT/FONDECYT /REGULAR/1140897 and Ricardo Soto is supported by grant CONICYT / FONDECYT/INICIACION/11130459.

Author information

Authors and Affiliations

  1. Pontificia Universidad Católica de Valparaíso, Valparaíso, Chile

    Broderick Crawford, Ricardo Soto & Jorge Córdova

  2. Universidad San Sebastián, Santiago Metropolitan Region, Chile

    Broderick Crawford & Eduardo Olguín

  3. Universidad Central de Chile, Santiago Metropolitan Region, Chile

    Broderick Crawford

  4. Universidad Autónoma de Chile, Temuco, Chile

    Ricardo Soto

  5. Universidad Cientifica del Sur, Lima, Peru

    Ricardo Soto

Authors
  1. Broderick Crawford
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ricardo Soto
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jorge Córdova
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Eduardo Olguín
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jorge Córdova .

Editor information

Editors and Affiliations

  1. Faculty of Applied Informatics, Tomas Bata University in Zlín, Zlín, Czech Republic

    Radek Silhavy

  2. Faculty of Applied Informatics, Tomas Bata University in Zlín, Zlín, Czech Republic

    Roman Senkerik

  3. Faculty of Applied Informatics, Tomas Bata University in Zlín, Zlín, Czech Republic

    Zuzana Kominkova Oplatkova

  4. Faculty of Applied Informatics, Tomas Bata University in Zlín, Zlín, Czech Republic

    Petr Silhavy

  5. Faculty of Applied Informatics, Tomas Bata University in Zlín, Zlín, Czech Republic

    Zdenka Prokopova

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Crawford, B., Soto, R., Córdova, J., Olguín, E. (2016). A Nature Inspired Intelligent Water Drop Algorithm and Its Application for Solving The Set Covering Problem. In: Silhavy, R., Senkerik, R., Oplatkova, Z., Silhavy, P., Prokopova, Z. (eds) Artificial Intelligence Perspectives in Intelligent Systems. Advances in Intelligent Systems and Computing, vol 464. Springer, Cham. https://doi.org/10.1007/978-3-319-33625-1_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-33625-1_39

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-33623-7

  • Online ISBN: 978-3-319-33625-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics