This paper has the interest of finding the approximate solution (APPS) of a nonlinear variable coefficients hyperbolic boundary value problem (NOLVCHBVP).  The given boundary value problem is written in its discrete weak form (WEFM) and proved  have a unique solution, which is obtained via the mixed Galerkin finite element with implicit method that reduces the problem to solve the Galerkin nonlinear algebraic system  (GNAS). In this part, the predictor and the corrector techniques (PT and CT, respectively) are proved at first convergence and then are used to transform  the obtained GNAS to a linear GLAS . Then the GLAS is solved using the Cholesky method (ChMe). The stability and the convergence of the method are stud

There are many different methods for analysis of two-way reinforced concrete slabs. The most efficient methods depend on using certain factors given in different codes of reinforced concrete design. The other ways of analysis of two-way slabs are the direct design method and the equivalent frame method. But these methods usually need a long time for analysis of the slabs.

In this paper, a new simple method has been developed to analyze the two-way slabs by using simple empirical formulae, and the results of final analysis of some examples have been compared with other different methods given in different codes of practice.

The comparison proof that this simple proposed method gives good results and it can be used in analy

      In this paper, a new class of ordinary differential equations is designed for some functions such as probability density function, cumulative distribution function, survival function and hazard function of power function distribution, these functions are used of the class under the study. The benefit of our work is that the equations ,which are generated from some probability distributions, are used to model and find  the  solutions  of problems in our lives, and that the solutions of these equations are a solution to these problems, as the solutions of the equations under the study are the closest and the most reliable to reality. The existence and uniqueness of solutions the obtained equations in the current study are dis

The aim of this paper is to study the asymptotically stable solution of nonlinear single and multi fractional differential-algebraic control systems, involving feedback control inputs, by an effective approach that depends on necessary and sufficient conditions.

In this paper, the construction of Hermite wavelets functions and their operational matrix of integration is presented. The Hermite wavelets method is applied to solve nth order Volterra integro diferential equations (VIDE) by expanding the unknown functions, as series in terms of Hermite wavelets with unknown coefficients. Finally, two examples are given

This paper investigates some exact and local search methods to solve the traveling salesman problem. The Branch and Bound technique (BABT) is proposed, as an exact method, with two models. In addition, the classical Genetic Algorithm (GA) and Simulated Annealing (SA) are discussed and applied as local search methods. To improve the performance of GA we propose two kinds of improvements for GA; the first is called improved GA (IGA) and the second is Hybrid GA (HGA).

The IGA gives best results than GA and SA, while the HGA is the best local search method for all within a reasonable time for 5 ≤ n ≤ 2000, where n is the number of visited cities. An effective method of reducing the size of the TSP matrix was proposed with

     In this paper, one of the Machine Scheduling Problems is studied, which is the problem of scheduling a number of products (n-jobs) on one (single) machine with the multi-criteria objective function. These functions are (completion time, the tardiness, the earliness, and the late work) which formulated as . The branch and bound (BAB) method are used as the main method for solving the problem, where four upper bounds and one lower bound are proposed and a number of dominance rules are considered to reduce the number of branches in the search tree. The genetic algorithm (GA) and the particle swarm optimization (PSO) are used to obtain two of the upper bounds. The computational results are calculated by coding (progr