Mutation matrix in evolutionary computation: an application to resource allocation problem
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
Adaptive genetic algorithm and quasi-parallel genetic algorithm: application to knapsack problem
LSSC'05 Proceedings of the 5th international conference on Large-Scale Scientific Computing
IDEAL '08 Proceedings of the 9th International Conference on Intelligent Data Engineering and Automated Learning
Combination of Global and Local Search for Real Function Optimization
ISICA '08 Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence
Application of adaptive genetic algorithm in mining industry
ECC'09 Proceedings of the 3rd international conference on European computing conference
Application of adaptive genetic algorithm in mining industry
AIC'09 Proceedings of the 9th WSEAS international conference on Applied informatics and communications
Complex energy landscape mapping by histogram assisted genetic algorithm
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Importance of information exchange in quasi-parallel genetic algorithms
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
EvoApplications'12 Proceedings of the 2012t European conference on Applications of Evolutionary Computation
Spatial and temporal resource allocation for adaptive parallel genetic algorithm
UC'07 Proceedings of the 6th international conference on Unconventional Computation
Topological effects on the performance of island model of parallel genetic algorithm
IWANN'13 Proceedings of the 12th international conference on Artificial Neural Networks: advences in computational intelligence - Volume Part II
Natural Computing: an international journal
Hi-index | 0.00 |
A matrix formulation for an adaptive genetic algorithm is developed using mutation matrix and crossover matrix. Selection, mutation, and crossover are all parameter-free in the sense that the problem at a particular stage of evolution will choose the parameters automatically. This time dependent selection process was first developed in MOGA (mutation only genetic algorithm) [Szeto and Zhang, 2005] and now is extended to include crossover. The remaining parameters needed are population size and chromosome length. The adaptive behavior is based on locus statistics and fitness ranking of chromosomes. In crossover, two methods are introduced: Long Hamming Distance Crossover (LHDC) and Short Hamming Distance Crossover (SHDC). LHDC emphasizes exploration of solution space. SHDC emphasizes exploitation of local search process. The one-dimensional random coupling Ising Spin Glass problem, which is similar to a knapsack problem, is used as a benchmark test for the comparison of various realizations of the adaptive genetic algorithms. Our results show that LHDC is better than SHDC, but both are superior to MOGA, which has been shown to be better than many traditional methods.