Skip to main content
SpringerLink
Log in

Solving the Set Covering Problem with the Soccer League Competition Algorithm

  • Conference paper
  • First Online:
Trends in Applied Knowledge-Based Systems and Data Science (IEA/AIE 2016)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9799))

Abstract

The Soccer League Competition (SLC) algorithm is a new metaheuristic approach intendended to solve complex optimization problems. It is based in the interaction model present in soccer teams and the goal to win every match, becoming the best team and league of players. This paper presents adaptations to the initial mode of SLC for the purpose of being applied to the Set Covering Problem (SCP) with a Python implementation.

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

Access this chapter

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

References

  1. OR-Library a collection of test data sets for a variety ofoperations research (or) problems. http://people.brunel.ac.uk/mastjjb/jeb/orlib/scpinfo.html. Accessed 30 Mar 2015

  2. PyPyODBC a pure Python ODBC module by ctypes. https://pypi.python.org/pypi/pypyodbc. Accessed 20 Jan 2015

  3. 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)

    Chapter  Google Scholar 

  4. 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. LNCS, vol. 9012, pp. 41–50. Springer, Heidelberg (2015)

    Google Scholar 

  5. 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 solveset covering problems. In: Silhavy, R., Senkerik, R., Oplatkova, Z.K., Prokopova, Z., Silhavy, P. (eds.) CSOC 2015. AISC, vol. 349, pp. 317–326. Springer, Cham (2015)

    Google Scholar 

  6. 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. In: Silhavy, R., Senkerik, R., Oplatkova, Z.K., Prokopova, Z., Silhavy, P. (eds.) CSOC 2015. AISC, vol. 349, pp. 307–315. Springer, Cham (2015)

    Google Scholar 

  7. Mirjalili, S., Lewis, A.: S-shaped versus V-shaped transfer functions for binary particle swarm optimization. Swarm Evol. Comput. 9, 1–14 (2013)

    Article  Google Scholar 

  8. Moosavian, N.: Soccer league competition algorithm, a new method for solving systems of nonlinear equations. Sci. Res. 4, 7–16 (2014)

    Google Scholar 

  9. Moosavian, N.: Soccer league competition algorithm for solving knapsack problems. Swarm Evol. Comput. 20, 14–22 (2015)

    Article  Google Scholar 

  10. 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)

    Article  Google Scholar 

  11. 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.) Bioinspired Computation in Artificial Systems. LNCS, vol. 9108, pp. 88–97. Springer, Heidelberg (2015)

    Chapter  Google Scholar 

  12. 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)

    Google Scholar 

Download references

Acknowledgements

Broderick Crawford is supported by Grant CONICYT/FONDECYT/REGULAR/1140897. Ricardo Soto is supported by Grant CONICYT/FONDECYT/REGULAR/1160455. Sebastián 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

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

    Adrián Jaramillo, Broderick Crawford, Ricardo Soto, Sebastián Mansilla Villablanca, Álvaro Gómez Rubio & Juan Salas

  2. Universidad Autónoma de Chile, Santiago, Chile

    Ricardo Soto

  3. Universidad Científica del Sur, Lima, Peru

    Ricardo Soto

  4. Universidad San Sebastian, Santiago, Chile

    Broderick Crawford & Eduardo Olguín

Authors
  1. Adrián Jaramillo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Broderick Crawford
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ricardo Soto
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Sebastián Mansilla Villablanca
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Álvaro Gómez Rubio
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Juan Salas
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Eduardo Olguín
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Adrián Jaramillo .

Editor information

Editors and Affiliations

  1. Iwate Prefectural University , Iwate, Japan

    Hamido Fujita

  2. Department Computer Science, Texas State University, San Marcos, Texas, USA

    Moonis Ali

  3. Universiti Teknologi Malaysis (UTM), Bahru, Malaysia

    Ali Selamat

  4. Iwate Prefectural University , Iwate, Japan

    Jun Sasaki

  5. Iwate Prefectural University , Iwate, Japan

    Masaki Kurematsu

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Jaramillo, A. et al. (2016). Solving the Set Covering Problem with the Soccer League Competition Algorithm. In: Fujita, H., Ali, M., Selamat, A., Sasaki, J., Kurematsu, M. (eds) Trends in Applied Knowledge-Based Systems and Data Science. IEA/AIE 2016. Lecture Notes in Computer Science(), vol 9799. Springer, Cham. https://doi.org/10.1007/978-3-319-42007-3_75

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-42007-3_75

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-42006-6

  • Online ISBN: 978-3-319-42007-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation