Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Computational Intelligence Studies
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.