A new approach to solve travelling salesman problem

Simple item page
dc.contributor.advisorRashid, Farzana
dc.contributor.advisorShowkat, Dilruba
dc.contributor.authorSarker, Sanjana
dc.date.accessioned2015-02-06T06:21:29Z
dc.date.available2015-02-06T06:21:29Z
dc.date.issued12/28/2014
dc.descriptionCataloged from PDF version of thesis report.
dc.descriptionIncludes bibliographical references (page 60).
dc.descriptionThis thesis report is submitted in partial fulfillment of the requirements for the degree of Bachelor of Science in Computer Science and Engineering, 2014.
dc.description.abstractThe 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.
dc.identifier.otherID 10201013
dc.identifier.otherhttps://dspace.bracu.ac.bd/server/api/core/items/510fa853-cbb6-4ebe-8786-96b923775177
dc.identifier.urihttp://hdl.handle.net/10361/3971
dc.language.isoen
dc.publisherBRAC University
dc.sourceBRAC University Institutional Repository
dc.subjectComputer science and engineering
dc.titleA new approach to solve travelling salesman problem
dc.typeThesis

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
10201013.pdf
Size:
1.64 MB
Format:
Adobe Portable Document Format
Download

Collections

Thesis (Bachelor of Science in Computer Science and Engineering)