Assistant Lecturer

IT

Kurdistan Express Company for general trading and IT.

Kurdistan-Duhok-Nuhadra Street.

Kurdistan Express Company for general trading and IT.

Customer Service Manager

Ariafon Company for Communication.

Kurdistan-Duhok-Nuhadra Street.

Ariafon Company for Communication.

Sales Manager

Kurdsoft Company for Computer Services

Kurdistan-Duhok-Nuhadra Street.

Kurdsoft Company for Computer Services

Applications: Microsoft Office Suite, LINUX, Matlab, Java, VB, Prolog, Eclipse, Kotlin, C#, and C++.

An enhanced hybrid genetic algorithm for solving traveling salesman problem‏

indonesian journal of electrical engineering and computer science (Volume: 18)

Robust known the exceedingly famed NP-hard problem in combinatorial optimization is the Traveling Salesman Problem (TSP), promoting the skillful algorithms to get the solution of TSP have been the burden for several scholars. For inquiring global optimal solution, the presented algorithm hybridizes genetic and local search algorithm to take out the uplifted quality results. The genetic algorithm gives the best individual of population by enhancing both cross over and mutation operators while local search gives the best local solutions by testing all neighbor solution. By comparing with the conventional genetic algorithm, the numerical outcomes acts that the presented algorithm is more adequate to attain optimal or very near to it. Problems arrested from the TSP library strongly trial the algorithm and shows that the proposed algorithm can reap outcomes within reach optimal. For more details, please download TEMPLATE HELP FILE from the website

Concentric Tabu Search Algorithm for Solving Traveling Salesman Problem

Eastern Mediterranean University Institutional Repository (EMU I-REP) (Issue: Jan,2016)

In this research one of the local search algorithms called the Concentric tabu search (CTS) is used to solve the traveling salesman problem (TSP). One of the well known NP-hard problems in combinatorial optimization is the TSP Problem and it is one of the most competently studied problems in the area of combinatorial optimization. Two different implementations of the Concentric tabu search (CTS): ring moves (RM) and all moves (AM) are used and compared with the traditional tabu search. For searching global optimal solutions for given TSP problems, Concentric tabu search was hybridized with Genetic Algorithm. Computational experiments showed that Concentric tabu search gives better performance than the traditional tabu search and also improves the execution of the Genetic Algorithm (GA) for the solutions of TSP problems.

Teaching Methods and Research Methodology

Duhok, National

Teaching Methods and Research Methodology

Internet and Computing Core Certification (IC3)

Erbil, International

IC³ is the world’s first certification program for digital literacy and the most commonly recognized standard of digital literacy today. IC³ is both accepted for college credit by the American Council on Education (ACE) and aligned with the National Educational Technology Standards (NETS) for teachers and students from the International Society for Technology in Education (ISTE). Students and teachers who achieve IC³ certification possess the validated skills and knowledge required for basic use of computer hardware, software, networks, and the Internet.