Hybridized moth search algorithm for constrained optimization problems

Ivana Starnberger, Eva Tuba, Nebojsa Bacanin, Marko Beko, Milan Tuba

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

In this paper, hybridized moth search algorithm adjusted for tackling constrained optimization problems, is presented. The moth search algorithm is new optimization method. The application of this approach for classic constrained functions was not published in any scientific paper before. By analyzing basic moth search, we noticed some deficiencies. To address these deficiencies, we hybridized the moth search algorithm with artificial bee colony metaheuristics. In order to evaluate robustness, convergence speed and solutions' quality of the hybridized moth search algorithm, we conducted tests on set of 13 classic constrained benchmarks. We performed comparative analysis with the original moth search, and with other algorithms, that proved to be robust and efficient optimization methods. According to the results obtained during experiments, and comparative analysis with other approaches, we came to the conclusion that the hybridized moth search algorithm has potential in dealing with constrained functions optimization.

Original languageEnglish
Title of host publicationProceedings - 2018 International Young Engineers Forum, YEF-ECE 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1-6
Number of pages6
ISBN (Electronic)9781538615034
DOIs
Publication statusPublished - 29 May 2018
Event2nd International Young Engineers Forum, YEF-ECE 2018 - Caparica, Portugal
Duration: 4 May 2018 → …

Conference

Conference2nd International Young Engineers Forum, YEF-ECE 2018
CountryPortugal
CityCaparica
Period4/05/18 → …

Fingerprint

Constrained optimization
Experiments

Keywords

  • constraints handling techniques
  • metaheuristic optimization
  • moth search algorithm
  • swarm intelligence

Cite this

Starnberger, I., Tuba, E., Bacanin, N., Beko, M., & Tuba, M. (2018). Hybridized moth search algorithm for constrained optimization problems. In Proceedings - 2018 International Young Engineers Forum, YEF-ECE 2018 (pp. 1-6). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/YEF-ECE.2018.8368930
Starnberger, Ivana ; Tuba, Eva ; Bacanin, Nebojsa ; Beko, Marko ; Tuba, Milan. / Hybridized moth search algorithm for constrained optimization problems. Proceedings - 2018 International Young Engineers Forum, YEF-ECE 2018. Institute of Electrical and Electronics Engineers Inc., 2018. pp. 1-6
@inproceedings{7c0e392ded884cc98f5f7142e554ae19,
title = "Hybridized moth search algorithm for constrained optimization problems",
abstract = "In this paper, hybridized moth search algorithm adjusted for tackling constrained optimization problems, is presented. The moth search algorithm is new optimization method. The application of this approach for classic constrained functions was not published in any scientific paper before. By analyzing basic moth search, we noticed some deficiencies. To address these deficiencies, we hybridized the moth search algorithm with artificial bee colony metaheuristics. In order to evaluate robustness, convergence speed and solutions' quality of the hybridized moth search algorithm, we conducted tests on set of 13 classic constrained benchmarks. We performed comparative analysis with the original moth search, and with other algorithms, that proved to be robust and efficient optimization methods. According to the results obtained during experiments, and comparative analysis with other approaches, we came to the conclusion that the hybridized moth search algorithm has potential in dealing with constrained functions optimization.",
keywords = "constraints handling techniques, metaheuristic optimization, moth search algorithm, swarm intelligence",
author = "Ivana Starnberger and Eva Tuba and Nebojsa Bacanin and Marko Beko and Milan Tuba",
note = "info:eu-repo/grantAgreement/FCT/5876/135950/PT# Presented research in this paper is facilitated by the Ministry of Education, Science and Technological Development of Republic of Serbia, Grant No. III-44006. M. Beko’s work is facilitated in part by Fundac¸{\~a}o para a Ci{\^e}ncia e a Tecnologia under Projects PEst-OE/EEI/UI0066/2014 (UNINOVA) and Program Investigador FCT (IF/00325/2015).",
year = "2018",
month = "5",
day = "29",
doi = "10.1109/YEF-ECE.2018.8368930",
language = "English",
pages = "1--6",
booktitle = "Proceedings - 2018 International Young Engineers Forum, YEF-ECE 2018",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

Starnberger, I, Tuba, E, Bacanin, N, Beko, M & Tuba, M 2018, Hybridized moth search algorithm for constrained optimization problems. in Proceedings - 2018 International Young Engineers Forum, YEF-ECE 2018. Institute of Electrical and Electronics Engineers Inc., pp. 1-6, 2nd International Young Engineers Forum, YEF-ECE 2018, Caparica, Portugal, 4/05/18. https://doi.org/10.1109/YEF-ECE.2018.8368930

Hybridized moth search algorithm for constrained optimization problems. / Starnberger, Ivana; Tuba, Eva; Bacanin, Nebojsa; Beko, Marko; Tuba, Milan.

Proceedings - 2018 International Young Engineers Forum, YEF-ECE 2018. Institute of Electrical and Electronics Engineers Inc., 2018. p. 1-6.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Hybridized moth search algorithm for constrained optimization problems

AU - Starnberger, Ivana

AU - Tuba, Eva

AU - Bacanin, Nebojsa

AU - Beko, Marko

AU - Tuba, Milan

N1 - info:eu-repo/grantAgreement/FCT/5876/135950/PT# Presented research in this paper is facilitated by the Ministry of Education, Science and Technological Development of Republic of Serbia, Grant No. III-44006. M. Beko’s work is facilitated in part by Fundac¸ão para a Ciência e a Tecnologia under Projects PEst-OE/EEI/UI0066/2014 (UNINOVA) and Program Investigador FCT (IF/00325/2015).

PY - 2018/5/29

Y1 - 2018/5/29

N2 - In this paper, hybridized moth search algorithm adjusted for tackling constrained optimization problems, is presented. The moth search algorithm is new optimization method. The application of this approach for classic constrained functions was not published in any scientific paper before. By analyzing basic moth search, we noticed some deficiencies. To address these deficiencies, we hybridized the moth search algorithm with artificial bee colony metaheuristics. In order to evaluate robustness, convergence speed and solutions' quality of the hybridized moth search algorithm, we conducted tests on set of 13 classic constrained benchmarks. We performed comparative analysis with the original moth search, and with other algorithms, that proved to be robust and efficient optimization methods. According to the results obtained during experiments, and comparative analysis with other approaches, we came to the conclusion that the hybridized moth search algorithm has potential in dealing with constrained functions optimization.

AB - In this paper, hybridized moth search algorithm adjusted for tackling constrained optimization problems, is presented. The moth search algorithm is new optimization method. The application of this approach for classic constrained functions was not published in any scientific paper before. By analyzing basic moth search, we noticed some deficiencies. To address these deficiencies, we hybridized the moth search algorithm with artificial bee colony metaheuristics. In order to evaluate robustness, convergence speed and solutions' quality of the hybridized moth search algorithm, we conducted tests on set of 13 classic constrained benchmarks. We performed comparative analysis with the original moth search, and with other algorithms, that proved to be robust and efficient optimization methods. According to the results obtained during experiments, and comparative analysis with other approaches, we came to the conclusion that the hybridized moth search algorithm has potential in dealing with constrained functions optimization.

KW - constraints handling techniques

KW - metaheuristic optimization

KW - moth search algorithm

KW - swarm intelligence

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

U2 - 10.1109/YEF-ECE.2018.8368930

DO - 10.1109/YEF-ECE.2018.8368930

M3 - Conference contribution

SP - 1

EP - 6

BT - Proceedings - 2018 International Young Engineers Forum, YEF-ECE 2018

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Starnberger I, Tuba E, Bacanin N, Beko M, Tuba M. Hybridized moth search algorithm for constrained optimization problems. In Proceedings - 2018 International Young Engineers Forum, YEF-ECE 2018. Institute of Electrical and Electronics Engineers Inc. 2018. p. 1-6 https://doi.org/10.1109/YEF-ECE.2018.8368930