@article {10.3844/jcssp.2008.871.876,
article_type = {journal},
title = {The Traveling Salesman Problem as a Benchmark Test for a Social-Based Genetic Algorithm},
author = {AL-Madi, N. A. and Khader, A. T.},
volume = {4},
number = {10},
year = {2008},
month = {Oct},
pages = {871-876},
doi = {10.3844/jcssp.2008.871.876},
url = {https://thescipub.com/abstract/jcssp.2008.871.876},
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.},
journal = {Journal of Computer Science},
publisher = {Science Publications}
}