Feyza Altunbey Özbay¹, Erdal Özbay², Farhad Soleimanian Gharehchopogh^3,*

CMES-Computer Modeling in Engineering & Sciences, Vol.141, No.2, pp. 1067-1110, 2024, DOI:10.32604/cmes.2024.054334 - 27 September 2024

Abstract Artificial rabbits optimization (ARO) is a recently proposed biology-based optimization algorithm inspired by the detour foraging and random hiding behavior of rabbits in nature. However, for solving optimization problems, the ARO algorithm shows slow convergence speed and can fall into local minima. To overcome these drawbacks, this paper proposes chaotic opposition-based learning ARO (COARO), an improved version of the ARO algorithm that incorporates opposition-based learning (OBL) and chaotic local search (CLS) techniques. By adding OBL to ARO, the convergence speed of the algorithm increases and it explores the search space better. Chaotic maps in CLS… More > Graphic Abstract

Basma Mohamed^1,*, Linda Mohaisen², Mohammed Amin¹

Intelligent Automation & Soft Computing, Vol.38, No.1, pp. 19-34, 2023, DOI:10.32604/iasc.2023.031947 - 26 January 2024

Abstract In this paper, we consider the NP-hard problem of finding the minimum dominant resolving set of graphs. A vertex set B of a connected graph G resolves G if every vertex of G is uniquely identified by its vector of distances to the vertices in B. A resolving set is dominating if every vertex of G that does not belong to B is a neighbor to some vertices in B. The dominant metric dimension of G is the cardinality number of the minimum dominant resolving set. The dominant metric dimension is computed by a binary version of the Archimedes optimization… More >

Basma Mohamed^1,*, Linda Mohaisen², Mohamed Amin¹

Intelligent Automation & Soft Computing, Vol.36, No.2, pp. 2349-2361, 2023, DOI:10.32604/iasc.2023.032930 - 05 January 2023

Abstract In this paper, we consider the NP-hard problem of finding the minimum connected resolving set of graphs. A vertex set B of a connected graph G resolves G if every vertex of G is uniquely identified by its vector of distances to the vertices in B. A resolving set B of G is connected if the subgraph induced by B is a nontrivial connected subgraph of G. The cardinality of the minimal resolving set is the metric dimension of G and the cardinality of minimum connected resolving set is the connected metric dimension of G. The problem is solved heuristically by… More >

R. Manjula Devi¹, M. Premkumar², Pradeep Jangir³, B. Santhosh Kumar⁴, Dalal Alrowaili⁵, Kottakkaran Sooppy Nisar^6,*

CMC-Computers, Materials & Continua, Vol.70, No.1, pp. 557-579, 2022, DOI:10.32604/cmc.2022.019611 - 07 September 2021

Abstract In machine learning and data mining, feature selection (FS) is a traditional and complicated optimization problem. Since the run time increases exponentially, FS is treated as an NP-hard problem. The researcher’s effort to build a new FS solution was inspired by the ongoing need for an efficient FS framework and the success rates of swarming outcomes in different optimization scenarios. This paper presents two binary variants of a Hunger Games Search Optimization (HGSO) algorithm based on V- and S-shaped transfer functions within a wrapper FS model for choosing the best features from a large dataset.… More >