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.
KeywordsGenetic Algorithm Simulated Annealing Dynamic Optimization Stochastic Algorithm Material Balance Equation
Unable to display preview. Download preview PDF.
- Press W.H. and S.A. Teukolsky (1991). Simulated annealing optimization over continuous spaces, Computers in Physics, 5(4), 426.Google Scholar
- Goldberg, D. (1989). Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley.Google Scholar