Close category search window
 

Simple Scheduled Memetic Algorithm for inverse problems in higher dimensions: Application to chemical kinetics

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Kononova, A.V. ; Centre for Comput. Fluid Dynamics, Univ. of Leeds, Leeds ; Ingham, D.B. ; Pourkashanian, M.

This paper proposes a scheme for the hybridisation of an evolution strategy framework and periodically scheduled Nelder-Mead algorithm. This relatively simple hybridisation scheme turns out to be efficient for the optimisation problems in higher dimensions. The efficiency of the proposed method is tested for a complex engineering problem, namely an inverse problem of chemical kinetics. An extensive parameter analysis and tuning are presented. Numerical results show the superiority of the proposed methods in comparison with some popular metaheuristics and some tailored algorithms presented in the literature for solving the problem under investigation.

Published in:
Evolutionary Computation, 2008. CEC 2008. (IEEE World Congress on Computational Intelligence). IEEE Congress on

Date of Conference: 1-6 June 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.