| Article ID: | iaor20042848 |
| Country: | Netherlands |
| Volume: | 9 |
| Issue: | 4 |
| Start Page Number: | 307 |
| End Page Number: | 319 |
| Publication Date: | Sep 2003 |
| Journal: | Journal of Heuristics |
| Authors: | Kulkarni B.D., Jayaraman V.K., Rajesh J., Gupta Kapil, Kusumakar Hari Shankar |
| Keywords: | tabu search, bilevel programming, chemical industry |
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.