SIMULATED ANNEALING FOR SOLVING THE TRAVELLING SALESMAN PROBLEM

Simple item page
dc.contributor.authorADEWOLE, A.P.
dc.contributor.authorAGWUEGBO, S.O.N.
dc.contributor.authorOTUBAMOWO, K.
dc.date.accessioned2019-09-16T12:33:07Z
dc.date.available2019-09-16T12:33:07Z
dc.date.issued2011
dc.description.abstractIn this paper we considered the use of Simulated Annealing for solving the Travelling Salesman Problem (TSP) which is NP-Complete. The algorithm searches solutions for the global minimum by perturbing existing solutions and replace if the new solution is better than the existing solution. The annealing process is controlled by some algorithmic parameters and thus the solution relies on the parameters set. Different parameters were used to know the best set of parameters. Generally the algorithm was tested and proved to be a good solver of TSP.en_US
dc.identifier.citationA.P. ADEWOLE, S.O.N. AGWUEGBO and K. OTUBAMOWO. (2011). SIMULATED ANNEALING FOR SOLVING THE TRAVELLING SALESMAN PROBLEM. Journal of Natural Sciences, Engineering and Technology. 10(2): 1-9en_US
dc.identifier.urihttps://ir.unilag.edu.ng/handle/123456789/5564
dc.language.isoenen_US
dc.publisherJournal of Natural Sciences, Engineering and Technologyen_US
dc.relation.ispartofseries10;2
dc.subjectGlobal minimumen_US
dc.subjectLocal Minimalen_US
dc.subjectNP-complete problemen_US
dc.subjectOptimal Solutionsen_US
dc.subjectSimulated Annealingen_US
dc.subjectTraveling Salesman Problemen_US
dc.titleSIMULATED ANNEALING FOR SOLVING THE TRAVELLING SALESMAN PROBLEMen_US
dc.typeArticleen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
ADEWOLE31_SA_FOR_TSP.pdf
Size:
918.12 KB
Format:
Adobe Portable Document Format
Description:
Main article
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Computer Science -Scholarly Publications