TY - GEN

T1 - A binary ant lion optimisation algorithm applied to the set covering problem

AU - JORQUERA MARTINEZ, LORENA VERONICA

AU - VALENZUELA TORO, PAMELA ISABEL

AU - Valenzuela, Matías

AU - Pinto, Hernan

PY - 2019/1/1

Y1 - 2019/1/1

N2 - The study and understanding of algorithms that solve combinatorial problems based on swarm intelligence continuous metaheuristics, is an area of interest at the level of basic and applied science. This is due to the fact that many of the problems addressed at industrial level are of a combinatorial type and a subset no less than these are of the NP-hard type. In this article, a mechanism of binarization of continuous metaheuristics that uses the concept of the percentile is proposed. This percentile concept is applied to the An Lion optimization algorithm, solving the set covering problem (SCP). Experiments were designed to demonstrate the importance of the percentile concept in the binarization process. Subsequently, the efficiency of the algorithm is verified through reference instances. The results indicate that the binary Ant Lion Algorithm (BALO) obtains adequate results when evaluated with a combinatorial problem such as the SCP.

AB - The study and understanding of algorithms that solve combinatorial problems based on swarm intelligence continuous metaheuristics, is an area of interest at the level of basic and applied science. This is due to the fact that many of the problems addressed at industrial level are of a combinatorial type and a subset no less than these are of the NP-hard type. In this article, a mechanism of binarization of continuous metaheuristics that uses the concept of the percentile is proposed. This percentile concept is applied to the An Lion optimization algorithm, solving the set covering problem (SCP). Experiments were designed to demonstrate the importance of the percentile concept in the binarization process. Subsequently, the efficiency of the algorithm is verified through reference instances. The results indicate that the binary Ant Lion Algorithm (BALO) obtains adequate results when evaluated with a combinatorial problem such as the SCP.

UR - http://www.scopus.com/inward/record.url?scp=85065904424&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-19810-7_16

DO - 10.1007/978-3-030-19810-7_16

M3 - Conference contribution

AN - SCOPUS:85065904424

SN - 9783030198091

T3 - Advances in Intelligent Systems and Computing

SP - 156

EP - 167

BT - Artificial Intelligence Methods in Intelligent Algorithms - Proceedings of 8th Computer Science On-line Conference 2019, Vol. 2

A2 - Silhavy, Radek

PB - Springer Verlag

Y2 - 24 April 2019 through 27 April 2019

ER -