The Traveling Salesman Problem as a Benchmark Test for a Social-Based Genetic Algorithm
Nagham A. Al-Madi, Ahamad Tajudin Khader · Journal of Computer Science · 2008
Abstract: 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.