Skip to main content
Presentation
A Novel Genetic Algorithm approach to solve Map Colour Problem
International Conference (2008)
  • anand kumar
Abstract

The Map colour problem states that given any plane separated into regions, such as a political map of the states of a country, the regions may be coloured using two colours in such a way that no two adjacent regions receive the same colour. Two regions are called adjacent only if they share a border segment, not just a point. In this paper I have used genetic algorithm to find the solution for this kind of problem. Genetic Algorithms are being used extensively in optimization problem as an alternative to traditional heuristics. It is an appealing idea that the natural concepts of evolution may be borrowed for use as a computational optimization technique and the result is “Genetic Algorithm”, which is based on the principle “Survival of the fittest” given by “Darvin”. In this paper I have used genetic algorithm as an optimization technique to provide the solution for “Map colour problem”. I have tried to show that genetic algorithm is an alternative solution for those problems where conventional deterministic methods are not able to provide the optimal solution.

Keywords
  • Genetic Algorithm,
  • Map colour,
  • GA operators.
Disciplines
Publication Date
Summer July 16, 2008
Citation Information
anand kumar. "A Novel Genetic Algorithm approach to solve Map Colour Problem" International Conference (2008)
Available at: http://works.bepress.com/anandkumar/3/