Preferred Language
Articles
/
9RalVooBVTCNdQwCN5v5
Community Detection in Modular Complex Networks Using an Improved Particle Swarm Optimization Algorithm
...Show More Authors

     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 local improvement operator to effectively discover community structure in the modular complex networks when employing the modularity density metric as a single-objective function. The framework of the proposed algorithm consists of three main steps: an initialization strategy, a movement strategy based on perturbation genetic operators, and an improvement operator. The key idea behind the improvement operator is to determine and reassign the complex network nodes that are located in the wrong communities if the majority of their topological links do not belong to their current communities, making it appear that these nodes belong to another community. The performance of the proposed algorithm has been tested and evaluated when applied to publicly-available modular complex networks generated using a flexible and simple benchmark generator. The experimental results showed the effectiveness of the suggested method in discovering community structure over modular networks of different complexities and sizes.

Scopus Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Sun Mar 01 2020
Journal Name
Computer Networks
An improved multi-objective evolutionary algorithm for detecting communities in complex networks with graphlet measure
...Show More Authors

View Publication
Scopus (7)
Crossref (4)
Scopus Clarivate Crossref
Publication Date
Wed Jun 01 2022
Journal Name
Baghdad Science Journal
WOAIP: Wireless Optimization Algorithm for Indoor Placement Based on Binary Particle Swarm Optimization (BPSO)
...Show More Authors

Optimizing the Access Point (AP) deployment has a great role in wireless applications due to the need for providing an efficient communication with low deployment costs. Quality of Service (QoS), is a major significant parameter and objective to be considered along with AP placement as well the overall deployment cost. This study proposes and investigates a multi-level optimization algorithm called Wireless Optimization Algorithm for Indoor Placement (WOAIP) based on Binary Particle Swarm Optimization (BPSO). WOAIP aims to obtain the optimum AP multi-floor placement with effective coverage that makes it more capable of supporting QoS and cost-effectiveness. Five pairs (coverage, AP deployment) of weights, signal thresholds and received s

... Show More
View Publication Preview PDF
Scopus (5)
Crossref (4)
Scopus Clarivate Crossref
Publication Date
Fri Apr 30 2021
Journal Name
International Journal Of Intelligent Engineering And Systems
SMS Spam Detection Based on Fuzzy Rules and Binary Particle Swarm Optimization
...Show More Authors

View Publication
Scopus (8)
Crossref (2)
Scopus Crossref
Publication Date
Thu Aug 31 2017
Journal Name
Journal Of Engineering
Enhanced Performance of Consensus Wireless Sensor Controlled System via Particle Swarm Optimization Algorithm
...Show More Authors

     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

... Show More
View Publication Preview PDF
Publication Date
Fri Nov 01 2019
Journal Name
Civil Engineering Journal
Time-Cost-Quality Trade-off Model for Optimal Pile Type Selection Using Discrete Particle Swarm Optimization Algorithm
...Show More Authors

The cost of pile foundations is part of the super structure cost, and it became necessary to reduce this cost by studying the pile types then decision-making in the selection of the optimal pile type in terms of cost and time of production and quality .So The main objective of this study is to solve the time–cost–quality trade-off (TCQT) problem by finding an optimal pile type with the target of "minimizing" cost and time while "maximizing" quality. There are many types In the world of piles but  in this paper, the researcher proposed five pile types, one of them is not a traditional, and   developed a model for the problem and then employed particle swarm optimization (PSO) algorithm, as one of evolutionary algorithms with t

... Show More
Scopus (9)
Crossref (8)
Scopus Clarivate Crossref
Publication Date
Wed Oct 28 2015
Journal Name
Journal Of Mathematics And System Science
Simulating Particle Swarm Optimization Algorithm to Estimate Likelihood Function of ARMA(1, 1) Model
...Show More Authors

Crossref
Publication Date
Thu Nov 02 2023
Journal Name
Journal Of Engineering
An Improved Adaptive Spiral Dynamic Algorithm for Global Optimization
...Show More Authors

This paper proposes a new strategy to enhance the performance and accuracy of the Spiral dynamic algorithm (SDA) for use in solving real-world problems by hybridizing the SDA with the Bacterial Foraging optimization algorithm (BFA). The dynamic step size of SDA makes it a useful exploitation approach. However, it has limited exploration throughout the diversification phase, which results in getting trapped at local optima. The optimal initialization position for the SDA algorithm has been determined with the help of the chemotactic strategy of the BFA optimization algorithm, which has been utilized to improve the exploration approach of the SDA. The proposed Hybrid Adaptive Spiral Dynamic Bacterial Foraging (HASDBF)

... Show More
View Publication Preview PDF
Crossref
Publication Date
Mon Jan 20 2020
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Genetic Algorithm and Particle Swarm Optimization Techniques for Solving Multi-Objectives on Single Machine Scheduling Problem
...Show More Authors

In this paper, two of the local search algorithms are used (genetic algorithm and particle swarm optimization), in scheduling number of products (n jobs) on a single machine to minimize a multi-objective function which is denoted as  (total completion time, total tardiness, total earliness and the total late work). A branch and bound (BAB) method is used for comparing the results for (n) jobs starting from (5-18). The results show that the two algorithms have found the optimal and near optimal solutions in an appropriate times.

View Publication Preview PDF
Crossref
Publication Date
Mon Oct 31 2022
Journal Name
International Journal Of Intelligent Engineering And Systems
Robot Path Planning in Unknown Environments with Multi-Objectives Using an Improved COOT Optimization Algorithm
...Show More Authors

Scopus (8)
Crossref (2)
Scopus Crossref
Publication Date
Mon Jan 09 2023
Journal Name
2023 15th International Conference On Developments In Esystems Engineering (dese)
Inverse Kinematics Optimization for Humanoid Robotic Legs Based on Particle Swarm Optimization
...Show More Authors

Calculating the Inverse Kinematic (IK) equations is a complex problem due to the nonlinearity of these equations. Choosing the end effector orientation affects the reach of the target location. The Forward Kinematics (FK) of Humanoid Robotic Legs (HRL) is determined by using DenavitHartenberg (DH) method. The HRL has two legs with five Degrees of Freedom (DoF) each. The paper proposes using a Particle Swarm Optimization (PSO) algorithm to optimize the best orientation angle of the end effector of HRL. The selected orientation angle is used to solve the IK equations to reach the target location with minimum error. The performance of the proposed method is measured by six scenarios with different simulated positions of the legs. The proposed

... Show More
View Publication
Scopus (2)
Crossref (2)
Scopus Crossref