Preferred Language
Articles
/
jih-2378
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.

Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Tue Jan 30 2024
Journal Name
Iraqi Journal Of Science
Parallel Particle Swarm Optimization Algorithm for Identifying Complex Communities in Biological Networks
...Show More Authors

    Identification of complex communities in biological networks is a critical and ongoing challenge since lots of network-related problems correspond to the subgraph isomorphism problem known in the literature as NP-hard. Several optimization algorithms have been dedicated and applied to solve this problem. The main challenge regarding the application of optimization algorithms, specifically to handle large-scale complex networks, is their relatively long execution time. Thus, this paper proposes a parallel extension of the PSO algorithm to detect communities in complex biological networks. The main contribution of this study is summarized in three- fold; Firstly, a modified PSO algorithm with a local search operator is proposed

... Show More
View Publication Preview PDF
Scopus (3)
Crossref (1)
Scopus Crossref
Publication Date
Thu Jan 20 2022
Journal Name
Webology
Red Monkey Optimization and Genetic Algorithm to Solving Berth Allocation Problems
...Show More Authors

In the past two decades, maritime transport traffic has increased, especially in the case of container flow. The BAP (Berth Allocation Problem) (BAP) is a main problem to optimize the port terminals. The current manuscript explains the DBAP problems in a typical arrangement that varies from the conventional separate design station, where each berth can simultaneously accommodate several ships when their entire length is less or equal to length. Be a pier, serve. This problem was then solved by crossing the Red Colobuses Monkey Optimization (RCM) with the Genetic Algorithm (GA). In conclusion, the comparison and the computational experiments are approached to demonstrate the effectiveness of the proposed method contrasted with other

... Show More
View Publication Preview PDF
Crossref (1)
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
Mon Apr 30 2018
Journal Name
Journal Of Theoretical And Applied Information Technology
An efficient artificial fish swarm algorithm with harmony search for scheduling in flexible job-shop problem
...Show More Authors

Flexible job-shop scheduling problem (FJSP) is one of the instances in flexible manufacturing systems. It is considered as a very complex to control. Hence generating a control system for this problem domain is difficult. FJSP inherits the job-shop scheduling problem characteristics. It has an additional decision level to the sequencing one which allows the operations to be processed on any machine among a set of available machines at a facility. In this article, we present Artificial Fish Swarm Algorithm with Harmony Search for solving the flexible job shop scheduling problem. It is based on the new harmony improvised from results obtained by artificial fish swarm algorithm. This improvised solution is sent to comparison to an overall best

... Show More
View Publication Preview PDF
Scopus (3)
Scopus
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
Publication Date
Sat Oct 28 2023
Journal Name
Baghdad Science Journal
Diversity Operators-based Artificial Fish Swarm Algorithm to Solve Flexible Job Shop Scheduling Problem
...Show More Authors

Artificial fish swarm algorithm (AFSA) is one of the critical swarm intelligent algorithms. In this
paper, the authors decide to enhance AFSA via diversity operators (AFSA-DO). The diversity operators will
be producing more diverse solutions for AFSA to obtain reasonable resolutions. AFSA-DO has been used to
solve flexible job shop scheduling problems (FJSSP). However, the FJSSP is a significant problem in the
domain of optimization and operation research. Several research papers dealt with methods of solving this
issue, including forms of intelligence of the swarms. In this paper, a set of FJSSP target samples are tested
employing the improved algorithm to confirm its effectiveness and evaluate its ex

... Show More
View Publication Preview PDF
Scopus (3)
Crossref (1)
Scopus 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
Mon Jun 10 2024
Journal Name
Iraqi Journal For Computer Science And Mathematics
Solving tri-criteria: total completion time, total late work, and maximum earliness by using exact, and heuristic methods on single machine scheduling problem
...Show More Authors

The presented study investigated the scheduling regarding  jobs on a single machine. Each  job will be processed with no interruptions and becomes available for the processing at time 0. The aim is finding a processing order with regard to jobs, minimizing total completion time , total late work , and maximal tardiness  which is an NP-hard problem. In the theoretical part of the present work, the mathematical formula for the examined problem will be presented, and a sub-problem of the original problem of minimizing the multi-objective functions  is introduced. Also, then the importance regarding the dominance rule (DR) that could be applied to the problem to improve good solutions will be shown. While in the practical part, two

... Show More
View Publication
Scopus Crossref
Publication Date
Sun Aug 01 2021
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Novel Heuristic Approach for Solving Multi-objective Scheduling Problems
...Show More Authors

    In this paper, we studied the scheduling of  jobs on a single machine.  Each of n jobs is to be processed without interruption and becomes available for processing at time zero. The objective is to find a processing order of the jobs, minimizing the sum of maximum earliness and maximum tardiness. This problem is to minimize the earliness and tardiness values, so this model is equivalent to the just-in-time production system. Our lower bound depended on the decomposition of the problem into two subprograms. We presented a novel heuristic approach to find a near-optimal solution for the problem. This approach depends on finding efficient solutions for two problems. The first problem is minimizing total completi

... Show More
View Publication Preview PDF
Crossref
Publication Date
Sat Jul 08 2017
Journal Name
Neural Computing And Applications
A new algorithm of modified binary particle swarm optimization based on the Gustafson-Kessel for credit risk assessment
...Show More Authors

View Publication
Scopus (30)
Crossref (28)
Scopus Clarivate Crossref