In this paper, we apply a new technique combined by a Sumudu transform and iterative method called the Sumudu iterative method for resolving non-linear partial differential equations to compute analytic solutions. The aim of this paper is to construct the efficacious frequent relation to resolve these problems. The suggested technique is tested on four problems. So the results of this study are debated to show how useful this method is in terms of being a powerful, accurate and fast tool with a little effort compared to other iterative methods.

In this paper, cubic trigonometric spline is used to solve nonlinear Volterra integral equations of second kind. Examples are illustrated to show the presented method’s efficiency and convenience.

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.

     The method of operational matrices is based on the Bernoulli and Shifted Legendre polynomials which is used to solve the Falkner-Skan equation. The nonlinear differential equation converting to a system of nonlinear equations is solved using Mathematica^®12, and the approximate solutions are obtained. The efficiency of these methods was studied by calculating the maximum error remainder ( ), and it was found that their efficiency increases as  increases. Moreover, the obtained approximate solutions are compared with the numerical solution obtained by the fourth-order Runge-Kutta method (RK4), which gives  a good agreement.

Metaheuristic is one of the most well-known fields of research used to find optimum solutions for non-deterministic polynomial hard (NP-hard) problems, for which it is difficult to find an optimal solution in a polynomial time. This paper introduces the metaheuristic-based algorithms and their classifications and non-deterministic polynomial hard problems. It also compares the performance of two metaheuristic-based algorithms (Elephant Herding Optimization algorithm and Tabu Search) to solve the Traveling Salesman Problem (TSP), which is one of the most known non-deterministic polynomial hard problems and widely used in the performance evaluations for different metaheuristics-based optimization algorithms. The experimental results of Ele

    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

In the present article, we implement the new iterative method proposed by Daftardar-Gejji and Jafari (NIM) [V. Daftardar-Gejji, H. Jafari, An iterative method for solving nonlinear functional equations, J. Math. Anal. Appl. 316 (2006) 753-763] to solve two problems; the first one is the problem of spread of a non-fatal disease in a population which is assumed to have constant size over the period of the epidemic, and the other one is the problem of the prey and predator. The results demonstrate that the method has many merits such as being derivative-free, overcome the difficulty arising in calculating Adomian polynomials to handle the nonlinear terms in Adomian Decomposition Method (ADM), does not require to calculate Lagrange multiplier a