Preferred Language
Articles
/
bsj-5309
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 optimal timetable schedules with different copies by increasing the probability of giving the best schedule for each stage in the campus with the ability to replace the timetable when needed. The Evolutionary Algorithm (EA) utilized in this paper is the Genetic Algorithm (GA) which is a common multi-solution metaheuristic search based on the evolutionary population that can be applied to solve complex combinatorial problems like timetabling problems. In this work, all inputs: courses, teachers, and time acted by one array to achieve local search and combined this acting of the timetable by using the heuristic crossover to ensure that the essential conditions are not broken. The result of this work is a flexible scheduling system, which shows the diversity of all possible timetables that can be created depending on user conditions and needs.

Scopus Clarivate Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Sun Jun 20 2021
Journal Name
Baghdad Science Journal
Multifactor Algorithm for Test Case Selection and Ordering
...Show More Authors

Regression testing being expensive, requires optimization notion. Typically, the optimization of test cases results in selecting a reduced set or subset of test cases or prioritizing the test cases to detect potential faults at an earlier phase. Many former studies revealed the heuristic-dependent mechanism to attain optimality while reducing or prioritizing test cases. Nevertheless, those studies were deprived of systematic procedures to manage tied test cases issue. Moreover, evolutionary algorithms such as the genetic process often help in depleting test cases, together with a concurrent decrease in computational runtime. However, when examining the fault detection capacity along with other parameters, is required, the method falls sh

... Show More
View Publication Preview PDF
Scopus (4)
Crossref (2)
Scopus Clarivate Crossref
Publication Date
Mon Jan 01 2024
Journal Name
Ieee Access
An Evolutionary Algorithm With Heuristic Operator for Detecting Protein Complexes in Protein Interaction Networks With Negative Controls
...Show More Authors

View Publication
Scopus Clarivate Crossref
Publication Date
Thu May 30 2024
Journal Name
Iraqi Journal Of Science
An Evolutionary Algorithm for Improving the Quantity and Quality of the Detected Complexes from Protein Interaction Networks
...Show More Authors

One of the recent significant but challenging research studies in computational biology and bioinformatics is to unveil protein complexes from protein-protein interaction networks (PPINs). However, the development of a reliable algorithm to detect more complexes with high quality is still ongoing in many studies. The main contribution of this paper is to improve the effectiveness of the well-known modularity density ( ) model when used as a single objective optimization function in the framework of the canonical evolutionary algorithm (EA). To this end, the design of the EA is modified with a gene ontology-based mutation operator, where the aim is to make a positive collaboration between the modularity density model and the proposed

... Show More
View Publication
Scopus Crossref
Publication Date
Thu Jul 01 2021
Journal Name
Iraqi Journal Of Science
Meerkat Clan Algorithm for Solving N-Queen Problems
...Show More Authors

The swarm intelligence and evolutionary methods are commonly utilized by researchers in solving the difficult combinatorial and Non-Deterministic Polynomial (NP) problems. The N-Queen problem can be defined as a combinatorial problem that became intractable for the large ‘n’ values and, thereby, it is placed in the NP class of problems. In the present study, a solution is suggested for the N-Queen problem, on the basis of the Meerkat Clan Algorithm (MCA). The problem of n-Queen can be mainly defined as one of the generalized 8-Queen problem forms, for which the aim is placing 8 queens in a way that none of the queens has the ability of killing the others with the use of the standard moves of the chess queen. The Meerkat Clan environm

... Show More
View Publication Preview PDF
Scopus (2)
Scopus Crossref
Publication Date
Mon Apr 03 2023
Journal Name
International Journal Of Online And Biomedical Engineering (ijoe)
An Integrated Grasshopper Optimization Algorithm with Artificial Neural Network for Trusted Nodes Classification Problem
...Show More Authors

Wireless Body Area Network (WBAN) is a tool that improves real-time patient health observation in hospitals, asylums, especially at home. WBAN has grown popularity in recent years due to its critical role and vast range of medical applications. Due to the sensitive nature of the patient information being transmitted through the WBAN network, security is of paramount importance. To guarantee the safe movement of data between sensor nodes and various WBAN networks, a high level of security is required in a WBAN network. This research introduces a novel technique named Integrated Grasshopper Optimization Algorithm with Artificial Neural Network (IGO-ANN) for distinguishing between trusted nodes in WBAN networks by means of a classifica

... Show More
View Publication
Scopus Clarivate Crossref
Publication Date
Tue Sep 08 2020
Journal Name
Baghdad Science Journal
A Proposed Analytical Method for Solving Fuzzy Linear Initial Value Problems
...Show More Authors

     In this article, we aim to define a universal set consisting of the subscripts of the fuzzy differential equation (5) except the two elements  and , subsets of that universal set are defined according to certain conditions. Then, we use the constructed universal set with its subsets for suggesting an analytical method which facilitates solving fuzzy initial value problems of any order by using the strongly generalized H-differentiability. Also, valid sets with graphs for solutions of fuzzy initial value problems of higher orders are found.

View Publication Preview PDF
Scopus Clarivate Crossref
Publication Date
Mon Sep 23 2019
Journal Name
Baghdad Science Journal
New Approach for Solving Three Dimensional Space Partial Differential Equation
...Show More Authors

This paper presents a new transform method to solve partial differential equations, for finding suitable accurate solutions in a wider domain. It can be used to solve the problems without resorting to the frequency domain. The new transform is combined with the homotopy perturbation method in order to solve three dimensional second order partial differential equations with initial condition, and the convergence of the solution to the exact form is proved. The implementation of the suggested method demonstrates the usefulness in finding exact solutions. The practical implications show the effectiveness of approach and it is easily implemented in finding exact solutions.

       Finally, all algori

... Show More
View Publication Preview PDF
Scopus (21)
Crossref (10)
Scopus Clarivate Crossref
Publication Date
Sun Feb 25 2024
Journal Name
Baghdad Science Journal
Efficient Task Scheduling Approach in Edge-Cloud Continuum based on Flower Pollination and Improved Shuffled Frog Leaping Algorithm
...Show More Authors

The rise of edge-cloud continuum computing is a result of the growing significance of edge computing, which has become a complementary or substitute option for traditional cloud services. The convergence of networking and computers presents a notable challenge due to their distinct historical development. Task scheduling is a major challenge in the context of edge-cloud continuum computing. The selection of the execution location of tasks, is crucial in meeting the quality-of-service (QoS) requirements of applications. An efficient scheduling strategy for distributing workloads among virtual machines in the edge-cloud continuum data center is mandatory to ensure the fulfilment of QoS requirements for both customer and service provider. E

... Show More
View Publication Preview PDF
Scopus (1)
Scopus Crossref
Publication Date
Fri Apr 01 2011
Journal Name
Al-mustansiriyah Journal Of Science
A Genetic Algorithm Based Approach For Generating Unit Maintenance Scheduling
...Show More Authors

Publication Date
Sat Feb 26 2022
Journal Name
Iraqi Journal Of Science
New Class of Rank 1 Update for Solving Unconstrained Optimization Problem: New Class of Rank 1 Update for solving Unconstrained Optimization Problem
...Show More Authors

     The focus of this article is to add a new class of rank one of  modified Quasi-Newton techniques to solve the problem of unconstrained optimization by updating the inverse Hessian matrix with an update of rank 1, where a diagonal matrix is the first component of the next inverse Hessian approximation, The inverse Hessian matrix is  generated by the method proposed which is symmetric and it satisfies the condition of modified quasi-Newton, so the global convergence is retained. In addition, it is positive definite that  guarantees the existence of the minimizer at every iteration of the objective function. We use  the program MATLAB to solve an algorithm function to introduce the feasibility of

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