Association rules mining (ARM) is a fundamental and widely used data mining technique to achieve useful information about data. The traditional ARM algorithms are degrading computation efficiency by mining too many association rules which are not appropriate for a given user. Recent research in (ARM) is investigating the use of metaheuristic algorithms which are looking for only a subset of high-quality rules. In this paper, a modified discrete cuckoo search algorithm for association rules mining DCS-ARM is proposed for this purpose. The effectiveness of our algorithm is tested against a set of well-known transactional databases. Results indicate that the proposed algorithm outperforms the existing metaheuristic methods.

The aim of this research is to construct a three-dimensional maritime transport model to transport nonhomogeneous goods (k) and different transport modes (v) from their sources (i) to their destinations (j), while limiting the optimum quantities v ijk x to be transported at the lowest possible cost v ijk c and time v ijk t using the heuristic algorithm, Transport problems have been widely studied in computer science and process research and are one of the main problems of transport problems that are usually used to reduce the cost or times of transport of goods with a number of sources and a number of destinations and by means of transport to meet the conditions of supply and demand. Transport models are a key tool in logistics an

In this paper, two of the local search algorithms are used (genetic algorithm and particle swarm optimization), in scheduling number of products (n jobs) on a single machine to minimize a multi-objective function which is denoted as  (total completion time, total tardiness, total earliness and the total late work). A branch and bound (BAB) method is used for comparing the results for (n) jobs starting from (5-18). The results show that the two algorithms have found the optimal and near optimal solutions in an appropriate times.

     This paper deals with the numerical solution of the discrete classical optimal control problem (DCOCP) governing by linear hyperbolic boundary value problem (LHBVP). The method which is used here consists of: the GFEIM " the Galerkin finite element method in space variable with the implicit finite difference method in time variable" to find the solution of the discrete state equation (DSE) and the solution of its corresponding discrete adjoint equation, where a discrete classical control (DCC) is given.  The gradient projection method with either the Armijo method (GPARM) or with the optimal method (GPOSM) is used to solve the minimization problem which is obtained from the necessary conditi

In this study, an unknown force function dependent on the space in the wave equation is investigated. Numerically wave equation splitting in two parts, part one using the finite-difference method (FDM). Part two using separating variables method. This is the continuation and changing technique for solving inverse problem part in (1,2). Instead, the boundary element method (BEM) in (1,2), the finite-difference method (FDM) has applied. Boundary data are in the role of overdetermination data. The second part of the problem is inverse and ill-posed, since small errors in the extra boundary data cause errors in the force solution. Zeroth order of Tikhonov regularization, and several parameters of regularization are employed to decrease error

   The main focus of this research is to examine the Travelling Salesman Problem (TSP) and the methods used to solve this problem where this problem is considered as one of the combinatorial optimization problems which met wide publicity and attention from the researches for to it's simple formulation and important applications and engagement to the rest of combinatorial problems , which is based on finding the optimal path through known number of cities where the salesman visits each city only once before returning to the city of departure n this research , the benefits  of( FMOLP)   algorithm is employed as one of the best methods to solve the (TSP) problem and the application of the algorithm in conjun

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 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.

This 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