Record Details

A tabu search based approach for solving a class of bilevel programming problems in chemical engineering

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title A tabu search based approach for solving a class of bilevel programming problems in chemical engineering
 
Creator RAJESH,J
GUPTA, K
KUSUMAKAR, HS
JAYARAMAN, VK
KULKARNI, BD
 
Subject mathematical programs
optimization problems
design
constraints
algorithms
assignment
branch
bilevel programming
tabu search
 
Description In this paper an approach based on the tabu search paradigm to tackle the bilevel programming problems is presented. The algorithm has been tested for a number of benchmark problems and the results obtained show superiority of the approach over the conventional methods in solving such problems.
 
Publisher KLUWER ACADEMIC PUBL
 
Date 2011-08-17T03:18:14Z
2011-12-26T12:55:18Z
2011-12-27T05:44:04Z
2011-08-17T03:18:14Z
2011-12-26T12:55:18Z
2011-12-27T05:44:04Z
2003
 
Type Article
 
Identifier JOURNAL OF HEURISTICS, 9(4), 307-319
1381-1231
http://dx.doi.org/10.1023/A:1025699819419
http://dspace.library.iitb.ac.in/xmlui/handle/10054/9721
http://hdl.handle.net/10054/9721
 
Language en