Preferred Language
Articles
/
ijs-3215
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 environment is a directed graph, called the search space, produced for the efficient search of valid n-queens’ placement, in a way that they do not cause harm to one another. This paper also presents the development of an intelligent heuristic function which is helpful to find the solution with high speed and effectiveness. This study includes a detailed discussion of the problem background, problem complexity, Meerkat Clan Algorithm, and comparisons of the problem solution with the Practical Swarm Optimization (PSO) and Genetic Algorithm (GA. It is an entirely review-based work which implemented the suggested designs and architectures of the methods and a fair amount of experimental results.

Scopus Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Mon Mar 06 2023
Journal Name
Arts
Solving chemical problems among students of the College of Education for Pure Sciences, Ibn al-Haytham
...Show More Authors

Preview PDF
Publication Date
Sun Sep 01 2019
Journal Name
Gazi University Journal Of Science
Reliable Iterative Methods for Solving Convective Straight and Radial Fins with Temperature-Dependent Thermal Conductivity Problems
...Show More Authors

In our article, three iterative methods are performed to solve the nonlinear differential equations that represent the straight and radial fins affected by thermal conductivity. The iterative methods are the Daftardar-Jafari method namely (DJM), Temimi-Ansari method namely (TAM) and Banach contraction method namely (BCM) to get the approximate solutions. For comparison purposes, the numerical solutions were further achieved by using the fourth Runge-Kutta (RK4) method, Euler method and previous analytical methods that available in the literature. Moreover, the convergence of the proposed methods was discussed and proved. In addition, the maximum error remainder values are also evaluated which indicates that the propo

... Show More
View Publication
Crossref (5)
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
Wed Feb 22 2023
Journal Name
Iraqi Journal Of Science
On Solving Singular Multi Point Boundary Value Problems with Nonlocal Condition
...Show More Authors

In this paper Hermite interpolation method is used for solving linear and non-linear second order singular multi point boundary value problems with nonlocal condition. The approximate solution is found in the form of a rapidly convergent polynomial. We discuss behavior of the solution in the neighborhood of the singularity point which appears to perform satisfactorily for singular problems. The examples to demonstrate the applicability and efficiency of the method have been given.

View Publication Preview PDF
Publication Date
Tue Oct 20 2020
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Solving Nonlinear Second Order Delay Eigenvalue Problems by Least Square Method
...Show More Authors

     The aim of this paper is to study the nonlinear delay second order eigenvalue problems which consists of delay ordinary differential equations, in fact one of the expansion methods that is called the least square method which will be developed to solve this kind of problems.

View Publication Preview PDF
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 24 2021
Journal Name
Proceedings Of Sixth International Congress On Information And Communication Technology
Minimizing Costs of Transportation Problems Using the Genetic Algorithm
...Show More Authors

View Publication
Scopus (7)
Crossref (5)
Scopus Crossref
Publication Date
Wed Sep 12 2018
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Solving Capacitated Vehicle Routing Problem (CVRP) Using Tabu Search Algorithm (TSA)
...Show More Authors

This paper investigates the capacitated vehicle routing problem (CVRP) as it is one of the numerous issues that have no impeccable solutions yet. Numerous scientists in the recent couple of decades have set up various explores and utilized numerous strategies with various methods to deal with it. However, for all researches, finding the least cost is exceptionally complicated. In any case, they have figured out how to think of rough solutions that vary in efficiencies relying upon the search space. Furthermore, tabu search (TS) is utilized to resolve this issue as it is fit for solving numerous complicated issues. The algorithm has been adjusted to resolve the exploration issue, where its methodology is not quite the same as the normal a

... Show More
View Publication Preview PDF
Crossref (3)
Crossref
Publication Date
Thu Apr 20 2023
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
A Novel Algorithm to Find the Best Solution for Pentagonal Fuzzy Numbers with Linear Programming Problems
...Show More Authors

    Fuzzy numbers are used in various fields such as fuzzy process methods, decision control theory, problems involving decision making, and systematic reasoning. Fuzzy systems, including fuzzy set theory. In this paper, pentagonal fuzzy variables (PFV) are used to formulate linear programming problems (LPP). Here, we will concentrate on an approach to addressing these issues that uses the simplex technique (SM). Linear programming problems (LPP) and linear programming problems (LPP) with pentagonal fuzzy numbers (PFN) are the two basic categories into which we divide these issues. The focus of this paper is to find the optimal solution (OS) for LPP with PFN on the objective function (OF) and right-hand side. New ranking f

... Show More
View Publication Preview PDF
Crossref
Publication Date
Tue Feb 28 2023
Journal Name
Iraqi Journal Of Science
Solving Linear and Nonlinear Fractional Differential Equations Using Bees Algorithm
...Show More Authors

A numerical algorithm for solving linear and non-linear fractional differential equations is proposed based on the Bees algorithm and Chebyshev polynomials. The proposed algorithm was applied to a set of numerical examples. Faster results are obtained compared to the wavelet methods.

View Publication Preview PDF
Scopus Crossref