Convex quadratic bilevel programming problem based on the redesigned BAS algorithm and application to supply chain

被引：0
|
作者：
Wu, Deyu [1 ]
Miao, Peng [1 ]
机构：
[1] Zhengzhou Univ Sci & Technol, Dept Basic Courses, Zhengzhou, Peoples R China
来源：
2023 35TH CHINESE CONTROL AND DECISION CONFERENCE, CCDC | 2023年
关键词：
redesigned BAS algorithm; convex quadratic bilevel programming; supply chain model; KKT; OPTIMIZATION PROBLEMS;
D O I：
10.1109/CCDC58219.2023.10327402
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper, convex quadratic bilevel programming problem is studied based on the redesigned beetle antennae search algorithm and applied to the supply chain. Beforhand, the beetle antennae search algorithm is introduced and the convex quadratic bilevel programming problem is proposed. Subsequntly, in order to solve the convex quadratic bilevel programming problem, a redesigned beetle antennae search algorithm is designed. Then, an example is given to show the effectiveness of the redesigned beetle antennae search algorithm. Finally, our method is applied to a supply chain model and the effectiveness of our method is shown as the simulation results.
引用
收藏
页码：1176 / 1181
页数：6
相关论文
共 50 条
12345