Browsing Working Papers by Subject "Tabu search"

Now showing items 1-5 of 5

    • Allocating tools to index positions in tool magazines using tabu search 

      Ghosh, Diptesh (Indian Institute of Management Ahmedabad, 2016-02-13)
      The arrangement of tools in tool slots of a tool magazine is an important problem in automated machining environments. This problem is called the indexing problem and has been widely studied in the literature. In this paper ...

    • Exploring lin kernighan neighborhoods for the indexing problem 

      Ghosh, Diptesh (Indian Institute of Management Ahmedabad, 2016-02-29)
      The indexing problem in automated machining environments aims to arrange tools in tool slots of a tool magazine for faster processing of jobs. This problem is called the indexing problem and has been widely studied in the ...

    • 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, ...

    • Neighborhood search heuristicsfor the uncapacitated facility location problem 

      Ghosh, Diptesh (2010-01-16)
      The uncapacitated facility location problem is one of choosing sites among a set of candidates in which facilities can be located, so that the demands of a given set of clients are satisfied at minimum costs. Applications ...

    • 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 ...