Preferred Language
Articles
/
ijs-5280
The Best Efficient Solutions for Multi-Criteria Travelling Salesman Problem Using Local Search Methods
...Show More Authors

     In this research, we propose to use two local search methods (LSM's); Particle Swarm Optimization (PSO) and the Bees Algorithm (BA) to solve Multi-Criteria Travelling Salesman Problem (MCTSP) to obtain the best efficient solutions. The generating process of the population of the proposed LSM's may be randomly obtained or by adding some initial solutions obtained from some efficient heuristic methods. The obtained solutions of the PSO and BA are compared with the solutions of the exact methods (complete enumeration and branch and bound methods) and some heuristic methods. The results proved the efficiency of PSO and BA methods for a large number of nodes ( ). The proposed LSM's give the best efficient solutions for the MCTSP for  jobs in a reasonable time.

Scopus Crossref
View Publication Preview PDF
Quick Preview PDF
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
Mon Aug 26 2019
Journal Name
Iraqi Journal Of Science
Finding Best Clustering For Big Networks with Minimum Objective Function by Using Probabilistic Tabu Search
...Show More Authors

     Fuzzy C-means (FCM) is a clustering method used for collecting similar data elements within the group according to specific measurements. Tabu is a heuristic algorithm. In this paper, Probabilistic Tabu Search for FCM implemented to find a global clustering based on the minimum value of the Fuzzy objective function. The experiments designed for different networks, and cluster’s number the results show the best performance based on the comparison that is done between the values of the objective function in the case of using standard FCM and Tabu-FCM, for the average of ten runs.

View Publication Preview PDF
Scopus (1)
Crossref (1)
Scopus Crossref
Publication Date
Sat Jun 01 2019
Journal Name
Journal Of Economics And Administrative Sciences
Using Some Robust Methods For Handling the Problem of Multicollinearity
...Show More Authors

The multiple linear regression model is an important regression model that has attracted many researchers in different fields including applied mathematics, business, medicine, and social sciences , Linear regression models involving a large number of independent variables are poorly performing due to large variation and lead to inaccurate conclusions , One of the most important problems in the regression analysis is the multicollinearity Problem, which is considered one of the most important problems that has become known to many researchers  , As well as their effects on the multiple linear regression model, In addition to multicollinearity, the problem of outliers in data is one of the difficulties in constructing the reg

... Show More
View Publication Preview PDF
Crossref
Publication Date
Sun May 17 2020
Journal Name
Iraqi Journal Of Science
Numerical Solutions for the Optimal Control Governing by Variable Coefficients Nonlinear Hyperbolic Boundary Value Problem Using the Gradient Projection, Gradient and Frank Wolfe Methods
...Show More Authors

This paper is concerned with studying the numerical solution for the discrete classical optimal control problem (NSDCOCP) governed by a variable coefficients nonlinear hyperbolic boundary value problem (VCNLHBVP). The DSCOCP is solved by using the Galerkin finite element method (GFEM) for the space variable and implicit finite difference scheme (GFEM-IFDS) for the time variable to get the NS for the discrete weak form (DWF) and for the discrete adjoint weak form (DSAWF) While, the gradient projection method (GRPM), also called the gradient method (GRM), or the Frank Wolfe method (FRM) are used to minimize the discrete cost function (DCF) to find the DSCOC. Within these three methods, the Armijo step option (ARMSO) or the optimal step opt

... Show More
View Publication Preview PDF
Scopus Crossref
Publication Date
Fri Oct 20 2023
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
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 a

... Show More
View Publication Preview PDF
Crossref
Publication Date
Sat Feb 27 2021
Journal Name
Iraqi Journal Of Science
Efficient Iterative Methods for Solving the SIR Epidemic Model
...Show More Authors

In this article, the numerical and approximate solutions for the nonlinear differential equation systems, represented by the epidemic SIR model, are determined. The effective iterative methods, namely the Daftardar-Jafari method (DJM), Temimi-Ansari method (TAM), and the Banach contraction method (BCM), are used to obtain the approximate solutions. The results showed many advantages over other iterative methods, such as Adomian decomposition method (ADM) and the variation iteration method (VIM) which were applied to the non-linear terms of the Adomian polynomial and the Lagrange multiplier, respectively. Furthermore, numerical solutions were obtained by using the fourth-orde Runge-Kutta (RK4), where the maximum remaining errors showed th

... Show More
View Publication Preview PDF
Scopus (9)
Crossref (3)
Scopus Crossref
Publication Date
Sun Jul 04 2021
Journal Name
Journal Of Interdisciplinary Mathematics
Comparison the solutions for some kinds of differential equations using iterative methods
...Show More Authors

This manuscript presents several applications for solving special kinds of ordinary and partial differential equations using iteration methods such as Adomian decomposition method (ADM), Variation iterative method (VIM) and Taylor series method. These methods can be applied as well as to solve nonperturbed problems and 3rd order parabolic PDEs with variable coefficient. Moreover, we compare the results using ADM, VIM and Taylor series method. These methods are a commination of the two initial conditions.

Scopus (8)
Scopus
Publication Date
Wed Jun 01 2022
Journal Name
Baghdad Science Journal
Advanced GIS-based Multi-Function Support System for Identifying the Best Route
...Show More Authors

Geographic Information Systems (GIS) are obtaining a significant role in handling strategic applications in which data are organized as records of multiple layers in a database. Furthermore, GIS provide multi-functions like data collection, analysis, and presentation. Geographic information systems have assured their competence in diverse fields of study via handling various problems for numerous applications. However, handling a large volume of data in the GIS remains an important issue. The biggest obstacle is designing a spatial decision-making framework focused on GIS that manages a broad range of specific data to achieve the right performance. It is very useful to support decision-makers by providing GIS-based decision support syste

... Show More
View Publication Preview PDF
Scopus (4)
Crossref (2)
Scopus Clarivate Crossref
Publication Date
Mon Jan 01 2007
Journal Name
Iraqi Journal Of Science
Adaptive methods for matching problem
...Show More Authors

In this paper, we deal with the problem of general matching of two images one of them has experienced geometrical transformations, to find the correspondence between two images. We develop the invariant moments for traditional techniques (moments of inertia) with new approach to enhance the performance for these methods. We test various projections directional moments, to extract the difference between Block Distance Moment (BDM) and evaluate their reliability. Three adaptive strategies are shown for projections directional moments, that are raster (vertical and horizontal) projection, Fan-Bean projection and new projection procedure that is the square projection method. Our paper started with the description of a new algorithm that is low

... Show More
Publication Date
Sat Oct 20 2018
Journal Name
Journal Of Economics And Administrative Sciences
Solve the problem of assignment by using multi-Objective programming
...Show More Authors

he assignment model represents a mathematical model that aims at expressing an important problem facing enterprises and companies in the public and private sectors, which are characterized by ensuring their activities, in order to take the appropriate decision to get the best allocation of tasks for machines or jobs or workers on the machines that he owns in order to increase profits or reduce costs and time As this model is called multi-objective assignment because it takes into account the factors of time and cost together and hence we have two goals for the assignment problem, so it is not possible to solve by the usual methods and has been resorted to the use of multiple programming The objectives were to solve the problem of

... Show More
View Publication Preview PDF
Crossref