Crow Search Algorithm (CSA) can be defined as one of the new swarm intelligence algorithms that has been developed lately, simulating the behavior of a crow in a storage place and the retrieval of the additional food when required. In the theory of the optimization, a crow represents a searcher, the surrounding environment represents the search space, and the random storage of food location represents a feasible solution. Amongst all the food locations, the one where the maximum amount of the food is stored is considered as the global optimum solution, and objective function represents the food amount. Through the simulation of crows’ intelligent behavior, the CSA attempts to find the optimum solutions to a variety of the problems that are related to the optimization. This study presents a new adaptive distributed algorithm of routing on CSA. Because the search space may be modified according to the size and kind of the network, the algorithm can be easily customized to the issue space. In contrast to population-based algorithms that have a broad and time-consuming search space. For ten networks of various sizes, the technique was used to solve the shortest path issue. And its capability for solving the problem of the routing in the switched networks is examined: detecting the shortest path in the process of a data packet transfer amongst the networks. The suggested method was compared with four common metaheuristic algorithms (which are: ACO, AHA, PSO and GA) on 10 datasets (integer, weighted, and not negative graphs) with a variety of the node sizes (10 - 297 nodes). The results have proven that the efficiency of the suggested methods is promising as well as competing with other approaches.
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 MoreIn 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 MoreBecause the Coronavirus epidemic spread in Iraq, the COVID-19 epidemic of people quarantined due to infection is our application in this work. The numerical simulation methods used in this research are more suitable than other analytical and numerical methods because they solve random systems. Since the Covid-19 epidemic system has random variables coefficients, these methods are used. Suitable numerical simulation methods have been applied to solve the COVID-19 epidemic model in Iraq. The analytical results of the Variation iteration method (VIM) are executed to compare the results. One numerical method which is the Finite difference method (FD) has been used to solve the Coronavirus model and for comparison purposes. The numerical simulat
... Show MoreThe Korteweg-de Vries equation plays an important role in fluid physics and applied mathematics. This equation is a fundamental within study of shallow water waves. Since these equations arise in many applications and physical phenomena, it is officially showed that this equation has solitary waves as solutions, The Korteweg-de Vries equation is utilized to characterize a long waves travelling in channels. The goal of this paper is to construct the new effective frequent relation to resolve these problems where the semi analytic iterative technique presents new enforcement to solve Korteweg-de Vries equations. The distinctive feature of this method is, it can be utilized to get approximate solution
... Show MoreThis paper derives the EDITRK4 technique, which is an exponentially fitted diagonally implicit RK method for solving ODEs . This approach is intended to integrate exactly initial value problems (IVPs), their solutions consist of linear combinations of the group functions and for exponentially fitting problems, with being the problem’s major frequency utilized to improve the precision of the method. The modified method EDITRK4 is a new three-stage fourth-order exponentially-fitted diagonally implicit approach for solving IVPs with functions that are exponential as solutions. Different forms of -order ODEs must be derived using the modified system, and when the same issue is reduced to a framework of equations that can be sol
... Show MoreThe aim of this article is to study the solution of Elliptic Euler-Poisson-Darboux equation, by using the symmetry of Lie Algebra of orders two and three, as a contribution in partial differential equations and their solutions.
Many numerical approaches have been suggested to solve nonlinear problems. In this paper, we suggest a new two-step iterative method for solving nonlinear equations. This iterative method has cubic convergence. Several numerical examples to illustrate the efficiency of this method by Comparison with other similar methods is given.
In this article, a new efficient approach is presented to solve a type of partial differential equations, such (2+1)-dimensional differential equations non-linear, and nonhomogeneous. The procedure of the new approach is suggested to solve important types of differential equations and get accurate analytic solutions i.e., exact solutions. The effectiveness of the suggested approach based on its properties compared with other approaches has been used to solve this type of differential equations such as the Adomain decomposition method, homotopy perturbation method, homotopy analysis method, and variation iteration method. The advantage of the present method has been illustrated by some examples.