Skip to main content
SpringerLink
Log in

A hybrid heuristic approach with adaptive scalarization for linear semivectorial bilevel programming and its application

  • Regular research paper
  • Published:
Memetic Computing Aims and scope Submit manuscript

Abstract

This article focuses on a heuristic solution strategy with adaptive scalarization for linear semivectorial bilevel programming (LSVBLP) as well as its practical application. An adaptive scalarization approach is adopted to the lower level multiobjective optimization problem to make it become a single objective linear programming (LP). The linear bilevel formulation can be reformulated as single-level programming with complementary constraints using the duality theory of LP, such that it is now equivalent to a single-level mixed-integer LP. To solve this resulting mixed-integer LP, a specific variable grouping strategy is proposed to reduce the computational complexity, in which all variables are divided into two groups: one group includes mixed-integer variables, and the other group only contains real-valued variables. In each iteration, the mixed-integer variables in the first group only need to be obtained by the improved mixed-coding differential evolution, while the pure real-valued variables in the second group are obtained by an LP solver. Experimental results on some numerical instances indicate that the proposed hybrid heuristic algorithm is comparable to or better than other algorithms in the literature. To demonstrate its practicability, a customer-oriented production-distribution planning problem is modeled as an LSVBLP, and then the model is solved effectively.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

Data availability statement

Some or all data, models, or code generated or used during the study are available from the corresponding author by request.

References

  1. Ankhili Z, Mansouri A (2009) An exact penalty on bilevel programs with linear vector optimization lower level. Eur J Oper Res 197:36–41

    Article  MathSciNet  MATH  Google Scholar 

  2. Audet C, Hansen P, Jaumard B, Savard G (1997) Links between linear bilevel and mixed 0–1 programming problems. J Optim Theory Appl 93:273–300

    Article  MathSciNet  MATH  Google Scholar 

  3. Bard JF (1998) Practical bilevel optimization: algorithms and applications. Kluwer, Dordrecht

    Book  MATH  Google Scholar 

  4. Bonnel H, Morgan J (2006) Semivectorial bilevel optimization problem: penalty approach. J Optim Theory Appl 131(3):365–382

    Article  MathSciNet  MATH  Google Scholar 

  5. Bonnel H (2006) Optimality conditions for the semivectorial bilevel optimization problem. Pac J Optim 2:447–467

    MathSciNet  MATH  Google Scholar 

  6. Calvete HI, Galé C (2008) Bilevel multiplicative problems: a penalty approach to optimality and a cutting plane based algorithm. J Comput Appl Math 218(2):259–269

    Article  MathSciNet  MATH  Google Scholar 

  7. Calvete HI, Galé C, Mateo P (2008) A new approach for solving linear bilevel problems using genetic algorithms. Eur J Oper Res 188:14–28

    Article  MathSciNet  MATH  Google Scholar 

  8. Calvete HI, Galé C (2010) A multiobjective bilevel program for production-distribution planning in a supply chain. Multiple Criteria Decision Making for Sustainable Energy and Transportation Systems, Lecture Notes in Economics and Mathematical Systems 634:155–165

  9. Calvete HI, Galé C (2011) On linear bilevel problems with multiple objectives at the lower level. Omega 39:33–40

    Article  Google Scholar 

  10. Dempe S (2002) Foundations of bilevel programming. Kluwer Academic Publishers, Dordrecht

    MATH  Google Scholar 

  11. Dempe S, Kalashnikov V, Ríos-Mercado RZ (2005) Discrete bilevel programming: application to a natural gas cash-out problem. Eur J Oper Res 166:469–488

    Article  MathSciNet  MATH  Google Scholar 

  12. Dempe S, Dutta J (2012) Is bilevel programming a special case of a mathematical program with complementarity constraints. Math Program Ser A 131:37–48

    Article  MathSciNet  MATH  Google Scholar 

  13. Dempe S, Gadhi N, Zemkoho AB (2013) New optimality conditions for the semivectorial bilevel optimization problem. J Optim Theory Appl 157:54–74

    Article  MathSciNet  MATH  Google Scholar 

  14. Hejazi SR, Memariani A, Jahanshahloo G, Sepehri MM (2002) Linear bilevel programming solution by genetic algorithm. Comput Oper Res 29:1913–1925

    Article  MathSciNet  MATH  Google Scholar 

  15. Júdice JJ, Faustino A (1992) A sequential LCP algorithm for bilevel linear programming. Ann Oper Res 34:89–106

    Article  MathSciNet  MATH  Google Scholar 

  16. Kuo RJ, Huang CC (2009) Application of particle swarm optimization algorithm for solving bi-level linear programming problem. Comput Math Appl 58:678–685

    Article  MathSciNet  MATH  Google Scholar 

  17. Li H, Jiao YC, Zhang FS, Zhang L (2009) An efficient method for linear bilevel programming problems based on the orthogonal genetic algorithm. Int J Innov Comput I 5:2837–2846

    Google Scholar 

  18. Li H, Zhang L (2014) A differential evolution with two mutation strategies and a selection based on an improved constraint-handling technique for bilevel programming problems. Math Probl Eng 2014:1–16

    MathSciNet  Google Scholar 

  19. Li H, Zhang L (2015) Solving linear bilevel programming problems using a binary differential evolution. 11th International Conference on Computational Intelligence and Security (CIS), pp 38–42

  20. Li H, Zhang L, Li HC (2019) Modified NSGA-II based interactive algorithm for linear multiobjective bilevel programs. In: 15th International conference on computational intelligence and security (CIS), pp 406–410

  21. Li H, Zhang L (2021) An efficient solution strategy for bilevel multiobjective optimization problems using multiobjective evolutionary algorithm. Soft Comput 25:8241–8261

    Article  Google Scholar 

  22. Lu J, Han J, Hu Y, Zhang G (2016) Multilevel decision-making: a survey. Inform Sci 346:463–487

  23. Lv Y, Wan Z (2014) A solution method for the optimistic linear semivectorial bilevel optimization problem. J Inequal Appl 2014:164–174

    Article  MathSciNet  MATH  Google Scholar 

  24. Lv Y, Wan Z (2015) Solving linear bilevel multiobjective programming problem via exact penalty function approach. J Inequal Appl 258:1–12

  25. Mathieu R, Pittard L, Anandalingam G (1994) Genetic algorithms based approach to bi-level linear programming. RAIRO-Oper Res 28(1):1–22

    Article  MathSciNet  MATH  Google Scholar 

  26. Moshirvaziri K, Amouzegar MA, Jacobsen SE (1996) Test problem construction for linear bilevel programming problems. J Glob Optim 8:235–243

    Article  MathSciNet  MATH  Google Scholar 

  27. Nishizaki I, Sakawa M, Niwa K, Kitaguchi Y (2002) A computational method using genetic algorithms for obtaining Stackelberg solutions to two-level linear programming problems. Electron Commun Japan, Part 3 85(6):55–62

  28. Nishizaki I, Sakawa M (2009) Cooperative and noncooperative multi-Level programming. Operations Research/Computer Science Interfaces Series, Springer

  29. Ren A, Wang Y (2016) A novel penalty function method for semivectorial bilevel programming problem. Appl Math Model 40:135–149

    Article  MathSciNet  MATH  Google Scholar 

  30. Shi C, Lu J, Zhang G (2005) An extended Kth-best approach for linear bilevel programming. Appl Math Comput 164:843–855

    MathSciNet  MATH  Google Scholar 

  31. Shi C, Lu J, Zhang G, Zhou H (2006) An extended branch and bound algorithm for linear bilevel programming. Appl Math Comput 180:529–537

    MathSciNet  MATH  Google Scholar 

  32. Storn R, Price K (1997) Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11:341–359

    Article  MathSciNet  MATH  Google Scholar 

  33. Tuy H, Migdalas A, Väbrand P (1993) A global optimization approach for the linear two-level program. J Glob Optim 3:1–23

    Article  MathSciNet  MATH  Google Scholar 

  34. Vicente LN, Calamai PH (1994) Bilevel and multilevel programming: a bibliography review. J Glob Optim 5:291–306

    Article  MathSciNet  MATH  Google Scholar 

  35. Zheng Y, Wan Z (2011) A solution method for semivectorial bilevel programming problem via penalty method. J Appl Math Comput 37:207–219

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This work was supported by the Natural Science Basic Research Plan in Shaanxi Province of China (Grant No. 2022JM-372), and the National Natural Science Foundation of China (Grant No. 61966030).

Author information

Authors and Affiliations

  1. School of Mathematics and Statistics, Xidian University, Xi’an, 710126, Shaanxi, China

    Hong Li & Li Zhang

Authors
  1. Hong Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Li Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hong Li.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, H., Zhang, L. A hybrid heuristic approach with adaptive scalarization for linear semivectorial bilevel programming and its application. Memetic Comp. 14, 433–449 (2022). https://doi.org/10.1007/s12293-022-00379-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12293-022-00379-4

Keywords

Search

Navigation