This paper is concerned with finding the approximation solution (APPS) of a certain type of nonlinear hyperbolic boundary value problem (NOLHYBVP).  The given BVP is written in its discrete (DI) weak form (WEF), and is proved that  it has a unique APPS, which is obtained via the mixed Galerkin finite element method (GFE) with implicit method (MGFEIM) that reduces the problem to solve the Galerkin nonlinear algebraic system  (GNAS).  In this part, the predictor and the corrector technique (PT and CT) are proved convergent and are used to transform the obtained GNAS to  linear (GLAS ), then the GLAS is solved using the Cholesky method (ChMe). The stability and the convergence of the method are studied. The results

Transport is a problem and one of the most important mathematical methods that help in making the right decision for the transfer of goods from sources of supply to demand centers and the lowest possible costs, In this research, the mathematical model of the three-dimensional transport problem in which the transport of goods is not homogeneous was constructed. The simplex programming method was used to solve the problem of transporting the three food products (rice, oil, paste) from warehouses to the student areas in Baghdad, This model proved its efficiency in reducing the total transport costs of the three products. After the model was solved in (Winqsb) program, the results showed that the total cost of transportation is (269,

     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

This work describes two efficient and useful methods for solving fractional pantograph delay equations (FPDEs) with initial and boundary conditions. These two methods depend mainly on orthogonal polynomials, which are the method of the operational matrix of fractional derivative that depends on Bernstein polynomials and the operational matrix of the fractional derivative with Shifted Legendre polynomials. The basic procedure of this method is to convert the pantograph delay equation to a system of linear equations and by using, the operational matrices we get rid of the integration and differentiation operations, which makes solving the problem easier. The concept of Caputo has been used to describe fractional derivatives. Finally, some

It is generally accepted that there are two spectrophotometric techniques for quantifying ceftazidime (CFT) in bulk medications and pharmaceutical formulations.  The methods  are described as simple, sensitive, selective, accurate and efficient techniques. The first method used an alkaline medium to convert ceftazidime to its diazonium salt, which is then combined with the 1-Naphthol (1-NPT) and 2-Naphthol (2-NPT) reagents. The azo dye that was produced brown  and red in color with absorption intensities of ƛmax 585 and 545nm respectively. Beer's law was followed in terms of concentration ranging from  (3-40) µg .ml^-1 For (CFT-1-NPT) and (CFT-2-NPT), the detection limits were 1.0096 and 0.8017 µg.ml^-1, respec

Abstract

The traffic jams taking place in the cities of the Republic of Iraq in general and the province of Diwaniyah especially, causes return to the large numbers of the modern vehicles that have been imported in the last ten years and the lack of omission for old vehicles in the province, resulting in the accumulation of a large number of vehicles that exceed the capacity of the city's streets, all these reasons combined led to traffic congestion clear at the time of the beginning of work in the morning, So researchers chose local area network of the main roads of the province of Diwaniyah, which is considered the most important in terms of traffic congestion, it was identified  fuzzy numbers for

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

Artificial fish swarm algorithm (AFSA) is one of the critical swarm intelligent algorithms. In this
paper, the authors decide to enhance AFSA via diversity operators (AFSA-DO). The diversity operators will
be producing more diverse solutions for AFSA to obtain reasonable resolutions. AFSA-DO has been used to
solve flexible job shop scheduling problems (FJSSP). However, the FJSSP is a significant problem in the
domain of optimization and operation research. Several research papers dealt with methods of solving this
issue, including forms of intelligence of the swarms. In this paper, a set of FJSSP target samples are tested
employing the improved algorithm to confirm its effectiveness and evaluate its ex

This study discussed a biased estimator of the Negative Binomial Regression model known as (Liu Estimator), This estimate was used to reduce variance and overcome the problem Multicollinearity between explanatory variables, Some estimates were used such as Ridge Regression and Maximum Likelihood Estimators, This research aims at the theoretical comparisons between the new estimator (Liu Estimator) and the estimators