Optimal Preference Detection Based on Golden Section and Genetic Algorithm for Affinity Propagation Clustering

Author(s):  
Libin Jiao ◽  
Guangzhi Zhang ◽  
Shenling Wang ◽  
Rashid Mehmood ◽  
Rongfang Bie
2016 ◽  
Vol 12 (8) ◽  
pp. 9807206 ◽  
Author(s):  
Libin Jiao ◽  
Rongfang Bie ◽  
Guangzhi Zhang ◽  
Shenling Wang ◽  
Rashid Mehmood

2015 ◽  
Vol 5 (4) ◽  
pp. 239-245 ◽  
Author(s):  
Ahmad Fouad El-Samak ◽  
Wesam Ashour

Abstract Combinatorial optimization problems, such as travel salesman problem, are usually NP-hard 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.


2008 ◽  
Vol 9 (10) ◽  
pp. 1373-1381 ◽  
Author(s):  
Ding-yin Xia ◽  
Fei Wu ◽  
Xu-qing Zhang ◽  
Yue-ting Zhuang

2016 ◽  
Vol 51 (3) ◽  
pp. 941-963 ◽  
Author(s):  
Leilei Sun ◽  
Chonghui Guo ◽  
Chuanren Liu ◽  
Hui Xiong

Sign in / Sign up

Export Citation Format

Share Document