Abstract
The Soccer League Competition algorithm (SLC) is a new nature-based metaheuristic approach to solve optimization problems. It gets its basis model from the interaction between soccer teams and their players in a soccer league competition, where each player (feasible solution) compete for victory and be the best player.
This paper presents a review of the underlaying SLC model and a practical approach to solve the Set Covering Problem using SLC and Python as programming language and tested over a widely OR-Library SCP benchmarks to obtain convergence capability and effectiveness of the implementation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
OR-Library a collection of test data sets for a variety of operations research (or) problems. http://people.brunel.ac.uk/~mastjjb/jeb/orlib/scpinfo.html. Accessed 30 Mar 2015
PyPyODBC a pure python odbc module by ctypes. https://pypi.python.org/pypi/pypyodbc. Accessed 20 Jan 2015
Agathos, S.N., Papapetrou, E.: On the set cover problem for broadcasting in wireless ad hoc networks. IEEE Commun. Lett. 17(11), 2192–2195 (2013)
Cormode, G., Karloff, H., Wirth, A.: Set cover algorithms for very large datasets. In: Proceedings of the 19th ACM International Conference on Information and Knowledge Management, CIKM 2010, pp. 479–488. ACM, New York (2010). http://doi.acm.org/10.1145/1871437.1871501
Crawford, B., Soto, R., Cuesta, R., Olivares-Suárez, M., Johnson, F., Olguín, E.: Two swarm intelligence algorithms for the set covering problem. In: ICSOFT-EA 2014 - Proceedings of the 9th International Conference on Software Engineering and Applications, Vienna, Austria, 29–31 August, pp. 60–69 (2014)
Crawford, B., Soto, R., Cuesta, R., Paredes, F.: Using the bee colony optimization method to solve the weighted set covering problem. In: Stephanidis, C. (ed.) HCI 2014, Part I. CCIS, vol. 434, pp. 493–497. Springer, Heidelberg (2014)
Crawford, B., Soto, R., Monfroy, E.: Cultural algorithms for the set covering problem. In: Tan, Y., Shi, Y., Mo, H. (eds.) ICSI 2013, Part II. LNCS, vol. 7929, pp. 27–34. Springer, Heidelberg (2013)
Crawford, B., Soto, R., Olivares-Suárez, M., Paredes, F.: Using the firefly optimization method to solve the weighted set covering problem. In: Stephanidis, C. (ed.) HCI 2014, Part I. CCIS, vol. 434, pp. 509–514. Springer, Heidelberg (2014)
Crawford, B., Soto, R., Palma, W., Paredes, F., Johnson, F., Norero, E.: The impact of a new formulation when solving the set covering problem using the ACO metaheuristic. Model. Comput. & Optim. in Inf. Syst. & Manage. Sci. AISC, vol. 360, pp. 209–218. Springer, Heidelberg (2015)
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., Trawiński, B., Kosala, R. (eds.) ACIIDS 2015, Part II. LNCS, vol. 9012, pp. 41–50. Springer, Heidelberg (2015)
Crawford, B., Soto, R., Peña, C., Riquelme-Leiva, M., Torres-Rojas, C., Johnson, F., Paredes, F.: Binarization methods for shuffled frog leaping algorithms that solve set covering problems. In: Silhavy, R., Senkerik, R., Oplatkova, K.Z., Prokopova, Z., Silhavy, P. (eds.) Software Engineering in Intelligent Systems. AISC, vol. 349, pp. 317–326. Springer, Heidelberg (2015)
Crawford, B., Soto, R., Peña, C., Riquelme-Leiva, M., Torres-Rojas, C., Misra, S., Johnson, F., Paredes, F.: A comparison of three recent nature-inspired metaheuristics for the set covering problem. In: Gervasi, O., Murgante, B., Misra, S., Gavrilova, M.L., Rocha, A.M.A.C., Torre, C., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2015, Part IV. LNCS, vol. 9158, pp. 431–443. Springer, Heidelberg (2015)
Crawford, B., Soto, R., Riquelme-Leiva, M., Peña, C., Torres-Rojas, C., Johnson, F., Paredes, F.: Modified binary firefly algorithms with different transfer functions for solving set covering problems. Software Engineering in Intelligent Systems. AISC, vol. 349, pp. 307–315. Springer, Heidelberg (2015)
Crawford, B., Soto, R., Torres-Rojas, C., Peña, C., Riquelme-Leiva, M., Misra, S., Johnson, F., Paredes, F.: A binary fruit fly optimization algorithm to solve the set covering problem. In: Gervasi, O., Murgante, B., Misra, S., Gavrilova, M.L., Rocha, A.M.A.C., Torre, C., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2015. LNCS, vol. 9158, pp. 411–420. Springer, Heidelberg (2015)
Mirjalili, S., Lewis, A.: S-shaped versus v-shaped transfer functions for binary particle swarm optimization. Swarm Evol. Comput. 9, 1–14 (2013)
Moosavian, N.: Soccer league competition algorithm, a new method for solving systems of nonlinear equations. Sci. Res. 4, 7–16 (2014)
Moosavian, N.: Soccer league competition algorithm for solving knapsack problems. Swarm Evol. Comput. 20, 14–22 (2015)
Moosavian, N., Roodsari, B.K.: Soccer league competition algorithm: a novel meta-heuristic algorithm for optimal design of water distribution networks. Swarm Evol. Comput. 17, 14–24 (2014)
Soto, R., Crawford, B., Olivares, R., Barraza, J., Johnson, F., Paredes, F.: A binary cuckoo search algorithm for solving the set covering problem. In: Vicente, J.M.F., Álvarez-Sánchez, J.R., López, F.P., Toledo-Moreo, F.J., Adeli, H. (eds.) IWINAC 2015, Part II. LNCS, vol. 9108, pp. 88–97. Springer, Heidelberg (2015)
Soto, R., Crawford, B., Vilches, J., Johnson, F., Paredes, F.: Heuristic feasibility and preprocessing for a set covering solver based on firefly optimization. In: Silhavy, R., Senkerik, R., Oplatkova, Z.K., Prokopova, Z., Silhavy, P. (eds.) Artificial Intelligence Perspectives and Applications. AISC, vol. 347, pp. 99–108. Springer, Heidelberg (2015)
Yang, Q., McPeek, J., Nofsinger, A.: Efficient and effective practical algorithms for the set-covering problem. In: Proceedings of the 2008 International Conference on Scientific Computing, CSC, 14–17 July 2008, Las Vegas, Nevada, USA. pp. 156–159 (2008)
Acknowledgements
Broderick Crawford is supported by Grant CONICYT/FONDECYT/REGULAR/1140897. Ricardo Soto is supported by Grant CONICYT/FONDECYT/REGULAR/1160455. Sebastiásn Mansilla, Álvaro Gómez and Juan Salas are supported by Postgraduate Grant Pontificia Universidad Católica de Valparaiso 2015 (INF-PUCV 2015).
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Jaramillo, A. et al. (2016). An Approach to Solve the Set Covering Problem with the Soccer League Competition Algorithm. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2016. ICCSA 2016. Lecture Notes in Computer Science(), vol 9786. Springer, Cham. https://doi.org/10.1007/978-3-319-42085-1_29
Download citation
DOI: https://doi.org/10.1007/978-3-319-42085-1_29
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-42084-4
Online ISBN: 978-3-319-42085-1
eBook Packages: Computer ScienceComputer Science (R0)