TY  - JOUR
AU  - AL-Madi, N. A. 
AU  - Khader, A. T. 
PY  - 2008
TI  - The Traveling Salesman Problem as a Benchmark Test for a Social-Based Genetic Algorithm
JF  - Journal of Computer Science
VL  - 4
IS  - 10
DO  - 10.3844/jcssp.2008.871.876
UR  - https://thescipub.com/abstract/jcssp.2008.871.876
AB  - 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.