期刊文献+

遗传算法优化框架中使用嵌入的混合可视化和数据分析的过程设计优化 被引量:1

Process design optimization using embedded hybrid visualization and data analysis techniques within a genetic algorithm optimization framework
原文传递
导出
摘要 非线性、非凸、不连续的数学模型的使用,使得过程优化问题难以求解。虽然确定性方法已经取得了重大的进步,但随机方法,特别是遗传算法提供了一种更有优势的方法。然而,遗传算法的性质决定了其不适合求解带有高约束的问题。本文提出了一个适用于高度约束问题的目标遗传算法,算法中的算子:交叉和变异,是在数据分析步骤得到的关于可行区域和目标函数行为信息的基础上定义。数据分析是以平行坐标系中的可视化描述为基础,一种模式匹配算法,扫描园算法,通过学习向量量化的使用被扩展来自动地确定目标函数和搜索空间的关键特征,这些特征被用于确定遗传算子。对石油稳定问题应用新的目标遗传算法,其结果证明了方法的有用、高效和健壮性。作为数据分析的核心,可视化技术的使用也可以用于解释优化过程得到的结果。 Process optimization is a difficult task due to the non-linear, non-convex and often discontinuous nature of the mathematical models used. Although significant advances in deterministic methods have been made, stochastic procedures, specifically genetic algorithms, provide attractive technology for solving these optimization problems. However, genetic algorithms are not naturally suited to highly constrained problems. We propose a targeted genetic algorithm for process optimization which is suitable for highly constrained problems. The genetic operators, crossover and mutation, are defined based on information gained about the feasible region and the behavior of the objective function through the use of a data analysis procedure. The data analysis is based on a visual representation, the parallel co-ordinate system. A pattern matching algorithm, the Scan Circle Algorithm is extended through the use of Learning Vector Quantization to identify, automatically, key features of the objective function and the search space. These features are used to target the genetic operators. Results from the application of the new targeted genetic algorithm to an oil stabilization problem are presented, demonstrating the effective, efficient and robust nature of the implementation. The use of visualization as the core of the data analysis step also provides a useful tool for explaining the results obtained by the optimization procedure.
出处 《计算机与应用化学》 CAS CSCD 北大核心 2006年第10期931-938,共8页 Computers and Applied Chemistry
基金 国家973项目资助(G2000263)
关键词 可视化 非线性优化 遗传算法 visualization, non-linear optimization, genetic algorithm
  • 相关文献

参考文献20

  • 1Wang K, Salhi A and Fraga ES. Cluster identification using a parallel co-ordinate system for knowledge discovery and nonlinear optimization, in: J. Grievink, J. van Schijndel (Eds.) , Proceedings of the 12th European Symposium on Computer-Aided Process Engineering, Computer-Aided Chemical Engineering, Elsevier, Amsterdam,2002, 10:1003 - 1008.
  • 2Kohonen T, Self-Organizing Maps, Springer-Verlag, Heidelberg,1995.
  • 3Floudas CA. Nonlinear and Mixed-Integer Optimization:Fundamentals and Applications. Topics in Chemical Engineerin. New York:Oxford University Press, 1995.
  • 4Goldberg DE. Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, Reading, MA, 1989.
  • 5Homaifar A, Lai SHV and Qi X. Constrained optimization via genetic algorithms. Simulation, 1994, 62 (4) :242 - 254.
  • 6Joins JA and Houck CR. On the use of nonstationary penalty functions to solve nonlinear constrained optimization problems with GAs.In:Z. Michalewicz (Ed.) , Proceedings of the International Conference on Evolutionary Computation. IEEE Press, Piscataway, 1994:579 - 584.
  • 7Michalewicz Z and Attia N, Evolutionary optimization of constrained problems, In: AV Sebald LJ. Fogel ( Eds. ), Proceedings of the ThirdAnnual Conference on Evolutionary Programming, World Science, Singapore, 1994:98 - 108.
  • 8Michalewicz Z. Genetic algorithms, numberical optimization and constraints, in: L. Eshelman (Ed.), Proceedings of the Sixth International Conference on Genetic Algorithms, vol. 195, Morgan Kauffman, San Mateo, 1995:151 - 158.
  • 9Michalewicz Z and Schoenauer M. Evolutionary algorithms for constrained parameter optimization problems. Evol Comput, 1996, 4(1) :1 -32.
  • 10Deb K. An efficient constraint handling method for genetic algorithms, Comput. Methods Appl Mech Eng, 2000, 186:311 -338.

同被引文献2

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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