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 algorith...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, statistical y 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 smal but representative sample of points as offspring. After al 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.展开更多
Two classes of mixed-integer nonlinear bilevel programming problems are discussed. One is that the follower＇s functions are separable with respect to the follower＇s variables, and the other is that the follower＇s f...Two classes of mixed-integer nonlinear bilevel programming problems are discussed. One is that the follower＇s functions are separable with respect to the follower＇s variables, and the other is that the follower＇s functions are convex if the follower＇s variables are not restricted to integers. A genetic algorithm based on an exponential distribution is proposed for the aforementioned problems. First, for each fixed leader＇s variable x, it is proved that the optimal solution y of the follower＇s mixed-integer programming can be obtained by solving associated relaxed problems, and according to the convexity of the functions involved, a simplified branch and bound approach is given to solve the follower＇s programming for the second class of problems. Furthermore, based on an exponential distribution with a parameter λ, a new crossover operator is designed in which the best individuals are used to generate better offspring of crossover. The simulation results illustrate that the proposed algorithm is efficient and robust.展开更多
Partial cooperation models are studied for many years to solve the bilevel programming problems where the follower’s optimal reaction is not unique. However, in these existed models, the follower’s cooperation level...Partial cooperation models are studied for many years to solve the bilevel programming problems where the follower’s optimal reaction is not unique. However, in these existed models, the follower’s cooperation level does not depend on the leader’s decision. A new model is proposed to solve this deficiency. It is proved the feasibility of the new model when the reaction set of the lower level is lower semicontinuous. And the numerical results show that the new model has optimal solutions when the reaction set of the lower level is discrete, lower semi-continuous and non-lower semi-continuous.展开更多
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.展开更多
A global convergent algorithm is proposed to solve bilevel linear fractional-linear programming, which is a special class of bilevel programming. In our algorithm, replacing the lower level problem by its dual gap equ...A global convergent algorithm is proposed to solve bilevel linear fractional-linear programming, which is a special class of bilevel programming. In our algorithm, replacing the lower level problem by its dual gap equaling to zero, the bilevel linear fractional-linear programming is transformed into a traditional sin- gle level programming problem, which can be transformed into a series of linear fractional programming problem. Thus, the modi- fied convex simplex method is used to solve the infinite linear fractional programming to obtain the global convergent solution of the original bilevel linear fractional-linear programming. Finally, an example demonstrates the feasibility of the proposed algorithm.展开更多
Partial cooperation formulation is a more viable option than optimistic＇s and pessimistic＇s to solve an ill-posed bilevel programming problem.Aboussoror＇s partial cooperation model uses a constant as a cooperation ...Partial cooperation formulation is a more viable option than optimistic＇s and pessimistic＇s to solve an ill-posed bilevel programming problem.Aboussoror＇s partial cooperation model uses a constant as a cooperation index to describe the degree of follower＇s cooperation.The constant only indicates the leader＇s expectation coefficient for the follower＇s action,not the follower＇s own willingness.To solve this situation,a new model is proposed by using the follower＇s satisfactory degree as the cooperation degree.Then,because this new cooperation degree is a function which is dependent on the leader＇s choice and decided by the follower＇s satisfactory degree,this paper proves such proposed model not only leads an optimal value between the optimistic value and pessimistic＇s,but also leads a more satisfactory solution than Aboussoror＇s.Finally,a numerical experiment is given to demonstrate the feasibility of this new model.展开更多
A discrete differential evolution algorithm combined with the branch and bound method is developed to solve the integer linear bilevel programming problems, in which both upper level and lower level variables are forc...A discrete differential evolution algorithm combined with the branch and bound method is developed to solve the integer linear bilevel programming problems, in which both upper level and lower level variables are forced to be integer. An integer coding for upper level variables is adopted, and then a discrete differential evolution algorithm with an improved feasibility-based comparison is developed to directly explore the integer solution at the upper level. For a given upper level integer variable, the lower level integer programming problem is solved by the existing branch and bound algorithm to obtain the optimal integer solution at the lower level. In the same framework of the algorithm, two other constraint handling methods, i.e. the penalty function method and the feasibility-based comparison method are also tested. The experimental results demonstrate that the discrete differential evolution algorithm with different constraint handling methods is effective in finding the global optimal integer solutions, but the improved constraint handling method performs better than two compared constraint handling methods.展开更多
This paper aims at providing an uncertain bilevel knapsack problem (UBKP) model, which is a type of BKPs involving uncertain variables. And then an uncertain solution for the UBKP is proposed by defining PE Nash equil...This paper aims at providing an uncertain bilevel knapsack problem (UBKP) model, which is a type of BKPs involving uncertain variables. And then an uncertain solution for the UBKP is proposed by defining PE Nash equilibrium and PE Stackelberg Nash equilibrium. In order to improve the computational efficiency of the uncertain solution, several operators (binary coding distance, inversion operator, explosion operator and binary back learning operator) are applied to the basic fireworks algorithm to design the binary backward fireworks algorithm (BBFWA), which has a good performance in solving the BKP. As an illustration, a case study of the UBKP model and the P-E uncertain solution is applied to an armaments transportation problem.展开更多
依托于聚光型太阳能发电技术的光热电站(concentrating solar power,CSP)可充分应对新能源发电的不确定性,为“双碳”愿景下新型电力系统的转型与建设提供有力保障。然而,CSP电站如何摆脱高昂建设成本的制约,为自身赢得更多可持续发展...依托于聚光型太阳能发电技术的光热电站(concentrating solar power,CSP)可充分应对新能源发电的不确定性,为“双碳”愿景下新型电力系统的转型与建设提供有力保障。然而,CSP电站如何摆脱高昂建设成本的制约,为自身赢得更多可持续发展的机会是亟需解决的关键难题。因此,该文提出了一种考虑电力市场机制的CSP电站子系统容量优化规划方法。首先,围绕借助CSP电站灵活调控特性在运行时间尺度下提升CSP电站自身经济收益这一问题,提出CSP电站以价格制定者这一角色参与电力市场的竞价策略。然后,构建以经济效益最大为目标的CSP电站聚光、储热、发电容量配比双层随机规划模型,并采用离散线性化转换方法将规划模型转化为混合整数线性模型,解决模型重构后非线性模型带来的求解难问题。最后,基于我国西北某地区实际历史数据的算例仿真验证所提优化配比方法的有效性,并分析说明与价格接受者相比电力市场中的议价权能使CSP电站获得更好的市场经济效益。展开更多
基金supported by the Fundamental Research Funds for the Central Universities(K50511700004)the Natural Science Basic Research Plan in Shaanxi Province of China(2013JM1022)
文摘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, statistical y 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 smal but representative sample of points as offspring. After al 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.
基金supported by the National Natural Science Fundation of China (60374063)
文摘Two classes of mixed-integer nonlinear bilevel programming problems are discussed. One is that the follower＇s functions are separable with respect to the follower＇s variables, and the other is that the follower＇s functions are convex if the follower＇s variables are not restricted to integers. A genetic algorithm based on an exponential distribution is proposed for the aforementioned problems. First, for each fixed leader＇s variable x, it is proved that the optimal solution y of the follower＇s mixed-integer programming can be obtained by solving associated relaxed problems, and according to the convexity of the functions involved, a simplified branch and bound approach is given to solve the follower＇s programming for the second class of problems. Furthermore, based on an exponential distribution with a parameter λ, a new crossover operator is designed in which the best individuals are used to generate better offspring of crossover. The simulation results illustrate that the proposed algorithm is efficient and robust.
基金supported by the National Natural Science Foundationof China (70771080)the National Science Foundation of Hubei Province(20091107)Hubei Province Key Laboratory of Systems Science in Metallurgical Process (B201003)
文摘Partial cooperation models are studied for many years to solve the bilevel programming problems where the follower’s optimal reaction is not unique. However, in these existed models, the follower’s cooperation level does not depend on the leader’s decision. A new model is proposed to solve this deficiency. It is proved the feasibility of the new model when the reaction set of the lower level is lower semicontinuous. And the numerical results show that the new model has optimal solutions when the reaction set of the lower level is discrete, lower semi-continuous and non-lower semi-continuous.
基金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(70771080)the Special Fund for Basic Scientific Research of Central Colleges+2 种基金China University of Geosciences(Wuhan) (CUG090113)the Research Foundation for Outstanding Young TeachersChina University of Geosciences(Wuhan)(CUGQNW0801)
文摘A global convergent algorithm is proposed to solve bilevel linear fractional-linear programming, which is a special class of bilevel programming. In our algorithm, replacing the lower level problem by its dual gap equaling to zero, the bilevel linear fractional-linear programming is transformed into a traditional sin- gle level programming problem, which can be transformed into a series of linear fractional programming problem. Thus, the modi- fied convex simplex method is used to solve the infinite linear fractional programming to obtain the global convergent solution of the original bilevel linear fractional-linear programming. Finally, an example demonstrates the feasibility of the proposed algorithm.
基金supported by the National Natural Science Foundation of China(1140145071171150+4 种基金71471143)the Hubei Provincial Department of Education(B2015348D20141101)the Hubei Province Key Laboratory of Systems Science in Metallurgical Process(Y201518Z201401)
文摘Partial cooperation formulation is a more viable option than optimistic＇s and pessimistic＇s to solve an ill-posed bilevel programming problem.Aboussoror＇s partial cooperation model uses a constant as a cooperation index to describe the degree of follower＇s cooperation.The constant only indicates the leader＇s expectation coefficient for the follower＇s action,not the follower＇s own willingness.To solve this situation,a new model is proposed by using the follower＇s satisfactory degree as the cooperation degree.Then,because this new cooperation degree is a function which is dependent on the leader＇s choice and decided by the follower＇s satisfactory degree,this paper proves such proposed model not only leads an optimal value between the optimistic value and pessimistic＇s,but also leads a more satisfactory solution than Aboussoror＇s.Finally,a numerical experiment is given to demonstrate the feasibility of this new model.
基金supported by the Natural Science Basic Research Plan in Shaanxi Province of China(2013JM1022)the Fundamental Research Funds for the Central Universities(K50511700004)
文摘A discrete differential evolution algorithm combined with the branch and bound method is developed to solve the integer linear bilevel programming problems, in which both upper level and lower level variables are forced to be integer. An integer coding for upper level variables is adopted, and then a discrete differential evolution algorithm with an improved feasibility-based comparison is developed to directly explore the integer solution at the upper level. For a given upper level integer variable, the lower level integer programming problem is solved by the existing branch and bound algorithm to obtain the optimal integer solution at the lower level. In the same framework of the algorithm, two other constraint handling methods, i.e. the penalty function method and the feasibility-based comparison method are also tested. The experimental results demonstrate that the discrete differential evolution algorithm with different constraint handling methods is effective in finding the global optimal integer solutions, but the improved constraint handling method performs better than two compared constraint handling methods.
基金supported by the National Natural Science Foundation of China(7160118361502522)
文摘This paper aims at providing an uncertain bilevel knapsack problem (UBKP) model, which is a type of BKPs involving uncertain variables. And then an uncertain solution for the UBKP is proposed by defining PE Nash equilibrium and PE Stackelberg Nash equilibrium. In order to improve the computational efficiency of the uncertain solution, several operators (binary coding distance, inversion operator, explosion operator and binary back learning operator) are applied to the basic fireworks algorithm to design the binary backward fireworks algorithm (BBFWA), which has a good performance in solving the BKP. As an illustration, a case study of the UBKP model and the P-E uncertain solution is applied to an armaments transportation problem.
文摘依托于聚光型太阳能发电技术的光热电站(concentrating solar power,CSP)可充分应对新能源发电的不确定性,为“双碳”愿景下新型电力系统的转型与建设提供有力保障。然而,CSP电站如何摆脱高昂建设成本的制约,为自身赢得更多可持续发展的机会是亟需解决的关键难题。因此,该文提出了一种考虑电力市场机制的CSP电站子系统容量优化规划方法。首先,围绕借助CSP电站灵活调控特性在运行时间尺度下提升CSP电站自身经济收益这一问题,提出CSP电站以价格制定者这一角色参与电力市场的竞价策略。然后,构建以经济效益最大为目标的CSP电站聚光、储热、发电容量配比双层随机规划模型,并采用离散线性化转换方法将规划模型转化为混合整数线性模型,解决模型重构后非线性模型带来的求解难问题。最后,基于我国西北某地区实际历史数据的算例仿真验证所提优化配比方法的有效性,并分析说明与价格接受者相比电力市场中的议价权能使CSP电站获得更好的市场经济效益。
