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

Total protein and total fucose were determined in sera of thyroid

disorder patients.

Sera of (40) diagnosed by consultant hyperthyroidism, and 40 hypothyroidism  were analyzed  for  the above  parameter  for  control, sera of (40) normal individuals were used.

They   were   healthy   with    no  appearing   disorder   results   analysis revealed  no significant  differences  (P<0.05)  in  the (mean  Â±SD)  of total   protein   values  in   sera  of   hyper  and   hypothyroidism   were compared

Purpose: The main objective of this paper is, to determine the optimal no. of technicians’ men in a workshop crew of an Industrial System.   Theoretical framework: The purpose of applying these tools is to explore their ability to reduce costs and improvements that can be obtained in the process of providing services to the end customer.   Design/methodology/approach: The literature structure review was built from analyzing 12 of scientific papers and books, from web sciences and the Elsevier database. The papers were analyzed from descriptive, methodologic, and citation characteristics.   Finding:  By applying the equation model of the paper, the optimal no. of technician men in the crew of the workshop can be determined when

     In this paper, we present a Branch and Bound (B&B) algorithm of scheduling (n) jobs on a single machine to minimize the sum total completion time, total tardiness, total earliness, number of tardy jobs and total late work with unequal release dates. We proposed six heuristic methods for account upper bound. Also to obtain lower bound (LB) to this problem we modified a (LB) select from literature, with (Moore algorithm and Lawler's algorithm).  And some dominance rules were suggested. Also, two special cases were derived. Computational experience showed the proposed (B&B) algorithm was effective in solving problems with up to (16) jobs, also the upper bounds and the lower bound were effective in restr

     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

Background: Total superficial parotidectomy is the most commonly used approach in excising the tumors that affect the superficial lobe of the parotid gland, whether they're benign or malignant. The aim of the study is to evaluate the benefits and drawbacks of total superficial parotidectomy for parotid gland tumors within five years of follow-up. Patients and methods: Nineteen patients with lateral facial swelling affecting the parotid region were included in this study. All of them operated under general anesthesia with oral endotracheal intubation, where Modified Blair Incision (lazy S incision) was utilized in all cases. Anterograde dissection with facial nerve identification was accomplished with total superficial parotidectomy.

This paper is concerned with studying the numerical solution for the discrete classical optimal control problem (NSDCOCP) governed by a variable coefficients nonlinear hyperbolic boundary value problem (VCNLHBVP). The DSCOCP is solved by using the Galerkin finite element method (GFEM) for the space variable and implicit finite difference scheme (GFEM-IFDS) for the time variable to get the NS for the discrete weak form (DWF) and for the discrete adjoint weak form (DSAWF) While, the gradient projection method (GRPM), also called the gradient method (GRM), or the Frank Wolfe method (FRM) are used to minimize the discrete cost function (DCF) to find the DSCOC. Within these three methods, the Armijo step option (ARMSO) or the optimal step opt

String matching is seen as one of the essential problems in computer science. A variety of computer applications provide the string matching service for their end users. The remarkable boost in the number of data that is created and kept by modern computational devices influences researchers to obtain even more powerful methods for coping with this problem. In this research, the Quick Search string matching algorithm are adopted to be implemented under the multi-core environment using OpenMP directive which can be employed to reduce the overall execution time of the program. English text, Proteins and DNA data types are utilized to examine the effect of parallelization and implementation of Quick Search string matching algorithm on multi-co