Comparative study of complexities of genetic algorithms and other hierarchical informed searches
| dc.contributor.author | Kuruppu, G | |
| dc.contributor.author | Pinidiyaarachchi, UAJ | |
| dc.date.accessioned | 2013-10-21T02:25:20Z | |
| dc.date.available | 2013-10-21T02:25:20Z | |
| dc.description.abstract | Search Algorithms are widely used in various contexts of computer science, mainly in finding the optimal solution. Some search algorithms are very accurate but computationally complex, thereby resulting limitations in applying them in practical real time applications. In this paper we discuss A* Search, Greedy Search and Genetic Algorithms comparatively with a modified Genetic Algorithm that we introduce, in the application of complex path finding. Simulation results show that Genetic Algorithm and modified Genetic Algorithm are suitable for path finding problems. | |
| dc.identifier.conference | ITRU Research Symposium | |
| dc.identifier.place | Faculty of Information Technology, University of Moratuwa | |
| dc.identifier.uri | http://dl.lib.mrt.ac.lk/handle/123/8406 | |
| dc.identifier.year | 2011 | |
| dc.language | en | |
| dc.title | Comparative study of complexities of genetic algorithms and other hierarchical informed searches | |
| dc.type | Conference-Abstract |