Full text restriction information:Access to this article is restricted until 12 months after publication by request of the publisher.
Restriction lift date:2020-06-15
Citation:Fajemisin A., Climent L. and Prestwich S. D. (2019) ) ‘Analytics-based decomposition of a class of bilevel problems’, in Le Thi, H., Le, H. and Pham Dinh, T. (eds) Optimization of Complex Systems: Theory, Models, Algorithms and Applications. World Congress on Global Optimization 2019. Advances in Intelligent Systems and Computing, 991, pp. 617-626. doi: 10.1007/978-3-030-21803-4_62
This paper proposes a new class of multi-follower bilevel problems. In this class the followers may be nonlinear, do not share constraints or variables, and are at most weakly constrained. This allows the leader variables to be partitioned among the followers. The new class is formalised and compared with existing problems in the literature. We show that approaches currently in use for solving multi-follower problems are unsuitable for this class. Evolutionary algorithms can be used, but these are computationally intensive and do not scale up well. Instead we propose an analytics-based decomposition approach. Two example problems are solved using our approach and two evolutionary algorithms, and the decomposition approach produces much better and faster results as the problem size increases.
This website uses cookies. By using this website, you consent to the use of cookies in accordance with the UCC Privacy and Cookies Statement. For more information about cookies and how you can disable them, visit our Privacy and Cookies statement