2020

Journal

International Journal of Computational Intelligence Studies

Bi-level optimisation problems (BOPs) are a class of challenging problems with two levels of optimisation tasks. These problems allow to model a large number of real-life situations in which a first decision maker, hereafter the leader, optimises his objective by taking the follower's response to his decisions explicitly into account. In this context, a new proposed algorithm called CODBA-II was suggested to solve combinatorial BOPs. The latter was able to improve the quality of generated bi-level solutions regarding to recently proposed methods. In fact, a wide range of applications fit the bi-level programming framework and real-life implementations still scarce. For this reason, we propose in this paper a co-evolutionary decomposition-based bi-level algorithm for the bi-level knapsack optimisation problem. The computational algorithm turned out to be quite efficient on both computation time and solution quality regarding to other competitive EAs.

@article{chaabani2020co,
  title={A co-evolutionary decomposition-based algorithm for the bi-level knapsack optimisation problem},
  author={Chaabani, Abir and Said, Lamjed Ben},
  journal={International Journal of Computational Intelligence Studies},
  volume={9},
  number={1-2},
  pages={52--67},
  year={2020},
  publisher={Inderscience Publishers (IEL)}
}