Skip to main content
Log in

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

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Bard, J.F. (1991). “Some Properties of the Bilevel Programming Problem.” Journal of Optimization Theory and Applications 2, 371–378.

    Google Scholar 

  • Bard, J.F. and J.T. Moore. (1990). “A Branch and Bound Algorithm for the Bilevel Programming Problem.” SIAM Journal of Scientific and Statistical Computing 11, 281–292.

    Google Scholar 

  • Batti, R. and G. Tecchiolli. (1996). “The Continuous Reactive Tabu Search: Blending Combinatorial Optimization and Stochastic Search for Global Optimization.” Annals of Operations Research 63, 53–188.

    Google Scholar 

  • Bialas, W.F. and M.H. Karwan. (1984). “Two-Level Linear Programming.” Management Science 30, 1004–1020.

    Google Scholar 

  • Biegler, L.T., I.E. Grossman, and A.W. Westerberg. (1997). Systematic Methods of Chemical Process Design. New Jersey: Prentice Hall PTR.

    Google Scholar 

  • Bonabeau, E., M. Dorigo, and G. Theraulaz. (2000). “Inspiration for Optimization from Social Insect Behavior.” Nature 406, 39–42.

    Google Scholar 

  • Bracken, J. and J. McGill. (1973). “Mathematical Programs with Optimization Problems in the Constraints.” Operations Research 21, 37–44.

    Google Scholar 

  • Brengel, D.D. and W.D. Seider. (1992). “Coordinated Design and Control Optimization of Nonlinear Processes.” Computers and Chemical Engineering 16, 861–886.

    Google Scholar 

  • Calamai, P. and L. Vicente. (1993). “Generating Linear and Linear-Quadratic Bilevel Programming Problems.”SIAM Journal on Scientific and Statistical Computing 14, 770–782.

    Google Scholar 

  • Candler, W. and R. Norton. (1977). “Multilevel Programming.” Technical Report 20, World Bank Development Center, Washington, D.C.

    Google Scholar 

  • Candler, W. and R. Townsley. (1982). “A Linear Two-Level Programming Problem.” Computers and Operations Research 9, 59–76.

    Google Scholar 

  • Chelouah, D. and P. Siarry. (2000). “Tabu Search Applied to Global Optimization.” European Journal of Operations Research 123, 256–270.

    Google Scholar 

  • Clark, P.A. and A. Westerberg. (1983). “Optimization for Design Problems Having More than One Objective.” Computers and Chemical Engineering 7, 259–278.

    Google Scholar 

  • Clark, P.A. and A. Westerberg. (1990). “Bilevel Programming for Chemical Process Design: Fundamentals and Algorithms.” Computers and Chemical Engineering 14, 87–97.

    Google Scholar 

  • Cvijovic, D. and J. Klinowski. (1995). “Tabu Search: An Approach to the Multiple Minima Problem.” Science 267, 664–666.

    Google Scholar 

  • Dempe, S. (1992). “A Necessary and a Sufficient Optimality Condition for Bilevel Programming Problems.” Optimization 25, 341–354.

    Google Scholar 

  • Edmunds, T.A. and J.F. Bard. (1991). “Algorithms for Nonlinear Bilevel Mathematical Programs.” IEEE Trans-actions on Systems, Man and Cybernetics 21, 83–89.

    Google Scholar 

  • Edmunds, T.A. and J.F. Bard. (1992). “An Algorithm for the Mixed Integer Nonlinear Bilevel Programming Problem.” Annals of Operations Research 34, 149–162.

    Google Scholar 

  • Glover, F. (1986). “Future Paths for Integer Programming and Links to Artificial Intelligence.” Computers and Operations Research 13, 533–549.

    Google Scholar 

  • Glover, F. (1989). “Tabu Search-Part I.” ORSA Journal on Computing 1, 190–206.

    Google Scholar 

  • Glover, F. (1990). “Tabu Search-Part II.” ORSA Journal on Computing 2, 4–32.

    Google Scholar 

  • Glover, F., M. Laguna, E. Taillard, and D. de Werra. (1993). “Users Guide to Tabu Search.” Annals of Operations Research 41, 3–28.

    Google Scholar 

  • Glover, F. and M. Laguna. (1997). Tabu Search. Boston: Kluwer Academic Publishers.

    Google Scholar 

  • Hansen, P., B. Jaumard, and G. Savard. (1992). “New Branch-and-Bound Rules for Linear Bilevel Programming.” SIAM Journal on Scientific and Statistical Computing 13, 1194–1217.

    Google Scholar 

  • Jayaraman, V.K., B.D. Kulkarni, and L.K. Doraiswamy. (1981). “A Simple Method of Solution for a Class of Reaction Diffusion Problems.” AIChE Journal 29, 521–523.

    Google Scholar 

  • Jayaraman, V.K. (1993). “An Algorithm for Solving Bidisperse Catalyst Pellet Problems.” Computers and Chemical Engineering 17, 639–642.

    Google Scholar 

  • Kelly, J., M. Laguna, and F. Glover. (1994). “A Study on Diversification Strategies for the Quadratic Assignment Problem.” Computers and Operations Research 22, 885–893.

    Google Scholar 

  • Laguna, M., J. Barnes, and F. Glover. (1993). “Intelligent Scheduling with Tabu Search: An Application to Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs and Times.” Journal of Applied Intelligence 3, 159–172.

    Google Scholar 

  • Laguna, M. and P. Laguna. (1995a). “Applying Tabu Search to the Two-Dimensional Ising Spin Glass.” International Journal of Modern Physics-C 6, 11–23.

    Google Scholar 

  • Laguna, M., J. Kelly, J. González-Velarde, and F. Glover. (1995b). “Tabu Search for the Multilevel Generalized Assignment Problem.” European Journal of Operational Research 82, 176–189.

    Google Scholar 

  • Laguna, M., R. Martí, and V. Campos. (1999). “Intensification and Diversification with Elite Tabu Search Solutions for the Linear Ordering Problem.” Computers and Operations Research 26, 1217–1230.

    Google Scholar 

  • Ors, N. and T. Dogu. (1979). “Effectiveness of Bidisperse Porous Catalysts.” AIChE J. 25, 723–725.

    Google Scholar 

  • Outrata, J. (1994). “On Optimization Problems with Variational Inequality Constraints.” SIAM Journal on Optimization 4, 340–357.

    Google Scholar 

  • Sahin, H.K. and R.A. Ciric. (1998). “A Dual Temperature Simulated Annealing Approach for Solving Bilevel Programming Problems.” Computers and Chemical Engineering 23, 11–25.

    Google Scholar 

  • Siarry, P. and G. Berthiau. (1997). “Fitting of Tabu Search to Optimize Functions of Continuous Variables.” International Journal for Numerical Methods in Engineering 40, 2449–2457.

    Google Scholar 

  • Stackelberg, H. (1952). The Theory of Market Economy. Oxford University Press.

  • Visweswaran, V., C. Floudas, M. Ierapetritou, and E. Pistikopoulos. (1996). “A Decomposition Based Global Optimization Approach for Solving Bilevel Linear and Nonlinear Quadratic Programs.” In Floudas and Pardalos (eds.), State of the Art in Global Optimization: Computational Methods and Applications. Kluwer Academic Publishers.

  • Wen, U. and S. Hsu. (1991). “Linear Bilevel Programming Problems--A Review.” Journal of the Operations Research Society 42, 125–133.

    Google Scholar 

  • Yang, H. and S. Yagar. (1994). “Traffic Assignment and Traffic Control in General Freeway-Arterial Corridor Systems.” Transportation Research 28B, 463–486.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rajesh, J., Gupta, K., Kusumakar, H.S. et al. A Tabu Search Based Approach for Solving a Class of Bilevel Programming Problems in Chemical Engineering. Journal of Heuristics 9, 307–319 (2003). https://doi.org/10.1023/A:1025699819419

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1025699819419

Navigation