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, a new technique is offered for solving three types of linear integral equations of the 2nd kind including Volterra-Fredholm integral equations (LVFIE) (as a general case), Volterra integral equations (LVIE) and Fredholm integral equations (LFIE) (as special cases). The new technique depends on approximating the solution to a polynomial of degree  and therefore reducing the problem to a linear programming problem(LPP), which will be solved to find the approximate solution of LVFIE. Moreover, quadrature methods including trapezoidal rule (TR), Simpson 1/3 rule (SR), Boole rule (BR), and Romberg integration formula (RI) are used to approximate the integrals that exist in LVFIE. Also, a comparison between those methods i

We use of multi-choice Goal Programming (MCGP), which is a developed model of Goal Programming where it is used in circumstances of the multiplicity and difference of goals when choosing between decision alternatives in cases of allocating resources, as it is a model that seeks to find the closest and best solutions to the specific values ​​of the goals within the aspiration levels, as the first goal in the multi-choice goal programming model that is used to reduce the total cost of storage and shortage, while the other goal was to reduce the difference between the real demand that the hospitals need from the blood transfusion center and the units that already achieved. The case Iraqi Center

The purpose of this paper is to find the best multiplier approximation of unbounded functions in    –space by using some discrete linear positive operators. Also we will estimate the degree of the best multiplier approximation in term of modulus of continuity and the averaged modulus.

The main idea of this paper is to define other types of a fuzzy local function and study the advantages and differences between them in addition to discussing some definitions of finding new fuzzy topologies. Also in this research, a new type of fuzzy closure has been defined, where the relation between the new type and different types of fuzzy local function has been studied

In this research was to use the method of classic dynamic programming (CDP) and the method of fuzzy dynamic programming (FDP) to controlling the inventory in N periods and only one substance ,in order to minimize the total cost and determining the required quantity in warehouse rusafa principal of the ministry of commerce . A comparison was made between the two techniques، We found that the value of fuzzy total cost is less than that the value of classic total cost

The way used to estimate the fuzzy reliability differs according to the nature of the information of failure time which has been dealt in this research.The information of failure times has no probable distribution to explain it , in addition it has fuzzy quality.The research includes fuzzy reliability estimation of three periods ,the first one from 1986 to 2013,the second one from 2013 to 2033 while the third one from 2033 to 2066 .Four failure time have been chosen to identify the membership function of fuzzy trapezoid represented in the pervious years after taking in consideration the estimation of most researchers, proffional    geologists and the technician who is incharge of maintaining of Mosul Dam project. B

The aims of the paper are to present a modified symmetric fuzzy approach to find the best workable compromise solution for quadratic fractional programming problems (QFPP) with fuzzy crisp in both the objective functions and the constraints. We introduced a modified symmetric fuzzy by proposing a procedure, that starts first by converting the quadratic fractional programming problems that exist in the objective functions to crisp numbers and then converts the linear function that exists in the constraints to crisp numbers. After that, we applied the fuzzy approach to determine the optimal solution for our quadratic fractional programming problem which is supported theoretically and practically. The computer application for the algo

A new algorithm is proposed to compress speech signals using wavelet transform and linear predictive coding. Signal compression based on the concept of selecting a small number of approximation coefficients after they are compressed by the wavelet decomposition (Haar and db4) at a suitable chosen level and ignored details coefficients, and then approximation coefficients are windowed by a rectangular window and fed to the linear predictor. Levinson Durbin algorithm is used to compute LP coefficients, reflection coefficients and predictor error. The compress files contain LP coefficients and previous sample. These files are very small in size compared to the size of the original signals. Compression ratio is calculated from the size of th