A Nature Inspired Intelligent Water Drop Algorithm and Its Application for Solving The Set Covering Problem
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.
KeywordsIntelligent Water Drop Set Covering Problem Metaheuristics Combinatorial optimization
The author Broderick Crawford is supported by grant CONICYT/FONDECYT /REGULAR/1140897 and Ricardo Soto is supported by grant CONICYT / FONDECYT/INICIACION/11130459.
- 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
- 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
- 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
- 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
- 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