Search
Now showing items 31-40 of 45
A multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem
(2005-10-27)
Maximization of submodular functions on a ground set is a NP-hard combinatorial
optimization problem. Data correcting algorithms are among the several algorithms suggested
for solving this problem exactly and approximately. ...
Neighbourhood search heuristics for the uncapacitated facility location problem
(2003-10-22)
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 ...
An efficient genetic algorithm for single row facility layout
(Optimization Letters, 2014)
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 its computational ...
Exploring lin kernighan neighborhoods for the indexing problem
(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 ...
Allocating tools to index positions in tool magazines using tabu search
(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
(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 new genetic algorithm for the tool indexing problem
(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 ...
Incorporating gender and age in genetic algorithms to solve the indexing problem
(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 Quadratic Programming Formulation of the Equidistant Bi-directional Loop Layout Problem
(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 ...
Large Point Source (LPS) emissions from India: regional and sectoral analysis, atmospheric environment
(2001-10-18)
Indian large point sources (LPS) contribute to CO2 andSO2 emissions to a large extent (above 65%) andto CH4,
N2O andNOX emissions to some extent (around10%). The former emissions are primarily from fossil fuel combustion
while ...