Application of Genetic Algorithms in Graph Theory and Optimization

DOI

10.2991/icmemtc-16.2016.6How to use a DOI?

Keywords

Graph theory planning model; Optimization; Genetic algorithm; Peak coverage problems; Coding; Application

Abstract

There will be a lot of NP- complete problems in graph theory and optimization process, as the most important problem in scientific engineering computing, now it is generally used genetic algorithm to solve. Therefore, this article will mainly study the basic theory of genetic algorithms and graph theory, and put forward the optimization algorithm in graph theory vertex cover problem in the specific application.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Qiaoyan Yang
AU  - Qinghong Zeng
PY  - 2016/04
DA  - 2016/04
TI  - Application of Genetic Algorithms in Graph Theory and Optimization
BT  - Proceedings of the 2016 3rd International Conference on Materials Engineering, Manufacturing Technology and Control
PB  - Atlantis Press
SP  - 24
EP  - 29
SN  - 2352-5401
UR  - https://doi.org/10.2991/icmemtc-16.2016.6
DO  - 10.2991/icmemtc-16.2016.6
ID  - Yang2016/04
ER  -