Competitive hybrid Jaya and β-Hill Climbing algorithm for high-cost optimization problems

Gurcan Yavuz; Hatem Dumlu; Yacoub Kadar Hassan

Makale detayları

Competitive hybrid Jaya and β-Hill Climbing algorithm for high-cost optimization problems

Yazarlar:

Gurcan Yavuz | Hatem Dumlu | Yacoub Kadar Hassan

Yayıncı:

Nigde Omer Halisdemir University

Ana Başlıklar:

Evrimsel Hesaplama

Dergi:

Niğde Ömer Halisdemir Üniversitesi Mühendislik Bilimleri Dergisi Vol.14 Issue 2, pp.597-606

Belge Tipi:

Makale

Yayın Tarihi:

4/2025

Belge Dili:

İngilizce

Document ID (Org No.):

2001345078

pISSN:

2564-6605

Anahtar kelimeler:

Özet:

 Jaya algorithm is a population-based parameter-less optimization algorithm. It is frequently used in high-cost industrial and engineering problems. However, Jaya algorithm gets stuck in local optimum in some problems with constrained conditions. In this paper, we introduce a hybrid variant of Jaya to overcome the problem of getting stuck at the local optimum, the β-Hill Climbing local search algorithm is added to the Jaya algorithm and a hybrid Jaya algorithm CT-JAYA-BH is presented. Before deciding to use the β-Hill Climbing algorithm, Jaya was also combined with the Quasi Newton and Nelder-Mead local search algorithms. These variants were tested on the CEC 2015 benchmark set provided by IEEE. According to the results, the Jaya-β-Hill Climbing variant CT-JAYA-BH obtained the best results. A parameter analysis of CT-JAYA-BH was also performed to determine at which parameter values this variant achieved the best results. Moreover CT-JAYA-BH was compared with 14 different optimization algorithms using the CEC 2015 benchmark set. According to the results, the proposed CT-JAYA-BH algorithm outperforms the other algorithms with an average rank value of 1.87 in both 10 and 30 dimensions. The results show that CT-JAYA-BH is a highly competitive.

 Jaya algorithm is a population-based parameter-less optimization algorithm. It is frequently used in high-cost industrial and engineering problems. However, Jaya algorithm gets stuck in local optimum in some problems with constrained conditions. In this paper, we introduce a hybrid variant of Jaya to overcome the problem of getting stuck at the local optimum, the β-Hill Climbing local search algorithm is added to the Jaya algorithm and a hybrid Jaya algorithm CT-JAYA-BH is presented. Before deciding to use the β-Hill Climbing algorithm, Jaya was also combined with the Quasi Newton and Nelder-Mead local search algorithms. These variants were tested on the CEC 2015 benchmark set provided by IEEE. According to the results, the Jaya-β-Hill Climbing variant CT-JAYA-BH obtained the best results. A parameter analysis of CT-JAYA-BH was also performed to determine at which parameter values this variant achieved the best results. Moreover CT-JAYA-BH was compared with 14 different optimization algorithms using the CEC 2015 benchmark set. According to the results, the proposed CT-JAYA-BH algorithm outperforms the other algorithms with an average rank value of 1.87 in both 10 and 30 dimensions. The results show that CT-JAYA-BH is a highly competitive.

 Jaya algorithm is a population-based parameter-less optimization algorithm. It is frequently used in high-cost industrial and engineering problems. However, Jaya algorithm gets stuck in local optimum in some problems with constrained conditions. In this paper, we introduce a hybrid variant of Jaya to overcome the problem of getting stuck at the local optimum, the β-Hill Climbing local search algorithm is added to the Jaya algorithm and a hybrid Jaya algorithm CT-JAYA-BH is presented. Before deciding to use the β-Hill Climbing algorithm, Jaya was also combined with the Quasi Newton and Nelder-Mead local search algorithms. These variants were tested on the CEC 2015 benchmark set provided by IEEE. According to the results, the Jaya-β-Hill Climbing variant CT-JAYA-BH obtained the best results. A parameter analysis of CT-JAYA-BH was also performed to determine at which parameter values this variant achieved the best results. Moreover CT-JAYA-BH was compared with 14 different optimization algorithms using the CEC 2015 benchmark set. According to the results, the proposed CT-JAYA-BH algorithm outperforms the other algorithms with an average rank value of 1.87 in both 10 and 30 dimensions. The results show that CT-JAYA-BH is a highly competitive.

 Jaya algoritması, popülasyon tabanlı parametresiz bir optimizasyon algoritmasıdır. Yüksek maliyetli endüstriyel ve mühendislik problemlerinde sıklıkla kullanılmaktadır. Ancak, Jaya algoritması kısıtlı koşullara sahip bazı problemlerde yerel optimumda takılıp kalmaktadır. Bu makalede, yerel optimumda takılma probleminin üstesinden gelmek için Jayanın hibrit bir varyantı tanıtılmakta, β -Hill Climbing yerel arama algoritması Jaya algoritmasına eklenmekte ve hibrit bir Jaya algoritması CT-JAYA-BH sunulmaktadır. β-Hill Climbing algoritmasını kullanmaya karar vermeden önce Jaya, Quasi Newton ve Nelder-Mead yerel arama algoritmaları ile de birleştirilmiştir. Bu varyantlar IEEE tarafından sağlanan CEC 2015 benchmark seti üzerinde test edilmiştir. Sonuçlara göre, Jaya-β-Hill Climbing varyantı CT-JAYA-BH en iyi sonuçları elde etmiştir. Bu varyantın hangi parametre değerlerinde en iyi sonuçları elde ettiğini belirlemek için CT-JAYA-BHnin bir parametre analizi de yapılmıştır. Ayrıca CT-JAYA-BH, CEC 2015 kıyaslama seti kullanılarak 14 farklı optimizasyon algoritması ile karşılaştırılmıştır. Sonuçlara göre, önerilen CT-JAYA-BH algoritması hem 10 hem de 30 boyutta ortalama 1.87 rank değeri ile diğer algoritmalardan daha iyi performans göstermiştir. CT-JAYA-BH oldukça rekabetçidir.

Makale detayları

Competitive hybrid Jaya and β-Hill Climbing algorithm for high-cost optimization problems

Yazarlar:

Gurcan Yavuz | Hatem Dumlu | Yacoub Kadar Hassan

Yayıncı:

Nigde Omer Halisdemir University

Ana Başlıklar:

Evrimsel Hesaplama

Dergi:

Niğde Ömer Halisdemir Üniversitesi Mühendislik Bilimleri Dergisi Vol.14 Issue 2, pp.597-606

Belge Tipi:

Makale

Yayın Tarihi:

4/2025

Belge Dili:

İngilizce

Document ID (Org No.):

2001345078

pISSN:

2564-6605

Jaya

Local Search

β -Hill Climbing

CEC 2015Jaya

Yerel Arama

β-Hill Climbing

CEC 2015

Sayı

Makale detayları

Yazarlar: Gurcan Yavuz | Hatem Dumlu | Yacoub Kadar Hassan

Yayıncı: Nigde Omer Halisdemir University

Ana Başlıklar: Evrimsel Hesaplama

Dergi: Niğde Ömer Halisdemir Üniversitesi Mühendislik Bilimleri Dergisi Vol.14 Issue 2, pp.597-606

Belge Tipi: Makale

Yayın Tarihi: 4/2025

Belge Dili: İngilizce

Document ID (Org No.): 2001345078

pISSN: 2564-6605

Sayı

Yazarlar:

Gurcan Yavuz | Hatem Dumlu | Yacoub Kadar Hassan

Yayıncı:

Nigde Omer Halisdemir University

Ana Başlıklar:

Evrimsel Hesaplama

Dergi:

Niğde Ömer Halisdemir Üniversitesi Mühendislik Bilimleri Dergisi Vol.14 Issue 2, pp.597-606

Belge Tipi:

Makale

Yayın Tarihi:

4/2025

Belge Dili:

İngilizce

Document ID (Org No.):

2001345078

pISSN:

2564-6605