A Genetic Algorithm for Solving Travelling Salesman Problem
| dc.contributor.author | Adewole, P. | |
| dc.contributor.author | Akinwale, A.T. | |
| dc.contributor.author | Otunbanowo, K | |
| dc.date.accessioned | 2019-09-10T11:27:06Z | |
| dc.date.available | 2019-09-10T11:27:06Z | |
| dc.date.issued | 2011 | |
| dc.description | Staff publications | en_US |
| dc.description.abstract | In this paper we present a Genetic Algorithm for solving the Travelling Salesman problem (TSP). Genetic Algorithm which is a very good local search algorithm is employed to solve the TSP by generating a preset number of random tours and then improving the population until a stop condition is satisfied and the best chromosome which is a tour is returned as the solution. Analysis of the algorithmic parameters (Population, Mutation Rate and Cut Length) was done so as to know how to tune the algorithm for various problem instances. | en_US |
| dc.identifier.citation | Adewole, P, Akinwale, A.T, Otunbanowo,K. (2011). A Genetic Algorithm for Solving Travelling Salesman Problem. International Journal of Advanced Computer Science and Applications, Vol.2(1): 26-29pp. | en_US |
| dc.identifier.uri | https://ir.unilag.edu.ng/handle/123456789/5461 | |
| dc.language.iso | en | en_US |
| dc.publisher | International Journal of Advanced Computer Science and Applications | en_US |
| dc.relation.ispartofseries | International Journal of Advanced Computer Science and Applications;Vol.2(1) | |
| dc.subject | Genetic Algorithm | en_US |
| dc.subject | Generation | en_US |
| dc.subject | Population | en_US |
| dc.subject | Travelling Salesman Problem | en_US |
| dc.subject | Research Subject Categories::TECHNOLOGY::Information technology::Computer science | en_US |
| dc.title | A Genetic Algorithm for Solving Travelling Salesman Problem | en_US |
| dc.type | Article | en_US |