Rashid, FarzanaShowkat, DilrubaSarker, Sanjana2015-02-062015-02-06201412/28/2014ID 10201013http://hdl.handle.net/10361/3971Cataloged 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.60 pagesenBRAC 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.Computer science and engineeringThesis