Advertisement

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

  • Broderick Crawford
  • Ricardo Soto
  • Jorge CórdovaEmail author
  • Eduardo Olguín
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 464)

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.

Keywords

Intelligent Water Drop Set Covering Problem Metaheuristics Combinatorial optimization 

Notes

Acknowledgments

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

References

  1. 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. 2.
    Beasley, J.: A lagrangian heuristic for set covering problems. Nav. Res. Logist. 37, 151–164 (1990)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Caprara, A., Fischetti, M., Toth, P.: Algorithms for the set covering problem. Ann. Oper. Res. 98, 353–371 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 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. 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. 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. 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)CrossRefGoogle Scholar
  8. 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. 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)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 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)MathSciNetCrossRefGoogle Scholar
  11. 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. 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. 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)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Shah-Hosseini, Hamed: A new optimization method for solving the multiple knapsack problem. Int. J. Intell. Comput. Cybern. 1(2), 193–212 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 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

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Broderick Crawford
    • 1
    • 2
    • 3
  • Ricardo Soto
    • 1
    • 4
    • 5
  • Jorge Córdova
    • 1
    Email author
  • Eduardo Olguín
    • 2
  1. 1.Pontificia Universidad Católica de ValparaísoValparaísoChile
  2. 2.Universidad San SebastiánSantiago Metropolitan RegionChile
  3. 3.Universidad Central de ChileSantiago Metropolitan RegionChile
  4. 4.Universidad Autónoma de ChileTemucoChile
  5. 5.Universidad Cientifica del SurLimaPeru

Personalised recommendations