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.

We investigated at the optical properties, structural makeup, and morphology of thin films of cadmium telluride (CdTe) with a thickness of 150 nm produced by thermal evaporation over glass. The X-ray diffraction study showed that the films had a crystalline composition, a cubic structure, and a preference for grain formation along the (111) crystallographic direction. The outcomes of the inquiry were used to determine these traits. With the use of thin films of CdTe that were doped with Ag at a concentration of 0.5%, the crystallization orientations of pure CdTe (23.58, 39.02, and 46.22) and CdTe:Ag were both determined by X-ray diffraction. orientations (23.72, 39.21, 46.40) For samples that were pure and those that were doped with

In this study, the optimum conditions for COD removal from petroleum refinery wastewater by using a combined electrocoagulation- electro-oxidation system were attained by Taguchi method. An orthogonal array experimental design (L18) which is of four controllable parameters including NaCl concentration, C.D. (current density), PH, and time (time of electrolysis) was employed. Chemical oxygen demand (COD) removal percentage was considered as the quality characteristics to be enhanced. Also, the value of turbidity and TDS (total dissolved solid) were estimated. The optimum levels of the studied parameters were determined precisely by implementing S/N analysis and analysis of variance (ANOVA). The optimum conditions were found to be NaCl = 2.5

The linear segment with parabolic blend (LSPB) trajectory deviates from the specified waypoints. It is restricted to that the acceleration must be sufficiently high. In this work, it is proposed to engage modified LSPB trajectory with particle swarm optimization (PSO) so as to create through points on the trajectory. The assumption of normal LSPB method that parabolic part is centered in time around waypoints is replaced by proposed coefficients for calculating the time duration of the linear part. These coefficients are functions of velocities between through points. The velocities are obtained by PSO so as to force the LSPB trajectory passing exactly through the specified path points. Also, relations for velocity correction and exact v

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