The aware genetic algorithm of the best member, applied to graph coloring and metric-dimension of the graph problems

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Amintoosi Mahmood; Ezzati Hashem

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: IRANIAN COMMUNICATION AND INFORMATION TECHNOLOGY Year:2020 | Volume:12 | Issue:43-44 Page(s): 143-154

Download Full-Text

View:

102

Download:

Cites:

Information Journal Paper

Title

The aware genetic algorithm of the best member, applied to graph coloring and metric-dimension of the graph problems

Author(s)

Amintoosi Mahmood | Ezzati Hashem | Issue Writer Certificate

Keywords

Genetic Algorithm

Metaheuristic Algorithms

Metric Dimension of Graphs

Graph Coloring

Abstract

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.

Cites

No record.

References

No record.

Cite

APA: Copy

Amintoosi, Mahmood, & Ezzati, Hashem. (2020). The aware genetic algorithm of the best member, applied to graph coloring and metric-dimension of the graph problems. IRANIAN COMMUNICATION AND INFORMATION TECHNOLOGY, 12(43-44 ), 143-154. SID. https://sid.ir/paper/783418/en

Vancouver: Copy

Amintoosi Mahmood, Ezzati Hashem. The aware genetic algorithm of the best member, applied to graph coloring and metric-dimension of the graph problems. IRANIAN COMMUNICATION AND INFORMATION TECHNOLOGY[Internet]. 2020;12(43-44 ):143-154. Available from: https://sid.ir/paper/783418/en

IEEE: Copy

Mahmood Amintoosi, and Hashem Ezzati, “The aware genetic algorithm of the best member, applied to graph coloring and metric-dimension of the graph problems,” IRANIAN COMMUNICATION AND INFORMATION TECHNOLOGY, vol. 12, no. 43-44 , pp. 143–154, 2020, [Online]. Available: https://sid.ir/paper/783418/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops