Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 1

New approach on global optimization problems based on meta-heuristic algorithm and quasi-Newton method

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 12 No. 5 (2022)

DOI
10.11591/ijece.v12i5.pp5182-5190
ISSN
2722-2578, 2088-8708
Published
2022-10-01
Publisher
Institute of Advanced Engineering and Science
License
creativecommons.org/licenses/by-sa/4.0

Abstract

This paper presents an innovative approach in finding an optimal solution of multimodal and multivariable function for global optimization problems that involve complex and inefficient second derivatives. Artificial bees colony (ABC) algorithm possessed good exploration search, but the major weakness at its exploitation stage. The proposed algorithms improved the weakness of ABC algorithm by hybridized with the most effective gradient based method which are Davidon-Flecher-Powell (DFP) and Broyden-Flecher-Goldfarb-Shanno (BFGS) algorithms. Its distinguished features include maximizing the employment of possible information related to the objective function obtained at previous iterations. The proposed algorithms have been tested on a large set of benchmark global optimization problems and it has shown a satisfactory computational behaviour and it has succeeded in enhancing the algorithm to obtain the solution for global optimization problems.

Collaboration network of the authors

5 authors · 7 co-authorship links

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Tun Hussein Onn University of Malaysia
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Much Aziz MuslimTun Hussein Onn University of Malaysia1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

This record comes from Crossref (what the publisher deposited), because the journal's own OAI-PMH endpoint could not be harvested.

Metadata source: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, first harvested 27 Okt 2026, last seen 27 Okt 2026.
Metadata as oai_dc, converted from Crossref
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title>New approach on global optimization problems based on meta-heuristic algorithm and quasi-Newton method</dc:title><dc:creator>Dasril, Yosza</dc:creator><dc:creator>Khang Wen, Goh</dc:creator><dc:creator>Bujang, Nazarudin bin</dc:creator><dc:creator>Salahudin, Shahrul Nizam</dc:creator><dc:description>&lt;jats:p&gt;&amp;lt;p&amp;gt;This paper presents an innovative approach in finding an optimal solution of multimodal and multivariable function for global optimization problems that involve complex and inefficient second derivatives. Artificial bees colony (ABC) algorithm possessed good exploration search, but the major weakness at its exploitation stage. The proposed algorithms improved the weakness of ABC algorithm by hybridized with the most effective gradient based method which are Davidon-Flecher-Powell (DFP) and Broyden-Flecher-Goldfarb-Shanno (BFGS) algorithms. Its distinguished features include maximizing the employment of possible information related to the objective function obtained at previous iterations. The proposed algorithms have been tested on a large set of benchmark global optimization problems and it has shown a satisfactory computational behaviour and it has succeeded in enhancing the algorithm to obtain the solution for global optimization problems.&amp;lt;/p&amp;gt;&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2022-10-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/ijece.v12i5.pp5182-5190</dc:identifier><dc:identifier>10.11591/ijece.v12i5.pp5182-5190</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 12 No 5 (2022); 5182</dc:source><dc:source>2722-2578</dc:source><dc:source>2088-8708</dc:source><dc:relation>https://ijece.iaescore.com/index.php/IJECE/article/viewFile/25701/15946</dc:relation><dc:rights>http://creativecommons.org/licenses/by-sa/4.0</dc:rights></oai_dc:dc>