Abstract
Stochastic and evolutionary optimization methods are more and more used in the analysis, design, and operation of systems that are highly nonlinear, high dimensional, and noisy or for problems that are not easily solved by classical deterministic methods of optimization. This chapter primarily concentrates on evaluating the results of various stochastic and evolutionary optimization algorithms such as genetic algorithm simulated annealing, differential evolution, ant colony optimization, particle swarm optimization, and artificial bee colony algorithm by applying them to different base case problems. Three typical base case problems of different complexities are used for implementation and evaluation of these methods. For the comparative performance, these methods are studied in terms of different criteria such as speed of convergence, number of iterations required to obtain the final converged solution, and complexity of model equation. The solution strategies and the analysis of results on application to base case nonlinear optimization problems of this chapter lead to extend the usefulness of these methods to solve real and complex optimization problems of different domains.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Stochastic Global Optimization Methods and Applications to Chemical, Biochemical, Pharmaceutical and Environmental Processes
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
