Community detection is an important and interesting topic for better understanding and analyzing complex network structures. Detecting hidden partitions in complex networks is proven to be an NP-hard problem that may not be accurately resolved using traditional methods. So it is solved using evolutionary computation methods and modeled in the literature as an optimization problem.  In recent years, many researchers have directed their research efforts toward addressing the problem of community structure detection by developing different algorithms and making use of single-objective optimization methods. In this study, we have continued that research line by improving the Particle Swarm Optimization (PSO) algorithm using a

     This paper describes the application of consensus optimization for Wireless Sensor Network (WSN) system. Consensus algorithm is usually conducted within a certain number of iterations for a given graph topology. Nevertheless, the best Number of Iterations (NOI) to reach consensus is varied in accordance with any change in number of nodes or other parameters of . graph topology. As a result, a time consuming trial and error procedure will necessary be applied
to obtain best NOI. The implementation of an intellig ent optimization can effectively help to get the optimal NOI. The performance of the consensus algorithm has considerably been improved by the inclusion of Particle Swarm Optimization (PSO). As a case s

This paper presents an improved technique on Ant Colony Optimization (ACO) algorithm. The procedure is applied on Single Machine with Infinite Bus (SMIB) system with power system stabilizer (PSS) at three different loading regimes. The simulations are made by using MATLAB software. The results show that by using Improved Ant Colony Optimization (IACO) the system will give better performance with less number of iterations as it compared with a previous modification on ACO. In addition, the probability of selecting the arc depends on the best ant performance and the evaporation rate.

Abstract

Much attention has been paid for the use of robot arm in various applications. Therefore, the optimal path finding has a significant role to upgrade and guide the arm movement. The essential function of path planning is to create a path that satisfies the aims of motion including, averting obstacles collision, reducing time interval, decreasing the path traveling cost and satisfying the kinematics constraints. In this paper, the free Cartesian space map of 2-DOF arm is constructed to attain the joints variable at each point without collision. The D*algorithm and Euclidean distance are applied to obtain the exact and estimated distances to the goal respectively. The modified Particle Swarm Optimization al

This paper describes the problem of online autonomous mobile robot path planning, which is consisted of finding optimal paths or trajectories for an autonomous mobile robot from a starting point to a destination across a flat map of a terrain, represented by a 2-D workspace. An enhanced algorithm for solving the problem of path planning using Bacterial Foraging Optimization algorithm is presented. This nature-inspired metaheuristic algorithm, which imitates the foraging behavior of E-coli bacteria, was used to find the optimal path from a starting point to a target point. The proposed algorithm was demonstrated by simulations in both static and dynamic different environments. A comparative study was evaluated between the developed algori

Clean energy applications widely recognize Proton Exchange Membrane Fuel Cells (PEMFCs) for their high efficiency and environmental compatibility. Accurate parameter identification of PEMFC models is essential for enhancing system performance and reliability, particularly under dynamic operating conditions. This paper presents a novel optimization-based approach called Heterogeneous Comprehensive Learning-Bald Eagle Search (HCLBES) with enhanced exploration and exploitation capabilities for the effective modeling of PEMFC. The algorithm combines the exploration strength of the Bald Eagle Search with comprehensive learning and heterogeneity mechanisms to achieve a balanced global and local search space. In this algorithm, the number

Optical Mark Recognition (OMR) is the technology of electronically extracting intended data from marked fields, such as squareand bubbles fields, on printed forms. OMR technology is particularly useful for applications in which large numbers of hand-filled forms need to be processed quickly and with a great degree of accuracy. The technique is particularly popular with schools and universities for the reading in of multiple choice exam papers. This paper proposed OMRbased on Modify Multi-Connect Architecture (MMCA) associative memory, its work in two phases: training phase and recognition phase. The proposed method was also able to detect more than one or no selected choice. Among 800 test samples with 8 types of grid answer sheets and tota

In this research The study of Multi-level  model (partial pooling model) we consider The partial pooling model which is one Multi-level  models and one of  the Most important models and extensive use and application in the analysis of the data .This Model characterized by the fact that the treatments take hierarchical or structural Form, in this partial pooling models, Full Maximum likelihood FML was used to estimated parameters of partial pooling models (fixed and random ), comparison between the preference of these Models, The application was on the Suspended Dust data in Iraq, The data were for four and a half years .Eight stations were selected randomly  among the stations in Iraq. We use Akaik′s Informa