The Traveling Salesman Problem as a Benchmark Test for a Social-Based Genetic Algorithm | Science Publications

Journal of Computer Science

N. A. AL-Madi¹  A. T. Khader¹ 

关键词: Genetic Algorithms (GAs);    Traveling Salesman Problem (TSP);    Symmetric TSP;    Social- Based Genetic Algorithm (SBGA);   

DOI  :  10.3844/jcssp.2008.871.876

学科分类：计算机科学（综合）

来源: Science Publications

【 摘 要 】

Present research, showed Traveling Salesman Problem (TSP) to compare values and results concerning the averages and best fits of both, Simple Standard Genetic Algorithm (SGA) and a new approach of Genetic Algorithms named Social-Based Genetic Algorithm (SBGA). Results from TSP test on Social-Based Genetic Algorithms (SBGA) were presented. Results were encouraging in Social-Based Genetic Algorithms (SBGA) performs better in finding best fit solutions of generations in different populations than the Simple Standard Genetic Algorithm.

【 授权许可】

Unknown