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

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.