首页> 外文学位 >Optimisation d'un procede de traitement des brasques (French text).
【24h】

Optimisation d'un procede de traitement des brasques (French text).

机译:优化锅衬处理工艺(法文)。

获取原文
获取原文并翻译 | 示例

摘要

The optimization of chemical processes defined by computer simulations does not have an exploitable structure, as required for mathematical programming theory. Classical solving methods do not generally work well; they can only detect local optima, when they succeed. Heuristic algorithms usually exhibit good performances, especially if they are stochastic; unfortunately, there is no proof of the solution's optimality.; Direct search algorithms are designed for problems in which the evaluation of the objective function is costly, or derivatives estimation is hard or impossible (noisy, piecewise or modular functions). These algorithms do not need information provided by derivatives.; The goal of this work is to use a Mesh Adaptive Direct Search algorithm (MADS) in order to optimize a spent potliner treatment process (spent potliners are highly toxic wastes of aluminum production). The chosen algorithm is believed to fulfill practical and theoretical lacks of classical and heuristic methods, respectively.; The mesh adaptive direct search algorithm uses a conceptual mesh (which is never explicitly defined) in the space of the variables with evolutionary dimensions. This mesh tends to be infinitely fine at convergence. An iteration consists of two steps: search and poll. The search step, optional, permits the user to guide the algorithm or to provide supplementary information. The poll step, mandatory, consists of an efficient exploration of neighbors defined with the mesh. This step guarantees mathematical convergence to a solution satisfying necessary optimality conditions.
机译:计算机编程定义的化学过程的优化没有数学编程理论所要求的可利用的结构。传统的求解方法通常效果不佳;他们只有在成功时才能检测局部最优。启发式算法通常表现出良好的性能,尤其是在随机的情况下;不幸的是,没有证明解决方案是最优的。直接搜索算法是针对以下问题而设计的:目标函数的评估成本很高,或者导数估计很难或不可能(噪声函数,分段函数或模块函数)。这些算法不需要导数提供的信息。这项工作的目标是使用网格自适应直接搜索算法(MADS)来优化废旧的衬板处理过程(废衬板是铝生产中的剧毒废物)。所选择的算法被认为分别满足了经典和启发式方法在实践和理论上的不足。网格自适应直接搜索算法在具有演化维度的变量空间中使用概念网格(从未明确定义)。该网格在收敛时趋于无限精细。迭代包括两个步骤:搜索和轮询。搜索步骤是可选的,允许用户指导算法或提供补充信息。强制性的轮询步骤包括对网格定义的邻居的有效探索。该步骤保证数学收敛到满足必要最优性条件的解决方案。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号