Preferred Language
Articles
/
jih-221
Minimizing the Total Completion Times, the Total Tardiness and the Maximum Tardiness
...Show More Authors

In this paper, the main work is to minimize a function of three cost criteria for scheduling n jobs on a single machine. We proposed algorithms to solve the single machine scheduling multiobjective problem. In this problem, we consider minimizing the total completion times, total tardiness and maximum tardiness criteria. First a branch and bound (BAB) algorithm is applied for the 1//∑Ci+∑Ti+Tmax problem. Second we compare two multiobjective algorithms one of them based on (BAB) algorithm to find the set of efficient (non dominated) solutions for the 1//(∑Ci ,∑Ti ,Tmax) problem. The computational results show that the algorithm based on (BAB) algorithm is better than the other one for generated the total number of non dominated solutions. 

View Publication Preview PDF
Quick Preview PDF
Publication Date
Wed Feb 01 2023
Journal Name
Baghdad Science Journal
3-D Packing in Container using Teaching Learning Based Optimization Algorithm
...Show More Authors

The paper aims to propose Teaching Learning based Optimization (TLBO) algorithm to solve 3-D packing problem in containers. The objective which can be presented in a mathematical model is optimizing the space usage in a container. Besides the interaction effect between students and teacher, this algorithm also observes the learning process between students in the classroom which does not need any control parameters. Thus, TLBO provides the teachers phase and students phase as its main updating process to find the best solution. More precisely, to validate the algorithm effectiveness, it was implemented in three sample cases. There was small data which had 5 size-types of items with 12 units, medium data which had 10 size-types of items w

... Show More
View Publication Preview PDF
Scopus Clarivate Crossref
Publication Date
Mon Dec 18 2017
Journal Name
Al-khwarizmi Engineering Journal
Path Planning of an Autonomous Mobile Robot using Enhanced Bacterial Foraging Optimization Algorithm
...Show More Authors

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

... Show More
View Publication Preview PDF
Crossref (13)
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
Thu May 18 2023
Journal Name
Journal Of Engineering
A Modified Strength Pareto Evolutionary Algorithm 2 based Environmental /Economic Power Dispatch
...Show More Authors

A Strength Pareto Evolutionary Algorithm 2 (SPEA 2) approach for solving the multi-objective Environmental / Economic Power Dispatch (EEPD) problem is presented in this paper. In the past fuel cost consumption minimization was the aim (a single objective function) of economic power dispatch problem. Since the clean air act amendments have been applied to reduce SO2 and NOX emissions from power plants, the utilities change their strategies in order to reduce pollution and atmospheric emission as well, adding emission minimization as other objective function made economic power dispatch (EPD) a multi-objective problem having conflicting objectives. SPEA2 is the improved version of SPEA with better fitness assignment, density estimation, an

... Show More
View Publication Preview PDF
Crossref
Publication Date
Sun Jan 14 2018
Journal Name
Journal Of Engineering
A Nonlinear MIMO-PID Neural Controller Design for Vehicle Lateral Dynamics model based on Modified Elman Neural Network
...Show More Authors

This paper presents a new design of a nonlinear multi-input multi-output PID neural controller of the active brake steering force and the active front steering angle for a 2-DOF vehicle model based on modified Elman recurrent neural. The goal of this work is to achieve the stability and to improve the vehicle dynamic’s performance through achieving the desired yaw rate and reducing the lateral velocity of the vehicle in a minimum time period for preventing the vehicle from slipping out the road curvature by using two active control actions: the front steering angle and the brake steering force. Bacterial forging optimization algorithm is used to adjust the parameters weights of the proposed controller. Simulation resul

... Show More
View Publication Preview PDF
Publication Date
Fri May 31 2019
Journal Name
Journal Of Engineering
A Comparative Study of Various Intelligent Algorithms based Path Planning for Mobile Robots
...Show More Authors

In general, path-planning problem is one of most important task in the field of robotics. This paper describes the path-planning problem of mobile robot based on various metaheuristic algorithms. The suitable collision free path of a robot must satisfies certain optimization criteria such as feasibility, minimum path length, safety and smoothness and so on. In this research, various three approaches namely, PSO, Firefly and proposed hybrid FFCPSO are applied in static, known environment to solve the global path-planning problem in three cases. The first case used single mobile robot, the second case used three independent mobile robots and the third case applied three follow up mobile robot.  Simulation results, whi

... Show More
View Publication Preview PDF
Crossref (4)
Crossref
Publication Date
Sat Jan 30 2021
Journal Name
Iraqi Journal Of Science
Using Non-dominated Sorting Particle Swarm Optimization Algorithm II for Bi-objective Flow Shop Scheduling Problems
...Show More Authors

A hybrid particulate swarm optimization (hybrid) combination of an optimization algorithm of the particle swarm and a variable neighborhood search algorithm is proposed for the multi-objective permutation flow shop scheduling problem (PFSP) with the smallest cumulative completion time and the smallest total flow time. Algorithm for hybrid particulate swarm optimization (HPSO) is applied to maintain a fair combination of centralized search with decentralized search. The Nawaz-Enscore-Ham )NEH) heuristic algorithm in this hybrid algorithm is used to initialize populations in order to improve the efficiency of the initial solution. The method design is based on ascending order (ranked-order-value, ROV), applying the continuous PSO algorithm

... Show More
View Publication Preview PDF
Scopus (7)
Crossref (3)
Scopus Crossref
Publication Date
Fri Sep 30 2022
Journal Name
Iraqi Journal Of Science
Distributed Multi-Ant Colony System Algorithm using Raspberry Pi Cluster for Travelling Salesman Problem
...Show More Authors

     The traveling salesman problem is addressed in this paper by introducing a distributed multi-ant colony algorithm that is implemented on a Raspberry Pi cluster. The implementation of a master and eight workers, each running on Raspberry Pi nodes, is the central component of this novel technique. Each worker is responsible for managing their own colony of ants, while the master coordinates communications among workers’ nodes and assesses the most optimal approach. To put the newly built cluster through its paces, several datasets of traveling salesman problem are used to test the created cluster. The findings of the experiment indicate that a single board computer cluster, which makes use of multi-ant colony algorithm, is a via

... Show More
View Publication Preview PDF
Scopus (2)
Crossref (2)
Scopus Crossref
Publication Date
Thu Oct 01 2020
Journal Name
Journal Of Engineering
Financing Cost Optimization in Construction Sector: A Review
...Show More Authors

The main aim of this research is to introduce financing cost optimization and different financing alternatives. There are many studies about financing cost optimization. All previous studies considering the cost of financing have many shortcomings, some considered only one source of financing as a credit line without taking into account different financing alternatives. Having only one funding alternative powers, restricts contractors and leads to a very specific financing model. Although it is beneficial for the contractor to use a long-term loan to minimize interest charges and prevent a substantial withdrawal from his credit line, none of the existing financial-based planning models have considered long-term loans in

... Show More
View Publication Preview PDF
Crossref
Publication Date
Sat Sep 30 2023
Journal Name
Iraqi Journal Of Science
A New Efficient Hybrid Approach for Machine Learning-Based Firefly Optimization
...Show More Authors

     Optimization is the task of minimizing or maximizing an objective function f(x) parameterized by x. A series of effective numerical optimization methods have become popular for improving the performance and efficiency of other methods characterized by high-quality solutions and high convergence speed. In recent years, there are a lot of interest in hybrid metaheuristics, where more than one method is ideally combined into one new method that has the ability to solve many problems rapidly and efficiently. The basic concept of the proposed method is based on the addition of the acceleration part of the Gravity Search Algorithm (GSA) model in the Firefly Algorithm (FA) model and creating new individuals. Some stan

... Show More
View Publication Preview PDF
Scopus (2)
Crossref (1)
Scopus Crossref