Skip to main content
SpringerLink
Log in

A co-evolutionary hybrid decomposition-based algorithm for bi-level combinatorial optimization problems

  • Methodologies and Application
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

Bi-level programming problems are a special class of optimization problems with two levels of optimization tasks. These problems have been widely studied in the literature and often appear in many practical problem solving tasks. Although many applications fit the bi-level framework, however, real-life implementations are scarce, due mainly to the lack of efficient algorithms able to handle effectively this NP-hard problem. Several solution approaches have been proposed to solve these problems; however, most of them are restricted to the continuous case. Motivated by this observation, we have recently proposed a Co-evolutionary Decomposition-based Algorithm (CODBA) to solve bi-level combinatorial problems. CODBA scheme has been able to bring down the computational expense significantly as compared to other competitive approaches within this research area. In this paper, we further improve CODBA approach by incorporating a local search procedure to make the search process more efficient. The proposed extension called CODBA-LS includes a variable neighborhood search to the lower-level task to help in faster convergence of the algorithm. Further experimental tests based on the bi-level production–distribution problems in supply chain management model on a set of artificial and real-life data turned out to be effective on both computation time and solution quality.

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.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  • Aboussoror A, Adly S, Saissi FE (2017) Strong-weak nonlinear bilevel problems: existence of solutions in a sequential setting. Set-Valued Var Anal 25(1):113–132

    MathSciNet  MATH  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  • Alekseeva E, Kochetov Y, Talbi E-G (2017) A matheuristic for the discrete bilevel problem with multiple objectives at the lower level. Int Trans Oper Res 24(5):959–981

    MathSciNet  MATH  Google Scholar 

  • Angelo JS, Krempser E, Barbosa HJ (2013) Differential evolution for bilevel programming. In: IEEE congress on evolutionary computation, pp 470–477

  • Angelo JS, Krempser E, Barbosa HJ (2014) Differential evolution assisted by a surrogate model for bilevel programming problems. In: IEEE congress on evolutionary computation, pp 1784–1791

  • Asafuddoula M, Ray T, Sarker R (2015) A decomposition based evolutionary algorithm for many objective optimization. IEEE Trans Evol Comput 19(3):445–460

    Google Scholar 

  • Bagloee SA, Asadi M, Sarvi M, Patriksson M (2018) A hybrid machine-learning and optimization method to solve bi-level problems. Expert Syst Appl 95:142–152

    Google Scholar 

  • Bard JF, Falk JE (1982) An explicit solution to the multi-level programming problem. Comput Oper Res 9(1):77–100

    MathSciNet  Google Scholar 

  • Ben-Ayed O (1993) Bilevel linear programming. Comput Oper Res 20(5):485–501

    MathSciNet  MATH  Google Scholar 

  • Bialas W, Karwan M, Shaw J (1980) A parametric complementary pivot approach for two-level linear programming. State University of New York, Buffalo

    Google Scholar 

  • Bracken J, McGill JT (1973) Mathematical programs with optimization problems in the constraints. Oper Res 21(1):37–44

    MathSciNet  MATH  Google Scholar 

  • Calvete HI, Galé C, Oliveros M-J (2011) Bilevel model for production–distribution planning solved by using ant colony optimization. Comput Oper Res 38(1):320–327

    MATH  Google Scholar 

  • Calvete HI, Galé C, Oliveros M-J (2013) A hybrid algorithm for solving a bilevel production–distribution planning problem. Springer, Berlin, pp 138–144

    Google Scholar 

  • Candler W, Norton R (1977) Multi-level programming and development policy. The World Bank, Geneva

    Google Scholar 

  • Caramia M, Mari R (2016) A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints. Optim Lett 10:997–1019

    MathSciNet  MATH  Google Scholar 

  • Casas-Ramirez MS, Camacho-Vallejo JF, MartÃnez-Salazar IA (2018) Approximating solutions to a bilevel capacitated facility location problem with customer’s patronization toward a list of preferences. Appl Math Comput 319:369–386

    MathSciNet  MATH  Google Scholar 

  • Chaabani A, Ben Said L (2019) Transfer of learning with the co-evolutionary decomposition-based algorithm-II: a realization on the bi-level production–distribution planning system. Appl Intell 48(9):2847–2872

    Google Scholar 

  • Chaabani A, Bechikh S, Ben Said L (2015) A co-evolutionary decomposition-based algorithm for bi-level combinatorial optimization. In; Congress on evolutionary computation (CEC), pp 1659–1666

  • Chaabani A, Bechikh S, Said LB (2017) A co-evolutionary decomposition-based chemical reaction algorithm for bi-level combinatorial optimization problems. Proced Comput Sci 112:780–789

  • Chaabani A, Bechikh S, Ben Said L (2018) A new co-evolutionary decomposition-based algorithm for bi-level combinatorial optimization. Appl Intell 48(9):2847–2872

    Google Scholar 

  • Clark PA, Westerberg AW (1990) Bilevel programming for steady-state chemical process design-I. Fundamentals and algorithms. Comput Chem Eng 14(1):87–97

    Google Scholar 

  • Colson B, Marcotte P, Savard G (2007) An overview of bilevel optimization. Ann Oper Res 153(1):235–256

    MathSciNet  MATH  Google Scholar 

  • Cordeau J-F, Gendreau M, Laporte G (1997) A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30(2):105–119

    MATH  Google Scholar 

  • Das I, Dennis JE (1998) Normal-boundary intersection: a new method for generating the pareto surface in nonlinear multicriteria optimization problems. SIAM J Optim 8(3):631–657

    MathSciNet  MATH  Google Scholar 

  • de Barros LN, Pinheiro WR, Delgado KV (2015) Learning to program using hierarchical model-based debugging. Appl Intell 43(3):544–563

    Google Scholar 

  • Dempe S (2018) Bilevel optimization: theory, algorithms and applications. TU Bergakademie Freiberg, Fakultät für Mathematik und Informatik. ISSN 2512–3750

  • Dempe S, Kalashnikov VV, Kalashnykova N (2006) Optimality conditions for bilevel programming problems. In: Optimization with multivalued mappings. Springer, pp 3–28

  • Derrac J, García S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1(1):3–18

    Google Scholar 

  • Fliege J, Vicente LN (2006) Multicriteria approach to bilevel optimization. J Optim Theory Appl 131(2):209–225

    MathSciNet  MATH  Google Scholar 

  • Fortuny-Amat J, McCarl B (1980) A representation and economic interpretation of a two-level programming problem. J Oper Res Soc 32:783–792

    MathSciNet  MATH  Google Scholar 

  • Friedlander A, Gomes FA (2011) Solution of a truss topology bilevel programming problem by means of an inexact restoration method. Comput Appl Math 30(1):109–125

    MathSciNet  MATH  Google Scholar 

  • Hansen P, Mladenović N (2001) Variable neighborhood search: principles and applications. Eur J Oper Res 130(3):449–467

    MathSciNet  MATH  Google Scholar 

  • He X, Zhou Y, Chen Z (2018) Evolutionary bilevel optimization based on covariance matrix adaptation. IEEE Trans Evol Comput 23(2):258–272

    Google Scholar 

  • Islam MM, Singh HK, Ray T, Sinha A (2017a) An enhanced memetic algorithm for single-objective bilevel optimization problems. Evol Comput 25(4):607–642

    Google Scholar 

  • Islam MM, Singh HK, Ray T (2017b) A surrogate assisted approach for single-objective bilevel optimization. IEEE Trans Evol Comput 21(5):681–696

    Google Scholar 

  • Islam MM, Singh HK, Ray T (2018) Efficient global optimization for solving computationally expensive bilevel optimization problems. IEEE Congr Evol Comput (CEC) 11(1):1–8

    Google Scholar 

  • Jeroslow RG (1985) The polynomial hierarchy and a simple model for competitive analysis. Math Program 32(2):146–164

    MathSciNet  MATH  Google Scholar 

  • Kolstad CD (1985) A review of the literature on bi-level mathematical programming. Los Alamos National Laboratory, Los Alamos

    Google Scholar 

  • Kuhn H, Tucker A (1951) Non linear programming. In: Proceedings of the second Berkeley symposium on mathematical statistics and probability, Berkeley, University of California, pp 481–492

  • Legillon F, Liefooghe A, Talbi E-G (2012) Cobra: a cooperative coevolutionary algorithm for bi-level optimization. In: 2012 IEEE congress on evolutionary computation, pp 1–8

  • Lei L, Guang-Nian X, Chen-Xin L (2010) Research on problems bilevel programming for personnel allocation in enterprise. In: 2010 international conference on management science and engineering (ICMSE). IEEE, pp 293–298

  • Li K, Deb K, Zhang Q, Kwong S (2014) Combining dominance and decomposition in evolutionary many-objective optimization. IEEE Trans Evol Comput 99:1–23

    Google Scholar 

  • Liu J, Fan Y, Chen Z, Zheng Y (2018) Pessimistic bilevel optimization: a survey. Int J Comput Intell Syst 11(1):725–736

    Google Scholar 

  • Marinakis Y, Migdalas A, Pardalos PM (2007) A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm. J Global Optim 38(4):555–580

    MathSciNet  MATH  Google Scholar 

  • Mathieu R, Pittard L, Anandalingam G (1994) Genetic algorithm based approach to bi-level linear programming. Revue française d’automatique, d’informatique et de recherche opérationnelle. Recherche opérationnelle 28(1):1–21

    MathSciNet  MATH  Google Scholar 

  • Meng Q, Yang H, Bell MG (2001) An equivalent continuously differentiable model and a locally convergent algorithm for the continuous network design problem. Transp Res B: Methodol 35(1):83–105

    Google Scholar 

  • Migdalas A (1995) Bilevel programming in traffic planning: models, methods and challenge. J Global Optim 7(4):381–405

    MathSciNet  MATH  Google Scholar 

  • Mladenović N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24(11):1097–1100

    MathSciNet  MATH  Google Scholar 

  • Oduguwa V, Roy R (2002) Bi-level optimisation using genetic algorithm. In: 2002 IEEE international conference on artificial intelligence systems, 2002 (ICAIS 2002), pp 322–327

  • Ren A, Wang Y (2018) A new approach based on possibilistic programming technique and fractile optimization for bi-level programming in a hybrid uncertain circumstance. Appl Intell 48:3782–3796

    Google Scholar 

  • Ross PJ (1988) Taguchi techniques for quality engineering: loss function, orthogonal experiments, parameter and tolerance design. McGraw-Hill, New York

    Google Scholar 

  • Savard G, Gauvin J (1994) The steepest descent direction for the nonlinear bilevel programming problem. Oper Res Lett 15(5):265–272

    MathSciNet  MATH  Google Scholar 

  • Segundo GA, Krohling RA, Cosme RC (2012) A differential evolution approach for solving constrained min–max optimization problems. Expert Syst Appl 39(18):13440–13450

    Google Scholar 

  • Sinha A, Malo P, Deb K (2013) Efficient evolutionary algorithm for single-objective bilevel optimization. arXiv:1303.3901

  • Sinha A, Malo P, Deb K (2017a) Evolutionary algorithm for bilevel optimization using approximations of the lower level optimal solution mapping. Eur J Oper Res 257(2):395–411

    MathSciNet  MATH  Google Scholar 

  • Sinha A, Malo P, Deb K (2017b) Evolutionary bilevel optimization: an introduction and recent advances. Recent advances in evolutionary multi-objective optimization. Springer, Berlin, pp 71–103

    Google Scholar 

  • Sinha A, Malo P, Deb K (2017c) A review on bilevel optimization: from classical to evolutionary approaches and applications. IEEE Trans Evol Comput 22(2):276–295

    Google Scholar 

  • Sinha A, Soun T, Deb K (2019) Using Karush–Kuhn–Tucker proximity measure for solving bi-level optimization problems. Swarm Evol Comput 44:496–510

    Google Scholar 

  • Stackelberg HV (1934) Marktform und gleichgewicht. Springer, Wien

    MATH  Google Scholar 

  • Unlu G (1987) A linear bilevel programming algorithm based on bicriteria programming. Comput Oper Res 14(2):173–179

    MathSciNet  MATH  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  • Wang Y, Jiao Y-C, Li H (2005) An evolutionary algorithm for solving nonlinear bilevel programming based on a new constraint-handling scheme. IEEE Trans Syst Man Cybern C (Applications and Reviews) 35(2):221–232

    Google Scholar 

  • Wiesemann W, Tsoukalas A, Kleniati P-M, Rustem B (2013) Pessimistic bilevel optimization. SIAM J Optim 23:353–380

    MathSciNet  MATH  Google Scholar 

  • Yin Y (2000) Genetic-algorithms-based approach for bilevel programming models. J Transp Eng 126(2):115–120

    Google Scholar 

  • Yue D, You F (2016) Projection-based reformulation and decomposition algorithm for a class of mixed-integer bilevel linear programs. In: Computer aided chemical engineering, vol 38, pp 481–486. https://doi.org/10.1016/B978-0-444-63428-3.50085-0

  • Zheng Y, Zhang G, Zhang Z, Lu J (2018) A reducibility method for the weak linear bilevel programming problems and a case study in principal-agent. Inf Sci 454:46–58

    MathSciNet  Google Scholar 

  • Zou D, Lu R, Wang P (2017) Hierarchical multi-swarm cooperative teaching–learning-based optimization for global optimization. Soft Comput 21(23):6983–7004

    Google Scholar 

Download references

Acknowledgements

This study received no funding.

Author information

Authors and Affiliations

  1. SMART Lab, ISG Computer Science Department, University of Tunis (Université de Tunis), Tunis, Tunisia

    Abir Chaabani, Slim Bechikh & Lamjed Ben Said

Authors
  1. Abir Chaabani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Slim Bechikh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lamjed Ben Said
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Abir Chaabani.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Ethical standard

This article does not contain any studies with human participants or animals performed by any of the authors.

Additional information

Communicated by V. Loia.

Publisher's Note

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

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chaabani, A., Bechikh, S. & Ben Said, L. A co-evolutionary hybrid decomposition-based algorithm for bi-level combinatorial optimization problems. Soft Comput 24, 7211–7229 (2020). https://doi.org/10.1007/s00500-019-04337-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-019-04337-0

Keywords

Search

Navigation