Skip to main content

A Hybrid Intelligent Algorithm for Solving the Bilevel Programming Models

  • Conference paper
Knowledge-Based and Intelligent Information and Engineering Systems (KES 2010)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6277))

Abstract

In this paper, genetic algorithm (GA) and neural network (NN) are integrated to produce a hybrid intelligent algorithm for solving the bilevel programming models. GA is used to select a set of potential combination from the entire generated combination. Then a meta-controlled Boltzmann machine which is formulated by comprising a Hopfield network and a Boltzmann machine (BM) is used to effectively and efficiently determine the optimal solution. The proposed method is used to solve the examples of bilevel programming for two- level investment in a new facility. The upper layer will decide the optimal company investment. The lower layer is used to decide the optimal department investment. Typical application examples are provided to illustrate the effectiveness and practicability of the hybrid intelligent algorithm.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Candler, W., Norton, R.: Multilevel programming. Technical Report 20, World Bank Development Research Center, Washinton, DC (1977)

    Google Scholar 

  2. Bard, J., Moore, J.: A branch and bound algorithm for the bilevel programming problem. SIAM Journal on Scientific and Statistical Computing 11(2), 281–292 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  3. Aiyoshi, E., Shimizu, K.: A solution method for the static constrained stackelberg problem via penalty method. IEEE Transactions on Automatic Control 29(12), 1111–1114 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  4. Wen, U., Huang, A.: Simple tabu search method to solve the mixed-integer linear bilevel programming problem. European Journal of Operation Research 88(3), 563–571 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  5. Bard, J.F.: Coordination of a multidivisional organization through two levels of management. Omega 11(5), 457–468 (1983)

    Article  Google Scholar 

  6. Carrion, M., Arroyo, J.M., Conejo, A.J.: A bilevel stochastic programming approach for retailer futures market trading. IEEE Transactions on Power Systems 24(3), 1446–1456 (2009)

    Article  Google Scholar 

  7. Shimizu, K., Ishizuka, Y., Bard, J.F.: Nondifferentiable and two-level mathematical programming. Kluwer Academic, Boston (1997)

    MATH  Google Scholar 

  8. Colson, B., Marcotte, P., Savard, G.: Bilevel programming: A survey. International Journal of Operations Research 3(2), 87–107 (2005)

    MATH  MathSciNet  Google Scholar 

  9. Al-Khayyal, F., Horst, R., Paradalos, P.: Global optimization on concave functions subject to quadratic constraints: an application in nonlinear bilevel programming. Annals of Operations Research 34(1), 125–147 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  10. Edmunds, T., Bard, J.F.: An algorithm for the mixed-integer nonlinear bilevel programming problem. Annals of Operations Research 34(1), 149–162 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  11. Savard, G., Gauvin, J.: The steepest descent direction for the nonlinear bilevel programming problem. Operations Research Letters 15(5), 265–272 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  12. Vicente, L., Savarg, G., Judice, J.: Descent approaches for quadratic bilevel programming. Journal of Optimization Theory and Applications 81(2), 379–399 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  13. Hejazi, S.R., Memariani, A., Jahanshanloo, G., Sepehri, M.M.: Bilevel programming solution by genetic algorithms. In: Proceeding of the First National Industrial Engineering Conference (2001)

    Google Scholar 

  14. Yin, Y.: Genetic algorithms based approach for bilevel programming models. Journal of Transportion Engineering 126(2), 110–120 (2000)

    Google Scholar 

  15. Shih, H.S., Wen, U.P.: A neural network approach for multi-objective and multilevel programming problems. Journal of Computer and Mathematics with Applications 48(1-2), 99–108 (2004)

    MathSciNet  Google Scholar 

  16. Lan, K.M., Wen, U.P.: A hybrid neural network approach to bilevel programming problems. Applied Mathematics Letters 20(8), 880–884 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  17. Hopfield, J.J.: Neural networks and physical systems with emergent collective computational abilities. In: Proceedings of National Science, pp. 2554–2558 (1982)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yaakob, S.B., Watada, J. (2010). A Hybrid Intelligent Algorithm for Solving the Bilevel Programming Models. In: Setchi, R., Jordanov, I., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based and Intelligent Information and Engineering Systems. KES 2010. Lecture Notes in Computer Science(), vol 6277. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15390-7_50

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15390-7_50

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15389-1

  • Online ISBN: 978-3-642-15390-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics