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.展开更多
安全约束机组组合(Security-constrained Unit Commitment,SCUC)问题作为制定发电计划的核心环节,在电力系统优化调度等方面具有十分重要的意义。针对考虑故障态约束后SCUC问题规模庞大、难以求解的情况,提出了一种基于辅助优化问题的...安全约束机组组合(Security-constrained Unit Commitment,SCUC)问题作为制定发电计划的核心环节,在电力系统优化调度等方面具有十分重要的意义。针对考虑故障态约束后SCUC问题规模庞大、难以求解的情况,提出了一种基于辅助优化问题的故障态安全约束削减方法。首先引入与具体故障态安全约束相关的辅助优化问题,从而建立判别相应故障态安全约束是否冗余的充分必要条件。然后探究冗余故障态安全约束辨识过程的具体加速方法,包括松弛辅助优化问题方法,使用可行性判据进行故障态安全约束预分类方法,以及多线程并行计算方法。最后,在IEEE118测试系统上对所提方法的正确性和有效性进行了仿真验证。展开更多
基金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.
文摘安全约束机组组合(Security-constrained Unit Commitment,SCUC)问题作为制定发电计划的核心环节,在电力系统优化调度等方面具有十分重要的意义。针对考虑故障态约束后SCUC问题规模庞大、难以求解的情况,提出了一种基于辅助优化问题的故障态安全约束削减方法。首先引入与具体故障态安全约束相关的辅助优化问题,从而建立判别相应故障态安全约束是否冗余的充分必要条件。然后探究冗余故障态安全约束辨识过程的具体加速方法,包括松弛辅助优化问题方法,使用可行性判据进行故障态安全约束预分类方法,以及多线程并行计算方法。最后,在IEEE118测试系统上对所提方法的正确性和有效性进行了仿真验证。
