The aware genetic algorithm of the best member, applied to graph coloring and metric-dimension of the graph problems
Genetic algorithm is one of the most famous methods for solving Combinatorial Optimization Problems. It had various applications in different field of studies such as Electronics, Computer Science and Mathematics and still has. In this algorithm, the population members which contribute for producing the next generation are selected according to their fitness values. The combination of the members is through Crossover Operator; And in some versions a few of the best members migrate to the next generation directly. Normally, the weak members of population may participate to the next generation. In this study, the combination operators are aware of the best member of generation; Only those child which are as good as the best member, are allowed to form the next generation. The proposed method is applied on graph coloring and finding metric-dimension of graph problems. The results are compared with the common genetic algorithm. Experimental results shows the superior performance of the proposed method in comparison to common genetic algorithm.
-
Challenges and Requirements of Persian Language Support in Citation Software
*
Journal of Studies in Library and Information Science, -
Prediction of the Air Quality by Artificial Neural Network Using Instability Indices in the City of Tehran-Iran
Razieh Farhadi, Mojtaba Hadavifar *, Mazaher Moeinaddini,
Journal of Civil Engineering, Autumn 2020