首页> 外文会议>International Conference on Adaptive and Natural Computing Algorithms >Benchmark testing of simulated annealing, adaptive random search and genetic algorithms for the global optimization of bioprocesses
【24h】

Benchmark testing of simulated annealing, adaptive random search and genetic algorithms for the global optimization of bioprocesses

机译:模拟退火的基准测试,适应性随机搜索和生物处理全球优化的自适应随机搜索和遗传算法

获取原文

摘要

This paper studies the global optimisation of bioprocesses employing model-based dynamic programming schemes. Three stochastic optimisation algorithms were tested: simulated annealing, adaptive random search and genetic algorithms. The methods were employed for optimising two challenging optimal control problems of fed-batch bioreactors. The main results show that adaptive random search and genetic algorithms are superior at solving these problems than the simulated annealing based method, both in accuracy and in the number of function evaluations.
机译:本文研究了采用基于模型的动态规划方案的生物过程的全局优化。测试了三种随机优化算法:模拟退火,自适应随机搜索和遗传算法。该方法用于优化含有膳食生物反应器的两个挑战性的最佳控制问题。主要结果表明,自适应随机搜索和遗传算法在求解这些问题时比基于模拟的基于退火的方法,无论是准确性还是在功能评估的数量。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号