| dc.contributor.advisor | Rashid, Farzana | |
| dc.contributor.advisor | Showkat, Dilruba | |
| dc.contributor.author | Sarker, Sanjana | |
| dc.date.accessioned | 2015-02-06T06:21:29Z | |
| dc.date.available | 2015-02-06T06:21:29Z | |
| dc.date.copyright | 2014 | |
| dc.date.issued | 12/28/2014 | |
| dc.identifier.other | ID 10201013 | |
| dc.identifier.uri | http://hdl.handle.net/10361/3971 | |
| dc.description | Cataloged from PDF version of thesis report. | |
| dc.description | Includes bibliographical references (page 60). | |
| dc.description | This thesis report is submitted in partial fulfillment of the requirements for the degree of Bachelor of Science in Computer Science and Engineering, 2014. | en_US |
| dc.description.abstract | The travelling Salesman Problem is one of the most NP-hard problems.
Our research provides a yieldable method for solving the problem using
genetic algorithm. To solve TSP we use genetic algorithm, a search
algorithm which generates random tours and using crossover technique
it gives almost optimized solution for for these kinds of problems. We are
introducing a map reduction technique with Genetic Algorithm to create
a new approach to solve TSP. | en_US |
| dc.description.statementofresponsibility | Sanjana Sarker | |
| dc.format.extent | 60 pages | |
| dc.language.iso | en | en_US |
| dc.publisher | BRAC University | en_US |
| dc.rights | BRAC University thesis are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. | |
| dc.subject | Computer science and engineering | en_US |
| dc.title | A new approach to solve travelling salesman problem | en_US |
| dc.type | Thesis | en_US |
| dc.contributor.department | Department of Computer Science and Engineering, BRAC University | |
| dc.description.degree | B. Computer Science and Engineering | |
