A percentile transition ranking algorithm applied to binarization of continuous swarm intelligence metaheuristics

José García; BRODERICK   CRAWFORD LABRIN; RICARDO JAVIER SOTO DE GIORGIS; Gino Astorga

doi:10.1007/978-3-319-72550-5_1

A percentile transition ranking algorithm applied to binarization of continuous swarm intelligence metaheuristics

José García, BRODERICK CRAWFORD LABRIN, RICARDO JAVIER SOTO DE GIORGIS, Gino Astorga

SCHOOL OF COMPUTER ENGINEERING

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

19 Scopus citations

Abstract

The binarization of continuous swarm-intelligence metaheuristics is an area of great interest in operational research. This interest is mainly due to the application of binarized metaheuristics to combinatorial problems. In this article we propose a general binarization algorithm called Percentil Transition Ranking Algorithm (PTRA). PTRA uses the percentile concept as a binarization mechanism. In particular we apply this mechanism to the Cuckoo Search metaheuristic to solve the Set Covering Problem (SCP). We provide necessary experiments to investigate the role of key ingredients of the algorithm. Finally to demonstrate the efficiency of our proposal, Set Covering benchmark instances of the literature show that PTRA competes with the state-of-the-art algorithms.

Original language	English
Title of host publication	Recent Advances on Soft Computing and Data Mining - Proceedings of the 3rd International Conference on Soft Computing and Data Mining SCDM 2018
Editors	Jemal H. Abawajy, Rozaida Ghazali, Mustafa Mat Deris, Nazri Mohd Nawi
Publisher	Springer Verlag
Pages	3-13
Number of pages	11
ISBN (Print)	9783319725499
DOIs	https://doi.org/10.1007/978-3-319-72550-5_1
State	Published - 1 Jan 2018
Event	3rd International Conference on Soft Computing and Data Mining, SCDM 2018 - Johor, Malaysia Duration: 6 Feb 2018 → 8 Feb 2018

Publication series

Name	Advances in Intelligent Systems and Computing
Volume	700
ISSN (Print)	2194-5357

Conference

Conference	3rd International Conference on Soft Computing and Data Mining, SCDM 2018
Country	Malaysia
City	Johor
Period	6/02/18 → 8/02/18

Keywords

Binary metaheuristics
Combinatorial optimization
Percentile ranking
Set covering problem

Access to Document

10.1007/978-3-319-72550-5_1

Fingerprint Dive into the research topics of 'A percentile transition ranking algorithm applied to binarization of continuous swarm intelligence metaheuristics'. Together they form a unique fingerprint.

Cite this

García, J., CRAWFORD LABRIN, BRODERICK., SOTO DE GIORGIS, RICARDO. JAVIER., & Astorga, G. (2018). A percentile transition ranking algorithm applied to binarization of continuous swarm intelligence metaheuristics. In J. H. Abawajy, R. Ghazali, M. M. Deris, & N. M. Nawi (Eds.), Recent Advances on Soft Computing and Data Mining - Proceedings of the 3rd International Conference on Soft Computing and Data Mining SCDM 2018 (pp. 3-13). (Advances in Intelligent Systems and Computing; Vol. 700). Springer Verlag. https://doi.org/10.1007/978-3-319-72550-5_1

García, José ; CRAWFORD LABRIN, BRODERICK ; SOTO DE GIORGIS, RICARDO JAVIER ; Astorga, Gino. / A percentile transition ranking algorithm applied to binarization of continuous swarm intelligence metaheuristics. Recent Advances on Soft Computing and Data Mining - Proceedings of the 3rd International Conference on Soft Computing and Data Mining SCDM 2018. editor / Jemal H. Abawajy ; Rozaida Ghazali ; Mustafa Mat Deris ; Nazri Mohd Nawi. Springer Verlag, 2018. pp. 3-13 (Advances in Intelligent Systems and Computing).

@inproceedings{3e40034d8280460db06ae9cfa7ef0a07,

title = "A percentile transition ranking algorithm applied to binarization of continuous swarm intelligence metaheuristics",

abstract = "The binarization of continuous swarm-intelligence metaheuristics is an area of great interest in operational research. This interest is mainly due to the application of binarized metaheuristics to combinatorial problems. In this article we propose a general binarization algorithm called Percentil Transition Ranking Algorithm (PTRA). PTRA uses the percentile concept as a binarization mechanism. In particular we apply this mechanism to the Cuckoo Search metaheuristic to solve the Set Covering Problem (SCP). We provide necessary experiments to investigate the role of key ingredients of the algorithm. Finally to demonstrate the efficiency of our proposal, Set Covering benchmark instances of the literature show that PTRA competes with the state-of-the-art algorithms.",

keywords = "Binary metaheuristics, Combinatorial optimization, Percentile ranking, Set covering problem",

author = "Jos{\'e} Garc{\'i}a and {CRAWFORD LABRIN}, BRODERICK and {SOTO DE GIORGIS}, {RICARDO JAVIER} and Gino Astorga",

year = "2018",

month = jan,

day = "1",

doi = "10.1007/978-3-319-72550-5_1",

language = "English",

isbn = "9783319725499",

series = "Advances in Intelligent Systems and Computing",

publisher = "Springer Verlag",

pages = "3--13",

editor = "Abawajy, {Jemal H.} and Rozaida Ghazali and Deris, {Mustafa Mat} and Nawi, {Nazri Mohd}",

booktitle = "Recent Advances on Soft Computing and Data Mining - Proceedings of the 3rd International Conference on Soft Computing and Data Mining SCDM 2018",

note = "null ; Conference date: 06-02-2018 Through 08-02-2018",

}

García, J, CRAWFORD LABRIN, BRODERICK , SOTO DE GIORGIS, RICARDOJAVIER & Astorga, G 2018, A percentile transition ranking algorithm applied to binarization of continuous swarm intelligence metaheuristics. in JH Abawajy, R Ghazali, MM Deris & NM Nawi (eds), Recent Advances on Soft Computing and Data Mining - Proceedings of the 3rd International Conference on Soft Computing and Data Mining SCDM 2018. Advances in Intelligent Systems and Computing, vol. 700, Springer Verlag, pp. 3-13, 3rd International Conference on Soft Computing and Data Mining, SCDM 2018, Johor, Malaysia, 6/02/18. https://doi.org/10.1007/978-3-319-72550-5_1

A percentile transition ranking algorithm applied to binarization of continuous swarm intelligence metaheuristics. / García, José; CRAWFORD LABRIN, BRODERICK ; SOTO DE GIORGIS, RICARDO JAVIER; Astorga, Gino.

Recent Advances on Soft Computing and Data Mining - Proceedings of the 3rd International Conference on Soft Computing and Data Mining SCDM 2018. ed. / Jemal H. Abawajy; Rozaida Ghazali; Mustafa Mat Deris; Nazri Mohd Nawi. Springer Verlag, 2018. p. 3-13 (Advances in Intelligent Systems and Computing; Vol. 700).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A percentile transition ranking algorithm applied to binarization of continuous swarm intelligence metaheuristics

AU - García, José

AU - CRAWFORD LABRIN, BRODERICK

AU - SOTO DE GIORGIS, RICARDO JAVIER

AU - Astorga, Gino

PY - 2018/1/1

Y1 - 2018/1/1

N2 - The binarization of continuous swarm-intelligence metaheuristics is an area of great interest in operational research. This interest is mainly due to the application of binarized metaheuristics to combinatorial problems. In this article we propose a general binarization algorithm called Percentil Transition Ranking Algorithm (PTRA). PTRA uses the percentile concept as a binarization mechanism. In particular we apply this mechanism to the Cuckoo Search metaheuristic to solve the Set Covering Problem (SCP). We provide necessary experiments to investigate the role of key ingredients of the algorithm. Finally to demonstrate the efficiency of our proposal, Set Covering benchmark instances of the literature show that PTRA competes with the state-of-the-art algorithms.

AB - The binarization of continuous swarm-intelligence metaheuristics is an area of great interest in operational research. This interest is mainly due to the application of binarized metaheuristics to combinatorial problems. In this article we propose a general binarization algorithm called Percentil Transition Ranking Algorithm (PTRA). PTRA uses the percentile concept as a binarization mechanism. In particular we apply this mechanism to the Cuckoo Search metaheuristic to solve the Set Covering Problem (SCP). We provide necessary experiments to investigate the role of key ingredients of the algorithm. Finally to demonstrate the efficiency of our proposal, Set Covering benchmark instances of the literature show that PTRA competes with the state-of-the-art algorithms.

KW - Binary metaheuristics

KW - Combinatorial optimization

KW - Percentile ranking

KW - Set covering problem

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

U2 - 10.1007/978-3-319-72550-5_1

DO - 10.1007/978-3-319-72550-5_1

M3 - Conference contribution

AN - SCOPUS:85041501507

SN - 9783319725499

T3 - Advances in Intelligent Systems and Computing

SP - 3

EP - 13

BT - Recent Advances on Soft Computing and Data Mining - Proceedings of the 3rd International Conference on Soft Computing and Data Mining SCDM 2018

A2 - Abawajy, Jemal H.

A2 - Ghazali, Rozaida

A2 - Deris, Mustafa Mat

A2 - Nawi, Nazri Mohd

PB - Springer Verlag

Y2 - 6 February 2018 through 8 February 2018

ER -

García J, CRAWFORD LABRIN BRODERICK , SOTO DE GIORGIS RICARDOJAVIER, Astorga G. A percentile transition ranking algorithm applied to binarization of continuous swarm intelligence metaheuristics. In Abawajy JH, Ghazali R, Deris MM, Nawi NM, editors, Recent Advances on Soft Computing and Data Mining - Proceedings of the 3rd International Conference on Soft Computing and Data Mining SCDM 2018. Springer Verlag. 2018. p. 3-13. (Advances in Intelligent Systems and Computing). https://doi.org/10.1007/978-3-319-72550-5_1

A percentile transition ranking algorithm applied to binarization of continuous swarm intelligence metaheuristics

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Cite this