Journal of Systems Engineering and Electronics ›› 2014, Vol. 25 ›› Issue (3): 443-451.doi: 10.1109/JSEE.2014.00051

• SYSTEMS ENGINEERING • Previous Articles     Next Articles

Solution for integer linear bilevel programming problems using orthogonal genetic algorithm

Hong Li1,∗, Li Zhang1, and Yongchang Jiao2   

  1. 1. School of Mathematics and Statistics, Xidian University, Xi’an 710071, China;
    2. Institute of Antennas and EM Scattering, Xidian University, Xi’an 710071, China
  • Online:2014-07-01 Published:2010-01-03


An integer linear bilevel programming problem is firstly transformed into a binary linear bilevel programming problem, and then converted into a single-level binary implicit programming. An orthogonal genetic algorithm is developed for solving the binary linear implicit programming problem based on the orthogonal design. The orthogonal design with the factor analysis, an experimental design method is applied to the genetic algorithm to make the algorithm more robust, statistically sound and quickly convergent. A crossover operator formed by the orthogonal array and the factor analysis is presented. First, this crossover operator can generate a small but representative sample of points as offspring. After all of the better genes of these offspring are selected, a best combination among these offspring is then generated. The simulation results show the effectiveness of the proposed algorithm.