Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 3

BREAKING BARRIERS IN OPTIMIZATION: CHAOTIC MAP-INTEGRATED ALGORITHMS FOR PRACTICAL CHALLENGE

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 19 No. 4 (2025) · hlm. 2777–2790

DOI
10.30598/barekengvol19iss4pp2777-2790
ISSN
2615-3017, 1978-7227
Terbit
2025-09-01
Penerbit
PATTIMURA UNIVERSITY
Bahasa
eng
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

Real-world applications frequently necessitate optimization of chaotic response surfaces and constrained functions, which present difficult challenges for conventional methods. In order to effectively manage constraints and uncertainty, these complexities necessitate sophisticated algorithms. The objective of this research is to optimize the Rider Optimization Algorithm (ROA) by incorporating chaotic maps—namely, Logistic, Sinusoidal, and Iterative—to enhance exploration and exploitation. The chaotic ROA consistently outperforms the standard ROA in convergence speed, accuracy, and robustness, as evidenced by benchmark evaluations. For instance, in the multiple disk clutch brake design problem, the chaotic ROA obtained the highest objective value of 0.2352, which was equivalent to or greater than the leading algorithms TSO, MFO, and WOA. The chaotic ROA variants (ROAC1, ROAC2, ROAC3) exhibited superior stability by achieving low standard deviations (e.g., 0.3321 in the Branin function at high noise levels) across noisy response surface benchmarks. The integration of constraint-handling mechanisms guaranteed that practicable solutions were achieved without sacrificing optimality. The chaotic ROA is established as a robust and adaptable solution for complex, noisy, and constrained optimization challenges in industrial scheduling, resource allocation, and engineering design by the proposed approach.

Jaringan kolaborasi para penulis

6 penulis · 12 tautan kepenulisan bersama · 4 lintas organisasi

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Thammasat University
  • King Mongkut's University of Technology North Bangkok
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Apirak TepvarinThammasat University2

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) https://ojs3.unpatti.ac.id/index.php/barekeng/oai, pertama di-harvest 5 Nov 2026, terakhir terlihat 15 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">BREAKING BARRIERS IN OPTIMIZATION: CHAOTIC MAP-INTEGRATED ALGORITHMS FOR PRACTICAL CHALLENGE</dc:title>
	<dc:creator>Luangpaiboon, Pongchanun</dc:creator>
	<dc:creator>Visuwan, Danupun</dc:creator>
	<dc:creator>Nanphang, Atiwat</dc:creator>
	<dc:creator>Ruekkasaem, Lakkana</dc:creator>
	<dc:creator>Aungkulanon, Pasura</dc:creator>
	<dc:description xml:lang="en-US">Real-world applications frequently necessitate optimization of chaotic response surfaces and constrained functions, which present difficult challenges for conventional methods. In order to effectively manage constraints and uncertainty, these complexities necessitate sophisticated algorithms. The objective of this research is to optimize the Rider Optimization Algorithm (ROA) by incorporating chaotic maps—namely, Logistic, Sinusoidal, and Iterative—to enhance exploration and exploitation. The chaotic ROA consistently outperforms the standard ROA in convergence speed, accuracy, and robustness, as evidenced by benchmark evaluations. For instance, in the multiple disk clutch brake design problem, the chaotic ROA obtained the highest objective value of 0.2352, which was equivalent to or greater than the leading algorithms TSO, MFO, and WOA. The chaotic ROA variants (ROAC1, ROAC2, ROAC3) exhibited superior stability by achieving low standard deviations (e.g., 0.3321 in the Branin function at high noise levels) across noisy response surface benchmarks. The integration of constraint-handling mechanisms guaranteed that practicable solutions were achieved without sacrificing optimality. The chaotic ROA is established as a robust and adaptable solution for complex, noisy, and constrained optimization challenges in industrial scheduling, resource allocation, and engineering design by the proposed approach.</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2025-09-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/17798</dc:identifier>
	<dc:identifier>10.30598/barekengvol19iss4pp2777-2790</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 19 No 4 (2025): BAREKENG: Journal of Mathematics and Its Application; 2777-2790</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol19iss4year2025</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/17798/11173</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2025 Pongchanun Luangpaiboon, Danupun Visuwan, Atiwat Nanphang, Lakkana Ruekkasaem, Pasura Aungkulanon</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>