Title
Solving the set covering problem with the soccer league competition algorithm
Date Issued
01 January 2016
Access level
metadata only access
Resource Type
conference paper
Author(s)
Jaramillo A.
Crawford B.
SOTO DE GIORGIS, RICARDO
Villablanca S.
Rubio Á.
Salas J.
Olguín E.
Universidad Científica del Sur
Publisher(s)
Springer Verlag
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.
Start page
884
End page
891
Volume
9799
Language
English
OCDE Knowledge area
Bioinformática
Subjects
DOI
10.1007/978-3-319-42007-3_75
Scopus EID
2-s2.0-84978890830
ISSN of the container
03029743
ISBN of the container
9783319420066
Conference
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Sources of information: Directorio de Producción Científica Scopus