Research Article Open Access

The Traveling Salesman Problem as a Benchmark Test for a Social-Based Genetic Algorithm

N. A. AL-Madi1 and A. T. Khader1
  • 1 ,
Journal of Computer Science
Volume 4 No. 10, 2008, 871-876

DOI: https://doi.org/10.3844/jcssp.2008.871.876

Published On: 31 October 2008

How to Cite: AL-Madi, N. A. & Khader, A. T. (2008). The Traveling Salesman Problem as a Benchmark Test for a Social-Based Genetic Algorithm. Journal of Computer Science, 4(10), 871-876. https://doi.org/10.3844/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.

  • 1,212 Views
  • 1,622 Downloads
  • 1 Citations

Download

Keywords

  • Genetic Algorithms (GAs)
  • Traveling Salesman Problem (TSP)
  • Symmetric TSP
  • Social- Based Genetic Algorithm (SBGA)