This research presents the fundamental concepts of tabu search for optimization problem as symmetric traveling salesman problem. The purpose of this research is to solve the traveling salesman problem with tabu search method, to find an optimal solution of small search space and computational requirements. Keywords: Tabu algorithm, traveling salesman problem, NP problem. ‫طريقة‬ ‫ال‬ ‫بحث‬ ‫الممنوع‬ ‫لحل‬ ‫م‬ ‫سالة‬ ‫المتجول‬ ‫البائع‬ ‫الكال‬ ‫نذير‬ ‫اء‬ ‫إسر‬ ‫ك‬ ‫شعبان‬ ‫زيدان‬ ‫رقية‬ ‫يض‬ ‫التمر‬ ‫كلية‬ ‫الموصل‬ ‫جامعة‬ ، ‫الطب‬ ‫كلية‬ ‫الموصل‬ ‫جامعة‬ ، ‫االستالم:‬ ‫تاريخ‬ 10 / 12 / 2007 ‫ال‬ ‫تاريخ‬ ‫قبول:‬ 04 / 03 / 2008 ‫الملخص‬ ‫قت‬ ‫تطر‬ ‫هذه‬ ‫اسة‬ ‫الدر‬ ‫األمثلية‬ ‫مسائل‬ ‫من‬ ‫مسألة‬ ‫مع‬ ‫الممنوع‬ ‫البحث‬ ‫أساسيات‬ ‫إلى‬ -‫البائع‬ ‫مسألة‬ ‫المتجول‬ -‫مثالي‬ ‫حل‬ ‫على‬ ‫للحصول‬ ‫الممنوع،‬ ‫البحث‬ ‫يقة‬ ‫طر‬ ‫باستخدام‬ ‫المتجول‬ ‫البائع‬ ‫مسألة‬ ‫حل‬ ‫على‬ ‫وركزت‬ ‫قليلة.‬ ‫وحسابات‬ ‫صغير‬ ‫ـث‬ ‫ـ‬ ‫بح‬ ‫وبفضاء‬ ‫للمسألة‬ ‫المفتاحية:‬ ‫الكلمات‬ ‫المتجول‬ ‫البائع‬ ‫مسألة‬ ‫الممنوع،‬ ‫البحث‬ ‫الخطية‬ ‫غير‬ ‫البرمجة‬ ‫مسألة‬ ، .

The paper tackled a survey of two optimization methods to study spanning tree problem by modifying the spanning tree problem to generate all of possible solutions in undirected tree graph with simulated annealing algorithm and ant colony optimization algorithm. These algorithms are two of the optimization methods to find optimal solution from many of solutions in search space. A program is written in MATLAB 6.5 language to simulate these two algorithms with spanning tree problem. The experimental results in this paper show the effectiveness and easy implementation of each algorithm to find optimal solution, and to perform significantly better than the manual method.

The current paper tackles the combination of the genetic Algorithm with scheduling the multiprocessor by browsing the two algorithms for dependent tasks and non preemptive. The first algorithm is the highest level first estimated time (HLFET), and the second algorithm is smallest co-level first with estimated time (SCFET). The genetic algorithm proved to be powerful, efficient and appeared the feasible solution among many solutions; that minimize the schedule length (execution time) to find the optimal scheduling. In this research, it is proposed a genetic algorithm that finds a good combination of two list algorithms to produce a schedule with shortest schedule length. The results of the experiments showed that scheduling found with the proposed two list scheduling genetic algorithms outperform those found with each one of the two lists scheduling alone.

Aim :To study the prevalence of carpal tunnel syndrome among over use of computer mouse in Mosul University employees.

This paper tackled cuckoo search method. The method is one of optimization methods with N-queens problem through proposed hybridization algorithm which mimics the behavior of cuckoo to reach the solution of N-queens problem. The proposed hybridization algorithm is simulated by using MATLAB 6.5 language to mimic the behavior of some cuckoo. These laid their eggs in the nests of other host birds. If a host bird discovers that the eggs aren't their own, it will either throw these alien eggs away, or abandon its nest and build a new one. To reach the solution for Nqueens problem easily. The experimental results in this paper show the effectiveness and easy implementation to reach solution.