Skip to main content

Bilevel Optimization Using Bacteria Foraging Optimization Algorithm

  • Conference paper
  • First Online:
Swarm, Evolutionary, and Memetic Computing (SEMCCO 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8947))

Included in the following conference series:

Abstract

Bilevel programming problems involve two optimization problems where the constraint region of the first level problem is implicitly determined by another optimization problem. There are number of different algorithms developed based on classical deterministic optimization methods for Bilevel Optimizations Problems (BLOP), but these are very much problem specific, non-robust and computation intensive when number of decision variables increase, while not applicable for multi-modal problems. Evolutionary Algorithms are inherently parallel, capable of local as well as global search, random, and robust techniques and can used to solve these BLOPs. In this paper, Bilevel Bacteria Foraging Optimization Algorithm (BiBFOA) is proposed for solving BLOP based on the foraging technique of common bacteria. Experimental results demonstrate the validity of the BFOA-based algorithm for solution of BLOPs.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Hansen, P., Jaumard, B., Savard, G.: New branch-and-bound rules for linear bilevel programming. SIAM J. Sci. Stat. Comput. 13(5), 1194–1217 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  2. Vicente, L., Savard, G., Júdice, J.: Descent approaches for quadratic bilevel programming. J. Optim. Theory Appl. 81(2), 379–399 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  3. Zhang, G., Zhang, G., Gao, Y., Lu, J.: A bilevel optimization model and a PSO-based algorithm in day-ahead electricity markets. In: Proceeds of the 2009 IEEE International Conference on Systems, Man and Cybernetics (SMC 2009), pp. 611–616, Texas, USA, October 2009

    Google Scholar 

  4. Sinha, A., Malo, P., Deb, K.: Efficient Evolutionary Algorithm for Single-Objective Bilevel Optimization. CoRR (2013). abs/1303.3901

    Google Scholar 

  5. Sinha, A., Malo, P., Deb, K.: Test problem construction for single-objective bilevel optimization. Evol. Comput. 22(3), 439–477 (2014)

    Article  Google Scholar 

  6. Deb, K., Sinha, A.: An efficient and accurate solution methodology for bilevel multi-objective programming problems using a hybrid evolutionary-local-search algorithm. Evol. Comput. 18(3), 403–449 (2010)

    Article  Google Scholar 

  7. Wang, G., Wan, Z., Wang, X., Lv, Y.: Genetic algorithm based on simplex method for solving linear-quadratic bilevel programming problem. Comput. Math Appl. 56(10), 2550–2555 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  8. Calvete, H.I., Gale, C., Mateo, P.M.: A new approach for solving linear bilevel problems using genetic algorithms. Eur. J. Oper. Res. 188(1), 14–28 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  9. Passino, K.M.: Biomimicry of bacterial foraging for distributed optimization and control. IEEE Control Syst. Mag. 22(3), 52–67 (2002)

    Article  MathSciNet  Google Scholar 

  10. Mahapatra, G., Banerjee, S.: A study of bacterial foraging optimization algorithm and its applications to solve simultaneous equations. Int. J. Comput. Appl. 72(5), 1–6 (2013)

    Google Scholar 

  11. Li, J., Dang, J., Bu, F., Wang, J.: Analysis and improvement of the bacterial foraging optimization algorithm. J. Comput. Sci. Eng. 8(1), 1–10 (2014)

    Article  Google Scholar 

  12. Das, S., Biswas, A., Dasgupta, S., Abraham, A.: Bacterial foraging optimization algorithm: theoretical foundations, analysis, and applications. In: Abraham, A., Hassanien, A.-E., Siarry, P., Engelbrecht, A. (eds.) Foundations of Computational Intelligence Volume 3. SCI, vol. 203, pp. 23–55. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  13. Dasgupta, S., Das, S., Abraham, A., Biswas, A.: Adaptive computational chemotaxis in bacterial foraging optimization: an analysis. Evol. Comput. IEEE Trans. 13(4), 919–941 (2009)

    Article  Google Scholar 

  14. Parsopoulos, K.E., Vrahatis, M.N.: Recent approaches to global optimization problems through particle swarm optimization. Nat. Comput. 1(2–3), 235–306 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  15. Bard, J.F.: Practical Bilevel Optimization. Norwell, Kluwer, MA (1998)

    Book  MATH  Google Scholar 

  16. Dempe, S.: Foundations of Bilevel Programming. Springer, Heidelberg (2002)

    MATH  Google Scholar 

Download references

Acknowledgement

The authors wish to acknowledge the support of the Post Graduate Teaching and Research Council of Asutosh College.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gautam Mahapatra .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Mahapatra, G., Banerjee, S., Suganthan, P.N. (2015). Bilevel Optimization Using Bacteria Foraging Optimization Algorithm. In: Panigrahi, B., Suganthan, P., Das, S. (eds) Swarm, Evolutionary, and Memetic Computing. SEMCCO 2014. Lecture Notes in Computer Science(), vol 8947. Springer, Cham. https://doi.org/10.1007/978-3-319-20294-5_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-20294-5_31

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-20293-8

  • Online ISBN: 978-3-319-20294-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics