Browsing Working Papers by Author "Ghosh, Diptesh"
Now showing items 21-30 of 30
-
A Quadratic Programming Formulation of the Equidistant Bi-directional Loop Layout Problem
Ghosh, Diptesh (Indian Institute of Management Ahmedabad, 2015)A loop layout is a common layout used in flexible manufacturing. In such a layout, a set of stations or facilities are to be arranged in a closed loop so that the total cost of flow between each pair of facilities is ... -
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 ... -
Scatter search algorithms for the single row facility layout problem
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, with the objective of minimizing the weighted sum of the distances between all pairs of facilities. The ... -
Sensitivity Analysis for the Single Row Facility Layout Problem
Kothari, Ravi; Ghosh, Diptesh (2013-11-25)The single row facility layout problem (SRFLP) is an important combinatorial optimization problem where a given set of facilities have to be arranged in a single row so as to minimize the weighted sum of the distances ... -
Solving medium to large sized euclidean generalized minimum spanning tree problems
Ghosh, Diptesh (2010-07-14)The generalized minimum spanning tree problem is a generalization of the minimum spanning tree problem. This network design problems finds several practical applications, especially when one considers the design of a ... -
Speeding up neighborhood search for the tool indexing problem
Ghosh, Diptesh (Indian Institute of Management Ahmedabad, 2016)The arrangement of tools in tool holding pockets of a tool magazine in a CNC machining center plays an important role in reducing processing times of complex job processes in automated machining environments. This problem ... -
Speeding Up the Estimation of Expected Maximum Flows through Reliable Networks
Sharma, Megha; Ghosh, Diptesh (2011-05-27)This paper presents a strategy for speeding up the estimation of expected maximum flows through reliable networks. Computational experiments with the strategy on three types of randomly generated networks show that it ... -
Spotting difficult weakly correlated binary knapsack problems
Ghosh, Diptesh; Bandyopadhyay, Tathagata (2010-04-16)We examine in this paper that the possibility of quickly deciding whether or not an instance of a binary knapsack problem is difficult for branch and bound algorithms. We first observe that the distribution of the objective ... -
Tabu search for multi-period facility location: uncapacitated problem with an uncertain number of servers
Vatsa, Amit Kumar; Ghosh, Diptesh (Indian Institute of Management Ahmedabad, 2014)This paper supersedes the work presented in WP.No.2014-02-06. We study the problem of allocating doctors to primary health centers (PHC). We model the problem as a multi-period uncapacitated facility location problem under ... -
Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods
Kothari, Ravi; Ghosh, Diptesh (2013-11-20)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 ...