Age Constraints Effectiveness on the Human Community Based Genetic Algorithm (HCBGA)

Nagham A. Al-Madi, Amnah A. El-Obaid

Abstract


In this paper, we use under-age constraints and apply it to the Traveling Salesman Problem (TSP). Values and results concerning the averages and best fits of both, the Simple Standard Genetic Algorithm (SGA), and an improved approach of Genetic Algorithms named Human Community Based Genetic Algorithm (HCBGA) are being compared. Results from the TSP test on Human Community Based Genetic Algorithm (HCBGA) are presented.
Best fit solutions towards slowing the convergence of solutions in different populations of different generations show better results in the Human Community Based Genetic Algorithm (HCBGA) than the Simple Standard Genetic Algorithm (SGA).

Keywords


Age constraints, Human community based genetic algorithm (HCBGA), Traveling salesman problem (TSP)

Full Text:

PDF


DOI: http://doi.org/10.11591/ijai.v7.i2.pp78-82
Total views : 220 times

Refbacks

  • There are currently no refbacks.


Copyright (c) 2018 Institute of Advanced Engineering and Science

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

View IJAI Stats

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.