Skip to main content
SpringerLink
Log in
Book cover

International Conference on Artificial Intelligence and Soft Computing

ICAISC 2006: Artificial Intelligence and Soft Computing – ICAISC 2006 pp 1169–1178Cite as

A Hierarchical Particle Swarm Optimization for Solving Bilevel Programming Problems

  • Conference paper

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

Abstract

The bilevel programming problem (BLPP) has proved to be a NP-hard problem. In this paper, we propose a hierarchial particle swarm optimization (PSO) for solving general BLPPs. Unlike most traditional algorithms designed for specific versions or based on specific assumptions, the proposed method is a hierarchical algorithm framework, which solves the general bilevel programming problems directly by simulating the decision process of bilevel programming. The solving general BLPPs is transformed to solve the upper-level and lower-level problems iteratively by two variants of PSO. The variants of PSO are built to solve upper-level and lower-level constrained optimization problems. The experimental results compared with those of other methods show that the proposed algorithm is a competitive method for solving general BLPPs.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   139.00
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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dempe, S.: Foundations of Bilevel Programming. In: Nonconvex optimization and its application, vol. 61, Kluwer Academic Publishers, Dordrecht (2002)

    Google Scholar 

  2. Colson, B., Marcotte, P., Savard, G.: Bilevel programming: A survey. 4OR: Quarterly Journal of the Belgian, French and Italian Operations Research Societies 3, 87–107 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  3. Chiou, S.W.: Bilevel programming for the continuous transport network design problem. Transportation Research Part B: Methodological 39, 383 (2005)

    Google Scholar 

  4. Shi, C., Lu, J., Zhang, G.: An extended kuhn-tucker approach for linear bilevel programming. Applied Mathematics and Computation 162, 63 (2005)

    Article  MathSciNet  Google Scholar 

  5. Shih, H., Lai, Y., Lee, E.: Fuzzy apporach for multi-level programming problems. Computers and Operations Research 23, 773–791 (1983)

    MathSciNet  Google Scholar 

  6. Marcotte, P., Savard, G., Zhu, D.L.: A trust region algorithm for nonlinear bilevel programming. Operations Research Letters 29, 179 (2001)

    Article  MathSciNet  Google Scholar 

  7. Wang, Y., Jiao, Y., Li, H.: An evolutionary algorithm for solving nonlinear bilevel programming based on a new constraint-handling scheme. IEEE Transactions on Systems, Man, and Cybernetics, Part C 35, 221 (2005)

    Article  Google Scholar 

  8. Sahin, K.H., Ciric, A.R.: A dual temperature simulated annealing approach for solving bilevel programming problems. Computers and Chemical Engineering 23, 25 (1998)

    Article  Google Scholar 

  9. Genderau, M., Marcotte, P., Savard, G.: A hybrid tabu-ascent algorithm for the linear bilevel programming problem. Journal of Global Optimization 8, 217–233 (1996)

    Article  Google Scholar 

  10. Kennedy, J., Eberhart, R., Shi, Y.: Swarm intelligence. Morgan Kaufmann Publisher, San Francisco (2001)

    Google Scholar 

  11. Powell, D., Skolnick, M.M.: Using genetic algorithms in engineering design optimization with non-linear constraints. In: Proceedings of the Fifth International Conference on Genetic Algorithms, Los Altos, CA, Morgan Kaufmann, San Francisco (1993)

    Google Scholar 

  12. Shi, Y., Eberhart, R.: A modified particle swarm optimizer. In: Proceedings of IEEE World Congress on Computational Intelligence 1998, pp. 69–73 (1998)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  14. Shimizu, K., Aiyoshi, E.: A new computational method for syackelberg and min-max problems by use of a penalty method. IEEE Transaction on Autommatic Control AC-26, 460–466 (1981)

    Article  MathSciNet  Google Scholar 

  15. Bard, J.: Convex two-level optimization. Mathematical Programming 40, 15–27 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  16. Calvete, H.I., Gale, C.: Theory and methodology: The bilevel linear/linear fractional programming problem. European Journal of Operation Research 114, 188–197 (1999)

    Article  MATH  Google Scholar 

  17. Outrata, J.V.: On the numerical solution of a class of stackelberg problems. Zeitschrift Fur Operation Research 34, 255–278 (1990)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Antai College of Economics & Management, Shanghai Jiaotong University, Shanghai, 200052, P.R. China

    Xiangyong Li & Peng Tian

  2. School of Finance, Jiangxi University of Finance and Economics, Nanchang, 330013, P.R. China

    Xiaoping Min

Authors
  1. Xiangyong Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peng Tian
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xiaoping Min
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Artificial Intelligence, Academy of Humanities and Economics, Poland

    Leszek Rutkowski

  2. Institute of Automatics, AGH University of Science and Technology, Al. Mickiewicza 30, PL-30-059, Kraków, Poland

    Ryszard Tadeusiewicz

  3. Department of Electrical Engineering and Computer Sciences, Berkeley Initiative in Soft Computing (BISC), University of California, 94720-1776, Berkeley, CA, USA

    Lotfi A. Zadeh

  4. Department of Electrical Engineering, University of Louisville, 40292, Louisville, KY, U.S.A

    Jacek M. Żurada

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, X., Tian, P., Min, X. (2006). A Hierarchical Particle Swarm Optimization for Solving Bilevel Programming Problems. In: Rutkowski, L., Tadeusiewicz, R., Zadeh, L.A., Żurada, J.M. (eds) Artificial Intelligence and Soft Computing – ICAISC 2006. ICAISC 2006. Lecture Notes in Computer Science(), vol 4029. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11785231_122

Download citation

  • DOI: https://doi.org/10.1007/11785231_122

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35748-3

  • Online ISBN: 978-3-540-35750-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation