In this paper Volterra Runge-Kutta methods which include: method of order two and four will be applied to general nonlinear Volterra integral equations of the second kind. Moreover we study the convergent of the algorithms of Volterra Runge-Kutta methods. Finally, programs for each method are written in MATLAB language and a comparison between the two types has been made depending on the least square errors.
The work in this paper focuses on solving numerically and analytically a nonlinear social epidemic model that represents an initial value problem of ordinary differential equations. A recent moking habit model from Spain is applied and studied here. The accuracy and convergence of the numerical and approximation results are investigated for various methods; for example, Adomian decomposition, variation iteration, Finite difference and Runge-Kutta. The discussion of the present results has been tabulated and graphed. Finally, the comparison between the analytic and numerical solutions from the period 2006-2009 has been obtained by absolute and difference measure error.
In this paper, we consider a new approach to solve type of partial differential equation by using coupled Laplace transformation with decomposition method to find the exact solution for non–linear non–homogenous equation with initial conditions. The reliability for suggested approach illustrated by solving model equations such as second order linear and nonlinear Klein–Gordon equation. The application results show the efficiency and ability for suggested approach.
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 research article, an Iterative Decomposition Method is applied to approximate linear and non-linear fractional delay differential equation. The method was used to express the solution of a Fractional delay differential equation in the form of a convergent series of infinite terms which can be effortlessly computable.
The method requires neither discretization nor linearization. Solutions obtained for some test problems using the proposed method were compared with those obtained from some methods and the exact solutions. The outcomes showed the proposed approach is more efficient and correct.
Simulated annealing (SA) has been an effective means that can address difficulties related to optimization problems. is now a common discipline for research with several productive applications such as production planning. Due to the fact that aggregate production planning (APP) is one of the most considerable problems in production planning, in this paper, we present multi-objective linear programming model for APP and optimized by . During the course of optimizing for the APP problem, it uncovered that the capability of was inadequate and its performance was substandard, particularly for a sizable controlled problem with many decision variables and plenty of constraints. Since this algorithm works sequentially then the current state wi
... Show MoreThe 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 environm
... Show MoreIn this paper, new approach based on coupled Laplace transformation with decomposition method is proposed to solve type of partial differential equation. Then it’s used to find the accurate solution for heat equation with initial conditions. Four examples introduced to illustrate the accuracy, efficiency of suggested method. The practical results show the importance of suggested method for solve differential equations with high accuracy and easy implemented.
This paper deals with a new Henstock-Kurzweil integral in Banach Space with Bilinear triple n-tuple and integrator function Ψ which depends on multiple points in partition. Finally, exhibit standard results of Generalized Henstock - Kurzweil integral in the theory of integration.
In This paper generalized spline method and Caputo differential operator is applied to solve linear fractional integro-differential equations of the second kind. Comparison of the applied method with exact solutions reveals that the method is tremendously effective.