Now showing items 1-5 of 5

    • Comparing genetic algorithm crossover and mutation operators for the indexing problem 

      Ghosh, Diptesh (Indian Institute of Management Ahmedabad, 2016-03-18)
      The tool indexing problem is one of allocating tools to slots in a tool magazine so as to minimize the tool change time in automated machining. Genetic algorithms have been suggested in the literature to solve this problem, ...
    • A competitive genetic algorithm for single row facility layout 

      Kothari, Ravi; Ghosh, Diptesh (2013-11-25)
      The single row facility layout is the NP-Hard problem of arranging facilities with given lengths on a line, so as to minimize the weighted sum of the distances between all pairs of facilities. Owing to the computational ...
    • Incorporating gender and age in genetic algorithms to solve the indexing problem 

      Ghosh, Diptesh (Indian Institute of Management Ahmedabad, 2016-04-04)
      In this paper we propose new genetic algorithms for the tool indexing problem. Genetic algorithms are said to be nature-inspired, in that they are modeled after the natural process of genetic evolution. The evolution process ...
    • A new genetic algorithm for the tool indexing problem 

      Ghosh, Diptesh (Indian Institute of Management Ahmedabad, 2016-03-14)
      The tool indexing problem is one of allocating tools to slots in a tool magazine so as to minimize the tool change time in automated machining. This problem has been widely studied in the literature. A genetic algorithm ...
    • Population Heuristics for the Corridor Allocation Problem 

      Ghosh, Diptesh; Kothari, Ravi (2013-11-22)
      The corridor allocation problem is one of assigning a given set of facilities in two rows along a straight corridor so as to minimize a weighted sum of the distances between every pair of facilities. This problem has ...