| Four color theorem, is also called "four color conjecture (4CC)" and is also known as "fourcolor problem". It refers to a map filled with only four colors, and each region of the map can befilled one color, and adjacent areas of the map with different colors. Successfully certification offour color theorem make the cartography in the efficiency has been greatly improved. So, it ismeaningful to find a more reasonable optimization algorithm to solve the four color problem formap coloring. Traditional algorithms can only be applied to deal with the smaller dimensionsproblems. Once the problem is large, Time consuming of the algorithm often growsexponentially. So, it is necessary to propose a highly intelligent optimization algorithm.This article has analyzed the background and status of researching both at home and abroadon the four color problem for map coloring firstly, expresses the importance and practicality ofsolving the four color problem for map coloring by an efficient and intelligent optimizationalgorithm. Then the article has introduced the abstract model of four-color problem for mapcoloring, proposed the solution. Through analyzed the principle and process of the existingsearch algorithms that such as genetic algorithm and simulates annealing algorithm, this articlesummed up the advantages and shortcomings of the genetic algorithm and simulated annealingalgorithm when dealing the four-color problem for map coloring separately, and then comparesthe genetic algorithm and simulated annealing algorithm. It designed improvement process ofgenetic algorithm next, and designed integration process with simulated annealing algorithm,then developed a map coloring module. Through experiments and convergence analysis, it obtainthat the improved algorithm is superior than the standard genetic algorithm. Finally, the modulehas been embedded in the experimental platform and used in the production practice ofcartography. |
PDF Full Text Request