A Tabu Search Based Approach for Solving a Class of Bilevel Programming Problems in Chemical Engineering

Authors:
Rajesh J.;Kapil Gupta;Hari Shankar Kusumakar;V. K. Jayaraman;B. D. Kulkarni
Affiliations:
Department of Chemical Engineering, Indian Institute of Technology, Mumbai, India;Department of Chemical Engineering, Indian Institute of Technology, Mumbai, India;Department of Chemical Engineering, Indian Institute of Technology, Mumbai, India;Chemical Engineering Division, National Chemical Laboratory, Pune, India;Chemical Engineering Division, National Chemical Laboratory, Pune, India. bdk@ems.ncl.res.in
Venue:
Journal of Heuristics
Year:
2003

Citing 10
Cited 2

Future paths for integer programming and links to artificial intelligence

Computers and Operations Research - Special issue: Applications of integer programming
A branch and bound algorithm for the bilevel programming problem

SIAM Journal on Scientific and Statistical Computing
Some properties of the bilevel programming problem

Journal of Optimization Theory and Applications
New branch-and-bound rules for linear bilevel programming

SIAM Journal on Scientific and Statistical Computing
An algorithm for the mixed-integer nonlinear bilevel programming problem

Annals of Operations Research - Special issue on hierarchical optimization
Generating linear and linear-quadratic bilevel programming problems

SIAM Journal on Scientific Computing
A user's guide to tabu search

Annals of Operations Research - Special issue on Tabu search
A study of diversification strategies for the quadratic assignment problem

Computers and Operations Research - Special issue: heuristic, genetic and tabu search
Intensification and diversification with elite tabu search solutions for the linear ordering problem

Computers and Operations Research
Tabu Search

Tabu Search

Application of particle swarm optimization algorithm for solving bi-level linear programming problem

Computers & Mathematics with Applications
Bilevel model for production-distribution planning solved by using ant colony optimization

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.