Preferred Language
Articles
/
lOYBCZ8BmraWrQ4dgWmC
Using gravitational search algorithm for solving optimization problems based on hypervolume indicator
...Show More Authors

Extended utilization of adaptive algorithms, Evaluative Algorithms (EAs), to address these issues offers a way to handle massive multi-objective optimization, even if the algorithmic method for handling combinations of objectives (CO) has been accessible for quite some time. Combining the idea of superiority with the Hypervolume (HV) tag approach, the GSA algorithm utilizes various target effects to explain several algorithms depending on the Hypervolume (HV) spacing. The Multi-objective Gravitational Search Algorithm with Hypervolume (MOGSA/HV). Since rapid convergence could result from GSA foundation work, Hypervolume rewrites the multi-objective problem (MOP) as a sequence of Tchebycheff solutions, improving it. Since the one in charge has already decided to utilize this method (Tchebycheff) as a benchmark, solving all of the (MOGSA/HV) problems simultaneously is a formidable challenge. In leader group construction, non-dominant groups are significant in containing less dense areas, avoiding nearby regions, and producing a more diversified and compact Pareto Frontier. This outcome was produced using nine conventional nonlinear functions. It might seem that MOGSA/HV outperforms Multi-objective Evolving Algorithm under Density Indicator (MOEAD), Non-Sorting Genetic Algorithm Two (NSGAII), Multi-Particle Swarm Optimization under Distance Indicator (MPSOD), and Spacing Evolving Algorithm Two (SPEA2). The results we obtained showed the efficiency of the new algorithm compared to other algorithms, which was based on its convergence to the optimal solution based on the (HV). Every single end product was created using MATLAB

Scopus Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Mon Jan 01 2024
Journal Name
International Journal Of Research In Science And Technology
Encryption of Medical Image Based on Cascaded Design of AES Block Algorithm and Chaotic Map
...Show More Authors

Security concerns in the transfer of medical images have drawn a lot of attention to the topic of medical picture encryption as of late. Furthermore, recent events have brought attention to the fact that medical photographs are constantly being produced and circulated online, necessitating safeguards against their inappropriate use. To improve the design of the AES algorithm standard for medical picture encryption, this research presents several new criteria. It was created so that needs for higher levels of safety and higher levels of performance could be met. First, the pixels in the image are diffused to randomly mix them up and disperse them all over the screen. Rather than using rounds, the suggested technique utilizes a cascad

... Show More
View Publication
Crossref
Publication Date
Sun Jan 01 2017
Journal Name
International Journal Of Advanced Computer Science And Applications
Fast Hybrid String Matching Algorithm based on the Quick-Skip and Tuned Boyer-Moore Algorithms
...Show More Authors

View Publication
Crossref
Publication Date
Sat Oct 01 2016
Journal Name
2016 6th International Conference On Information Communication And Management (icicm)
Enhancing case-based reasoning retrieval using classification based on associations
...Show More Authors

View Publication
Scopus (4)
Crossref (2)
Scopus Crossref
Publication Date
Sun Mar 01 2026
Journal Name
Journal Of Engineering
Bi-objective Machine Scheduling Using Enhanced Simulated Annealing and Bee Algorithm Approaches
...Show More Authors

Many industrial systems involve multiple criteria and objectives, and they are very complex problems in computational science, such as task scheduling. We propose bi-criteria and bi-objective scheduling problems, which are solved by two nature-inspired evolutionary algorithms, such as Simulated Annealing (SA) and Bee Algorithm (BA). This problem is characterized by scheduling a batch of tasks on multiple machines, and it is fundamental because the solution should focus on the simultaneous optimization of two conflicting objectives: the makespan minimization and the total tardiness minimization. This problem is NP-Hard, and therefore, two evolutionary methods were used to search for solutions intelligently in this huge, very complex

... Show More
View Publication
Scopus Crossref
Publication Date
Sun Dec 04 2011
Journal Name
Baghdad Science Journal
Use of cefoxitin as indicator for detection of Methicillin Resistant Staphylococcus aureus
...Show More Authors

Rapid and accurate identification of Methicillin Resistant Staphylococcus aureus is essential in limiting the spread of this bacterium. The aim of study is the detection of Methicillin Resistant Staphylococcus aureus (MRSA) and determining their susceptibility to some antimicrobial agent. A total of fifty clinical Staphylococcus aureus, isolated from the nose of health work staff in surgery unit of Kalar general hospital and from ear of patients attended to the same hospital. The susceptibilities of isolates were determined by the disc diffusion method with oxacillin (1 ?g) and cefoxitin (30 ?g), and by the mannitol salt agar supplemented with cefoxitin (MSA-CFOX), susceptibilities of isolates to other antimicrobial agent were determined b

... Show More
View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Sun Jul 03 2016
Journal Name
Journal Of Educational And Psychological Researches
The exploratory and Confirmatory Factorial structure for Riso-Hadson enneagram test indicator
...Show More Authors

This  investigation was conducted to recognize the structure for (RHETI version 2.5  1999) by using exploratory and confirmatory factor analysis. Sample of (620) student of Al-Mustansrya University were administered the (RHETI).

The data of their responses was analyzed by using (PAF) and oblique rotating .

The findings explored (9) factors as one factor for each type and (184) items were loaded by the factors: (60) item for feeling center, (61) items for instinctive center and (63) items for thinking center.

Results of confirmatory factorial analysis supported a model designed by the researcher depended upon a theoretical views of Riso and Hudson

... Show More
View Publication Preview PDF
Publication Date
Sun Mar 04 2018
Journal Name
Baghdad Science Journal
An Approximate Solution of some Variational Problems Using Boubaker Polynomials
...Show More Authors

In this paper, an approximate solution of nonlinear two points boundary variational problem is presented. Boubaker polynomials have been utilized to reduce these problems into quadratic programming problem. The convergence of this polynomial has been verified; also different numerical examples were given to show the applicability and validity of this method.

View Publication Preview PDF
Scopus (4)
Scopus Clarivate Crossref
Publication Date
Sun Aug 01 2021
Journal Name
Telkomnika (telecommunication Computing Electronics And Control)
Online 3D path planning for Tri-copter drone using GWO-IBA algorithm
...Show More Authors

View Publication
Scopus (4)
Crossref (3)
Scopus Crossref
Publication Date
Mon Dec 31 2012
Journal Name
Al-khwarizmi Engineering Journal
Genetic Algorithm Based PID Controller Design for a Precise Tracking of Two-Axis Piezoelectric Micropositioning Stage
...Show More Authors

 In this paper, an intelligent tracking control system of both single- and double-axis Piezoelectric Micropositioner stage is designed using Genetic Algorithms (GAs) method for the optimal Proportional-Integral-Derivative (PID) controller tuning parameters. The (GA)-based PID control design approach is a methodology to tune a (PID) controller in an optimal control sense with respect to specified objective function. By using the (GA)-based PID control approach, the high-performance trajectory tracking responses of the Piezoelectric Micropositioner stage can be obtained. The (GA) code was built and the simulation results were obtained using MATLAB environment. The Piezoelectric Micropositioner simulation model with th

... Show More
View Publication Preview PDF
Publication Date
Sun Apr 01 2018
Journal Name
Journal Of Economics And Administrative Sciences
Solving a three dimensional transportation problem using linear programming
...Show More Authors

Transport is a problem and one of the most important mathematical methods that help in making the right decision for the transfer of goods from sources of supply to demand centers and the lowest possible costs, In this research, the mathematical model of the three-dimensional transport problem in which the transport of goods is not homogeneous was constructed. The simplex programming method was used to solve the problem of transporting the three food products (rice, oil, paste) from warehouses to the student areas in Baghdad, This model proved its efficiency in reducing the total transport costs of the three products. After the model was solved in (Winqsb) program, the results showed that the total cost of transportation is (269,

... Show More
View Publication Preview PDF
Crossref