EpiGenetic algorithm for optimization: Application to mobile network frequency planning

S Birogul - Arabian Journal for Science and Engineering, 2016 - Springer
Arabian Journal for Science and Engineering, 2016Springer
Genetic algorithms (GA) has been used as a successful algorithm for many problems. GA
has been redesigned with different methods or used in hybrid algorithms to solve different
problems and improve solutions. In this study, epigenetic algorithm (EGA) design has been
made by adapting epigenetic concepts to the classical GA structure. GA is counted as a
heuristic research algorithm, and there is randomness in the function of genetic operators.
However, owing to some serious research in medical field, it has been shown that through …
Abstract
Genetic algorithms (GA) has been used as a successful algorithm for many problems. GA has been redesigned with different methods or used in hybrid algorithms to solve different problems and improve solutions. In this study, epigenetic algorithm (EGA) design has been made by adapting epigenetic concepts to the classical GA structure. GA is counted as a heuristic research algorithm, and there is randomness in the function of genetic operators. However, owing to some serious research in medical field, it has been shown that through the epigenetics, randomness of crossover and mutation operators can be defined. With regards to this information in the field of medicine, in this study design of EGA, how epicrossover, epimutation operators, and epigenetic factors are made and how they do work and also how the epigenetic inheritance is possible have been told. Our designed EGA has been applied on base stations’ BCCH frequency planning in GSM network that is a constrained optimization problem. Real base station’s data have been used in solving the problem. EGA and GA coding have been made by using C# programming. In order to analyze the success of EGA than the classical GA, both algorithms have been used in solving of this problem. Because of this, EGA gave better results in a shorter time and less iteration than classical GA’s.
Springer
以上显示的是最相近的搜索结果。 查看全部搜索结果