Effective Use of Directional Information in Multi-objective Evolutionary Computation
While genetically inspired approaches to multi-objective optimization have many advantages over conventional approaches, they do not explicitly exploit directional/gradient information. This paper describes how steepest-descent, multi-objective optimization theory can be combined with EC concepts to produce improved algorithms. It shows how approximate directional information can be efficiently extracted from parent individuals, and how a multi-objective gradient can be calculated, such that children individuals can be placed in appropriate, dominating search directions. The paper describes and introduces the basic theoretical concepts as well as demonstrating some of the concepts on a simple test problem.
KeywordsSearch Direction Pareto Front Descent Direction Directional Cone Evolutionary Computation Algorithm
Unable to display preview. Download preview PDF.
- Brown, M. 3(2002) Steepest Descent Vector Optimization and Product Design, submitted for publication. in preparationGoogle Scholar
- Coello, Carlos A., Van Veldhuizen, David A., and Lamont, Gary B (2002) Evolutionary Algorithms for Solving Multi-Objective Problems. Kluwer Academic Publishers.Google Scholar
- Deb, K. (2000). Multi-Objective Optimization Using Evolutionary Algorithms. Wiley.Google Scholar
- Deb, K, Anand, A., and Joshi, D (2002). A Computationally Efficient Evolutionary Algorithm for Real-Parameter Optimization. KanGAL Report No. 2002003. (to appear in the journal Evolutionary Computation).Google Scholar
- Product Formulation using Intelligent Software, http://www.brad.ac.uk/acad/profits/website/Google Scholar
- Vicini, A., and Quagliarella, D. (1997) Inverse and direct airfoil design by means of a multi-objective genetic algorithm. AIAA Journal. 35(9).Google Scholar