The Traveling Salesman Problem as a Benchmark Test for a Social-Based Genetic Algorithm
N. A. AL-Madi and A. T. Khader
DOI : 10.3844/jcssp.2008.871.876
Journal of Computer Science
Volume 4, Issue 10
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.
© 2008 N. A. AL-Madi and A. T. Khader. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.