By Topic

Orthogonal genetic algorithm for solving quadratic bilevel programming problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Li, Hong ; National Key Lab of Antennas and Microwave Technology, Xidian University, Xi'an 710071, P. R. China; School of Science, Xidian University, Xi'an 710071, P. R. China ; Jiao, Yongchang ; Zhang, Li

A quadratic bilevel programming problem is transformed into a single level complementarity slackness problem by applying Karush-Kuhn-Tucker (KKT) conditions. To cope with the complementarity constraints, a binary encoding scheme is adopted for KKT multipliers, and then the complementarity slackness problem is simplified to successive quadratic programming problems, which can be solved by many algorithms available. Based on 0–1 binary encoding, an orthogonal genetic algorithm, in which the orthogonal experimental design with both two-level orthogonal array and factor analysis is used as crossover operator, is proposed. Numerical experiments on 10 benchmark examples show that the orthogonal genetic algorithm can find global optimal solutions of quadratic bilevel programming problems with high accuracy in a small number of iterations.

Published in:

Systems Engineering and Electronics, Journal of  (Volume:21 ,  Issue: 5 )