cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Andi Adriansyah
Contact Email
andi@mercubuana.ac.id
Phone
+628111884220
Journal Mail Official
sinergi@mercubuana.ac.id
Editorial Address
Fakultas Teknik Universitas Mercu Buana Jl. Raya Meruya Selatan, Kembangan, Jakarta 11650 Tlp./Fax: +62215871335
Location
Kota adm. jakarta barat,
Dki jakarta
INDONESIA
Sinergi
Published by Universitas Mercu Buana
ISSN : 14102331     EISSN : 24601217     DOI : https://dx.doi.org/10.22441/sinergi
Core Subject : Engineering,
Civil Engineering, Building, Construction & Architecture Control & Systems Engineering Electrical & Electronics Engineering Engineering Industrial & Manufacturing Engineering
SINERGI is a peer-reviewed international journal published three times a year in February, June, and October. The journal is published by Faculty of Engineering, Universitas Mercu Buana. Each publication contains articles comprising high quality theoretical and empirical original research papers, review papers, and literature reviews that are closely related to the fields of Engineering (Mechanical, Electrical, Industrial, Civil, and Architecture). The theme of the paper is focused on new industrial applications and energy development that synergize with global, green and sustainable technologies. The journal registered in the CrossRef system with Digital Object Identifier (DOI). The journal has been indexed by Google Scholar, DOAJ, BASE, and EBSCO.
Arjuna Subject : Teknik (semua kategori) - Teknik (Lain-Lain)
Articles 561 Documents
 53   54   55   56   57 
An adaptive decreasing sigmoid convergence factor for enhancing Grey Wolf Optimizer performance in high-dimensional optimization problems Andi Adriansyah; Yudhi Gunardi; Heru Suwoyo; Fina Supegina; Isack Farady; Ahmad 'Athif Mohd Faudzi
SINERGI Vol. 30 No. 2 (2026)
Publisher : Universitas Mercu Buana

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22441/sinergi.2026.2.025

Abstract

Optimization algorithms require an effective balance between exploration and exploitation to achieve fast convergence and high solution quality. The Grey Wolf Optimizer (GWO) has demonstrated promising performance in various engineering applications; however, its conventional linear convergence factor often leads to premature convergence or insufficient exploitation, particularly in high-dimensional search spaces. To address this limitation, this study proposes an adaptive decreasing sigmoid convergence factor that dynamically regulates the transition between exploration and exploitation throughout the optimization process. Unlike the standard linear reduction scheme, the proposed sigmoid-based mechanism maintains stronger exploration during the early search stages and accelerates exploitation in later iterations through a controlled nonlinear decline. The proposed approach was evaluated using four widely adopted benchmark functions, namely Sphere, Rosenbrock, Rastrigin, and Griewank, under different dimensionalities, population sizes, and iteration limits. Experimental results demonstrate that the proposed method improves performance in most benchmark scenarios compared with the standard GWO. The best performance was obtained with a sigmoid parameter n = 0.75, which yielded near-optimal solutions for the Sphere and Griewank functions while maintaining stable convergence for the Rosenbrock function. The results further indicate that the proposed strategy scales effectively across medium- and high-dimensional optimization problems. These findings confirm that the adaptive decreasing sigmoid convergence factor provides a simple yet effective enhancement to GWO, offering improved convergence behavior and optimization accuracy across benchmark optimization problems.

Page 57 of 57 | Total Record : 561

 53   54   55   56   57 

Filter by Year

2013 2026


Reset
Filter By Issues
All Issue Vol. 30 No. 2 (2026) Vol 30, No 1 (2026) Vol 29, No 3 (2025) Vol 29, No 2 (2025) Vol 29, No 1 (2025) Vol 28, No 3 (2024) Vol 28, No 2 (2024) Vol 28, No 1 (2024) Vol 27, No 3 (2023) Vol 27, No 2 (2023) Vol 27, No 1 (2023) Vol 26, No 3 (2022) Vol 26, No 2 (2022) Vol 26, No 1 (2022) Vol 25, No 3 (2021) Vol 25, No 2 (2021) Vol 25, No 1 (2021) Vol 24, No 3 (2020) Vol 24, No 2 (2020) Vol 24, No 1 (2020) Vol 23, No 3 (2019) Vol 23, No 2 (2019) Vol 23, No 1 (2019) Vol 22, No 3 (2018) Vol 22, No 2 (2018) Vol 22, No 1 (2018) Vol 21, No 3 (2017) Vol 21, No 2 (2017) Vol 21, No 1 (2017) Vol 20, No 3 (2016) Vol 20, No 2 (2016) Vol 20, No 1 (2016) Vol 19, No 3 (2015) Vol 19, No 2 (2015) Vol 19, No 1 (2015) Vol 18, No 3 (2014) Vol 18, No 2 (2014) Vol 18, No 1 (2014) Vol 17, No 3 (2013) More Issue