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

利用模糊次梯度算法求解拉格朗日松弛对偶问题
引用本文:周 威,金以慧.利用模糊次梯度算法求解拉格朗日松弛对偶问题[J].控制与决策,2004,19(11):1213-1217.
作者姓名:周 威  金以慧
作者单位:清华大学,自动化系,北京,100084
基金项目:国家自然科学基金资助项目(60174046).
摘    要:针对利用次梯度算法处理拉格朗日松弛对偶问题时,计算过程容易出现振荡,求解效率较低的问题,首先提出了一种基于模糊理论的次梯度算法,利用隶属度函数给出迭代过程中所有次梯度的合适权重,并将它们线性加权得到新的迭代方向;其次证明了算法的收敛性;最后通过仿真实验验证了该方法的有效性.

关 键 词:拉格朗日松弛  次梯度算法  模糊理论  对偶
文章编号:1001-0920(2004)11-1213-05
修稿时间:2003年12月16

Fuzzy subgradient algorithm for solving Lagrangian relaxation dual problem
ZHOU Wei,JIN Yi-hui.Fuzzy subgradient algorithm for solving Lagrangian relaxation dual problem[J].Control and Decision,2004,19(11):1213-1217.
Authors:ZHOU Wei  JIN Yi-hui
Abstract:To the problem of zigzaging happened in solving the undifferential Lagrangian dual problems by subgradient algorithm, a subgradient algorithm based on fuzzy theory is presented. In this method, the resulting subgradient direction is attained by combining all history subgradient directions, which are achieved in the iteration process, following a simple membership function. The resulting subgradient direction uses the history information suitably, thereby significantly reduces the solution zigzagging difficulty without much additional computational requirements. The convergence of the algorithm is proved. This method is then applied in the traveling salesman problem, and the results show that this method leads to significant improvement over the traditional subgradient algorithm.
Keywords:Lagrangian relaxation  subgradient algorithm  fuzzy theory  dual
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《控制与决策》浏览原始摘要信息
点击此处可从《控制与决策》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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