DocumentCode
2313059
Title
A Novel Genetic Algorithm Approach to Solve Map Colour Problem
Author
Kumar, Anand
Author_Institution
Chimanbhai Patel P. G. Inst. of Comput. Applic., Gujarat Univ., Ahmedabad
fYear
2008
fDate
16-18 July 2008
Firstpage
288
Lastpage
291
Abstract
This paper presents a genetic algorithm approach to solve the "map colour problem". 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. 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".. 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 algorithms; graph colouring; genetic algorithm; graph colouring; map colour problem; optimization; Biological cells; Biology; Computer applications; Computer simulation; Encoding; Evolution (biology); Genetic algorithms; Genetic engineering; Genetic mutations; Random processes; GA operators; Genetic Algorithm; Map colour;
fLanguage
English
Publisher
ieee
Conference_Titel
Emerging Trends in Engineering and Technology, 2008. ICETET '08. First International Conference on
Conference_Location
Nagpur, Maharashtra
Print_ISBN
978-0-7695-3267-7
Electronic_ISBN
978-0-7695-3267-7
Type
conf
DOI
10.1109/ICETET.2008.82
Filename
4579912
Link To Document