ملخص الدراسة:

TSP (traveling salesman problem) is one of the typical NP-hard problems in combinatorial optimization problem. We present a genetic algorithm for solving the traveling salesman problem to optimality for TSP, however it gives good solution, it takes much combinational time. In this paper, Neural Network Clustering Algorithm used for enhancement the performance of Genetic Algorithm to solve TSP. The main idea, which is clustering cities into smaller clusters and each cluster is a sub problem which is solving by Genetic Algorithm , that will be in less combinational time. Experimental results show that the proposed algorithm can give a good results for TSP problem more than the simple GA.

توثيق المرجعي (APA)

Al_Rubaie, Fatma,& Alhanjouri, Mohammed A. (2019). Optimization of Travelling Salesman Problem using NN Clustering and Genetic Algorithm. IEEE 7th Palestinian International Conference on Electrical and Computer Engineering (PICECE), مؤتمر كلية الهندسة - الجامعة الإسلامية, Islamic University of Gaza. 27449