Now showing items 1-1 of 1

    • A new approach to solve travelling salesman problem 

      Sarker, Sanjana (BRAC University, 12/28/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 ...