Research ArticleOpen accessIn the keywordsThe Traveling Salesman Problem as a Benchmark Test for a Social-Based Genetic AlgorithmN. A. AL-Madi, A. T. KhaderPresent 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 … …Journal of Computer Science, Vol. 4, Issue 10 · 31 Oct 2008 · 6,843 accessesView PDFCite