11479

Particle Swarm Optimization Applied to the van de Vusse Mechanism

Consider the following complex reaction scheme (called the van de Vusse mechanism), taking place in a continuous stirred-tank reactor (CSTR) with a residence time and rate constants , , :
,
.
The feed to the reactor is pure . Initially the reactor contains only species .
This Demonstration determines the values of the residence time and the rate constants using a set of experimental data. The method of resolution is based on particle swarm optimization (PSO). A plot of the exit concentrations of the chemical species , , , and versus time (in blue, red, magenta, and green, respectively) is given for the experimental data and the theoretical model. You can increase the noise of the experimental data. The resultant values of , , , and are indicated on the plot in red and blue, respectively. PSO finds the best solution after a number of iterations and for a chosen size of the swarm, both of which you can vary. Notice, however, their complementary effect.
Here, the problem is four-dimensional, but its extension to higher-dimensional problems using the present code is straightforward. It is seen that the fit is almost perfect (i.e., the values of the fitness are very close to zero) when the noise of the experimental data is small (see first snapshot). A similar result is observed for large swarm sizes and number of iterations. Finally, when the value of the noise of the experimental data is large, the fit is not perfect and the fitness value is significantly larger than zero, as shown in the last snapshot.

SNAPSHOTS

  • [Snapshot]
  • [Snapshot]
  • [Snapshot]

DETAILS

Particle swarm optimization (PSO) resulted from the pioneering work of Kennedy and Eberhart [1, 2]. PSO algorithms mimic the social behavior patterns of organisms that live and interact within large groups, such as swarms of bees.
References
[1] J. Kennedy and R. Eberhart, "Particle Swarm Optimization," in Proceedings of the 1995 International Conference on Neural Networks, Vol. 4, New York: IEEE Press, 1995 pp. 1942–1948. doi:10.1109/ICNN.1995.488968.
[2] J. Kennedy and R. Eberhart, Swarm Intelligence, San Francisco: Morgan Kaufmann Publishers, 2001.
    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.









 
RELATED RESOURCES
Mathematica »
The #1 tool for creating Demonstrations
and anything technical.
Wolfram|Alpha »
Explore anything with the first
computational knowledge engine.
MathWorld »
The web's most extensive
mathematics resource.
Course Assistant Apps »
An app for every course—
right in the palm of your hand.
Wolfram Blog »
Read our views on math,
science, and technology.
Computable Document Format »
The format that makes Demonstrations
(and any information) easy to share and
interact with.
STEM Initiative »
Programs & resources for
educators, schools & students.
Computerbasedmath.org »
Join the initiative for modernizing
math education.
Step-by-Step Solutions »
Walk through homework problems one step at a time, with hints to help along the way.
Wolfram Problem Generator »
Unlimited random practice problems and answers with built-in step-by-step solutions. Practice online or make a printable study sheet.
Wolfram Language »
Knowledge-based programming for everyone.
Powered by Wolfram Mathematica © 2017 Wolfram Demonstrations Project & Contributors  |  Terms of Use  |  Privacy Policy  |  RSS Give us your feedback
Note: To run this Demonstration you need Mathematica 7+ or the free Mathematica Player 7EX
Download or upgrade to Mathematica Player 7EX
I already have Mathematica Player or Mathematica 7+