期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

求解二层规划问题的改进粒子群算法 被引量：1

An Improved Particle Swarm Optimization Method for Solving Bilevel Programming Problem
下载PDF
导出
摘要 两层规划问题是一个NP—难问题,这意味着它很难被求解.基于粒子群算法提出了一种求解二层规划问题的方法,通过分离目标函数和约束函数,使每个粒子拥有双适应值,并通过双适应值来决定个体优劣.应用了一种自适应保留不可行个体的策略.数值结果表明了算法的有效性. A bilevel programming （BLP） problem is a NP hard problem, which means it is very hard to be solved. In this paper, we introduce a BLP algorithm which separate the objective functions from its constrained functions based on the PSO. Therefore, every particle has double fitness values by which the particle will be decided whether better or not. The strategy to keep a fixed proportion of infeasible individuals is used in this new method. Numerical results show the efficiency and effect of the algorithm.
作者 李响 高常海 刘梁
机构地区 中国矿业大学理学院
出处 《徐州工程学院学报（自然科学版）》 CAS 2009年第2期21-24,共4页 Journal of Xuzhou Institute of Technology(Natural Sciences Edition)
基金 中国矿业大学科技基金资助项目(A200410)
关键词 二层规划 粒子群 双适应值 bilevel programming particle swarm optimization double fitness value
分类号 O221.1 [理学—运筹学与控制论]
  • 相关文献

参考文献1

二级参考文献13

  • 1Jonathan F Bard. Practical Bilevel Optimization Algorithms and Application[M]. The Netherlands: Kluwer Academic Publishers, 1998. 193-386.
  • 2Zeynep H. Gümüs, Christodoulos A Floudas. Global optimization of nonlinear bilevel programming problems[J]. Journal of Global Optimization, 2001, 20: 1-31.
  • 3Mahyar A Amouzegar. A global optimization method for nonlinear bilevel programming problems[J]. IEEE Trans. on Systems, Man, and Cybernetics - Part B: Cybernetics, 1999, 29(6): 771-777.
  • 4Olav K. Foundations of Modern Probability[M]. New York : Springer-Verlag , 1997.
  • 5Patrick B. Convergence of Probability Measures[M]. New York:Wiley, 1999.
  • 6Thomas A Edmunds, Jonathan F Bard. Algorithms for nonlinear bilevel mathematical programs[J]. IEEE Trans. on Systems, Man, and Cybernetics, 1991, 21(1): 83-89.
  • 7E Aiyoshi, K Shimizu. A solution method for the static constrained Stackelberg problem via penalty method [J]. IEEE Transactions on Automatic Control, 1984, 29(12):1111-1114.
  • 8H I Calvete, C Galé. The bilevel linear/linear fractional programming problem [J]. European Journal of Operational Research, 1999, 114(1): 188-197.
  • 9J.V.Outrata. On the numerical solution of a class of Stackelberg problems[J]. Zeitschrift Fur Operation Research, 1990, 34: 255-278.
  • 10K Shimizu, E Aiyoshi. A new computational method for Stackelberg and min-max problems by use of a penalty method[J]. IEEE Transactions on Automatic Control, 1981, 26(2): 460-466.

共引文献21

同被引文献9

  • 1SHI Chenggen, ZHANG Guanquan, LU Jie. The Kth-best approach for linear bilevel multi-follower programming [J].Journal of Global Optimization, 2005, 33 (4) : 563-578.
  • 2EDMUNDS T A, BARD J F. An algorithm for the mixed-integer nonlinear bilevel programming problem[ J]. Annals of Oper- ations Research, 1992, 34(1 ) : 149-162.
  • 3SAVARD G, GAUVIN J. The steepest descent direction for the nonlinear bilevel programming problem [ J ]. Operations Re- search Letters, 1994 (5) : 265-272.
  • 4SHEN Zuhe, MEUMAIER A, EIERMANN M C. Solving minimax problems by interval methods[J].BIT, 1990, 30: 742- 751.
  • 5CAO Dexin, CHEN Meirong, WANG Haijun, et al. Interval method for global solutions of a class of min-max-min problems [ J]. Applied Mathematics and Computation, 2008, 196(2) : 594-602.
  • 6ASAITHAMBI N S,SHEN ZUHE, MOORE R E. On computing the range of values[J]. Computing, 1982, 28: 225-237.
  • 7MOORE R E. Methods and applications of interval analysis[ M]. Phiadelphia: SIAM, 1979.
  • 8RATSCHEK H, ROKNE J. New computer methods for global optimization[ M]. Chichester: Ellis Horwood Limited, 1988.
  • 9邓先礼,雷万明.用罚函数求解二层凸规划的方法[J].应用数学学报,2001,24(2):161-167. 被引量：6

引证文献1

二级引证文献1

徐州工程学院学报（自然科学版）
2009年 第2期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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