Neural, Parallel & Scientific Computations
A hybrid genetic hill-climbing algorithm for four-coloring map problems
Design and application of hybrid intelligent systems
| Hi-index | 0.00 |
A harmony theory artificial neural network solution to the map coloring problem is presented. Map coloring aims at assigning a unique color to each area of a given map so that no two adjacent areas receive identical colors. The harmony theory implementation is able to determine whether the map coloring problem can be solved with a predefined number of colors as well as which is the smallest number of colors that can solve the map coloring problem. The present implementation directly encodes the given problem into the artificial neural network so that a solution is represented simply by node activation. Additionally, the consensus function of harmony theory produces a quick and definite solution to the colorability problem, obviating the need for manual validation of the result