Yazar "Eguchi, Kei" seçeneğine göre listele

Listeleniyor 1 - 2 / 2
  • Küçük Resim Yok
    Öğe
    Blue-eared Hedgehog Optimization (BEHO): A Nature-inspired Metaheuristic for Robust and Efficient Global Optimization
    (Intelligent Network and Systems Society, 2025) Dinler, Özlem Batur; Bektemyssova, Gulnara; Ahmed, Mahmood Anees; Ibraheem, Ibraheem Kasim; Smerat, Aseel; Montazeri, Zeinab; Eguchi, Kei
    A novel metaheuristic algorithm named the Blue-Eared Hedgehog Optimization (BEHO), inspired by the unique foraging and defensive behaviour of the blue-eared hedgehog is introduced in this study. Unlike conventional optimization methods, BEHO simulates the species’ natural strategies-nocturnal cautious exploration, gradual environmental mapping, and protective retreat-into computational operators that effectively balance exploration and exploitation. The algorithm initializes a diverse population of candidate solutions, simulates hedgehog-inspired gradual movements for exploration, and employs defensive-inspired refinement for exploitation, ensuring robust convergence and preservation of high-quality solutions. BEHO’s performance has been rigorously evaluated on 23 standard benchmark functions, including unimodal, high-dimensional multimodal, and fixed-dimensional multimodal problems, and compared with nine state-of-the-art metaheuristics, including MOA, WaOA, AOA, GWO, LSA, SWO, TLBO, BaOA, and WSO. Experimental results demonstrate that BEHO consistently achieves superior accuracy, stability, and convergence speed across all function categories. Its hedgehog-inspired mechanisms allow the algorithm to escape local optima, maintain population diversity, and achieve precise global solutions in complex and high-dimensional landscapes. The findings highlight BEHO as a highly effective and versatile optimization tool, providing a biologically grounded and computationally efficient framework for solving diverse complex problems. © This article is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License. License details: https://creativecommons.org/licenses/by-sa/4.0/
  • Küçük Resim Yok
    Öğe
    Carpenter Optimization Algorithm: A Human-inspired Metaheuristic for Robust and Efficient Constrained Optimization
    (Intelligent Network and Systems Society, 2025) Dinler, Özlem Batur; Bektemyssova, Gulnara; Şahin, Canan Batur; Montazeri, Zeinab; Dehghani, Mohammad; Smerat, Aseel; Eguchi, Kei
    This paper introduces the Carpenter Optimization Algorithm (COA), a novel human-inspired metaheuristic designed to efficiently solve complex, high-dimensional, and constrained optimization problems. COA draws direct inspiration from the systematic behaviors of skilled carpenters, who initially perform broad cuts to explore raw materials and subsequently execute precise refinements to achieve high-quality outcomes. These behaviors are mathematically mapped into exploration and exploitation phases, where stochastic global modifications mimic broad exploratory actions, and targeted incremental adjustments refine promising solutions. Unlike traditional metaheuristics, COA achieves a robust balance between exploration and exploitation while requiring minimal control parameters, enhancing both adaptability and computational efficiency. The algorithm was rigorously evaluated on 22 constrained benchmark functions from the CEC 2011 suite and compared against nine well-established metaheuristics. The results demonstrate that COA consistently outperforms all competitors in terms of solution quality, convergence speed, stability, and robustness, achieving the best mean, median, and best values across all test problems. Statistical analyses, including standard deviation, rank-based evaluation, and pairwise Wilcoxon tests, confirm the significance and reproducibility of these results, while boxplot visualizations highlight controlled variability and narrow interquartile ranges, even for large-scale and multimodal problems. The findings suggest that COA’s behaviorally grounded design provides a practical and explainable framework for real-world optimization tasks. Future research directions include extending COA to multi-objective, dynamic, and large-scale industrial problems, integrating hybrid strategies or adaptive mechanisms, and conducting theoretical analyses of convergence and parameter sensitivity. Overall, COA represents a promising addition to the metaheuristic optimization landscape, offering both conceptual clarity and high practical performance. This article is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License. License details: https://creativecommons.org/licenses/by-sa/4.0/