Chapter 7. Design Schedulers

Table of Contents

7.1. Available Schedulers
7.1.1. DOE Sequence
7.1.2. Multi Objective Genetic Algorithm II (MOGA-II)
7.1.3. Simplex
7.1.4. Bounded BFGS (B-BFGS)
7.1.5. Levenberg-Marquardt
7.1.6. Simulated Annealing (SA)
7.1.7. Adaptive Range Multi-Objective Genetic Algorithm (ARMOGA)
7.1.8. Multi Objective Simulated Annealing (MOSA)
7.1.9. Multivariate Adaptive Crossvalidating Kriging (MACK)
7.1.10. Non-dominated Sorting Genetic Algorithm II (NSGA-II)
7.1.11. Multi Objective Game Theory (MOGT)
7.1.12. Fast Multi Objective Genetic Algorithm (FMOGA)
7.1.13. Fast SIMPLEX (FSIMPLEX)
7.1.14. Evolution Strategies
7.1.14.1. (1+1)-Evolution Strategy
7.1.14.2. Derandomized Evolution Strategy (DES)
7.1.14.3. Multimembered Multiobjective Evolution Strategy (MMES)
7.1.15. Sequential Quadratic Programming (NLPQLP)
7.1.16. Normal-Boundary Intersection Method coupled with NLPQLP (NBI-NLPQLP)
7.2. Genetic Algorithms (GAs)
7.2.1. Optimisation Algorithm
7.2.2. Selection Schemas
7.2.3. Cross-over Operators
7.2.4. GA for Multi Objective Optimisation
7.2.5. Constraints handling methods
7.3. MACK Example

The motivation for using modeFRONTIERTM and a general description of the whole design process can be found in the chapters of Why do design optimization while in this chapter a pragmatic description of the tools offered by modeFRONTIERTM and suggestions on how to use them is given.

Any optimization process can be divided into different phases:

  1. preliminary exploration of the design space.

  2. rough optimization using "search" algorithms.

  3. refinement using "converging" algorithms.

The first phase is performed using Design of Experiments techniques, the second phase using statistical multi-objective algorithms (MOGA-II,MMES, MOGT), the third phase using single-objective optimizers (Simplex, B-BFGS, DES).

Between the second and the third phases a decision process take place where the many objectives are collapsed into one using a transfer function (MCDM or other approaches).

As the path to the optimum is, in many cases, quite complex the user should interactively try different strategies until he has effectively reached the optimum or is satisfied with the solution found. Typical optimization problems are usually solved by means of "hill climbing" procedure possibly based on local gradients of a stated cost function. The typical drawback of this approach is the fact that the search for improvements is done efficiently but is done locally. On the other hand probabilistic optimization techniques can be used to examine a large but discrete configuration space in order to find a good solution possibly close to the global optimum. Typical optimization are more accurate but less robust than probabilistic optimization techniques.

As any algorithm needs an initialization set of points, these are taken from the predefined DOE. The number of initial points differs according to the selected algorithms and may range from one single point for the quasi-Newton method B-BFGS to many points in the case of MOGA-II.

To enter the Design Schedulers panel, double click on the Scheduler node identified by the icon .

Schedulers Panel

Figure 7.1. Schedulers Panel

The window is divided into three parts:

A specific algorithm can be selected by a left mouse clicking on the name in the list and with the Apply Schedulers button.

Default values for the algorithm are resumed by the button Default Parameters.


Return to modeFRONTIER Index


Your Ad Here
??