Introduction to Optimization and Classical Methods: 90 min.
1.1 A brief overview of different types of optimization problems
1.2 Classical optimization methods
1.2.1 Gradient-based methods
1.2.2 Direct search methods
1.3 Constraint handling
1.4 Mixed integer programming
1.5 Difficulties with classical methods
Introduction to Evolutionary Algorithms (EAs): 90 min.
2.1 What are EAs?
2.2 An introduction to binary-coded genetic algorithms (GAs)
2.3 Theoretical underpinnings
2.4 Some simple example case studies
2.5 Constraint handling in GAs
Real-Parameter EAs: 120 min.
3.1 Real-parameter GAs
3.2 Evolution strategies (ESs)
3.3 Differential evolution (DE)
3.4 Particle swarm optimization (PSO)
Advanced Evolutionary Algorithms: 120 min.
4.1 Knowledge-augmented EAs
4.2 Function Approximation in EAs
4.3 Multi-modal EAs
Evolutionary Multi-Objective Optimization (EMO): 120 min.
5.1 Introduction to multi-objective optimization
5.2 Classical methods
5.3 EMO methodologies (NSGA-II, SPEA2, etc.)
5.4 Constraint handling
5.5 Some case studies
Advanced Topics on EMO: 120 min.
6.1 Three main applications
6.1.1 Decision-making easier
6.1.2 Unveiling important information in a problem
6.1.3 EMO for other optimization problem-solving
6.2 Interactive EMO
6.3 Robust EMO and other topics
Some Theories of EAs: 90 min.
7.1 Engineering approach
7.1.1 Population sizing
7.1.2 Control maps
7.2 Dynamical systems approach
7.3 Statistical dynamics approach
7.4 Main informative results
Other EA Topics: 90 min.
8.1 Genetic programming (GP)
8.2 Self-adaptive EAs
8.3 Scheduling EAs
8.4 EAs with neural nets and fuzzy logic controllers
Further Reading Materials
This page is maintained by Dr. Kalyanmoy Deb. Please contact at
deb@iitk.ac.in for any comments.
Page last updated on April 15, 2005 by Santosh Tiwari (
tiwaris@iitk.ac.in)