JCS Cover
Frequency: Monthly
ISSN: 1549-3636 (Print)
ISSN: 1552-6607 (Online)
Research Article Open Access

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

N. A. AL-Madi and A. T. Khader

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 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

Open AccessCopyright: © 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.

  • 3,385 Views
  • 2,610 Downloads
  • 1 Citations

Download

Keywords

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