Now showing items 1-2 of 2

    • Implementing Tabu Search to Exploit Sparsity in ATSP Instances 

      Basu, Sumanta; Gajulapalli, Ravindra S.; Ghosh, Diptesh (2009-07-28)
      Real life traveling salesman problem (TSP) instances are often large, sparse, and asymmetric. Conventional tabu search implementations for the TSP that have been reported in the literature, almost always deals with small, ...
    • A Review of the Tabu Search Literature on Traveling Salesman Problems 

      Basu, Sumanta; Ghosh, Diptesh (2009-07-28)
      he Traveling Salesman Problem (TSP) is one of the most widely studied problems in ombinatorial optimization. It has long been known to be NP-hard and hence research on developing algorithms for the TSP has focused on ...