A binary ant lion optimizer applied to knapsack problem

Matias Valenzuela; Lorena Jorquera; Gabriel Villavicencio; Paola Moraga; Hernan Pinto

doi:10.1109/ICSAI48974.2019.9010533

A binary ant lion optimizer applied to knapsack problem

Matias Valenzuela, Lorena Jorquera, Gabriel Villavicencio, Paola Moraga, Hernan Pinto

SCHOOL OF CONSTRUCTION ENGINEERING

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

1 Scopus citations

Abstract

Combinatorial problems with NP-hard complexity appear frequently in operational research. Making robust algorithms that solve these combinatorial problems is of interest in operational research. In this article, a binarization mechanism is proposed so that continuous metaheuristics can solve combinatorial problems. The binarization mechanism uses the concept of percentile. This percentile mechanism is applied to the ant lion algorithm. The NP-hard knapsack problem (MKP) was used to verify our algorithm. Additionally, the binary percentile algorithm was compared with other algorithms that have recently has solved the MKP, observing that the percentile algorithm produces competitive results.

Original language	English
Title of host publication	2019 6th International Conference on Systems and Informatics, ICSAI 2019
Editors	Wanqing Wu, Lipo Wang, Chunlei Ji, Niansheng Chen, Sun Qiang, Xiaoyong Song, Xin Wang
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	469-474
Number of pages	6
ISBN (Electronic)	9781728152561
DOIs	https://doi.org/10.1109/ICSAI48974.2019.9010533
State	Published - Nov 2019
Event	6th International Conference on Systems and Informatics, ICSAI 2019 - Shanghai, China Duration: 2 Nov 2019 → 4 Nov 2019

Publication series

Name	2019 6th International Conference on Systems and Informatics, ICSAI 2019

Conference

Conference	6th International Conference on Systems and Informatics, ICSAI 2019
Country/Territory	China
City	Shanghai
Period	2/11/19 → 4/11/19

Access to Document

10.1109/ICSAI48974.2019.9010533

Cite this

Valenzuela, M., Jorquera, L., Villavicencio, G., Moraga, P., & Pinto, H. (2019). A binary ant lion optimizer applied to knapsack problem. In W. Wu, L. Wang, C. Ji, N. Chen, S. Qiang, X. Song, & X. Wang (Eds.), 2019 6th International Conference on Systems and Informatics, ICSAI 2019 (pp. 469-474). Article 9010533 (2019 6th International Conference on Systems and Informatics, ICSAI 2019). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICSAI48974.2019.9010533

Valenzuela, Matias ; Jorquera, Lorena ; Villavicencio, Gabriel et al. / A binary ant lion optimizer applied to knapsack problem. 2019 6th International Conference on Systems and Informatics, ICSAI 2019. editor / Wanqing Wu ; Lipo Wang ; Chunlei Ji ; Niansheng Chen ; Sun Qiang ; Xiaoyong Song ; Xin Wang. Institute of Electrical and Electronics Engineers Inc., 2019. pp. 469-474 (2019 6th International Conference on Systems and Informatics, ICSAI 2019).

@inproceedings{ae01b764cf064171b8cb2f011ce7a68f,

title = "A binary ant lion optimizer applied to knapsack problem",

abstract = "Combinatorial problems with NP-hard complexity appear frequently in operational research. Making robust algorithms that solve these combinatorial problems is of interest in operational research. In this article, a binarization mechanism is proposed so that continuous metaheuristics can solve combinatorial problems. The binarization mechanism uses the concept of percentile. This percentile mechanism is applied to the ant lion algorithm. The NP-hard knapsack problem (MKP) was used to verify our algorithm. Additionally, the binary percentile algorithm was compared with other algorithms that have recently has solved the MKP, observing that the percentile algorithm produces competitive results.",

author = "Matias Valenzuela and Lorena Jorquera and Gabriel Villavicencio and Paola Moraga and Hernan Pinto",

note = "Publisher Copyright: {\textcopyright} 2019 IEEE.; 6th International Conference on Systems and Informatics, ICSAI 2019 ; Conference date: 02-11-2019 Through 04-11-2019",

year = "2019",

month = nov,

doi = "10.1109/ICSAI48974.2019.9010533",

language = "English",

series = "2019 6th International Conference on Systems and Informatics, ICSAI 2019",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "469--474",

editor = "Wanqing Wu and Lipo Wang and Chunlei Ji and Niansheng Chen and Sun Qiang and Xiaoyong Song and Xin Wang",

booktitle = "2019 6th International Conference on Systems and Informatics, ICSAI 2019",

}

Valenzuela, M, Jorquera, L , Villavicencio, G , Moraga, P & Pinto, H 2019, A binary ant lion optimizer applied to knapsack problem. in W Wu, L Wang, C Ji, N Chen, S Qiang, X Song & X Wang (eds), 2019 6th International Conference on Systems and Informatics, ICSAI 2019., 9010533, 2019 6th International Conference on Systems and Informatics, ICSAI 2019, Institute of Electrical and Electronics Engineers Inc., pp. 469-474, 6th International Conference on Systems and Informatics, ICSAI 2019, Shanghai, China, 2/11/19. https://doi.org/10.1109/ICSAI48974.2019.9010533

A binary ant lion optimizer applied to knapsack problem. / Valenzuela, Matias; Jorquera, Lorena ; Villavicencio, Gabriel et al.
2019 6th International Conference on Systems and Informatics, ICSAI 2019. ed. / Wanqing Wu; Lipo Wang; Chunlei Ji; Niansheng Chen; Sun Qiang; Xiaoyong Song; Xin Wang. Institute of Electrical and Electronics Engineers Inc., 2019. p. 469-474 9010533 (2019 6th International Conference on Systems and Informatics, ICSAI 2019).

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

TY - GEN

T1 - A binary ant lion optimizer applied to knapsack problem

AU - Valenzuela, Matias

AU - Jorquera, Lorena

AU - Villavicencio, Gabriel

AU - Moraga, Paola

AU - Pinto, Hernan

PY - 2019/11

Y1 - 2019/11

N2 - Combinatorial problems with NP-hard complexity appear frequently in operational research. Making robust algorithms that solve these combinatorial problems is of interest in operational research. In this article, a binarization mechanism is proposed so that continuous metaheuristics can solve combinatorial problems. The binarization mechanism uses the concept of percentile. This percentile mechanism is applied to the ant lion algorithm. The NP-hard knapsack problem (MKP) was used to verify our algorithm. Additionally, the binary percentile algorithm was compared with other algorithms that have recently has solved the MKP, observing that the percentile algorithm produces competitive results.

AB - Combinatorial problems with NP-hard complexity appear frequently in operational research. Making robust algorithms that solve these combinatorial problems is of interest in operational research. In this article, a binarization mechanism is proposed so that continuous metaheuristics can solve combinatorial problems. The binarization mechanism uses the concept of percentile. This percentile mechanism is applied to the ant lion algorithm. The NP-hard knapsack problem (MKP) was used to verify our algorithm. Additionally, the binary percentile algorithm was compared with other algorithms that have recently has solved the MKP, observing that the percentile algorithm produces competitive results.

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

U2 - 10.1109/ICSAI48974.2019.9010533

DO - 10.1109/ICSAI48974.2019.9010533

M3 - Conference contribution

AN - SCOPUS:85081981536

T3 - 2019 6th International Conference on Systems and Informatics, ICSAI 2019

SP - 469

EP - 474

BT - 2019 6th International Conference on Systems and Informatics, ICSAI 2019

A2 - Wu, Wanqing

A2 - Wang, Lipo

A2 - Ji, Chunlei

A2 - Chen, Niansheng

A2 - Qiang, Sun

A2 - Song, Xiaoyong

A2 - Wang, Xin

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 6th International Conference on Systems and Informatics, ICSAI 2019

Y2 - 2 November 2019 through 4 November 2019

ER -

Valenzuela M, Jorquera L , Villavicencio G , Moraga P , Pinto H. A binary ant lion optimizer applied to knapsack problem. In Wu W, Wang L, Ji C, Chen N, Qiang S, Song X, Wang X, editors, 2019 6th International Conference on Systems and Informatics, ICSAI 2019. Institute of Electrical and Electronics Engineers Inc. 2019. p. 469-474. 9010533. (2019 6th International Conference on Systems and Informatics, ICSAI 2019). doi: 10.1109/ICSAI48974.2019.9010533

A binary ant lion optimizer applied to knapsack problem

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this