Bicriteria transportation problem by hybrid genetic algorithm
Proceedings of the 23rd international conference on on Computers and industrial engineering
Numerical Optimization of Computer Models
Numerical Optimization of Computer Models
An analysis of the behavior of a class of genetic adaptive systems.
An analysis of the behavior of a class of genetic adaptive systems.
Widely convergent method for finding multiple solutions of simultaneous nonlinear equations
IBM Journal of Research and Development
Evolutionary programming techniques for constrained optimizationproblems
IEEE Transactions on Evolutionary Computation
Information Sciences: an International Journal
Hi-index | 0.00 |
This paper examines the effects of local search on hybrid genetic algorithm performance and population sizing. It compares the performance of a self-adaptive hybrid genetic algorithm (SAHGA) to a non-adaptive hybrid genetic algorithm (NAHGA) and the simple genetic algorithm (SGA) on eight different test functions, including unimodal, multimodal and constrained optimization problems. The results show that the hybrid genetic algorithm substantially reduces required population sizes because of the reduction in population variance. The adaptive nature of the SAHGA algorithm together with the reduction in population size allow for faster solution of the test problems without sacrificing solution quality.