A new approach to solve travelling salesman problem

Cataloged from PDF version of thesis report.

Մատենագիտական մանրամասներ
Հիմնական հեղինակ: Sarker, Sanjana
Այլ հեղինակներ: Rashid, Farzana
Ձևաչափ: Թեզիս
Լեզու:English
Հրապարակվել է: BRAC University 2015
Խորագրեր:
Առցանց հասանելիություն:http://hdl.handle.net/10361/3971
id 10361-3971
record_format dspace
spelling 10361-39712022-01-26T10:10:30Z A new approach to solve travelling salesman problem Sarker, Sanjana Rashid, Farzana Showkat, Dilruba Department of Computer Science and Engineering, BRAC University Computer science and engineering Cataloged from PDF version of thesis report. Includes bibliographical references (page 60). This thesis report is submitted in partial fulfillment of the requirements for the degree of Bachelor of Science in Computer Science and Engineering, 2014. 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. Sanjana Sarker B. Computer Science and Engineering 2015-02-06T06:21:29Z 2015-02-06T06:21:29Z 2014 12/28/2014 Thesis ID 10201013 http://hdl.handle.net/10361/3971 en 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. 60 pages application/pdf BRAC University
institution Brac University
collection Institutional Repository
language English
topic Computer science and engineering
spellingShingle Computer science and engineering
Sarker, Sanjana
A new approach to solve travelling salesman problem
description Cataloged from PDF version of thesis report.
author2 Rashid, Farzana
author_facet Rashid, Farzana
Sarker, Sanjana
format Thesis
author Sarker, Sanjana
author_sort Sarker, Sanjana
title A new approach to solve travelling salesman problem
title_short A new approach to solve travelling salesman problem
title_full A new approach to solve travelling salesman problem
title_fullStr A new approach to solve travelling salesman problem
title_full_unstemmed A new approach to solve travelling salesman problem
title_sort new approach to solve travelling salesman problem
publisher BRAC University
publishDate 2015
url http://hdl.handle.net/10361/3971
work_keys_str_mv AT sarkersanjana anewapproachtosolvetravellingsalesmanproblem
AT sarkersanjana newapproachtosolvetravellingsalesmanproblem
_version_ 1814307839335727104