期刊文献+

利用一种改进的模拟退火算法求解多目标规划问题 被引量:1

Solving multiobjective programming problem by an improved simulated annealing algorithm
在线阅读 下载PDF
导出
摘要 提出了一种求解多目标规划问题的改进模拟退火算法。该算法基于多目标规划的Pareto最优解特征提出了一种新的能量差计算方法,并利用外部存档储存每一代产生的Pareto最优解,通过预设迭代次数,使近似Pareto最优解不断逼近精确最优解。最后,通过数值实验验证算法的可行性和有效性。 In this paper, an improved SA is presented for solving muhiobjective new method for computing energy difference is proposed and the external file approximate Pareto optimal solutions for muhiobjective programming problem is This interactive procedure is repeated until the accurate Pareto optimal solutions The experimental results show that the proposed algorithm is a feasible muhiobjective programming problems. programming problems, in which a technology is used. And a set of obtained using the elite strategy. of the original problem are found. and efficient method for solving
出处 《武汉工业学院学报》 CAS 2013年第2期74-76,共3页 Journal of Wuhan Polytechnic University
关键词 多目标规划 PARETO最优解 模拟退火算法 精英策略 Multiobjective programming Simulated annealing algorithm Pareto optimal solution External file
  • 相关文献

参考文献5

  • 1汪定伟,王俊伟,王洪峰,等.智能优化算法[M].北京:高等教育出版社,2006.
  • 2Smith K, Everson R, Fieldsend J. Dominance measures for multi-objective simulated annealing [ C ]// In Proceedings of the 2004 IEEE Congress on Evolutionary Computation. UK: University of Exeter, 2004.
  • 3Kemal H S, Ciric A R. A dual temperature simulated annealing approach for solving bilevel programming problems [ J ] , Computers and Chemical Engineering, 1998 (23) : 11 - 25.
  • 4Xiang R, Lu G Y, He D. Simulated Annealing Algorithm for Solving a Bi - level Optimization Model on High- speed Railway Station Location [ C ]//2010 Third International Conference on Information and Computing. Chengdu: Southwest Jiaotong University, 2010.
  • 5Deb K, Agrawalan S, Pratap A, et al. A fast and elitist multi -objective genetic algorithm: NSGA - II [ J ]. IEEE Transactions on Evolutionary Computation, 2002 (6) : 182 - 197.

同被引文献5

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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