Harnessing Cellular Automata and Genetic Algorithms To Solve Travelling Salesman Problem
|
 |
|
Post a Comment
|
|
|
|
|
CONTRIBUTORS:
|
|
|
PROCEEDINGS TITLE:
|
|
|
YEAR:
|
2012
|
|
PUB TYPE:
|
Conference Paper in Proceedings
|
|
PAGES:
|
72 -
77
|
|
SUBJECT(S):
|
NP Hard Problem, TSP, Cellular Automata, Genetic Algorithms
|
|
DISCIPLINE:
|
Computer Science
|
|
HTTP:
|
|
|
LANGUAGE:
|
English
|
|
PUB ID:
|
103-501-503
(Last edited on
2012/04/01 09:25:30 GMT-6)
|
|
SPONSOR(S):
|
|
|
ABSTRACT:
The work proposes a Genetic Algorithms (GAs) based approach to solve the problem. The approach is a blend of mathematical craftsmanship and heuristic approaches with approved credibility. The results obtained are encouraging and the work opens a new window of AI to the problem. To generate the initial population of GAs, Cellular Automata (CA) has been used, thus making it a part of the system.
|
|
|
|
STATISTICS
|
|
Click on # to view
|
|
Citations
|
|
0
|
|
References
|
|
0
|
|
Comments
|
|
0
|
|
Quality
|
|
0/0.00
|
|
Interest
|
|
0/0.00
|
|
View(er)s
|
|
1/112
|
|
|
|
|
|
|
| Prev |
Next |
|