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 encod...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.展开更多
In order to solve the complex optimization problem dealing with uncertain phenomenon effectively, this paper presents a probability simulation optimization approach using orthogonal genetic algorithm. This approach sy...In order to solve the complex optimization problem dealing with uncertain phenomenon effectively, this paper presents a probability simulation optimization approach using orthogonal genetic algorithm. This approach synthesizes the computer simulation technology, orthogonal genetic algorithm and statistical test method faultlessly, which can solve complex optimization problem effectively. In this paper, the author gives the correlative conception of probability simulation optimization and describes the probability simulation optimization approach using orthogonal genetic algorithm in detail. Theoretically speaking, it has a strong rationality and maneuverability that can apply probability method in solving the complex optimization problems with uncertain phenomenon. In demonstration, the optimization performance of this method is better than other traditional methods. Simulation resuh suggests that the approach referred to this paper is feasible, correct and valid.展开更多
In order to minimize the transmitted power in the multi-user orthogonal frequency division multiplexing（OFDM） system, a scheme combining the improved particle swarm optimization（POS） algorithm with genetic algori...In order to minimize the transmitted power in the multi-user orthogonal frequency division multiplexing（OFDM） system, a scheme combining the improved particle swarm optimization（POS） algorithm with genetic algorithm（GA） is proposed to optimize the sub-carriers and bits allocation. In the algorithm, a random velocity between the maximum and minimum particle velocity is used as the updating velocity instead of maximum or minimum velocity when the updated particle velocity is higher than the maximum particle velocity or lower than the minimum particle velocity. Then, the convergence population is used as the initial population of the genetic algorithm to optimize the subcarriers and bits allocation further. Simulation results show that the transmitted power of the proposed algorithm is about 2 d B to 10 d B lower than that of the genetic algorithm, particle swarm optimization algorithm, and Zhang＇s algorithm.展开更多
基金supported by the National Natural Science Foundation of China (60873099)
文摘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.
基金Supported by the National Natural Science Foundation of China(70272002) .
文摘In order to solve the complex optimization problem dealing with uncertain phenomenon effectively, this paper presents a probability simulation optimization approach using orthogonal genetic algorithm. This approach synthesizes the computer simulation technology, orthogonal genetic algorithm and statistical test method faultlessly, which can solve complex optimization problem effectively. In this paper, the author gives the correlative conception of probability simulation optimization and describes the probability simulation optimization approach using orthogonal genetic algorithm in detail. Theoretically speaking, it has a strong rationality and maneuverability that can apply probability method in solving the complex optimization problems with uncertain phenomenon. In demonstration, the optimization performance of this method is better than other traditional methods. Simulation resuh suggests that the approach referred to this paper is feasible, correct and valid.
基金supported by the National Natural Science Foundation of China under Grant No.61371112
文摘In order to minimize the transmitted power in the multi-user orthogonal frequency division multiplexing（OFDM） system, a scheme combining the improved particle swarm optimization（POS） algorithm with genetic algorithm（GA） is proposed to optimize the sub-carriers and bits allocation. In the algorithm, a random velocity between the maximum and minimum particle velocity is used as the updating velocity instead of maximum or minimum velocity when the updated particle velocity is higher than the maximum particle velocity or lower than the minimum particle velocity. Then, the convergence population is used as the initial population of the genetic algorithm to optimize the subcarriers and bits allocation further. Simulation results show that the transmitted power of the proposed algorithm is about 2 d B to 10 d B lower than that of the genetic algorithm, particle swarm optimization algorithm, and Zhang＇s algorithm.
