Preferred Language
Articles
/
jih-3195
Solving Quadratic Assignment Problem by Using Meta-heuristic Search Method
...Show More Authors

While analytical solutions to Quadratic Assignment Problems (QAP) have indeed been since a long time, the expanding use of Evolutionary Algorithms (EAs) for similar issues gives a framework for dealing with QAP with an extraordinarily broad scope. The study's key contribution is that it normalizes all of the criteria into a single scale, regardless of their measurement systems or the requirements of minimum or maximum, relieving the researchers of the exhaustively quantifying the quality criteria. A tabu search algorithm for quadratic assignment problems (TSQAP) is proposed, which combines the limitations of tabu search with a discrete assignment problem. The effectiveness of the proposed technique has been compared to well-established alternatives, and its operating principle is illustrated with a numerical example.

After repeating the solution of each issue (8) once and recording the algorithm results, it showed its agreement, once from a total (375) repetition of the experiment while the number of times the Artificial Bee Colony (ABC) arrived (2) as for the Firefly (FA) Algorithm giving (117), also Genetic (GA) and Particle Swarm (PSO) gives (120) and the Tabu Search algorithm (174). The proposed technique (TSQAP) is shown to yield a superior solution with low computing complexity. MATLAB was used to generate all of the findings (R2020b).

Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Wed Dec 23 2020
Journal Name
Iraqi Journal For Electrical And Electronic Engineering
Heuristic and Meta-Heuristic Optimization Models for Task Scheduling in Cloud-Fog Systems: A Review
...Show More Authors

Nowadays, cloud computing has attracted the attention of large companies due to its high potential, flexibility, and profitability in providing multi-sources of hardware and software to serve the connected users. Given the scale of modern data centers and the dynamic nature of their resource provisioning, we need effective scheduling techniques to manage these resources while satisfying both the cloud providers and cloud users goals. Task scheduling in cloud computing is considered as NP-hard problem which cannot be easily solved by classical optimization methods. Thus, both heuristic and meta-heuristic techniques have been utilized to provide optimal or near-optimal solutions within an acceptable time frame for such problems. In th

... Show More
View Publication
Crossref (6)
Crossref
Publication Date
Thu Oct 20 2022
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Solving of the Quadratic Fractional Programming Problems by a Modified Symmetric Fuzzy Approach
...Show More Authors

The aims of the paper are to present a modified symmetric fuzzy approach to find the best workable compromise solution for quadratic fractional programming problems (QFPP) with fuzzy crisp in both the objective functions and the constraints. We introduced a modified symmetric fuzzy by proposing a procedure, that starts first by converting the quadratic fractional programming problems that exist in the objective functions to crisp numbers and then converts the linear function that exists in the constraints to crisp numbers. After that, we applied the fuzzy approach to determine the optimal solution for our quadratic fractional programming problem which is supported theoretically and practically. The computer application for the algo

... Show More
View Publication Preview PDF
Crossref (2)
Crossref
Publication Date
Tue Jan 02 2018
Journal Name
Arab Journal Of Basic And Applied Sciences
Daftardar-Jafari method for solving nonlinear thin film flow problem
...Show More Authors

View Publication
Crossref (15)
Crossref
Publication Date
Sun Jun 07 2015
Journal Name
Baghdad Science Journal
Direct method for Solving Nonlinear Variational Problems by Using Hermite Wavelets
...Show More Authors

In this work, we first construct Hermite wavelets on the interval [0,1) with it’s product, Operational matrix of integration 2^k M×2^k M is derived, and used it for solving nonlinear Variational problems with reduced it to a system of algebric equations and aid of direct method. Finally, some examples are given to illustrate the efficiency and performance of presented method.

View Publication Preview PDF
Crossref
Publication Date
Mon Jan 01 2024
Journal Name
Fusion: Practice And Applications
A Hybrid Meta-Heuristic Approach for Test Case Prioritization and Optimization
...Show More Authors

The application of the test case prioritization method is a key part of system testing intended to think it through and sort out the issues early in the development stage. Traditional prioritization techniques frequently fail to take into account the complexities of big-scale test suites, growing systems and time constraints, therefore cannot fully fix this problem. The proposed study here will deal with a meta-heuristic hybrid method that focuses on addressing the challenges of the modern time. The strategy utilizes genetic algorithms alongside a black hole as a means to create a smooth tradeoff between exploring numerous possibilities and exploiting the best one. The proposed hybrid algorithm of genetic black hole (HGBH) uses the

... Show More
View Publication
Scopus (1)
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
Sun Dec 06 2015
Journal Name
Baghdad Science Journal
Solving Two-Points Singular Boundary Value Problem Using Hermite Interpolation
...Show More Authors

In this paper, we have been used the Hermite interpolation method to solve second order regular boundary value problems for singular ordinary differential equations. The suggest method applied after divided the domain into many subdomains then used Hermite interpolation on each subdomain, the solution of the equation is equal to summation of the solution in each subdomain. Finally, we gave many examples to illustrate the suggested method and its efficiency.

View Publication Preview PDF
Crossref
Publication Date
Fri Dec 01 2023
Journal Name
Baghdad Science Journal
Solving the Hotdog Problem by Using the Joint Zero-order Finite Hankel - Elzaki Transform
...Show More Authors

This paper is concerned with combining two different transforms to present a new joint transform FHET and its inverse transform IFHET. Also, the most important property of FHET was concluded and proved, which is called the finite Hankel – Elzaki transforms of the Bessel differential operator property, this property was discussed for two different boundary conditions, Dirichlet and Robin. Where the importance of this property is shown by solving axisymmetric partial differential equations and transitioning to an algebraic equation directly. Also, the joint Finite Hankel-Elzaki transform method was applied in solving a mathematical-physical problem, which is the Hotdog Problem. A steady state which does not depend on time was discussed f

... Show More
View Publication Preview PDF
Scopus Crossref
Publication Date
Fri Jan 01 2016
Journal Name
Journal Of Computer And Communications
Parallel Quick Search Algorithm for the Exact String Matching Problem Using OpenMP
...Show More Authors

String matching is seen as one of the essential problems in computer science. A variety of computer applications provide the string matching service for their end users. The remarkable boost in the number of data that is created and kept by modern computational devices influences researchers to obtain even more powerful methods for coping with this problem. In this research, the Quick Search string matching algorithm are adopted to be implemented under the multi-core environment using OpenMP directive which can be employed to reduce the overall execution time of the program. English text, Proteins and DNA data types are utilized to examine the effect of parallelization and implementation of Quick Search string matching algorithm on multi-co

... Show More
View Publication Preview PDF
Crossref (3)
Crossref
Publication Date
Fri Jan 01 2016
Journal Name
Journal Of Computer And Communications
Pathfinding in Strategy Games and Maze Solving Using A* Search Algorithm
...Show More Authors

View Publication
Crossref (13)
Crossref