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

被引：35

作者：

J, R

Gupta, K

Kusumakar, HS

Jayaraman, VK

Kulkarni, BD ^{[1
]}

机构：

[1] Natl Chem Lab, Div Chem Engn, Pune, Maharashtra, India

[2] Indian Inst Technol, Dept Chem Engn, Bombay 400076, Maharashtra, India

来源：

JOURNAL OF HEURISTICS | 2003年 / 9卷 / 04期

关键词：

bilevel programming; tabu search;

D O I：

10.1023/A:1025699819419

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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.

引用

页码：307 / 319

页数：13

共 39 条

[1]

[Anonymous], 1997, Tabu Search

[2] SOME PROPERTIES OF THE BILEVEL PROGRAMMING PROBLEM [J].