Reducing bias and inefficiency in the selection algorithm
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Parallel genetic algorithms for a hypercube
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms
Niching methods for genetic algorithms
Niching methods for genetic algorithms
Distributed Genetic Algorithms
Proceedings of the 3rd International Conference on Genetic Algorithms
An Efficient Migration Scheme for Subpopulation-Based Asynchronously Parallel Genetic Algorithms
Proceedings of the 5th International Conference on Genetic Algorithms
Computer simulations of genetic adaptation: parallel subcomponent interaction in a multilocus model
Computer simulations of genetic adaptation: parallel subcomponent interaction in a multilocus model
Hi-index | 0.00 |
Nomadic genetic algorithm is a type of multi-population migration based genetic algorithm that gives equal importance to low fit individuals and adaptively chooses its migration parameters. It has been applied to several real life applications and found to perform well compared to other genetic algorithms. This paper exploits the working of nomadic genetic algorithm (NGA) for benchmark mathematical functions and compares it with the standard genetic algorithm. To compare its performance with standard GA (SGA), the prominent mathematical functions used in optimization are used and the results proved that NGA outperforms SGA in terms of convergence speed and better optimized values.