ABSTRACT
In this paper, the Maximal Information Coefficient (MIC) will be used to modify the Genetic Algorithm (GA) in order to solve multi-variable optimization problems more efficiently and accurately. The MIC modified GA (MICGA) learns the problem structure by calculating the MIC. The original GA is compared to the MICGA and many other types of optimization algorithms to determine the most efficient optimization method.
- A. Das and B. Mahua. Affine-based registration of ct and mr modality images of human brain using multiresolution approaches: comparative study on genetic algorithm and particle swarm optimization. Neural Computing & Applications, 20(2):223--237, 2011. Google ScholarDigital Library
- K. Deb. Genetic algorithm {computer program}, 2001.Google Scholar
- K. Deb, A. Anand, and D. Joshi. A computationaly efficient evolutionary algorithm for real-parameter optimization. Evolutionary Computation, 10. Google ScholarDigital Library
- W. Gong, Z. Cai, C. X. Ling, and H. Li. A real-coded biogeography-based optimization with mutation, 2009.Google Scholar
- N. Hansen and A. Ostermeir. Completely derandomized self-adaptation in evolution strategies. Evolutionary Computation, 9(2):159--195, 2001. Google ScholarDigital Library
- S. He, Q. Wu, and J. R. Saunders. Group search optimizer: An optimization algorithm inspired by animal searching behavior. IEEE Transactions on Evolutionary Computation, 13(5):973--990, 2009. Google ScholarDigital Library
- J. Kennedy and R. Eberhart. Swarm Intelligence. Morgan Kaufmann, San Francisco, CA, 2001. Google ScholarDigital Library
- A. Y. Lam, V. O. Li, and J. J. Yu. Real-coded chemical reaction optimization. IEEE Transactions on Evolutionary Computation, 16(3):339--353, 2012.Google ScholarDigital Library
- D. N. Reshef, Y. A. Reshef, H. K. Finucane, S. R. Grossman, G. McVean, P. J. Turnbaugh, E. S. Lander, M. Mitzenmacher, and P. C. Sabeti. Detecting novel associations in large data sets. Science Magazine, 334(6062):1518--1524, 2011.Google Scholar
- L. Sahoo, A. K. Bhunia, and P. K. Kapur. Genetic algorithm based multi-objective reliability optimization in interval environment. Computers & Industrial Engineering, 62(1):152--160, 2012. Google ScholarDigital Library
- R. Storn and K. Price. Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization, 11(4):341--359, 1997. Google ScholarDigital Library
- H.-C. Tseng and J.-Y. Chen. Thermal analysis and packaging optimization of collector-up hbts using an enhanced genetic-algorithm methodology. Packaging & Manufacturing Technology, 2(2):231--239, 2012.Google ScholarCross Ref
- X. Yao and Y. Liu. Faster evoultion strategies. In Proc. 6th International Conference of Evolutionary Programming, pages 151--162, 1997. Google ScholarDigital Library
- X. Yao, Y. Liu, and G. Lin. Evolutionary programming made faster. IEEE Transactions on Evolutionary Computation, 3(2):82--102, 1999. Google ScholarDigital Library
Index Terms
- New genetic algorithm with a maximal information coefficient based mutation
Recommendations
Implementing Genetic Algorithm Accelerated By Intel Xeon Phi
SoICT '17: Proceedings of the 8th International Symposium on Information and Communication TechnologyIn this paper, genetic algorithm (GA) accelerated by Intel Xeon Phi coprocessor based on Intel Many Integrated Chip (MIC) Architecture is proposed and called GAPhi framework. The GAPhi framework solves the power-aware task scheduling (PATS) problems in ...
An improved genetic algorithm with conditional genetic operators and its application to set-covering problem
The genetic algorithm (GA) is a popular, biologically inspired optimization method. However, in the GA there is no rule of thumb to design the GA operators and select GA parameters. Instead, trial-and-error has to be applied. In this paper we present an ...
Solving Japanese nonograms by Taguchi-based genetic algorithm
A Taguchi-based genetic algorithm (TBGA) is proposed to solve Japanese nonogram puzzles. The TBGA exploits the power of global exploration inherent in the traditional genetic algorithm (GA) and the abilities of the Taguchi method in efficiently ...
Comments