Genetic algorithms are algorithms to simulate biological evolution, as long as one of the feasible solution can be represented by a set of suitable code, then the feasible solution can be seen as a biological entity, serveral feasible solutions can be seen as a biological population. By using the characteristics of biological evolution with a number of feasible solutions, the optimal solution can be obtained easily and quickly. This article uses the characteristics of genetic algorithms and the four-color map problem, to solve the four-color map problem with genetic algorithm. Experiments show that, to solve a similar four-color map problem with genetic algorithms can be simply thinking and fast convergence.%遗传算法是模拟生物进化过程的算法，任何问题只要能用一组合适的编码来表示其中的一个可行解，那么这个可行解就可以看做是一个生物个体，若干个可行解就可以看做是一个生物种群。将问题的若干个可行解利用生物进化的特点，最终就可以简单快速地得到问题的一个最优解。利用遗传算法和四色图问题的这一特点，通过遗传算法实现了四色图问题的求解。实验证明，用遗传算法实现类似的四色图问题，思想简单，收敛速度快。
展开▼
