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
Fri Jul 01 2016
Journal Name
Journal Of Engineering
An Adaptive Multi-Objective Particle Swarm Optimization Algorithm for Multi-Robot Path Planning
...Show More Authors

This paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO) for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In ord

... Show More
View Publication Preview PDF
Publication Date
Wed Apr 25 2018
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Local Search Algorithms for Multi-criteria Single Machine Scheduling Problem
...Show More Authors

   Real life scheduling problems require the decision maker to consider a number of criteria before arriving at any decision. In this paper, we consider the multi-criteria scheduling problem of n jobs on single machine to minimize a function of five criteria denoted by total completion times (∑), total tardiness (∑), total earliness (∑), maximum tardiness () and maximum earliness (). The single machine total tardiness problem and total earliness problem are already NP-hard, so the considered problem is strongly NP-hard.

We apply two local search algorithms (LSAs) descent method (DM) and simulated annealing method (SM) for the 1// (∑∑∑

... Show More
View Publication Preview PDF
Crossref (2)
Crossref
Publication Date
Sat Jan 01 2011
Journal Name
Journal Of The College Of Basic Education
Solving Job-Shop Scheduling Problem Using Genetic Algorithm Approach
...Show More Authors

Publication Date
Sat Nov 30 2019
Journal Name
Journal Of Engineering And Applied Sciences
Using Particle Swarm Optimization Algorithm to Address the Multicollinearity Problem
...Show More Authors

View Publication
Scopus (2)
Scopus Crossref
Publication Date
Thu Jul 01 2021
Journal Name
Journal Of Physics: Conference Series
Wireless Optimization Algorithm for Multi-floor AP deployment using binary particle swarm optimization (BPSO)
...Show More Authors
Abstract<p>Optimizing the Access Point (AP) deployment is of great importance in wireless applications owing the requirement to provide efficient and cost-effective communication. Highly targeted by many researchers and academic industries, Quality of Service (QOS) is an important primary parameter and objective in mind along with AP placement and overall publishing cost. This study proposes and investigates a multi-level optimization algorithm based on Binary Particle Swarm Optimization (BPSO). It aims to an optimal multi-floor AP placement with effective coverage that makes it more capable of supporting QOS and cost effectiveness. Five pairs (coverage, AP placement) of weights, signal threshol</p> ... Show More
View Publication
Scopus Crossref
Publication Date
Fri Apr 01 2022
Journal Name
Baghdad Science Journal
An Evolutionary Algorithm for Solving Academic Courses Timetable Scheduling Problem
...Show More Authors

Scheduling Timetables for courses in the big departments in the universities is a very hard problem and is often be solved by many previous works although results are partially optimal. This work implements the principle of an evolutionary algorithm by using genetic theories to solve the timetabling problem to get a random and full optimal timetable with the ability to generate a multi-solution timetable for each stage in the collage. The major idea is to generate course timetables automatically while discovering the area of constraints to get an optimal and flexible schedule with no redundancy through the change of a viable course timetable. The main contribution in this work is indicated by increasing the flexibility of generating opti

... Show More
View Publication Preview PDF
Scopus (10)
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
Thu May 01 2008
Journal Name
2008 International Conference On Computer And Communication Engineering
A binary Particle Swarm Optimization for attacking knapsacks Cipher Algorithm
...Show More Authors

View Publication
Scopus (10)
Crossref (6)
Scopus Clarivate Crossref
Publication Date
Sat Sep 30 2017
Journal Name
Al-khwarizmi Engineering Journal
Robot Arm Path Planning Using Modified Particle Swarm Optimization based on D* algorithm
...Show More Authors

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

... Show More
View Publication Preview PDF
Crossref (8)
Crossref
Publication Date
Sat May 01 2021
Journal Name
Journal Of Physics: Conference Series
A Parallel Adaptive Genetic Algorithm for Job Shop Scheduling Problem
...Show More Authors