- Tytuł:
- Optimization of traveling salesman problem using affinity propagation clustering and genetic algorithm
- Autorzy:
-
El-Samak, A. F.
Ashour, W. - Powiązania:
- https://bibliotekanauki.pl/articles/91810.pdf
- Data publikacji:
- 2015
- Wydawca:
- Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
- Tematy:
-
combinatorial optimization problem
travel salesman problem
genetic algorithm
evolutionary computation algorithm
affinity propagation clustering technique
AP
problem optymalizacji kombinatorycznej
algorytm genetyczny
obliczenia ewolucyjne - Opis:
- Combinatorial optimization problems, such as travel salesman problem, are usually NPhard and the solution space of this problem is very large. Therefore the set of feasible solutions cannot be evaluated one by one. The simple genetic algorithm is one of the most used evolutionary computation algorithms, that give a good solution for TSP, however, it takes much computational time. In this paper, Affinity Propagation Clustering Technique (AP) is used to optimize the performance of the Genetic Algorithm (GA) for solving TSP. The core idea, which is clustering cities into smaller clusters and solving each cluster using GA separately, thus the access to the optimal solution will be in less computational time. Numerical experiments show that the proposed algorithm can give a good results for TSP problem more than the simple GA.
- Źródło:
-
Journal of Artificial Intelligence and Soft Computing Research; 2015, 5, 4; 239-245
2083-2567
2449-6499 - Pojawia się w:
- Journal of Artificial Intelligence and Soft Computing Research
- Dostawca treści:
- Biblioteka Nauki
Artykuł