Optimisation

From orch
Revision as of 10:30, 4 April 2017 by Seltz (Talk | contribs) (Created page with "Because of the lost of intermediates species, the reduced mechanisms obtained after the DRGEP and QSS simplifications do not predict well the trajectories of the detailed sche...")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Because of the lost of intermediates species, the reduced mechanisms obtained after the DRGEP and QSS simplifications do not predict well the trajectories of the detailed scheme. An optimisation step is then needed.

The optimisation algorithm performed in ORCh is the genetic algorithm [1] which apply the principles of natural selection and evolution, in order to look for the optimal solution of a problem initialised by a population of potential solutions.

In this case, we want to optimise the parameters of the Arrhenius law, describing the reaction rates. For example, the forward Arrhenius law for the reaction rate of the jth reaction reads :

with the pre-exponential factor, the activation energy, the temperature exponent, and the concentrations of the reactants involved and and the exponents of concentrations.

Given te high values of , we prefer to work with .

The parameters values to be optimised are then put in the form of a triplet (,,) considered as a chromosome. A population will be composed of a set of chromosomes which will evolve and mutate until converging towards the best solution, i.e. the best chromosome.

Bibliography

  1. J.H. Holland, Adaptation in natural and artificial systems, MIT press, Cambridge, MA, USA, 1992. ISBN 0-262-58111-6