期刊文献+

解约束最优化问题的凝聚函数法(英文) 被引量:3

An Aggregate Function Method for Constrained Optimization Problems
下载PDF
导出
摘要 凝聚函数法(AFM)是用于求解约束最优化问题的有效方法之一,然而,凝聚函数法本身存在解发散和数据溢出问题。为系统地解决凝聚函数法的以上缺陷,本文提出一种全新的凝聚函数,通过增加稳定项来解决解发散的问题,增加指数渐消因子解决数值计算中的数据溢出问题。此外,本文还给出凝聚函数和改进的凝聚函数的性质。 In this paper,the aggregate function method(AFM) for constrained optimization problems(COP) is investigated. The AFM is effective for solving multiple inequality-constrained optimization problems. However,the inherent demerits of the AFM,both in convergence and data overflow, seem to have gone unnoticed. To address these issues systematically,some necessary measures have beem taken to deal with such problems,such as adding the stable term and introducing the exponent reduction parameter to the original aggregate function,which are highlighted in the entire paper. Moreover,the associated properties of both the AFM and the improved AFM(IAFM) are presented.
作者 张鑫春
机构地区 电子科技大学
出处 《新型工业化》 2014年第1期38-45,共8页 The Journal of New Industrialization
基金 中央高校基本科研业务费专项资金资助(ZYGX2012J150)
关键词 约束最优化 凝聚函数 最优化 Constrained optimization problems aggregate function optimization
  • 相关文献

参考文献5

二级参考文献47

  • 1唐焕文,张立卫.凸规划的极大熵方法[J].科学通报,1994,39(8):682-684. 被引量:49
  • 2李兴斯.一类不可微优化问题的有效解法[J].中国科学(A辑),1994,24(4):371-377. 被引量:137
  • 3杨庆之.对凝聚函数法的分析[J].计算数学,1996,18(4):405-410. 被引量:17
  • 4DORN R, HAO J K. A new genetic local search algorithm for graph coloring [C] // Proceedings of the 5th International Conference on Parallel Problem Solving from Nature. London: Springer-Verlag, 1998:745-754.
  • 5GALIIER P, HAO J K. Hybrid evolutionary algorithms for graph coloring [J].Journal of Combinatorial Optimization, 1999, 3(4) : 379-397.
  • 6OSORIO M A, GLOVER F. Exploiting surrogate constraint analysis for fixing variables in both bounds for multidimensional Knapsack problems[C] //CHPAVEZ E, FAVELA J, MEJIA M, eds. Proceedings of the Fourth Mexican International Conference on Computer Science. New Jersey:lEEE Computer Society, 2003:263-267.
  • 7JOHNSON D S, TRICK M A. Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge[M]. Washington D C: American Mathematical Society, 1996.
  • 8GLOVER F. A mutiphase-dual algorithm for the zero-one integer programming problem [J].Operations Research, 1965, 13 (6):879-919.
  • 9GLOVER F. Surrogate constraints [J].Operations Research, 1968, 16(4):741-749.
  • 10GLOVER F. Tutorial on surrogate constraint approaches for optimization in graphs [J]. Journal of Heuristics, 2003, 9(3) : 175-227.

共引文献48

同被引文献41

引证文献3

二级引证文献18

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部