首页 | 本学科首页   官方微博 | 高级检索  
     

基于递阶优化算法的一类两层规划问题的解法
引用本文:郑丕谔,刘国宏,李瑞波,赵玉超.基于递阶优化算法的一类两层规划问题的解法[J].系统工程与电子技术,2005,27(4):662-665.
作者姓名:郑丕谔  刘国宏  李瑞波  赵玉超
作者单位:天津大学系统工程研究所,天津,300072
摘    要:提出一种基于分解协调的两级递阶结构优化算法来求解两层规划问题。通过设计解耦变量,两层规划问题被分解成若干相互独立的易于在结构的第一级求解的子问题。而结构的第二级是调整解耦变量使各子问题的解得以改善。算法以一种迭代的方式使第一级求得的子问题的解不断协调,最终达到两层规划的解。算例表明该算法是可行且有效的

关 键 词:递阶优化算法  两层规划  分解协调  拉格朗日乘子法
文章编号:1001-506X(2005)04-0662-04
修稿时间:2004年1月14日

Hierarchical optimization algorithm-based solutions to a class of bilevel programming problems
ZHENG Pi-e,LIU Guo-hong,LI Rui-bo,ZHAO Yu-chao.Hierarchical optimization algorithm-based solutions to a class of bilevel programming problems[J].System Engineering and Electronics,2005,27(4):662-665.
Authors:ZHENG Pi-e  LIU Guo-hong  LI Rui-bo  ZHAO Yu-chao
Abstract:A decomposition-coordination-based optimization algorithm in a two-level hierarchical structure is proposed to solve a bilevel programming problem. By introducing decoupling variables, or coordinating variables, the programming problem is decomposed into some independent subproblems which are easily solved at Level 1 of the structure(.) And at Level 2 the coordinating variables are updated to improve the solutions to subproblems. The algorithm is carried out in an iterative fashion in order to continuously coordinate the solutions towards the optimal one to the bilevel programming problem. A case study demonstrates its feasibility and effectiveness.
Keywords:hierarchical optimization algorithm  bilevel programming  decomposition-coordination  Lagrangian multiplier method
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号