Now showing items 1-20 of 29

    • 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 ...
    • 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 ...
    • Computing the Probability Mass Function of the Maximum Flow through a Reliable Network 

      Sharma, Megha; Ghosh, Diptesh (2011-05-26)
      This paper proposes a fast state-space enumeration based algorithm called TOP-DOWN capable of computing the probability mass function of the maximum s-t flow through reliable networks. The algorithm computes the probability ...
    • Data correcting algorithms for combinatorial optimization 

      Goldengorin, Boris; Ghosh, Diptesh; Gerard, Sierksma (2009-12-12)
      This paper describes data correcting algorithms. It provides the theory behind the algorithms and presents the implementation details and computational experience with these algorithms on the asymmetric traveling salesperson ...
    • Data correcting: a methodology for obtaining near-optimal solutions 

      Ghosh, Diptesh (2010-01-16)
      In this paper we concern ourselves with the problem of finding near optimal solutions to function that are not amenable to solution by analytic means. This means that given a function and a parameter ? away from the optimal ...
    • Data-correcting algorithm for the maximization of submodular functions: a multilevel search in the hasse diagram 

      Goldengorin, Boris; Ghosh, Diptesh (2010-01-16)
      The Data Correcting Algorithm (DCA) is a recursive branch and bound type algorithm, in which the data of a given instance is heuristically corrected at each branching in such a way that the new instance will be as close ...
    • An empirical investigation into randomly generated euclidean symmetric traveling salesman problems 

      Sharma, Megha; Ghosh, Diptesh (2010-07-22)
      The traveling salesman problem is one of the most well-solved hard combinatorial optimization problems. Any new algorithm or heuristic for the traveling salesman problem is empirically evaluated based on its performance ...
    • Evaluating Downside Risks in Reliable Networks 

      Sharma, Megha; Ghosh, Diptesh (2011-05-27)
      Reliable networks are those in which network elements have a positive probability of failing. Conventional performance measures for such networks concern themselves either with expected network performance or with the ...
    • 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 ...
    • Identifying defective valves in a blowout preventer valve network 

      Ghosh, Diptesh (2013-11-26)
      Blowouts are nancially damaging for drilling companies and are ecological hazards. Hence blowout prevention equipment is critical infrastructure for drilling companies. Blowout preventer valves are important components ...
    • 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, ...
    • 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 Lin-Kernighan heurisitic for single row facility layout 

      Kothari, Ravi; Ghosh, Diptesh (2013-11-25)
      The single row facility layout problem (SRFLP) is the problem of arranging facilities with given lengths on a line, while minimizing the weighted sum of the distances between all pairs of facilities. The problem is known ...
    • 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 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 ...
    • Obtaining near-optimal solutions for the binary knapsack problem 

      Goldengorin, B.; Ghosh, Diptesh (2010-01-16)
      In this paper we consider the well-known binary knapsack problem. We propose a method of embedding heuristicsi in a branch and bound framework to optain solutions with profits within a pre-specified quality parameter within ...
    • On the Blowout Preventer Testing Problem: An approach to checking for leakage in BOP networks 

      Ghosh, Diptesh (2013-11-20)
      Blowout Preventers (BOPs) and choke manifolds are key pieces of drilling rig equipment o prevent the uncontrolled release of potentially hazardous formation uids to surface. The blowout prevention testing problem is ...
    • Path relinking for single row facility layout 

      Kothari, Ravi; Ghosh, Diptesh (2013-11-22)
      The single row facility layout problem is the problem of arranging facilities with given lengths on a line, while minimizing the weighted sum of the distances between all pairs of facilities. The problem is NP-hard. In ...
    • 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 ...