Preferred Language
Articles
/
EubTn54BmraWrQ4djmTv
Optimization of Particle Swarms for Travelling Salesman Problem
...Show More Authors

The Traveling Salesman Problem is a story application of Atom Swarm Optimizations in this research. We have developed several novel techniques intended for solving TSP with PSO. Additionally, we introduced the notions to Swap Operative and Swap Chronological sequence and redefining the remaining operatives their foundation; that way, the study created unique PSO. Research prove it can produce satisfactory outcomes. The aim of this paper be there to assess the functioning of particle swarm optimization, for the going salesman issue TSP. The solution to this trouble is common to be NP-hard, it has N! permutations. The study's goal is to examine the capacity of both algorithms to solve intercontinental and other benchmark problems. Overall, the results suggest that used algorithms know how to understand good quality explanations than PSO algorithm, but they are not good enough in terms of normal generation

Scopus Crossref
View Publication
Publication Date
Sat May 01 2021
Journal Name
Journal Of Physics: Conference Series
A Parallel Adaptive Genetic Algorithm for Job Shop Scheduling Problem
...Show More Authors

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
Thu Jun 01 2023
Journal Name
Baghdad Science Journal
Effective Computational Methods for Solving the Jeffery-Hamel Flow Problem
...Show More Authors

In this paper, the effective computational method (ECM) based on the standard monomial polynomial has been implemented to solve the nonlinear Jeffery-Hamel flow problem. Moreover, novel effective computational methods have been developed and suggested in this study by suitable base functions, namely Chebyshev, Bernstein, Legendre, and Hermite polynomials. The utilization of the base functions converts the nonlinear problem to a nonlinear algebraic system of equations, which is then resolved using the Mathematica®12 program. The development of effective computational methods (D-ECM) has been applied to solve the nonlinear Jeffery-Hamel flow problem, then a comparison between the methods has been shown. Furthermore, the maximum

... Show More
View Publication Preview PDF
Scopus (6)
Crossref (2)
Scopus Crossref
Publication Date
Thu Jun 01 2023
Journal Name
Baghdad Science Journal
Effective Computational Methods for Solving the Jeffery-Hamel Flow Problem
...Show More Authors

في هذا البحث، تم تنفيذ الطريقة الحسابية الفعالة (ECM) المستندة إلى متعددة الحدود القياسية الأحادية لحل مشكلة تدفق جيفري-هامل غير الخطية. علاوة على ذلك، تم تطوير واقتراح الطرق الحسابية الفعالة الجديدة في هذه الدراسة من خلال وظائف أساسية مناسبة وهي متعددات الحدود تشيبشيف، بيرنشتاين، ليجندر، هيرمت. يؤدي استخدام الدوال الأساسية إلى تحويل المسألة غير الخطية إلى نظام جبري غير خطي من المعادلات، والذي يتم حله بع

... Show More
View Publication
Scopus (6)
Crossref (2)
Scopus Clarivate Crossref
Publication Date
Fri Apr 30 2021
Journal Name
Iraqi Journal Of Science
A Genetic Algorithm for Task Allocation Problem in the Internet of Things
...Show More Authors

In the last few years, the Internet of Things (IoT) is gaining remarkable attention in both academic and industrial worlds. The main goal of the IoT is laying on describing everyday objects with different capabilities in an interconnected fashion to the Internet to share resources and to carry out the assigned tasks. Most of the IoT objects are heterogeneous in terms of the amount of energy, processing ability, memory storage, etc. However, one of the most important challenges facing the IoT networks is the energy-efficient task allocation. An efficient task allocation protocol in the IoT network should ensure the fair and efficient distribution of resources for all objects to collaborate dynamically with limited energy. The canonic

... Show More
Scopus (4)
Crossref (5)
Scopus Crossref
Publication Date
Mon Jun 01 2020
Journal Name
Iop Conference Series: Materials Science And Engineering
Common Fixed Point problem for Classes of Nonlinear Maps in Hilbert Space
...Show More Authors
Abstract<p>in this article, we present a definition of k-generalized map independent of non-expansive map and give infinite families of non-expansive and k-generalized maps new iterative algorithms. Such algorithms are also studied in the Hilbert spaces as the potential to exist for asymptotic common fixed point.</p>
View Publication
Scopus (6)
Crossref (1)
Scopus Crossref
Publication Date
Fri Apr 28 2023
Journal Name
Mathematical Modelling Of Engineering Problems
Design Optimal Neural Network for Solving Unsteady State Confined Aquifer Problem
...Show More Authors

View Publication Preview PDF
Scopus (8)
Crossref (4)
Scopus Crossref
Publication Date
Sat Dec 01 2012
Journal Name
Iraqi Journal Of Physics
The transition rates for 232Th using the two component particle-hole state density with different corrections
...Show More Authors

The particle-hole state densities have been calculated for 232Th in
the case of incident neutron with  ,  1 Z Z T T T T and   2 Z T T .
The finite well depth, surface effect, isospin and Pauli correction are
considered in the calculation of the state densities and then the
transition rates. The isospin correction function ( ) iso f has been
examined for different exciton configurations and at different
excitation energies up to 100 MeV. The present results are indicated
that the included corrections have more affected on transition rates
behavior for        , , and    above 30MeV excitation energy

View Publication Preview PDF
Publication Date
Sun Oct 29 2023
Journal Name
Journal Of Al-qadisiyah For Computer Science And Mathematics
Optimization Techniques for Human Multi-Biometric Recognition System
...Show More Authors

Researchers are increasingly using multimodal biometrics to strengthen the security of biometric applications. In this study, a strong multimodal human identification model was developed to address the growing problem of spoofing attacks in biometric security systems. Through the use of metaheuristic optimization methods, such as the Genetic Algorithm(GA), Ant Colony Optimization(ACO), and Particle Swarm Optimization (PSO) for feature selection, this unique model incorporates three biometric modalities: face, iris, and fingerprint. Image pre-processing, feature extraction, critical image feature selection, and multibiometric recognition are the four main steps in the workflow of the system. To determine its performance, the model wa

... Show More
View Publication
Crossref
Publication Date
Thu Jun 16 2022
Journal Name
Periodicals Of Engineering And Natural Sciences (pen)
Optimization algorithms for transportation problems with stochastic demand
...Show More Authors

The purpose of this paper is to solve the stochastic demand for the unbalanced transport problem using heuristic algorithms to obtain the optimum solution, by minimizing the costs of transporting the gasoline product for the Oil Products Distribution Company of the Iraqi Ministry of Oil. The most important conclusions that were reached are the results prove the possibility of solving the random transportation problem when the demand is uncertain by the stochastic programming model. The most obvious finding to emerge from this work is that the genetic algorithm was able to address the problems of unbalanced transport, And the possibility of applying the model approved by the oil products distribution company in the Iraqi Ministry of Oil to m

... Show More
View Publication
Scopus (15)
Crossref (7)
Scopus Crossref