Evolutionary Multi-Criterion Optimization: First International Conference, EMO 2001, Zurich, Switzerland, March 7-9, 2001 Proceedings

Lecture Notes in Computer Science Edited by G. Goos, J. Hartmanis and J. van Leeuwen 1993 3 Berlin Heidelberg New Yo...

Author: Eckart Zitzler | Kalyanmoy Deb | Lothar Thiele | Carlos A. Coello Coello | David Corne

42 downloads 893 Views 9MB Size Report

This content was uploaded by our users and we assume good faith they have the permission to share this book. If you own the copyright to this book and it is wrongfully on our website, we offer a simple DMCA procedure to remove your content from our site. Start by pressing the button below!
Report copyright / DMCA form

DOWNLOAD PDF

Lecture Notes in Computer Science Edited by G. Goos, J. Hartmanis and J. van Leeuwen

1993

3

Berlin Heidelberg New York Barcelona Hong Kong London Milan Paris Singapore Tokyo

Eckart Zitzler Kalyanmoy Deb Lothar Thiele Carlos A. Coello Coello David Corne (Eds.)

Evolutionary Multi-Criterion Optimization First International Conference, EMO 2001 Zurich, Switzerland, March 7-9, 2001 Proceedings

13

Volume Editors Eckart Zitzler Lothar Thiele Swiss Federal Institute of Technology, Department of Electrical Engineering Computer Engineering and Networks Laboratory ETH Zentrum, Gloriastrasse 35, 8092 Zurich, Switzerland E-mail: {zitzler/thiele}@tik.ee.ethz.ch Kalyanmoy Deb Indian Institute of Technology, Department of Mechanical Engineering Kanpur Genetic Algorithms Laboratory, Kanpur, UP 208 016, India E-mail: [email protected] Carlos Artemio Coello Coello CINVESTAV-IPN, Electrical Engineering Department, Computer Science Section Av. Instituto Politecnico Nacional No. 2508 Col. San Pedro Zacatenco, Mexico City 07300, Mexico E-mail: [email protected] David Corne University of Reading, Department of Computer Science P.O. Box 225, Whiteknights, Reading RG6 6AY, UK E-mail: [email protected] Cataloging-in-Publication Data applied for Die Deutsche Bibliothek - CIP-Einheitsaufnahme Evolutionary multi-criterion optimization : first international conference ; proceedings / EMO 2001, Zurich, Switzerland, March 7 - 9, 2001. Eckart Zitzler . . . (ed.). - Berlin ; Heidelberg ; New York ; Barcelona ; Hong Kong ; London ; Milan ; Paris ; Singapore ; Tokyo : Springer, 2001 (Lecture notes in computer science ; Vol. 1993) ISBN 3-540-41745-1

CR Subject Classification (1998): F.2, G.1.6, G.1.2, I.2.8 ISSN 0302-9743 ISBN 3-540-41745-1 Springer-Verlag Berlin Heidelberg New York This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer-Verlag. Violations are liable for prosecution under the German Copyright Law. Springer-Verlag Berlin Heidelberg New York a member of BertelsmannSpringer Science+Business Media GmbH http://www.springer.de © Springer-Verlag Berlin Heidelberg 2001 Printed in Germany Typesetting: Camera-ready by author, data conversion by PTP-Berlin, Stefan Sossna Printed on acid-free paper SPIN: 10782086 06/3142 543210

V

Preface

Multi-criterion optimization deals with multiple, often conflicting objectives which naturally arise in a real-world scenario. The field of multiple criteria decision making (MCDM) is well established, investigated by many researchers and scientists, and widely applied in practice. Unlike in single-objective optimization, a multi-criterion optimization problem gives rise to a number of optimal solutions, known as Pareto-optimal solutions, of which none can be said to be better than the others with respect to all objectives. Thus, one of the primary goals in multi-criterion optimization is to find or to approximate the set of Pareto-optimal solutions. Since evolutionary algorithms work with a population of solutions, they have been used in multi-criterion optimization for more than a decade. To date, there exist a number of evolutionary approaches and application case studies, demonstrating the usefulness and efficiency of evolutionary multi-criterion optimization (EMO). Due to the growing interest in EMO, the general chairs envisaged organizing this first-ever international conference covering all aspects of the intersection of evolutionary computation and classical MCDM. The aim was to promote and share research activities in this promising field. The first international conference on evolutionary multi-criterion optimization (EMO 2001) was held in Z¨ urich at the Swiss Federal Institute of Technology (ETH) on March 7–9, 2001. This event included two keynote speeches, one delivered by Ralph E. Steuer on current state-of-the-art methodology and the other delivered by Ian C. Parmee on real-world applications of evolutionary techniques. Furthermore, two extended tutorials were presented, one on classical multiple criteria decision making methodologies by Kaisa Miettinen and another one on evolutionary algorithms by Carlos A. Coello Coello. In response to the call for papers, 87 papers from 27 countries were submitted, each of which was independently reviewed by at least three members of the program committee. This volume presents a selection of 45 of the refereed papers, together with contributions based on the invited talks and tutorials. We would like to express our appreciation to the keynote speakers who accepted our invitation, to the tutorial organizers, to all authors who submitted papers to EMO 2001, and to Marco Laumanns and Monica Fricker for their invaluable help in organizing the conference.

March 2001

Eckart Zitzler, Kalyanmoy Deb, Lothar Thiele, Carlos A. Coello Coello, and David Corne

Organization

EMO 2001 took place from March 7th to 9th, 2001 at the Swiss Federal Institute of Technology (ETH) Z¨ urich, Switzerland, and was organized in cooperation with ACM/SIGART, IEEE Neural Network Council, and the International Society for Genetic and Evolutionary Computation (ISGEC).

General Chairs Kalyanmoy Deb Lothar Thiele Eckart Zitzler

IIT Kanpur, India ETH Z¨ urich, Switzerland ETH Z¨ urich, Switzerland

Executive Program Committee Hojjat Adeli Carlos A. Coello Coello David Corne Carlos Fonseca David E. Goldberg Jeffrey Horn Sourav Kundu Gary B. Lamont Shigeru Obayashi Ian C. Parmee Carlo Poloni G¨ unter Rudolph J. David Schaffer Hans-Paul Schwefel El-ghazali Talbi

Ohio State University, USA CINVESTAV-IPN, Mexico University of Reading, UK Universidade do Algarve, Portugal University of Illinois at Urbana-Champaign, USA Northern Michigan University, USA Mastek Limited, Japan Air Force Institute of Technology, USA Tohoku University, Japan University of Plymouth, UK University of Trieste, Italy University of Dortmund, Germany Phillips Research, USA University of Dortmund, Germany Université des Sciences et Technologies de Lille, France

Program Committee Enrique Baeyens Tapan P. Bagchi Peter J. Bentley J¨ urgen Branke Nirupam Chakraborti William A. Crossley

University de Valladolid, Spain IIT Kanpur, India University College London, UK University of Karlsruhe, Germany IIT Kharagpur, India Purdue University, USA

VIII

Organization

Dragan Cvetkovic Nicole Drechsler Rolf Drechsler Peter Fleming Kary Fr¨ amling Antonio Gaspar-Cunha Prabhat Hajela Thomas Hanne Alberto Herreros Evan J. Hughes Hisao Ishibuchi Andrzej Jaszkiewicz Joshua D. Knowles Petros Koumoutsakos Rajeev Kumar Bill Langdon Marco Laumanns Mark Sh. Levin Daniel H. Loughlin Filippo Menczer Martin Middendorf Tadahiko Murata Pedro Oliveira Andrzej Osyczka S. Ranji Ranjithan Katya Rodriguez-Vazquez Carlos Mariano Romero Ralf Salomon Marc Schoenauer Pratyush Sen Hisashi Tamaki Kay Chen Tan Dirk Thierens Mark Thompson Thanh Binh To Marco Tomassini David A. Van Veldhuizen

Soliton Associates Ltd., Canada University of Freiburg, Germany Siemens AG, Germany University of Sheffield, UK Helsinki University of Technology, Finland University of Minho, Portugal Rensselaer Polytechnic Institute, USA Institute for Techno- and Economathematics, Germany University of Valladolid, Spain Cranfield University, UK Osaka Prefecture University, Japan Poznan University of Technology, Poland University of Reading, UK ETH Z¨ urich, Switzerland IIT Kharagpur, India University College London, UK ETH Z¨ urich, Switzerland Ben-Gurion University, Israel North Carolina State University, USA University of Iowa, USA University of Karlsruhe, Germany Ashikaga Institute of Technology, Japan Universidade do Minho, Portugal Cracow University of Technology, Poland North Carolina State University, USA IIMAS-UNAM, Mexico IMTA, Mexico University of Z¨ urich, Switzerland Ecole Polytechnique, France University of Newcastle, UK Kobe University, Japan National University, Singapore Utrecht University, The Netherlands Sheffield Hallam University, UK Institute of Automation and Communication Magdeburg, Germany University of Lausanne, Switzerland US Air Force, USA

Table of Contents

Tutorials Some Methods for Nonlinear Multi-objective Optimization . . . . . . . . . . . . . . Kaisa Miettinen

1

A Short Tutorial on Evolutionary Multiobjective Optimization . . . . . . . . . . . 21 Carlos A. Coello Coello

Invited Talks An Overview in Graphs of Multiple Objective Programming . . . . . . . . . . . . . 41 Ralph E. Steuer Poor-Definition, Uncertainty and Human Factors – Satisfying Multiple Objectives in Real-World Decision-Making Environments . . . . . . . . . . . . . . . 52 I. C. Parmee

Algorithm Improvements Controlled Elitist Non-dominated Sorting Genetic Algorithms for Better Convergence . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 67 Kalyanmoy Deb, Tushar Goel Specification of Genetic Search Directions in Cellular Multi-objective Genetic Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 82 Tadahiko Murata, Hisao Ishibuchi, Mitsuo Gen Adapting Weighted Aggregation for Multiobjective Evolution Strategies . . 96 Yaochu Jin, Tatsuya Okabe, Bernhard Sendhoff Incrementing Multi-objective Evolutionary Algorithms: Performance Studies and Comparisons . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 111 K. C. Tan, T. H. Lee, E. F. Khor A Micro-Genetic Algorithm for Multiobjective Optimization . . . . . . . . . . . . . 126 Carlos A. Coello Coello, Gregorio Toscano Pulido Evolutionary Algorithms for Multicriteria Optimization with Selecting a Representative Subset of Pareto Optimal Solutions . . . . . . . . . . . . . . . . . . . . . 141 Andrzej Osyczka, Stanislaw Krenich Multi-objective Optimisation Based on Relation Favour . . . . . . . . . . . . . . . . . 154 Nicole Drechsler, Rolf Drechsler, Bernd Becker

X

Table of Contents

Performance Assessment and Comparison Comparison of Evolutionary and Deterministic Multiobjective Algorithms for Dose Optimization in Brachytherapy . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 167 Natasa Milickovic, Michael Lahanas, Dimos Baltas, Nikolaos Zamboglou On The Effects of Archiving, Elitism, and Density Based Selection in Evolutionary Multi-objective Optimization . . . . . . . . . . . . . . . . . . . . . . . . . . . . 181 Marco Laumanns, Eckart Zitzler, Lothar Thiele Global Multiobjective Optimization with Evolutionary Algorithms: Selection Mechanisms and Mutation Control . . . . . . . . . . . . . . . . . . . . . . . . . . 197 Thomas Hanne Inferential Performance Assessment of Stochastic Optimisers and the Attainment Function . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 213 Viviane Grunert da Fonseca, Carlos M. Fonseca, Andreia O. Hall A Statistical Comparison of Multiobjective Evolutionary Algorithms Including the MOMGA-II . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 226 Jesse B. Zydallis, David A. Van Veldhuizen, Gary B. Lamont Performance of Multiple Objective Evolutionary Algorithms on Distribution System Design Problem – Computational Experiment . . . . . . . 241 Andrzej Jaszkiewicz, Maciej Hapke, Pawel Kominek

Constraint Handling and Problem Decomposition An Infeasibility Objective for Use in Constrained Pareto Optimization . . . . 256 Jonathan Wright, Heather Loosemore Reducing Local Optima in Single-Objective Problems by Multi-objectivization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 269 Joshua D. Knowles, Richard A. Watson, David W. Corne Constrained Test Problems for Multi-objective Evolutionary Optimization 284 Kalyanmoy Deb, Amrit Pratap, T. Meyarivan Constraint Method-Based Evolutionary Algorithm (CMEA) for Multiobjective Optimization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 299 S. Ranji Ranjithan, S. Kishan Chetan, Harish K. Dakshina

Uncertainty and Noise Pareto-Front Exploration with Uncertain Objectives . . . . . . . . . . . . . . . . . . . . 314 J¨ urgen Teich Evolutionary Multi-objective Ranking with Uncertainty and Noise . . . . . . . 329 Evan J. Hughes

Table of Contents

XI

Hybrid and Alternative Methods Tabu-Based Exploratory Evolutionary Algorithm for Effective Multi-objective Optimization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 344 E. F. Khor, K. C. Tan, T. H. Lee Bi-Criterion Optimization with Multi Colony Ant Algorithms . . . . . . . . . . . 359 Steffen Iredi, Daniel Merkle, Martin Middendorf Multicriteria Evolutionary Algorithm with Tabu Search for Task Assignment . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 373 Jerzy Balicki, Zygmunt Kitowski A Hybrid Multi-objective Evolutionary Approach to Engineering Shape Design . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 385 Kalyanmoy Deb, Tushar Goel Fuzzy Evolutionary Hybrid Metaheuristic for Network Topology Design . . . 400 Habib Youssef, Sadiq M. Sait, Salman A. Khan A Hybrid Evolutionary Approach for Multicriteria Optimization Problems: Application to the Flow Shop . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 416 El-Ghazali Talbi, Malek Rahoual, Mohamed Hakim Mabed, Clarisse Dhaenens The Supported Solutions Used as a Genetic Information in a Population Heuristics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 429 Xavier Gandibleux, Hiroyuki Morita, Naoki Katoh

Scheduling Multi-objective Flow-Shop: Preliminary Results . . . . . . . . . . . . . . . . . . . . . . . . 443 C. Brizuela, N. Sannomiya, Y. Zhao Pareto-Optimal Solutions for Multi-objective Production Scheduling Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 458 Tapan P. Bagchi Comparison of Multiple Objective Genetic Algorithms for Parallel Machine Scheduling Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 472 W. Matthew Carlyle, Bosun Kim, John W. Fowler, Esma S. Gel

Applications A Bi-Criterion Approach for the Airlines Crew Rostering Problem . . . . . . . 486 Walid El Moudani, Carlos Alberto Nunes Cosenza, Marc de Coligny, Félix Mora-Camino

XII

Table of Contents

Halftone Image Generation with Improved Multiobjective Genetic Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 501 Hern´ an E. Aguirre, Kiyoshi Tanaka, Tatsuo Sugimura, Shinjiro Oshita Microchannel Optimization Using Multiobjective Evolution Strategies . . . . 516 Ivo F. Sbalzarini, Sibylle M¨ uller, Petros Koumoutsakos Multi-objective Optimisation of Cancer Chemotherapy Using Evolutionary Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 531 Andrei Petrovski, John McCall Application of Multi Objective Evolutionary Algorithms to Analogue Filter Tuning . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 546 Mark Thompson Multiobjective Design Optimization of Real-Life Devices in Electrical Engineering: A Cost-Effective Evolutionary Approach . . . . . . . . . . 560 P. Di Barba, M. Farina, A. Savini Application of Multiobjective Evolutionary Algorithms for Dose Optimization Problems in Brachytherapy . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 574 Michael Lahanas, Natasa Milickovic, Dimos Baltas, Nikolaos Zamboglou Multiobjective Optimization in Linguistic Rule Extraction from Numerical Data . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 588 Hisao Ishibuchi, Tomoharu Nakashima, Tadahiko Murata Determining the Color-Efficiency Pareto Optimal Surface for Filtered Light Sources . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 603 Neil H. Eklund, Mark J. Embrechts Multi-objective Design Space Exploration of Road Trains with Evolutionary Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 612 Nando Laumanns, Marco Laumanns, Dirk Neunzig Multiobjective Optimization of Mixed Variable Design Problems . . . . . . . . . 624 Johan Andersson, Petter Krus Aerodynamic Shape Optimization of Supersonic Wings by Adaptive Range Multiobjective Genetic Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 639 Daisuke Sasaki, Masashi Morikawa, Shigeru Obayashi, Kazuhiro Nakahashi Accurate, Transparent, and Compact Fuzzy Models for Function Approximation and Dynamic Modeling through Multi-objective Evolutionary Optimization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 653 Fernando Jiménez, Antonio F. G´ omez-Skarmeta, Hans Roubos, Robert Babuˇska

Table of Contents

XIII

Multi-objective Evolutionary Design of Fuzzy Autopilot Controller . . . . . . . 668 Anna L. Blumel, Evan J. Hughes, Brian A. White The Niched Pareto Genetic Algorithm 2 Applied to the Design of Groundwater Remediation Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 681 Mark Erickson, Alex Mayer, Jeffrey Horn MOLeCS: Using Multiobjective Evolutionary Algorithms for Learning . . . . 696 Ester Bernad´ o i Mansilla, Josep M. Garrell i Guiu Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 711

Some Methods for Nonlinear Multi-objective Optimization Kaisa Miettinen? University of Jyv¨ askyl¨ a, Department of Mathematical Information Technology, P.O. Box 35 (Agora), FIN-40351 Jyv¨ askyl¨ a, Finland [email protected] WWW home page: http://www.mit.jyu.fi/miettine/engl.html

Abstract. A general overview of nonlinear multiobjective optimization methods is given. The basic features of several methods are introduced so that an appropriate method could be found for different purposes. The methods are classified according to the role of a decision maker in the solution process. The main emphasis is devoted to interactive methods where the decision maker progressively provides preference information so that the most satisfactory solution can be found.

1

Introduction

Multiple criteria decision making (MCDM) problems form an extensive field where the best possible compromise should be found by evaluating several conflicting objectives. There is a good reason to classify such problems on the basis of their different characteristics. Here we concentrate on problems involving continuous nonlinear functions with deterministic values. We present versatile methods for solving such problems. The solution process usually requires the participation of a human decision maker (DM) who can give preference information related to conflicting goals. Here we assume that a single DM is involved. Methods are divided into four classes according to the role of the DM. Either no DM takes part in the solution process or (s)he expresses preference relations before, after or during the process. The last-mentioned, interactive, methods form the most extensive class of methods. Multiobjective optimization problems are usually solved by scalarization. Scalarization means that the problem is converted into one single or a family of single objective optimization problems. This new problem has a real-valued objective function that possibly depends on some parameters and it can be solved using single objective optimizers. Further information about the methodology of deterministic multiobjective optimization can be found, e.g., in the monographs [6,12,14,20,27,30]. For a more detailed presentation of the methods treated here as well as other related topics we refer to [20] and references therein. ?

This research was supported by the Academy of Finland, grant #65760.

E. Zitzler et al. (Eds.): EMO 2001, LNCS 1993, pp. 1–20, 2001. c Springer-Verlag Berlin Heidelberg 2001

2

2

K. Miettinen

Concepts and Background

A multiobjective optimization problem is of the form minimize {f1 (x), f2 (x), . . . , fk (x)} subject to x ∈ S

(1)

involving k (≥ 2) conflicting objective functions fi : IRn → IR that we want to minimize simultaneously. The decision (variable) vectors x = (x1 , x2 , . . . , xn )T belong to the (nonempty) feasible region S ⊂ IRn . The feasible region is formed by constraint functions but we do not fix them here. We denote the image of the feasible region by Z ⊂ IRk and call it a feasible objective region. The elements of Z are called objective vectors and they consist of objective (function) values f (x) = (f1 (x), f2 (x), . . . , fk (x))T . Note that if fi is to be maximized, it is equivalent to minimize −fi . In what follows, a function is called nondifferentiable if it is locally Lipschitzian (and not necessarily continuously differentiable). Definition 1. When all the objective and the constraint functions are linear, the problem is called linear or an MOLP problem. If at least one of the functions is nonlinear, the problem is a nonlinear multiobjective optimization problem. Correspondingly, the problem is nondifferentiable is some of the functions is nondifferentiable and convex if all the objective functions and the feasible region are convex. Because of the contradiction and possible incommensurability of the objective functions, it is not possible to find a single solution that would optimize all the objectives simultaneously. In multiobjective optimization, vectors are regarded as optimal if their components cannot be improved without deterioration to at least one of the other components. This is usually called Pareto optimality. Definition 2. A decision vector x∗ ∈ S is Pareto optimal if there does not exist another x ∈ S such that fi (x) ≤ fi (x∗ ) for all i = 1, . . . , k and fj (x) < fj (x∗ ) for at least one index j. An objective vector is Pareto optimal if the corresponding decision vector is Pareto optimal. There are usually a lot (infinite number) of Pareto optimal solutions and they form a set of Pareto optimal solutions or a Pareto optimal set. This set can be nonconvex and nonconnected. Definition 2 introduces global Pareto optimality. Another important concept is local Pareto optimality defined in a small environment of the point considered. Naturally, any globally Pareto optimal solution is locally Pareto optimal. The converse is valid for convex problems. To be more specific, if the feasible region is convex and the objective functions are quasiconvex with at least one strictly quasiconvex function, then locally Pareto optimal solutions are also globally Pareto optimal.

Some Methods for Nonlinear Multi-objective Optimization

3

Other related optimality concepts are weak and proper Pareto optimality. The properly Pareto optimal set is a subset of the Pareto optimal set which is a subset of the weakly Pareto optimal set. A vector is weakly Pareto optimal if there does not exist any other feasible vector for which all the components are better. In other words, when compared to Definition 2, all the inequalities are strict. Weakly Pareto optimal solutions are often relevant from a technical point of view because they are sometimes easier to generate than Pareto optimal points. Pareto optimal solutions can be divided into improperly and properly Pareto optimal ones according to whether unbounded trade-offs between objectives are allowed or not. Proper Pareto optimality can be defined in several ways (see, e.g., [20]). According to [9] a solution is properly Pareto optimal if there is at least one pair of objectives for which a finite decrement in one objective is possible only at the expense of some reasonable increment in the other objective. Mathematically, all the Pareto optimal points are equally acceptable solutions of the multiobjective optimization problem. However, it is generally desirable to obtain one point as a solution. Selecting one out of the set of Pareto optimal solutions calls for a decision maker (DM). (S)he is a person who has better insight into the problem and who can express preference relations between different solutions. Finding a solution to (1) is called a solution process. It usually means the co-operation of the DM and an analyst. An analyst is a person or a computer program responsible for the mathematical side of the solution process. The analyst generates information for the DM to consider and the solution is selected according to the preferences of the DM. By solving a multiobjective optimization problem we here mean finding a feasible decision vector such that it is Pareto optimal and satisfies the DM. Assuming such a solution exists, it is called a final solution. The ranges of the Pareto optimal set provide valuable information for the solution process if the objective functions are bounded over the feasible region. The components zi? of the ideal objective vector z ? ∈ IRk are obtained by minimizing each of the objective functions individually subject to the constraints. The ideal objective vector is not feasible because of the conflict among the objectives. From the ideal objective vector we obtain the lower bounds of the Pareto optimal set. Note that in nonconvex problems we need a global optimizer for calculating the ideal objective vector. The upper bounds of the Pareto optimal set, that is, the components of a nadir objective vector z nad , are usually rather difficult to obtain. They can be estimated from a payoff table (see, e.g., [20]) but this is not a reliable way as can be seen, e.g., in [15,31]. For nonlinear problems, there is no constructive method for calculating the nadir objective vector. Nonetheless, the payoff table may be used as a rough estimate as long as its robustness is kept in mind. Because of the above-described difficulty of calculating the actual nadir objective vector, z nad is usually an approximation.

4

K. Miettinen

Sometimes we need a vector that is strictly better than every Pareto optimal solution. Such a vector is called a utopian objective vector z ?? ∈ IRk and its components are formed by decreasing the components of z ? by a positive scalar. It is often assumed that the DM makes decisions on the basis of an underlying function. This function representing the preferences of the DM is called a value function U : IRk → IR (see [14]). In many methods, the value (or utility) function is assumed to be known implicitly. Value functions are important in the development of solution methods and as a theoretical background. Generally, the value function is assumed to be strongly decreasing. This means that the preference of the DM will increase if the value of an objective function decreases while all the other objective values remain unchanged (i.e., less is preferred to more). In this case, the maximum of U is Pareto optimal. Regardless of the existence of a value function, it is usually assumed that less is preferred to more by the DM. Instead of as a maximum of the value function, a final solution can be understood as a satisficing one. Satisficing decision making means that the DM does not intend to maximize any value function but tries to achieve certain aspirations. A solution which satisfies all the aspirations of the DM is called a satisficing solution. During solution processes, various kinds of information are solicited from the DM. Aspiration levels z¯i , i = 1, . . . , k, are such desirable or acceptable levels in the objective function values that are of special interest and importance to the ¯ ∈ IRk is called a reference point. DM. The vector z According to the definition of Pareto optimality, moving from one Pareto optimal solution to another necessitates trading off. This is one of the basic concepts in multiobjective optimization. A trade-off reflects the ratio of change in the values of the objective functions concerning the increment of one objective function that occurs when the value of some other objective function decreases. For details, see, e.g., [6,20]. It is said that two feasible solutions are situated on the same indifference curve if the DM finds them equally desirable. For any two Pareto optimal solutions on the same indifference curve there is a trade-off involving a certain increment in one objective function value that the DM can tolerate in exchange for a certain amount of decrement in some other objective function while the preferences of the two solutions remain the same. This is called the marginal rate of substitution mij (x∗ ) (i, j = 1, . . . , k, i 6=j). To conclude this section, let us have a look at how the Pareto optimality of a feasible decision vector can be tested. This topic is investigated, e.g., in [1,20]. A decision vector x∗ ∈ S is Pareto optimal if and only if the problem Pk minimize i=1 εi subject to fi (x) + εi = fi (x∗ ) for all i = 1, . . . , k, εi ≥ 0 for all i = 1, . . . , k, x∈S

(2)


5

has an optimal objective function value of zero, where both x ∈ IRn and ε ∈ IRk+ are variables. On the other hand, if (2) has a finite nonzero optimal objective ˆ , then x ˆ is Pareto optimal. Note that the equalities function value obtained at x in (2) can be replaced with inequalities.

3

Methods

Mathematically, the multiobjective optimization problem is considered to be solved when the Pareto optimal set is found. This is also known as vector optimization. However, this is not always enough. Instead, we want to obtain one final solution. This means that we must find a way to order the Pareto optimal solutions and here we need a DM and her/his preferences. In what follows, we present several methods for finding a final solution. We cannot cover every existing method but we introduce several philosophies and ways of approaching the problem. The methods can be classified in many ways. Here we apply the classification presented in [12] based on the participation of the DM in the solution process. The classes are no-preference methods, a posteriori methods, a priori methods and interactive methods. Note that no classification can be complete and overlapping and combinations of classes are possible. In addition, we consider an alternative way of classification into ad hoc and non ad hoc methods. This division, suggested in [29], is based on the existence of an underlying value function. Even if one knew the DM’s value function, one would not exactly know how to respond to the questions posed by an ad hoc algorithm. On the other hand, in non ad hoc methods the responses can be determined or at least confidently simulated with the help of a value function. In no-preference methods, the opinions of the DM are not taken into consideration. Thus, the problem is solved using some relatively simple method and the solution is presented to the DM who may either accept or reject it. For details if this class see, e.g., [20]. Next we introduce examples of a posteriori, a priori and interactive methods.

4

A Posteriori Methods

A posteriori methods could also be called methods for generating Pareto optimal solutions. After the Pareto optimal set (or a part of it) has been generated, it is presented to the DM, who selects the most preferred solution. The inconveniences here are that the generation process is usually computationally expensive and sometimes in part, at least, difficult. On the other hand, it is hard for the DM to select from a large set of alternatives. An important question related to this is how to display the alternatives to the DM in an illustrative way. If there are only two objective functions, the Pareto optimal set can be generated parametrically (see, e.g., [2,8]). The problem becomes more complicated with more objectives.

6

4.1

K. Miettinen

Weighting Method

In the weighting method (see, e.g. [8,35]), we solve the problem Pk minimize i=1 wi fi (x) (3) subject to x ∈ S , Pk where wi ≥ 0 for all i = 1, . . . , k and i=1 wi = 1. The solution of (3) is weakly Pareto optimal and it is Pareto optimal if wi > 0 for all i = 1, . . . , k or the solution is unique. The weakness of the weighting method is that not all of the Pareto optimal solutions can be found unless the problem is convex. The conditions under which the whole Pareto optimal set can be generated by the weighting method with positive weights are presented in [5]. Systematic ways of perturbing the weights to obtain different Pareto optimal solutions are suggested, e.g., in [6] (pp. 234–236). In addition, an algorithm for generating different weights automatically for convex problems to produce an approximation of the Pareto optimal set is proposed in [4]. The method has several weaknesses. On the one hand, a small change in the weights may cause big changes in the objective vectors. On the other hand, dramatically different weights may produce nearly similar objective vectors. In addition, an evenly distributed set of weights does not necessarily produce an evenly distributed representation of the Pareto optimal set. 4.2

ε-Constraint Method

In the ε-constraint method, introduced in [11], one of the objective functions is optimized in the form minimize f` (x) subject to fj (x) ≤ εj for all j = 1, . . . , k, j 6=`, x∈S ,

(4)

where ` ∈ {1, . . . , k} and εj are upper bounds for the objectives j 6=`. The solution of (4) is weakly Pareto optimal. On the other hand, x∗ ∈ S is Pareto optimal if and only if it solves (4) for every ` = 1, . . . , k, where εj = fj (x∗ ) for j = 1, . . . , k, j 6=`. In addition, the unique solution of (4) is Pareto optimal for any upper bounds. Thus, finding any Pareto optimal solution does not necessitate convexity. In order to ensure Pareto optimality in this method, we have to either solve k different problems or obtain a unique solution. In general, uniqueness is not necessarily easy to verify. Systematic ways of perturbing the upper bounds to obtain different Pareto optimal solutions are suggested in [6] (pp. 283–295). 4.3

Method of Weighted Metrics

In the method of weighted metrics, the distance between some reference point and the feasible objective region is minimized. A common way is to use the ideal


7

objective vector and Lp -metrics. We can produce different solutions by weighting the metrics. This method is also sometimes called compromise programming. The solution obtained depends greatly on the value chosen for p. For 1 ≤ p < ∞ we have a problem P 1/p k fi (x) − z ? p w minimize i i i=1 subject to x ∈ S .

(5)

The exponent 1/p can be dropped. For p = ∞ we have a weighted Tchebycheff problem minimize maxi=1,...,k wi |fi (x) − zi? | (6) subject to x ∈ S . Notice that no absolute values are needed if we know the global ideal objective vector. The solution of (5) is Pareto optimal if either the solution is unique or all the weights are positive. Furthermore, the solution of (6) is weakly Pareto optimal for positive weights. Finally, (6) has at least one Pareto optimal solution. Convexity of the problem is needed in order to guarantee that every Pareto optimal solution can be found by (5). On the other hand, any Pareto optimal solution can be found by (6) when z ?? is used as a reference point. Weakly Pareto optimal solutions can be avoided in (6) by giving a slight slope to the contour of the metric (see [27]). The augmented problem to be solved is Pk minimize maxi=1,...,k wi |fi (x) − zi?? | + ρ i=1 |fi (x) − zi?? | subject to x ∈ S ,

(7)

where ρ is a sufficiently small positive scalar. In this case, it may be impossible to find every Pareto optimal solution. Instead, (7) generates properly Pareto optimal solutions and any properly Pareto optimal solution can be found. Let us mention that different connections between the weighting method, the ε-constraint method and the method of weighted metrics are presented in [17]. 4.4

Achievement Scalarizing Function Approach

Scalarizing functions of a special type are called achievement (scalarizing) functions. They have been introduced by Wierzbicki, e.g., in [32,33]. These functions ¯ ∈ IRk is an arbitrary reference point. Beare of the form sz¯ : Z → IR, where z cause we do not know Z explicitly, in practice we minimize the function sz¯ (f (x)) subject to x ∈ S. We can define so-called order-representing and order-approximating achievement functions. Then we have the following properties for any reference point: If the achievement function is order-representing, then its solution is weakly Pareto optimal and if the function is order-approximating, then its solution is Pareto optimal. On the other hand, any (weakly) Pareto optimal solution can be found if the achievement function is order-representing. Thus, weakly Pareto optimal or Pareto optimal solutions can be obtained by moving the reference point only.

8

K. Miettinen

There are many achievement functions satisfying the above-presented conditions. An example of order-representing functions is sz¯ (z) = maxi=1,...,k [ wi (zi − z¯i ) ], where w is some fixed positive weighting vector. An example of orderapproximating achievement functions is sz¯ (z) = max [ wi (zi − z¯i ) ] + ρ i=1,...,k

k X

wi (zi − z¯i ) ,

(8)

i=1

where w is as above and ρ > 0.

5

A Priori Methods

In a priori methods, the DM must specify her/his preferences, hopes and opinions before the solution process. Unfortunately, the DM does not necessarily know beforehand what it is possible to attain in the problem and how realistic her/his expectations are. 5.1

Value Function Method

The value function approach was already mentioned earlier. It is an excellent method if the DM happens to know an explicit mathematical formulation for the value function and if that function represents wholly her/his preferences. Unfortunately, it may be difficult, if not impossible, to get that mathematical expression. On the other hand, it can be difficult to optimize because of its possible complicated nature. Note that the DM’s preferences must satisfy certain conditions so that a value function can be defined on them. The DM must, e.g., be able to specify consistent preferences. 5.2

Lexicographic Ordering

In lexicographic ordering, the DM must arrange the objective functions according to their absolute importance. This ordering means that a more important objective is infinitely more important than a less important objective. After ordering, the most important objective function is minimized subject to the original constraints. If this problem has a unique solution, it is the final one. Otherwise, the second most important objective function is minimized. Now, a new constraint is added to guarantee that the most important objective function preserves its optimal value. If this problem has a unique solution, it is the final one. Otherwise, the process goes on. The solution of lexicographic ordering is Pareto optimal. The method is quite simple and people usually make decisions successively. However, the DM may have difficulties in specifying an absolute order of importance. Besides, it is very likely that the process stops before less important objective functions are taken into consideration.


9

Note that lexicographic ordering does not allow a small increment of an important objective function to be traded off with a great decrement of a less important objective. Yet, trading off might often be appealing to the DM. 5.3

Goal Programming

Goal programming is one of the first methods expressly created for multiobjective optimization. The DM is asked to specify aspiration levels z¯i (i = 1, . . . , k) for the objective functions and deviations from these aspiration levels are minimized. An objective function jointly with an aspiration level forms a goal . For minimization problems, goals are of the form fi (x) ≤ z¯i . Here the aspiration levels are assumed to be selected so that they are not achievable simultaneously. Next, the overachievements δi of the objective function values are minimized. The method has several variants. In the weighted approach, see [7], the weighted sum of the deviational variables is minimized. This means that in addition to the aspiration levels, the DM must specify positive weights. Then we have a problem Pk minimize i=1 wi δi subject to fi (x) − δi ≤ z¯i for all i = 1, . . . , k, (9) δi ≥ 0 for all i = 1, . . . , k, x∈S , where x ∈ IRn and δi (i = 1, . . . , k) are the variables and δi = max [0, fi (x)− z¯i ]. In the lexicographic approach, the DM must specify a lexicographic order for the goals in addition to the aspiration levels. After the lexicographic ordering, the problem with the deviational variables as objective functions is solved subject to the constraints of (9) as explained in Sect. 5.2. A combination of the weighted and the lexicographic approaches is quite popular. In this case, several objective functions may belong to the same class of importance in the lexicographic order. In each priority class, a weighted sum of the deviational variables is minimized. The solution of a weighted or a lexicographic goal programming problem is Pareto optimal if either the aspiration levels form a Pareto optimal reference point or all the deviational variables δi have positive values at the optimum. In other words, if the aspiration levels are all feasible, the solution is equal to the reference point that is not necessarily Pareto optimal. Goal programming is a very widely used and popular solution method. Goalsetting is an understandable and easy way of making decisions. The specification of the weights or the lexicographic ordering may be more difficult. It may also be hard to specify weights because they have no direct physical meaning.

6

Interactive Methods

The extensive interest devoted to interactive methods can be explained by the fact that assuming the DM has enough time and capabilities for co-operation,

10

K. Miettinen

interactive methods can be presumed to produce the most satisfactory results. Many of the weak points of the methods in the other method classes are overcome. Namely, only part of the Pareto optimal points has to be generated and evaluated, the DM is not overloaded with information, and the DM can specify and correct her/his preferences and selections as the solution process continues and (s)he gets to know the problem and its potentialities better. This also means that the DM does not have to know any global preference structure. In addition, the DM can be assumed to have more confidence in the final solution since (s)he is involved throughout the solution process. In interactive methods, the DM works together with an analyst or an interactive computer program. One can say that the analyst tries to determine the preference structure of the DM in an interactive way. After every iteration, some information is given to the DM and (s)he is asked to answer some questions or provide some other type of information. Interactive methods differ from each other by the form in which information is given to the DM, by the form in which information is provided by the DM, and how the problem is transformed into a single objective optimization problem. It is always important that the DM finds the method worthwhile and acceptable and is able to use it properly. There are three main stopping criteria in interactive methods. Either the DM finds a desirable solution and is convinced that it is preferred to all the other Pareto optimal solutions (see [16]), some algorithmic stopping or convergence rule is fulfilled or the DM gets tired of the solution process. The number of interactive methods is large. Here we briefly describe some of them. In all the methods, less is assumed to be preferred to more by the DM. For more details, see [20] and references therein. 6.1

Geoffrion-Dyer-Feinberg Method

The Geoffrion-Dyer-Feinberg (GDF) method, proposed in [10], is one of the most well-known interactive methods and it is based on the maximization of the underlying (implicitly known) value function. The objective functions are assumed to be continuously differentiable and the feasible region S must be compact and convex. Marginal rates of substitution specified by the DM at the current point xh are here used to approximate the direction.of steepest ascent of the value function. (xh )) ∂U (f (xh )) We have mij (xh ) = mi = ∂U (f . Then the approximation is ∂fj ∂fi optimized by the method of Frank and Wolfe by solving the problem minimize

Pk

i=1

subject to y ∈ S with y ∈ IRn being the variable.

h

−mi ∇x fi (x )

T y

(10)


11

The basic phases of the GDF algorithm are the following. 1. Ask the DM to specify a reference function. 2. Ask the DM to specify marginal rates of substitution between the reference function and the other objectives at the current solution point. 3. Solve (10). Set the search direction as the difference between the old (i.e. current) and the new solution. 4. Determine with the help of the DM the appropriate step-size to be taken in the direction. 5. If the DM wants to continue, go to step (2). Otherwise, stop. When determining the step-size, the DM is asked to select the most preferred objective vector obtained with different step-sizes taken in the search direction. Note that the alternatives are not necessarily Pareto optimal. It is obvious that the task of selection becomes more difficult for the DM as the number of objective functions increases. The GDF method can be characterized to be a non ad hoc method. If one knows the value function, it is easy to specify the marginal rates of substitution and select the best alternative. In spite of the plausible theoretical foundation of the GDF method, it is not so convincing and powerful in practice. The most important difficulty for the DM is the determining of the k − 1 marginal rates of substitution at each iteration. Even more difficult is to give consistent and correct marginal rates of substitution at every iteration. 6.2

Tchebycheff Method

The Tchebycheff method, presented in [27] (pp. 419–450) and refined in [28], is an interactive weighting vector space reduction method where value functions are not used. The method has been designed to be user-friendly for the DM and, thus, complicated information is not required. It is assumed that the objective functions are bounded (from below). To start with, a utopian objective vector is established. Then the distance from the utopian objective vector to the feasible objective region, measured by the weighted Tchebycheff metric, is minimized. Different solutions are obtained with well dispersed positive weighting vectors in the metric, as introduced in Sect. 4.3. At the first iteration, a sample of the whole Pareto optimal set is generated. The solution space is reduced by tightening the upper and the lower bounds for the weights. Then a concentrated group of weighting vectors centred about the selected one is formed. Thus, the idea is to develop a sequence of progressively smaller subsets of the Pareto optimal set until a final solution is located. Every Pareto optimal solution of can be found by solving the weighted Tchebycheff problem with z ?? but some of the solutions may be weakly Pareto optimal. Here this weakness is overcome by formulating the distance minimization problem in a lexicographic form: Pk lex minimize maxi=1,...,k wi (fi (x) − zi?? ) , i=1 (fi (x) − zi?? ) (11) subject to x∈S .

12

K. Miettinen

The solution of (11) is Pareto optimal and any Pareto optimal solution can be found. The number of the alternative objective vectors to be presented to the DM is denoted by P . It may be fixed or different at each iteration. We can now present the main steps of the Tchebycheff algorithm. 1. Specify values for the set size P and the number of iterations H. Construct the utopian objective vector. Set h = 1. 2. Form the current weighting vector space and generate 2P dispersed weighting vectors. 3. Solve (11) for each of the 2P weighting vectors. 4. Present the P most different of the resulting objective vectors to the DM and let her/him choose the most preferred among them. 5. If h = H, stop. Otherwise, gather information for reducing the weighting vector space, set h = h + 1 and go to step (2). The predetermined number of iterations is not necessarily conclusive. The DM can stop iterating when (s)he obtains a satisfactory solution or continue the solution process longer if necessary. All the DM has to do in the Tchebycheff method is to compare several Pareto optimal objective vectors and select the most preferred one. The ease of the comparison depends on the magnitude of P and on the number of objective functions. This can be characterized as a non ad hoc method. If the value function is known, it is easy to select the alternative maximizing the value function. The flexibility of the method is reduced by the fact that the discarded parts of the weighting vector space cannot be restored if the DM changes her/his mind. Thus, some consistency is required. The weakness of the Tchebycheff method is that a great deal of calculation is needed at each iteration and many of the results are discarded. For large and complex problems, the Tchebycheff method is not a realistic choice. On the other hand, parallel computing can be utilized. 6.3

Reference Point Method

As its name suggests, the reference point method (see, e.g., [32]) is based on a reference point of aspiration levels. The reference point is used to derive achievement scalarizing functions as introduced in Sect. 4.4. No specific assumptions are set on the problem to be solved. The reference point idea has been utilized in several methods in different ways. Wierzbicki’s reference point method (to be discussed here) was among the first of them. Before the solution process starts, some information is given to the DM about the problem. If possible, the ideal objective vector and the (approximated) nadir objective vector are presented to illustrate the ranges of the Pareto optimal set. Another possibility is to minimize and maximize the objective functions individually in the feasible region (if it is bounded). An appropriate form for the achievement function must also be selected.


13

The basic steps of the reference point method are the following: 1. 2. 3. 4.

Present information about the problem to the DM. Ask the DM to specify a reference point. Minimize the achievement function. Present the solution to the DM. Calculate a number of k other (weakly) Pareto optimal solutions by minimizing the achievement function with perturbed reference points. 5. Present the alternatives to the DM. If (s)he finds one of the k + 1 solutions satisfactory, stop. Otherwise, go to step (2). The reference point method can be characterized as an ad hoc method or a method having both non ad hoc and ad hoc features. Alternatives are easy to compare if the value function is known. On the other hand, a reference point cannot be directly defined with the help of the value function. However, it is possible to test whether a new reference point has a higher value function value than the earlier solutions. The reference point method is quite easy for the DM to understand. The DM only has to specify appropriate aspiration levels and compare objective vectors. What has earlier been said about the comparison of alternatives is also valid here. The solutions are weakly or Pareto optimal depending on the achievement function employed. The freedom of the DM has both positive and negative aspects. On the one hand, the DM can direct the solution process and is free to change her/his mind during the process. On the other hand, there is no clear strategy to produce the final solution since the method does not help the DM to find improved solutions. A software family called DIDAS (Dynamic Interactive Decision Analysis and Support) has been developed on the basis of the reference point ideas (see [34] for details). 6.4

GUESS Method

The GUESS method is a simple interactive method related to the reference point method. The method is also sometimes called a na¨ıve method and it is presented in [3]. The ideal objective vector z ? and the nadir objective vector z nad are required to be available. The method proceeds as follows. The DM specifies a reference point (or a guess) below the nadir objective vector and the minimum weighted deviation from the nadir objective vector is maximized. Then the DM specifies a new reference point and the iteration continues until the DM is satisfied with the solution produced. The problem to be solved is h nad i z −fi (x) minimize mini=1,...,k iznad −¯ zi (12) i subject to x ∈ S . The solution of (12) is weakly Pareto optimal and any Pareto optimal solution can be found. The algorithm can be formulated as follows.

14

K. Miettinen

1. Calculate the ideal objective vector and the nadir objective vector and present them to the DM. 2. Let the DM specify upper or lower bounds to the objective functions if (s)he so desires. Update (12), if necessary. 3. Ask the DM to specify a reference point between the ideal and the nadir objective vectors. 4. Solve (12) and present the solution to the DM. 5. If the DM is satisfied, stop. Otherwise, go to step (2). The only stopping rule is the satisfaction of the DM. No guidance is given to the DM in setting new aspiration levels. This is typical of many reference point-based methods. The GUESS method is an ad hoc method. The existence of a value function would not help in determining new reference points or upper or lower bounds for the objective functions. The weakness of the GUESS method is its heavy reliance on the availability of the nadir objective vector. As mentioned earlier, the nadir objective vector is not easy to determine and it is usually only an approximation. An interesting practical observation is mentioned in [3]. Namely, DMs are easily satisfied if there is a small difference between the reference point and the solution obtained. Somehow they feel a need to be satisfied when they have almost achieved what they wanted. In this case they may stop iterating ‘too early.’ The DM is naturally allowed to stop the solution process if the solution really is satisfactory. But, the coincidence of setting the reference point near an attainable solution may unnecessarily increase the DM’s satisfaction. 6.5

Satisficing Trade-Off Method

The satisficing trade-off method (STOM) (see, e.g., [25]) is based on ideas similar to the two earlier methods with emphasis on finding a satisficing solution. The differentiating factor is the trade-off information utilized. The functioning of STOM is the following. After a (weakly) Pareto optimal solution has been obtained by optimizing a scalarizing function, it is presented to the DM. On the basis of this information (s)he is asked to classify the objective functions into three classes. The classes are the unacceptable objective functions whose values (s)he wants to improve, the acceptable objective functions whose values (s)he agrees to relax (impair) and the acceptable objective functions whose values (s)he accepts as they are. The objective and the constraint functions are assumed to be twice continuously differentiable. Under some additional special assumptions, trade-off information can be obtained from the KKT multipliers related to the scalarizing function. With this information, appropriate upper bounds can be determined for the functions to be relaxed. Thus, the DM only has to specify aspiration levels for functions to be improved. This is called automatic trade-off. Next, a modified scalarizing function is minimized and the DM is asked to classify the objective functions at the new solution.


15

Different scalarizing functions have been suggested for use in STOM. In the original formulation, the weighted Tchebycheff metric is used and the weights 1 ¯ is a reference point and z ?? is are set as wi = z¯i −z ?? for i = 1, . . . , k, where z i ¯ > z ?? . If weakly Pareto optimal solutions a utopian objective vector so that z are to be avoided, the scalarizing function can be augmented as described in Sect. 4.3. Even if a value function existed, it could not be directly used to determine the functions to be decreased and increased or the amounts of change. Thus the method is characterized as an ad hoc method. If automatic trade-off is not used, the method resembles the GUESS method. 6.6

Light Beam Search

Light beam search, described in [13], combines the reference point idea and tools of multiattribute decision analysis. The achievement function (8) is used with weights only in the maximum part. The reference point is here assumed to be an infeasible objective vector. It is assumed that the objective and the constraint functions are continuously differentiable and the ideal and the nadir objective vectors are available. In addition, none of the objective functions is allowed to be more important than all the others together. In the light beam search, the learning process of the DM is supported by providing additional information about the Pareto optimal set at each iteration. This means that other solutions in the neighbourhood of the current solution (based on the reference point) are displayed. However, an attempt is made to avoid frustration on the part of the DM caused, e.g., by indifference between the alternatives. Concepts used in ELECTRE methods (see, e.g., [26]) are here employed. The idea is to establish outranking relations between alternatives. It is said that one alternative outranks the other if it is at least as good as the latter. In the light beam search, additional alternatives near the current solution are generated so that they outrank the current one. Incomparable or indifferent alternatives are not shown to the DM. To be able to compare alternatives and to define outranking relations, we need several thresholds from the DM. The DM is asked to provide indifference thresholds for each objective function describing intervals where indifference prevails. Furthermore, the line between indifference and preference does not have to be sharp. The hesitation between indifference and preference can be expressed by preference thresholds. One more type of threshold, namely a veto threshold can be defined. It prevents a good performance in some objectives from compensating for poor values on some other objectives. Let us now outline the light beam algorithm. 1. If the DM wants to or can specify the best and the worst values for each objective function, save them. Alternatively calculate z ? and z nad . Set z ? as

16

K. Miettinen

a reference point. Ask the DM to specify indifference thresholds. If desired, (s)he can also specify preference and veto thresholds. 2. Minimize the achievement function. 3. Present the solution to the DM. Calculate k Pareto optimal characteristic neighbours and present them as well to the DM. If the DM wants to see alternatives between any two of the k + 1 alternatives displayed, set their difference as a search direction, take different steps in this direction and project them onto the Pareto optimal set before showing them to the DM. If desired, save the current solution. 4. If desired, let the DM revise the thresholds and go to step (3). Otherwise, if the DM wants to give another reference point, go to step (2). If, on the other hand, the DM wants to select one of the alternatives displayed or saved as a current solution, go to step (3). Finally, if one of the alternatives is satisfactory, stop. Characteristic neighbours are new alternative objective vectors that outrank the current solution. See [13] for details. The option of saving desirable solutions increases the flexibility of the method. The DM can explore different directions and select the best among different trials. The light beam search can be characterized as an ad hoc method. If a value function were available, it could not directly determine new reference points. It could, however, be used in comparing the set of alternatives. Yet, the thresholds are important in the method and they must come from the DM. Specifying different thresholds is a new aspect when compared to the methods presented earlier. This may be demanding for the DM. Anyway, it is positive that the thresholds are not assumed to be global but can be altered at any time. The light beam search is a rather versatile solution method where the DM can specify reference points, compare a set of alternatives and affect the set of alternatives in different ways. Thresholds are used to try to make sure that the alternatives generated are not worse than the current solution. In addition, the alternatives must be different enough to be compared and comparable on the whole. This should decrease the burden on the DM. 6.7

NIMBUS Method

NIMBUS (Nondifferentiable Interactive Multiobjective BUndle-based optimization System), presented in [20,21,22], is an interactive multiobjective optimization method designed especially to be able to handle nondifferentiable functions efficiently. For this reason, it is capable of solving complicated real-world problems. It is assumed that the objective and the constraint functions are locally Lipschitzian (if a nondifferentiable solver is used) and the ideal objective vector is available. NIMBUS is based on the classification of the objective functions where the DM can easily indicate what kind of improvements are desirable and what kind of impairments are tolerable. The DM examines at iteration h the values of the objective functions calculated at the current solution xh and divides the objective functions into up to five classes; functions fi whose values


– – – – –

17

should be decreased (i ∈ I < ), should be decreased to a certain aspiration level z¯i < fi (xh ) (i ∈ I ≤ ), are satisfactory at the moment (i ∈ I = ), are allowed to increase to a certain upper bound εi > fi (xh ) (i ∈ I > ) and are allowed to change freely (i ∈ I ),

where I < ∪ I ≤ 6=∅ and I = ∪ I > ∪ I 6=∅. The difference between the classes I < and I ≤ is that the functions in I < are to be minimized as far as possible but the functions in I ≤ only as far as the aspiration level. The classification is the core of NIMBUS. However, the DM can specify optional positive weights wi summing up to one. After the DM has classified the objective functions, a subproblem h i minimize max i∈I < wi (fi (x) − zi? ), wj max [fj (x) − z¯j , 0] j∈I ≤

subject to fi (x) ≤ fi (xh ) for all i ∈ I < ∪ I ≤ ∪ I = , fi (x) ≤ εi for all i ∈ I > , x∈S

(13)

is formed, where zi? (i ∈ I < ) are components of the ideal objective vector. The solution of (13) is weakly Pareto optimal if the set I < is nonempty. On the other hand, any Pareto optimal solution can be found with an appropriate classification. If the DM does not like the solution of (13) for some reason, (s)he can explore other solutions between the old and this new one. Then we calculate a search direction as a difference of these two solutions and provide more solutions by taking steps of different sizes in this direction. The NIMBUS algorithm is given below. Note that the DM must be ready to give up something in order to attain improvement for some other objective functions. 1. Ask the DM to classify the objective functions at the current point. 2. Solve the subproblem and present the solution to the DM. If (s)he wants to see different alternatives between the old and the new solution, go to step (3). If the DM prefers either of the two solutions and want to continue from it, go to step (1). Otherwise, go to step (4). 3. Ask the DM to specify the desired number of alternatives P and calculate alternative vectors. Present their Pareto optimal counterparts to the DM and let her/him choose the most preferred one among them. If the DM wants to continue, go to step (1). 4. Check Pareto optimality and stop. In NIMBUS, the DM expresses iteratively her/his desires. Unlike some other methods based on classification, the success of the solution process does not depend entirely on how well the DM manages in specifying the classification and the appropriate parameter values. It is important that the classification is not irreversible. Thus, no irrevocable damage is caused in NIMBUS if the solution obtained is not what was expected. The DM is free to go back or explore

18

K. Miettinen

intermediate points. (S)he can easily get to know the problem and its possibilities by specifying, e.g., loose upper bounds and examining intermediate solutions. In NIMBUS, the DM can explore the (weakly) Pareto optimal set and change her/his mind if necessary. The DM can also extract undesirable solutions from further consideration. The method is ad hoc in nature, since the existence of a value function would not directly advise the DM how to act to attain her/his desires. A value function could only be used to compare different alternatives. The method has been implemented as a WWW-NIMBUS system on the Internet (see [23]). Via the Internet we can centralize the computing to one server computer (at the University of Jyv¨ askyl¨ a) and the WWW is a way of distributing the graphical user interface to the computers of each individual user. Besides, the user always has the latest version of NIMBUS available. The most important aspect of WWW-NIMBUS is that it is easily accessible and available to any Internet user (http://nimbus.mit.jyu.fi/). No special tools, compilers or software besides a WWW browser are needed. The user saves the trouble of installing any software and the system is independent of the computer and the operating system used. The system contains both a nondifferentiable local solver (proximal bundle method) (see [19], pp. 112–143) and a global solver (genetic algorithms) for the subproblem. When the first version of WWW-NIMBUS was implemented in 1995 it was a pioneering interactive optimization system on the Internet.

7

Conclusions

As has been stressed, a large variety of methods exists for multiobjective optimization problems and none of them can be claimed to be superior to the others in every aspect. When selecting a solution method, the specific features of the problem to be solved must be taken into consideration. In addition, the opinions of the DM are important. One can say that selecting a multiobjective optimization method is a problem with multiple objectives itself. The theoretical properties of the methods can rather easily be compared. A comparative table summarizing some of the features of interactive methods is given in [20]. However, in addition to theoretical properties, practical applicability also plays an important role in the selection of an appropriate method for the problem to be solved. The difficulty is that practical applicability is hard to determine without experience and experimentation. The features of the problem and the capabilities of the DM have to be charted before a solution method can be chosen. Some methods may suit some problems and some DMs better than others. A decision tree is provided in [20] for easing the selection. As far as the future is concerned, the obvious conclusion in the development of methods is the importance of continuing in the direction of user-friendliness. Methods must be even better able to correspond to the characteristics of the DM. If the aspirations of the DM change during the solution process, the algorithm must be able to cope with this situation. Computational tests have confirmed the idea that DMs want to feel in control of the solution process, and consequently they must understand what is


19

happening. However, sometimes the DM simply needs support, and this should be available as well. Thus, the aim is to have methods that support learning so that guidance is given whenever necessary. The DM can be supported by using visual illustrations and further development of such tools is essential. In addition to bar charts, value paths and petal diagrams of alternatives, we may use 3D slices of the feasible objective region (see [18]) and other tools. Specific methods for different areas of application that take into account the characteristics of the problems are also important.

References 1. Benson, H.P.: Existence of Efficient Solutions for Vector Maximization Problems. Journal of Optimization Theory and Applications 26 (1978) 569–580 2. Benson, H.P.: Vector Maximization with Two Objective Functions. Journal of Optimization Theory and Applications (1979) 253–257 3. Buchanan, J.T.: A Na¨ıve Approach for Solving MCDM Problems: The GUESS Method. Journal of the Operational Research Society 48 (1997) 202–206 4. Caballero, R., Rey, L., Ruiz, F., Gonz´ alez, M.: An Algorithmic Package for the Resolution and Analysis of Convex Multiple Objective Problems. In: Fandel, G., Gal, T. (eds.): Multiple Criteria Decision Making: Proceedings of the Twelfth International Conference, Hagen (Germany). Springer-Verlag (1997) 275–284 5. Censor, Y.: Pareto Optimality in Multiobjective Problems. Applied Mathematics and Optimization 4 (1977) 41–59 6. Chankong, V., Haimes, Y.Y.: Multiobjective Decision Making Theory and Methodology. Elsevier Science Publishing Co., Inc., (1983) 7. Charnes, A., Cooper, W.W.: Goal Programming and Multiple Objective Optimization; Part 1. European Journal of Operational Research 1 (1977) 39–54 8. Gass, S., Saaty, T.: The Computational Algorithm for the Parametric Objective Function. Naval Research Logistics Quarterly 2 (1955) 39–45 9. Geoffrion, A.M.: Proper Efficiency and the Theory of Vector Maximization. Journal of Mathematical Analysis and Applications 22 (1968) 618–630 10. Geoffrion, A.M., Dyer, J.S., Feinberg, A.: An Interactive Approach for MultiCriterion Optimization, with an Application to the Operation of an Academic Department. Management Science 19 (1972) 357–368 11. Haimes, Y.Y., Lasdon, L.S., Wismer, D.A.: On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization. IEEE Transactions on Systems, Man, and Cybernetics 1 (1971) 296–297 12. Hwang, C.-L., Masud, A.S.M.: Multiple Objective Decision Making – Methods and Applications: A State-of-the-Art Survey. Springer-Verlag (1979) 13. Jaszkiewicz, A., Slowi´ nski, R.: The ‘Light Beam Search’ Approach – An Overview of Methodology and Applications. European Journal of Operational Research 113 (1999) 300–314 14. Keeney, R.L., Raiffa, H.: Decisions with Multiple Objectives: Preferences and Value Tradeoffs. John Wiley & Sons, Inc. (1976) 15. Korhonen, P., Salo, S., Steuer, R.E.: A Heuristic for Estimating Nadir Criterion Values in Multiple Objective Linear Programming. Operations Research 45 (1997) 751–757 16. Korhonen, P., Wallenius, J.: Behavioural Issues in MCDM: Neglected Research Questions. Journal of Multi-Criteria Decision Analysis 5 (1996) 178–182

20

K. Miettinen

17. Li, D., Yang, J.-B., Biswal, M.P.: Quantitative Parametric Connections between Methods for Generating Noninferior Solutions in Multiobjective Optimization. European Journal of Operational Research 117 (1999) 84–99 18. Lotov, A.V., Bushenkov, V., Chernykh, O: Multi-Criteria DSS for River Water Quality Planning. Microcomputers in Civil Engineering 12 (1997) 57–67 19. M¨ akel¨ a, M.M., Neittaanm¨ aki, P.: Nonsmooth Optimization: Analysis and Algorithms with Applications to Optimal Control. World Scientific Publishing Co. (1992) 20. Miettinen, K.: Nonlinear Multiobjective Optimization. Kluwer Academic Publishers (1999) 21. Miettinen, K., M¨ akel¨ a, M.M.: Interactive Bundle-Based Method for Nondifferentiable Multiobjective Optimization: NIMBUS. Optimization 34 (1995) 231–246 22. Miettinen, K., M¨ akel¨ a, M.M.: Comparative Evaluation of Some Interactive Reference Point-Based Methods for Multi-Objective Optimisation. Journal of the Operational Research Society 50 (1999) 949–959 23. Miettinen, K., M¨ akel¨ a, M.M.: Interactive Multiobjective Optimization System WWW-NIMBUS on the Internet. Computers & Operations Research 27 (2000) 709–723 24. Miettinen, K., M¨ akel¨ a, M.M, M¨ annikk¨ o, T.: Optimal Control of Continuous Casting by Nondifferentiable Multiobjective Optimization. Computational Optimization and Applications 11 (1998) 177–194 25. Nakayama, H.: Aspiration Level Approach to Interactive Multi-Objective Programming and Its Applications. In: Pardalos, P.M., Siskos, Y., Zopounidis, C. (eds.): Advances in Multicriteria Analysis. Kluwer Academic Publishers (1995) 147–174 26. Roy, B.: The Outranking Approach and the Foundations of ELECTRE Methods. In: Bana e Costa, C.A. (ed.): Readings in Multiple Criteria Decision Aid. SpringerVerlag (1990) 155–183 27. Steuer, R.E.: Multiple Criteria Optimization: Theory, Computation, and Applications. John Wiley & Sons, Inc. (1986) 28. Steuer, R.E.: The Tchebycheff Procedure of Interactive Multiple Objective Programming. In: Karpak, B., Zionts, S. (eds.): Multiple Criteria Decision Making and Risk Analysis Using Microcomputers. Springer-Verlag (1989) 235–249 29. Steuer, R.E., Gardiner, L.R.: On the Computational Testing of Procedures for Interactive Multiple Objective Linear Programming. In: Fandel, G., Gehring, H. (eds.): Operations Research. Springer-Verlag (1991) 121–131 30. Vincke, P.: Multicriteria Decision-Aid. John Wiley & Sons, Inc. (1992) 31. Weistroffer, H.R.: Careful Usage of Pessimistic Values is Needed in Multiple Objective Optimization. Operations Research Letters 4 (1985) 23–25 32. Wierzbicki, A.P.: A Mathematical Basis for Satisficing Decision Making. Mathematical Modelling 3 (1982) 391–405 33. Wierzbicki, A.P.: On the Completeness and Constructiveness of Parametric Characterizations to Vector Optimization Problems. OR Spektrum 8 (1986) 73–87 34. Wierzbicki, A.P., Granat, J.: Multi-Objective Modeling for Engineering Applications: DIDASN++ System. European Journal of Operational Research 113 (1999) 372–389 35. Zadeh, L.: Optimality and Non-Scalar-Valued Performance Criteria. IEEE Transactions on Automatic Control 8 (1963) 59–60

A Short Tutorial on Evolutionary Multiobjective Optimization Carlos A. Coello Coello? CINVESTAV-IPN Depto. de Ingenier´ıa Eléctrica Secci´ on de Computaci´ on Av. Instituto Politécnico Nacional No. 2508 Col. San Pedro Zacatenco México, D. F. 07300 [email protected]

Abstract. This tutorial will review some of the basic concepts related to evolutionary multiobjective optimization (i.e., the use of evolutionary algorithms to handle more than one objective function at a time). The most commonly used evolutionary multiobjective optimization techniques will be described and criticized, including some of their applications. Theory, test functions and metrics will be also discussed. Finally, we will provide some possible paths of future research in this area.

1

Introduction

Most real-world engineering optimization problems are multiobjective in nature, since they normally have several (possibly conflicting) objectives that must be satisfied at the same time. The notion of “optimum” has to be re-defined in this context and instead of aiming to find a single solution, we will try to produce a set of good compromises or “trade-offs” from which the decision maker will select one. Over the years, the work of a considerable amount of operational researchers has produced an important number of techniques to deal with multiobjective optimization problems [46]. However, it was until relatively recently that researchers realized of the potential of evolutionary algorithms in this area. The potential of evolutionary algorithms in multiobjective optimization was hinted by Rosenberg in the 1960s [52], but this research area, later called Evolutionary Multi-Objective Optimization (EMOO for short) remained unexplored for almost twenty five years. However, researchers from many different disciplines have shown an increasing interest in EMOO in recent years. The considerable amount of research related to EMOO currently reported in the literature (over 630 publications1 ) is a clear reflection of such interest. ? 1

This work was done while the author was at the Laboratorio Nacional de Inform´ atica Avanzada, Rébsamen 80, Xalapa, Veracruz 91090, México. The author maintains a repository on Evolutionary Multiobjective Optimization at: http://www.lania.mx/˜ccoello/EMOO/ with a mirror at http://www.jeo.org/emo/


22

C.A. Coello Coello

This paper will provide a short tutorial on EMOO, including a review of the main existing approaches (a description of the technique, together with its advantages and disadvantages and some of its applications) and of the most significant research done in theory, test functions and metrics. We will finish with a short review of two promising areas of future research.

2

Basic Definitions

Multiobjective optimization (also called multicriteria optimization, multiperformance or vector optimization) can be defined as the problem of finding [49]: a vector of decision variables which satisfies constraints and optimizes a vector function whose elements represent the objective functions. These functions form a mathematical description of performance criteria which are usually in conflict with each other. Hence, the term “optimize” means finding such a solution which would give the values of all the objective functions acceptable to the designer. Formally, we can state it as follows: Find the vector x∗ = [x∗1 , x∗2 , . . . , x∗n ] constraints:

T

which will satisfy the m inequality

gi (x) ≥ 0

i = 1, 2, . . . , m

(1)

hi (x) = 0

i = 1, 2, . . . , p

(2)

the p equality constraints

and optimizes the vector function T

f (x) = [f1 (x), f2 (x), . . . , fk (x)] T

(3)

where x = [x1 , x2 , . . . , xn ] is the vector of decision variables. In other words, we wish to determine from among the set F of all numbers which satisfy (1) and (2) the particular set x∗1 , x∗2 , . . . , x∗k which yields the optimum values of all the objective functions. It is rarely the case that there is a single point that simultaneously optimizes all the objective functions. Therefore, we normally look for “trade-offs”, rather than single solutions when dealing with multiobjective optimization problems. The notion of “optimum” is therefore, different. The most commonly adopted notion of optimality is that originally proposed by Francis Ysidro Edgeworth [22], and later generalized by Vilfredo Pareto [50]. Although some authors call Edgeworth-Pareto optimum to this notion (see for example Stadler [61]), we will use the most commonly accepted term: Pareto optimum. We say that a vector of decision variables x∗ ∈ F is Pareto optimal if there does not exist another x ∈ F such that fi (x) ≤ fi (x∗ ) for all i = 1, . . . , k and fj (x) < fj (x∗ ) for at least one j.

A Short Tutorial on Evolutionary Multiobjective Optimization

23

In words, this definition says that x∗ is Pareto optimal if there exists no feasible vector of decision variables x ∈ F which would decrease some criterion without causing a simultaneous increase in at least one other criterion. Unfortunately, this concept almost always gives not a single solution, but rather a set of solutions called the Pareto optimal set. The vectors x∗ correspoding to the solutions included in the Pareto optimal set are called nondominated. The plot of the objective functions whose nondominated vectors are in the Pareto optimal set is called the Pareto front. 2.1

An Example

Let us analyze a simple example of a multiobjective optimization problem, that has been studied by Stadler & Dauer [62]. We want to design the four-bar plane truss shown in Figure 1. We will consider two objective functions: minimize the volume of the truss (f1 ) and minimize its joint displacement ∆ (f2 ). The mathematical definition of the problem is:

1 3

L

F

2

4

F 2F

L

L

Fig. 1. A four-bar plane truss.

( Minimize

√ √ f1 (x) = L 2x x3 + x4 2+ 1 + 2x √ √ f2 (x) = FEL x21 + 2x22 − 2x32 + x24

(4)

(F/σ) ≤ x1 ≤ 3(F/σ) √ 2(F/σ) ≤ x2 ≤ 3(F/σ) √ 2(F/σ) ≤ x3 ≤ 3(F/σ) (F/σ) ≤ x4 ≤ 3(F/σ)

(5)

such that:

where F = 10 kN, E = 2 × 105 kN/cm2 , L = 200 cm, σ = 10 kN/cm2 .

24

C.A. Coello Coello

The global Pareto front of this problem can be obtained by enumeration. The process consists of iterating on the four decision variables (with a reasonable granularity) to get a set of points representing the search space. Then, we apply the concept of Pareto optimality previously defined to the points generated. The result of this procedure, plotted on objective function space is shown in Figure 2. This is the true (or global) Pareto front of the problem.

0.04 3 3 0.035 0.03 0.025 f2

0.02 0.015 0.01 0.005

3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 33

0 1200

1400

1600

1800

2000

2200

2400

2600

2800

f1

Fig. 2. True Pareto front of the four-bar plane truss problem.

3

Why Evolutionary Algorithms?

The first implementation of an EMOO approach was Schaffer’s Vector Evaluation Genetic Algorithm (VEGA), which was introduced in the mid-1980s, mainly intended for solving problems in machine learning [57,58,59]. Schaffer’s work was presented at the First International Conference on Genetic Algorithms in 1985 [58]. Interestingly, his simple unconstrained twoobjective functions became the usual test suite to validate most of the evolutionary multiobjective optimization techniques developed during the following years [60,38]. Evolutionary algorithms seem particularly suitable to solve multiobjective optimization problems, because they deal simultaneously with a set of possible solutions (the so-called population). This allows us to find several members of the Pareto optimal set in a single run of the algorithm, instead of having to perform a series of separate runs as in the case of the traditional mathematical


25

programming techniques [5]. Additionally, evolutionary algorithms are less susceptible to the shape or continuity of the Pareto front (e.g., they can easily deal with discontinuous or concave Pareto fronts), whereas these two issues are a real concern for mathematical programming techniques.

4

Reviewing EMOO Approaches

There are several detailed surveys of EMOO reported in the literature [5,27,64] and this tutorial does not intend to produce a new one. Therefore, we will limit ourselves to a short discussion on the most popular EMOO techniques currently in use, including two recent approaches that look very promising. 4.1

Aggregating Functions

A genetic algorithm relies on a scalar fitness function to guide the search. Therefore, the most intuitive approach to deal with multiple objectives would be to combine them into a single function. The approach of combining objectives into a single (scalar) function is normally denominated aggregating functions, and it has been attempted several times in the literature with relative success in problems in which the behavior of the objective functions is more or less well-known. An example of this approach is a sum of weights of the form: min

k X

wi fi (x)

(6)

i=1

where wi ≥ 0 are the weighting coefficients representing the relative importance of the k objective functions of our problem. It is usually assumed that k X

wi = 1

(7)

i=1

Since the results of solving an optimization model using (6) can vary significantly as the weighting coefficients change, and since very little is usually known about how to choose these coefficients, a necessary approach is to solve the same problem for many different values of wi . Advantages and Disadvantages. This approach does not require any changes to the basic mechanism of a genetic algorithm and it is therefore very simple, easy to implement and efficient. The approach can work properly in simple multiobjective optimization problems with few objective functions and convex search spaces. One obvious problem of this approach is that it may be difficult to generate a set of weights that properly scales the objectives when little is known about the problem. However, its most serious drawback is that it cannot generate proper members of the Pareto optimal set when the Pareto front is concave regardless of the weights used [13].

26

C.A. Coello Coello

Sample Applications – Truck packing problems [30]. – Real-time scheduling [47]. – Structural synthesis of cell-based VLSI circuits [1].

gene

performance 1 2

Generation(t)

...

n

parents

Generation(t+1)

1

1 1

.

STEP 1

2

STEP 2

STEP 3

shuffle

apply genetic operators

. .

. .

select n subgroups using each dimension of performance in turn

. .

.

.

n popsize

popsize

Fig. 3. Schematic of VEGA selection.

4.2

VEGA

Schaffer [58] proposed an approach that he called the Vector Evaluated Genetic Algorithm (VEGA), and that differed of the simple genetic algorithm (GA) only in the way in which selection was performed. This operator was modified so that at each generation a number of sub-populations was generated by performing proportional selection according to each objective function in turn. Thus, for a problem with k objectives and a population size of M , k sub-populations of size M/k each would be generated. These sub-populations would be shuffled together to obtain a new population of size M , on which the GA would apply the crossover and mutation operators in the usual way. This process is illustrated in Figure 3. The solutions generated by VEGA are locally nondominated, but not necessarily globally nondominated. VEGA presents the so-called “speciation” problem (i.e., we could have the evolution of “species” within the population which excel on different objectives). This problem arises because this technique selects individuals who excel in one objective, without looking at the others. The potential danger doing that is that we could have individuals with what Schaffer [58]


27

called “middling” performance2 in all dimensions, which could be very useful for compromise solutions, but that will not survive under this selection scheme, since they are not in the extreme for any dimension of performance (i.e., they do not produce the best value for any objective function, but only moderately good values for all of them). Speciation is undesirable because it is opposed to our goal of finding compromise solutions. Advantages and Disadvantages. Since only the selection mechanism of the GA needs to be modified, the approach is easy to implement and it is quite efficient. However, the “middling” problem prevents the technique from finding the compromise solutions that we normally aim to produce. In fact, if proportional selection is used with VEGA (as Schaffer did), the shuffling and merging of all the sub-populations corresponds to averaging the fitness components associated with each of the objectives [51]. In other words, under these conditions, VEGA behaves as an aggregating approach and therefore, it is subject to the same problems of such techniques. Sample Applications – Optimal location of a network of groundwater monitoring wells [4]. – Combinational circuit design [8]. – Design multiplierless IIR filters [71]. 4.3

MOGA

Fonseca and Fleming [25] proposed the Multi-Objective Genetic Algorithm (MOGA). The approach consists of a scheme in which the rank of a certain individual corresponds to the number of individuals in the current population by which it is dominated. All nondominated individuals are assigned rank 1, while dominated ones are penalized according to the population density of the corresponding region of the trade-off surface. Fitness assignment is performed in the following way [25]: 1. Sort population according to rank. 2. Assign fitness to individuals by interpolating from the best (rank 1) to the worst (rank n ≤ M ) in the way proposed by Goldberg [29] (the so-called Pareto ranking assignment process), according to some function, usually linear, but not necessarily. 3. Average the fitnesses of individuals with the same rank, so that all of them will be sampled at the same rate. This procedure keeps the global population fitness constant while maintaining appropriate selective pressure, as defined by the function used. 2

By “middling”, Schaffer meant an individual with acceptable performance, perhaps above average, but not outstanding for any of the objective functions.

28

C.A. Coello Coello

Since the use of a blocked fitness assignment scheme as the one indicated before is likely to produce a large selection pressure that might produce premature convergence [29], the authors proposed the use of a niche-formation method to distribute the population over the Pareto-optimal region [20]. Sharing is performed on the objective function values, and the authors provided some guidelines to compute the corresponding niche sizes. MOGA also uses mating restrictions. Advantages and Disadvantages. The main strengths of MOGA is that is efficient and relatively easy to implement [11]. Its main weakness is that, as with all the other Pareto ranking techniques3 , its performance is highly dependent on an appropriate selection of the sharing factor. MOGA has been a very popular EMOO technique (particularly within the control community), and it normally exhibits a very good overall performance [11]. Some Applications – – – – 4.4

Fault diagnosis [45]. Control system design [3,69,21]. Wing planform design [48]. Design of multilayer microwave absorbers [68]. NSGA

The Nondominated Sorting Genetic Algorithm (NSGA) was proposed by Srinivas and Deb [60], and is based on several layers of classifications of the individuals. Before selection is performed (stochastic remainder proportionate selection was used), the population is ranked on the basis of domination (using Pareto ranking): all nondominated individuals are classified into one category (with a dummy fitness value, which is proportional to the population size). To maintain the diversity of the population, these classified individuals are shared (in decision variable space) with their dummy fitness values. Then this group of classified individuals is removed from the population and another layer of nondominated individuals is considered (i.e., the remainder of the population is re-classified). The process continues until all individuals in the population are classified. Since individuals in the first front have the maximum fitness value, they always get more copies than the rest of the population. This allows us to search for nondominated regions, and results in convergence of the population toward such regions. Sharing, on its part, helps to distribute the population over this region. Figure 4 (taken from Srinivas and Deb [60]) shows the general flow chart of this approach. 3

The use of a ranking scheme based on the concept of Pareto optimality was originally proposed by Goldberg [29].


29

START

initialize population gen = 0 front = 1

is population classified ?

No

identify Nondominated individuals

Yes reproduction according to dummy fitness gen = gen + 1

Yes

assign dummy fitness

crossover

sharing in current front

mutation

front = front + 1

is gen < maxgen ?

No

STOP

Fig. 4. Flowchart of the Nondominated Sorting Genetic Algorithm (NSGA).

Advantages and Disadvantages. Some researchers have reported that NSGA has a lower overall performance than MOGA (both computationally and in terms of quality of the Pareto fronts produced), and it seems to be also more sensitive to the value of the sharing factor than MOGA [11]. However, Deb et al. [18,19] have recently proposed a new version of this algorithm, called NSGA-II, which is more efficient (computationally speaking), uses elitism and a crowded comparison operator that keeps diversity without specifying any additional parameters. The new approach has not been extensively tested yet, but it certainly looks promising.

30

C.A. Coello Coello

Sample Applications – Airfoil shape optimization [43]. – Scheduling [2]. – Minimum spanning tree [73]. 4.5

NPGA

Horn et al. [38] proposed the Niched Pareto Genetic Algorithm, which uses a tournament selection scheme based on Pareto dominance. Instead of limiting the comparison to two individuals (as normally done with traditional GAs), a higher number of individuals is involved in the competition (typically around 10% of the population size). When both competitors are either dominated or nondominated (i.e., when there is a tie), the result of the tournament is decided through fitness sharing in the objective domain (a technique called equivalent class sharing was used in this case) [38]. The pseudocode for Pareto domination tournaments assuming that all of the objectives are to be maximized is presented below [37]. S is an array of the N individuals in the current population, random pop index is an array holding the N indices of S, in a random order, and tdom is the size of the comparison set. function selection /* Returns an individual from the current population S */ begin shuffle(random pop index); /* Re-randomize random index array */ candidate 1 = random pop index[1]; candidate 2 = random pop index[2]; candidate 1 dominated = false; candidate 2 dominated = false; for comparison set index = 3 to tdom + 3 do /* Select tdom individuals randomly from S */ begin comparison individual = random pop index[comparison set index]; if S[comparison individual] dominates S[candidate 1] then candidate 1 dominated = true; if S[comparison individual] dominates S[candidate 2] then candidate 2 dominated = true; end /* end for loop */ if ( candidate 1 dominated AND ¬ candidate 2 dominated ) then return candidate 2; else if ( ¬ candidate 1 dominated AND candidate 2 dominated ) then return candidate 1; else do sharing; end


31

This technique normally requires population sizes considerably larger than usual with other approaches, so that the noise of the selection method can be tolerated by the emerging niches in the population [26]. Advantages and Disadvantages. Since this approach does not apply Pareto ranking to the entire population, but only to a segment of it at each run, its main strength are that it is faster than MOGA and NSGA4 . Furthermore, it also produces good nondominated fronts that can be kept for a large number of generations [11]. However, its main weakness is that besides requiring a sharing factor, this approach also requires an additional parameter: the size of the tournament. Sample Applications – – – – 4.6

Automatic derivation of qualitative descriptions of complex objects [55]. Feature selection [24]. Optimal well placement for groundwater containment monitoring [37,38]. Investigation of feasibility of full stern submarines [63]. Target Vector Approaches

Under this name we will consider approaches in which the decision maker has to assign targets or goals that wishes to achieve for each objective. The GA in this case, tries to minimize the difference between the current solution found and the vector of goals (different metrics can be used for that purpose). The most popular techniques included here are hybrids with: Goal Programming [16,70], Goal Attainment [71,72] and the min-max approach [32,9]. Advantages and Disadvantages. The main strength of these methods is their efficiency (computationally speaking) because they do not require a Pareto ranking procedure. However, their main weakness is the definition of the desired goals which requires some extra computational effort (normally, these goals are the optimum of each objective function, considered separately). Furthermore, these techniques will yield a nondominated solution only if the goals are chosen in the feasible domain, and such condition may certainly limit their applicability. Some Applications – Truss design [56,7]. – Design of a robot arm [10]. – Synthesis of low-power operational amplifiers [72]. 4

Pareto ranking is O(kM 2 ), where k is the number of objectives and M is the population size.

32

4.7

C.A. Coello Coello

Recent Approaches

Recently, several new EMOO approaches have been developed. We consider important to discuss briefly at least two of them: PAES and SPEA. The Pareto Archived Evolution Strategy (PAES) was introduced by Knowles & Corne [42]. This approach is very simple: it uses a (1+1) evolution strategy (i.e., a single parent that generates a single offspring) together with a historical archive that records all the nondominated solutions previously found (such archive is used as a comparison set in a way analogous to the tournament competitors in the NPGA). PAES also uses a novel approach to keep diversity, which consists of a crowding procedure that divides objective space in a recursive manner. Each solution is placed in a certain grid location based on the values of its objectives. A map of such grid is maintained, indicating the amount of solutions that reside in each grid location. Since the procedure is adaptive, no extra parameters are required (except for the number of divisions of the objective space). Furthermore, the procedure has a lower computational complexity than traditional niching methods. PAES has been used to solve the off-line routing problem [41] and the adaptive distributed database management problem [42]. The Strength Pareto Evolutionary Algorithm (SPEA) was introduced by Zitzler & Thiele [78]. This approach was conceived as a way of integrating different EMOO techniques. SPEA uses an archive containing nondominated solutions previously found (the so-called external nondominated set). At each generation, nondominated individuals are copied to the external nondominated set. For each individual in this external set, a strength value is computed. This strength is similar to the ranking value of MOGA, since it is proportional to the number of solutions to which a certain individual dominates. The fitness of each member of the current population is computed according to the strengths of all external nondominated solutions that dominate it. Additionally, a clustering technique is used to keep diversity. SPEA has been used to explore trade-offs of software implementations for DSP algorithms [76] and to solve 0/1 knapsack problems [78].

5

Theory

The most important theoretical work related to EMOO has concentrated on two main issues: – Studies of convergence towards the Pareto optimum set [53,54,33,34,65]. – Ways to compute appropriate sharing factors (or niche sizes) [36,35,25]. Obviously, a lot of work remains to be done. It would be very interesting to study, for example, the structure of fitness landscapes in multiobjective optimization problems [40,44]. Such study could provide some insights regarding the sort of problems that are particularly difficult for an evolutionary algorithm and could also provide clues regarding the design of more powerful EMOO techniques.


33

Also, there is a need for detailed studies of the different aspects involved in the parallelization of EMOO techniques (e.g., load balancing, impact on Pareto convergence, performance issues, etc.), including new algorithms that are more suitable for parallelization than those currently in use.

6

Test Functions

The design of test functions that are appropriate to evaluate EMOO approaches was disregarded in most of the early research in this area. However, in recent years, there have been several interesting proposals. Deb [14,15] proposed ways to create controllable test problems for evolutionary multiobjective optimization techniques using single-objective optimization problems as a basis. He proposed to transform deceptive and massively multimodal problems into very difficult multiobjective optimization problems. More recently, his proposal was extended to constrained multiobjective optimization problems [17] (in most of the early papers on EMOO techniques, only unconstrained test functions were used). Van Veldhuizen and Lamont [66,67] have also proposed some guidelines to design a test function suite for evolutionary multiobjective optimization techniques, and have included in a technical report some sample test problems (mainly combinatorial optimization problems) [66]. In this regard, the literature on multiobjective combinatorial optimization can be quite useful [23]. The benchmarks available for problems like the multiobjective 0/1 knapsack can be used to validate EMOO approaches. Such idea has been explored by a few EMOO researchers (for example [78,39]), but more work in this direction is still necessary.

7

Metrics

Assuming that we have a set of test functions available, the next issue is how to compare different EMOO techniques. The design of metrics has been studied recently in the literature. The main proposals so far are the following: – Van Veldhuizen and Lamont [65] proposed the so-called generational distance, which is a measure of how close our current Pareto front is from the true Pareto front (assuming we know where it lies). – Srinivas and Deb [60] proposed the use of an statistical measure (the chisquare distribution) to estimate the spread of the population on the Pareto front with respect to the sharing factor used. – Zitzler and Thiele [77] proposed two measures: the first concerns the size of the objective value space which is covered by a set of nondominated solutions and the second compares directly two sets of nondominated solutions, using as a metric the fraction of the Pareto front covered by each of them. Several other similar metrics have been also suggested recently by Zitzler et al. [75].

34

C.A. Coello Coello

– Fonseca and Fleming [28] proposed the definition of certain (arbitrary) goals that we wish the GA to attain; then we can perform multiple runs and apply standard non-parametric statistical procedures to evaluate the quality of the solutions (i.e. the Pareto fronts) produced by the EMOO technique under study, and/or compare it against other similar techniques. There are few comparative studies of EMOO techniques where these metrics have been used and more comprehensive comparisons are still lacking in the literature [75,64,74]. Also, it is important to consider that most of the previously mentioned metrics assume that the user can generate the global Pareto front of the problem under study (using, for example, an enumerative approach), and that will not be possible in most real-world applications.

8

Promising Areas of Future Research

There are at least two areas of future research that deserve more attention in the next few years: – Incorporation of preferences: We should not ignore the fact that the solution of a multiobjective optimization problem really involves three stages: measurement, search, and decision making. Most EMOO research tends to concentrate on issues related to the search of nondominated vectors. However, these nondominated vectors do not provide any insight into the process of decision making itself (the decision maker still has to choose manually one of the several alternatives produced), since they are really a useful generalization of a utility function under the conditions of minimum information (i.e., all attributes are considered as having equal importance; in other words, the decision maker does not express any preferences of the attributes). Thus, the issue is how to incorporate the decision maker’s preferences into an EMOO approach as to guide the search only to the regions of main interest. There are a few recent proposals in this area [12,6], but more research is still needed. Issues such as scalability of the preferences’ handling mechanism and capability of the approach to incorporate preferences from several decision makers deserve special attention. – Emphasis on efficiency: Efficiency has been emphasized in EMOO research until recently, mainly regarding the number of comparisons performed for ranking the population [18], ways to maintain diversity [42], and procedures to reduce the computational cost involved in evaluating several (expensive) objective functions [21]. However, more work is still needed. For example, EMOO researchers have paid little attention to the use of efficient data structures. In contrast, operational researchers have used, for example, domination-free quad trees where a nondominated vector can be retrieved from the tree very efficiently. Checking if a new vector is dominated by the vectors in one of these trees can also be done very efficiently [31]. It is therefore necessary to pay more attention to efficiency issues in the design of new EMOO approaches, to make them more suitable for real-world applications.


9

35

Conclusions

This paper has attempted to provide a short tutorial of evolutionary multiobjective optimization. Our discussion has covered the main EMOO approaches currently in use, their advantages and disadvantages, and some of their applications reported in the literature. We have also discussed briefly the theoretical work done in this area, as well as some of the research that has attempted to produce benchmarks that are appropriate to validate EMOO approaches. We also discussed another problem related to this last issue: the definition of appropriate metrics that allow us to compare several EMOO techniques. Such metrics should evaluate the capability of an EMOO approach to produce a sufficient amount of elements of the Pareto optimal set of the problem as well as to spread them appropriately. Our discussion finishes with a short description of two possible areas of future research in EMOO: mechanisms that facilitate the incorporation of user’s preferences and the search for efficient procedures and algorithms for evolutionary multiobjective optimization and to keep diversity. Acknowledgements. The author gratefully acknowledges support from CONACyT through project 34201-A.

References 1. T. Arslan, D. H. Horrocks, and E. Ozdemir. Structural Synthesis of Cell-based VLSI Circuits using a Multi-Objective Genetic Algorithm. IEE Electronic Letters, 32(7):651–652, March 1996. 2. Tapan P. Bagchi. Multiobjective Scheduling by Genetic Algorithms. Kluwer Academic Publishers, Boston, 1999. 3. A. J. Chipperfield and P. J. Fleming. Gas Turbine Engine Controller Design using Multiobjective Genetic Algorithms. In A. M. S. Zalzala, editor, Proceedings of the First IEE/IEEE International Conference on Genetic Algorithms in Engineering Systems : Innovations and Applications, GALESIA’95, pages 214–219, Halifax Hall, University of Sheffield, UK, September 1995. IEEE. 4. Scott E. Cieniawski, J. W. Eheart, and S. Ranjithan. Using Genetic Algorithms to Solve a Multiobjective Groundwater Monitoring Problem. Water Resources Research, 31(2):399–409, February 1995. 5. Carlos A. Coello Coello. A Comprehensive Survey of Evolutionary-Based Multiobjective Optimization Techniques. Knowledge and Information Systems. An International Journal, 1(3):269–308, August 1999. 6. Carlos A. Coello Coello. Handling Preferences in Evolutionary Multiobjective Optimization: A Survey. In 2000 Congress on Evolutionary Computation, volume 1, pages 30–37, Piscataway, New Jersey, July 2000. IEEE Service Center. 7. Carlos A. Coello Coello. Treating Constraints as Objectives for Single-Objective Evolutionary Optimization. Engineering Optimization, 32(3):275–308, 2000. 8. Carlos A. Coello Coello, Arturo Hern´ andez Aguirre, and Bill P. Buckles. Evolutionary Multiobjective Design of Combinational Logic Circuits. In Jason Lohn, Adrian Stoica, Didier Keymeulen, and Silvano Colombano, editors, Proceedings of the Second NASA/DoD Workshop on Evolvable Hardware, pages 161–170, Los Alamitos, California, July 2000. IEEE Computer Society.

36

C.A. Coello Coello

9. Carlos A. Coello Coello and Alan D. Christiansen. Two New GA-based methods for multiobjective optimization. Civil Engineering Systems, 15(3):207–243, 1998. 10. Carlos A. Coello Coello, Alan D. Christiansen, and Arturo Hern´ andez Aguirre. Using a New GA-Based Multiobjective Optimization Technique for the Design of Robot Arms. Robotica, 16(4):401–414, July–August 1998. 11. Carlos Artemio Coello Coello. An Empirical Study of Evolutionary Techniques for Multiobjective Optimization in Engineering Design. PhD thesis, Department of Computer Science, Tulane University, New Orleans, LA, April 1996. 12. Dragan Cvetković. Evolutionary Multi–Objective Decision Support Systems for Conceptual Design. PhD thesis, School of Computing, University of Plymouth, Plymouth, UK, November 2000. 13. Indraneel Das and John Dennis. A Closer Look at Drawbacks of Minimizing Weighted Sums of Objectives for Pareto Set Generation in Multicriteria Optimization Problems. Structural Optimization, 14(1):63–69, 1997. 14. Kalyanmoy Deb. Multi-Objective Genetic Algorithms: Problem Difficulties and Construction of Test Problems. Technical Report CI-49/98, Dortmund: Department of Computer Science/LS11, University of Dortmund, Germany, 1998. 15. Kalyanmoy Deb. Evolutionary Algorithms for Multi-Criterion Optimization in Engineering Design. In Kaisa Miettinen, Marko M. M¨ akel¨ a, Pekka Neittaanm¨ aki, and Jacques Periaux, editors, Evolutionary Algorithms in Engineering and Computer Science, chapter 8, pages 135–161. John Wiley & Sons, Ltd, Chichester, UK, 1999. 16. Kalyanmoy Deb. Solving Goal Programming Problems Using Multi-Objective Genetic Algorithms. In 1999 Congress on Evolutionary Computation, pages 77–84, Washington, D.C., July 1999. IEEE Service Center. 17. Kalyanmoy Deb. An Efficient Constraint Handling Method for Genetic Algorithms. Computer Methods in Applied Mechanics and Engineering, 2000. (in Press). 18. Kalyanmoy Deb, Samir Agrawal, Amrit Pratab, and T. Meyarivan. A Fast Elitist Non-Dominated Sorting Genetic Algorithm for Multi-Objective Optimization: NSGA-II. KanGAL report 200001, Indian Institute of Technology, Kanpur, India, 2000. 19. Kalyanmoy Deb, Samir Agrawal, Amrit Pratab, and T. Meyarivan. A Fast Elitist Non-Dominated Sorting Genetic Algorithm for Multi-Objective Optimization: NSGA-II. In Proceedings of the Parallel Problem Solving from Nature VI Conference, pages 849–858. Springer, 2000. 20. Kalyanmoy Deb and David E. Goldberg. An Investigation of Niche and Species Formation in Genetic Function Optimization. In J. David Schaffer, editor, Proceedings of the Third International Conference on Genetic Algorithms, pages 42–50, San Mateo, California, June 1989. George Mason University, Morgan Kaufmann Publishers. 21. N.M. Duarte, A. E. Ruano, C.M. Fonseca, and P.J. Fleming. Accelerating MultiObjective Control System Design Using a Neuro-Genetic Approach. In 2000 Congress on Evolutionary Computation, volume 1, pages 392–397, Piscataway, New Jersey, July 2000. IEEE Service Center. 22. F. Y. Edgeworth. Mathematical Physics. P. Keagan, London, England, 1881. 23. Matthias Ehrgott and Xavier Gandibleux. An Annotated Bibliography of Multiobjective Combinatorial Optimization. Technical Report 62/2000, Fachbereich Mathematik, Universitat Kaiserslautern, Kaiserslautern, Germany, 2000. 24. C. Emmanouilidis, A. Hunter, and J. MacIntyre. A Multiobjective Evolutionary Setting for Feature Selection and a Commonality-Based Crossover Operator. In 2000 Congress on Evolutionary Computation, volume 1, pages 309–316, Piscataway, New Jersey, July 2000. IEEE Service Center.


37

25. Carlos M. Fonseca and Peter J. Fleming. Genetic Algorithms for Multiobjective Optimization: Formulation, Discussion and Generalization. In Stephanie Forrest, editor, Proceedings of the Fifth International Conference on Genetic Algorithms, pages 416–423, San Mateo, California, 1993. University of Illinois at UrbanaChampaign, Morgan Kauffman Publishers. 26. Carlos M. Fonseca and Peter J. Fleming. An Overview of Evolutionary Algorithms in Multiobjective Optimization. Technical report, Department of Automatic Control and Systems Engineering, University of Sheffield, Sheffield, U. K., 1994. 27. Carlos M. Fonseca and Peter J. Fleming. An Overview of Evolutionary Algorithms in Multiobjective Optimization. Evolutionary Computation, 3(1):1–16, Spring 1995. 28. Carlos M. Fonseca and Peter J. Fleming. On the Performance Assessment and Comparison of Stochastic Multiobjective Optimizers. In Hans-Michael Voigt, Werner Ebeling, Ingo Rechenberg, and Hans-Paul Schwefel, editors, Parallel Problem Solving from Nature—PPSN IV, Lecture Notes in Computer Science, pages 584–593, Berlin, Germany, September 1996. Springer-Verlag. 29. David E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Publishing Company, Reading, Massachusetts, 1989. 30. Pierre Grignon, J. Wodziack, and G. M. Fadel. Bi-Objective optimization of components packing using a genetic algorithm. In NASA/AIAA/ISSMO Multidisciplinary Design and Optimization Conference, pages 352–362, Seattle, Washington, September 1996. AIAA-96-4022-CP. 31. W. Habenicht. Quad trees, A data structure for discrete vector optimization problems. In Lecture notes in economics and mathematical systems, volume 209, pages 136–145, 1982. 32. P. Hajela and C. Y. Lin. Genetic search strategies in multicriterion optimal design. Structural Optimization, 4:99–107, 1992. 33. T. Hanne. On the convergence of multiobjective evolutionary algorithms. European Journal of Operational Research, 117(3):553–564, September 2000. 34. Thomas Hanne. Global Multiobjective Optimization Using Evolutionary Algorithms. Journal of Heuristics, 6(3):347–360, August 2000. 35. Jeffrey Horn. Multicriterion Decision Making. In Thomas B¨ ack, David Fogel, and Zbigniew Michalewicz, editors, Handbook of Evolutionary Computation, volume 1, pages F1.9:1 – F1.9:15. IOP Publishing Ltd. and Oxford University Press, 1997. 36. Jeffrey Horn. The Nature of Niching: Genetic Algorithms and the Evolution of Optimal, Cooperative Populations. PhD thesis, University of Illinois at Urbana Champaign, Urbana, Illinois, 1997. 37. Jeffrey Horn and Nicholas Nafpliotis. Multiobjective Optimization using the Niched Pareto Genetic Algorithm. Technical Report IlliGAl Report 93005, University of Illinois at Urbana-Champaign, Urbana, Illinois, USA, 1993. 38. Jeffrey Horn, Nicholas Nafpliotis, and David E. Goldberg. A Niched Pareto Genetic Algorithm for Multiobjective Optimization. In Proceedings of the First IEEE Conference on Evolutionary Computation, IEEE World Congress on Computational Intelligence, volume 1, pages 82–87, Piscataway, New Jersey, June 1994. IEEE Service Center. 39. Andrzej Jaszkiewicz. On the performance of multiple objective genetic local search on the 0/1 knapsack problem. a comparative experiment. Technical Report RA-002/2000, Institute of Computing Science, Poznan University of Technology, Pozna´ n, Poland, July 2000.

38

C.A. Coello Coello

40. S. Kaufmann. Adaptation on rugged fitness landscapes. In D. Stein, editor, Lectures in the Sciences of Complexity, pages 527–618. Addison-Wesley, Reading, Massachusetts, 1989. 41. Joshua D. Knowles and David W. Corne. The Pareto Archived Evolution Strategy: A New Baseline Algorithm for Multiobjective Optimisation. In 1999 Congress on Evolutionary Computation, pages 98–105, Washington, D.C., July 1999. IEEE Service Center. 42. Joshua D. Knowles and David W. Corne. Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy. Evolutionary Computation, 8(2):149–172, 2000. 43. R. M¨ akinen, P. Neittaanm¨ aki, J. Périaux, and J. Toivanen. A genetic Algorithm for Multiobjective Design Optimization in Aerodynamics and Electromagnetics. In K. D. Papailiou et al., editor, Computational Fluid Dynamics ’98, Proceedings of the ECCOMAS 98 Conference, volume 2, pages 418–422, Athens, Greece, September 1998. Wiley. 44. Bernard Manderick, Mark de Weger, and Piet Spiessens. The Genetic Algorithm and the Structure of the Fitness Landscape. In Richard K. Belew and Lashon B. Booker, editors, Proceedings of the Fourth International Conference on Genetic Algorithms, pages 143–150, San Mateo, California, 1991. Morgan Kaufmann. 45. Teodor Marcu. A multiobjective evolutionary approach to pattern recognition for robust diagnosis of process faults. In R. J. Patton and J. Chen, editors, IFAC Symposium on Fault Detection, Supervision and Safety for Technical Processes: SAFEPROCESS’97, pages 1183–1188, Kington Upon Hull, United Kingdom, August 1997. 46. Kaisa M. Miettinen. Nonlinear Multiobjective Optimization. Kluwer Academic Publishers, Boston, Massachusetts, 1998. 47. David Montana, Marshall Brinn, Sean Moore, and Garrett Bidwell. Genetic Algorithms for Complex, Real-Time Scheduling. In Proceedings of the 1998 IEEE International Conference on Systems, Man, and Cybernetics, pages 2213–2218, La Jolla, California, October 1998. IEEE. 48. S. Obayashi, S. Takahashi, and Y. Takeguchi. Niching and Elitist Models for MOGAs. In A. E. Eiben, M. Schoenauer, and H.-P. Schwefel, editors, Parallel Problem Solving From Nature — PPSN V, pages 260–269, Amsterdam, Holland, 1998. Springer-Verlag. 49. Andrzej Osyczka. Multicriteria optimization for engineering design. In John S. Gero, editor, Design Optimization, pages 193–227. Academic Press, 1985. 50. Vilfredo Pareto. Cours D’Economie Politique, volume I and II. F. Rouge, Lausanne, 1896. 51. Jon T. Richardson, Mark R. Palmer, Gunar Liepins, and Mike Hilliard. Some Guidelines for Genetic Algorithms with Penalty Functions. In J. David Schaffer, editor, Proceedings of the Third International Conference on Genetic Algorithms, pages 191–197, George Mason University, 1989. Morgan Kaufmann Publishers. 52. R. S. Rosenberg. Simulation of genetic populations with biochemical properties. PhD thesis, University of Michigan, Ann Harbor, Michigan, 1967. 53. G¨ unter Rudolph. On a Multi-Objective Evolutionary Algorithm and Its Convergence to the Pareto Set. In Proceedings of the 5th IEEE Conference on Evolutionary Computation, pages 511–516, Piscataway, New Jersey, 1998. IEEE Press. 54. G¨ unter Rudolph and Alexandru Agapie. Convergence Properties of Some MultiObjective Evolutionary Algorithms. In Proceedings of the 2000 Conference on Evolutionary Computation, volume 2, pages 1010–1016, Piscataway, New Jersey, July 2000. IEEE Press.


39

55. Enrique H. Ruspini and Igor S. Zwir. Automated Qualitative Description of Measurements. In Proceedings of the 16th IEEE Instrumentation and Measurement Technology Conference, Venice, Italy, 1999. 56. Eric Sandgren. Multicriteria design optimization by goal programming. In Hojjat Adeli, editor, Advances in Design Optimization, chapter 23, pages 225–265. Chapman & Hall, London, 1994. 57. J. David Schaffer. Multiple Objective Optimization with Vector Evaluated Genetic Algorithms. PhD thesis, Vanderbilt University, 1984. 58. J. David Schaffer. Multiple Objective Optimization with Vector Evaluated Genetic Algorithms. In Genetic Algorithms and their Applications: Proceedings of the First International Conference on Genetic Algorithms, pages 93–100. Lawrence Erlbaum, 1985. 59. J. David Schaffer and John J. Grefenstette. Multiobjective Learning via Genetic Algorithms. In Proceedings of the 9th International Joint Conference on Artificial Intelligence (IJCAI-85), pages 593–595, Los Angeles, California, 1985. AAAI. 60. N. Srinivas and Kalyanmoy Deb. Multiobjective Optimization Using Nondominated Sorting in Genetic Algorithms. Evolutionary Computation, 2(3):221–248, Fall 1994. 61. W. Stadler. Fundamentals of multicriteria optimization. In W. Stadler, editor, Multicriteria Optimization in Engineering and the Sciences, pages 1–25. Plenum Press, New York, 1988. 62. W. Stadler and J. Dauer. Multicriteria optimization in engineering: A tutorial and survey. In Structural Optimization: Status and Future, pages 209–249. American Institute of Aeronautics and Astronautics, 1992. 63. Mark W. Thomas. A Pareto Frontier for Full Stern Submarines via Genetic Algorithm. PhD thesis, Ocean Engineering Department, Massachusetts Institute of Technology, Cambridge, MA, june 1998. 64. David A. Van Veldhuizen. Multiobjective Evolutionary Algorithms: Classifications, Analyses, and New Innovations. PhD thesis, Department of Electrical and Computer Engineering. Graduate School of Engineering. Air Force Institute of Technology, Wright-Patterson AFB, Ohio, May 1999. 65. David A. Van Veldhuizen and Gary B. Lamont. Evolutionary Computation and Convergence to a Pareto Front. In John R. Koza, editor, Late Breaking Papers at the Genetic Programming 1998 Conference, pages 221–228, Stanford University, California, July 1998. Stanford University Bookstore. 66. David A. Van Veldhuizen and Gary B. Lamont. Multiobjective Evolutionary Algorithm Research: A History and Analysis. Technical Report TR-98-03, Department of Electrical and Computer Engineering, Graduate School of Engineering, Air Force Institute of Technology, Wright-Patterson AFB, Ohio, 1998. 67. David A. Van Veldhuizen and Gary B. Lamont. Multiobjective Evolutionary Algorithm Test Suites. In Janice Carroll, Hisham Haddad, Dave Oppenheim, Barrett Bryant, and Gary B. Lamont, editors, Proceedings of the 1999 ACM Symposium on Applied Computing, pages 351–357, San Antonio, Texas, 1999. ACM. 68. D. S. Weile, E. Michielssen, and D. E. Goldberg. Genetic algorithm design of pareto optimal broad-band microwave absorbers. Technical Report CCEM-4-96, Electrical and Computer Engineering Department, Center for Computational Electromagnetics, University of Illinois at Urbana-Champaign, May 1996. 69. J. F. Whidborne, D.-W. Gu, and I. Postlethwaite. Algorithms for the method of inequalities – a comparative study. In Procedings of the 1995 American Control Conference, pages 3393–3397, Seattle, Washington, 1995.

40

C.A. Coello Coello

70. P. B. Wienke, C. Lucasius, and G. Kateman. Multicriteria target optimization of analytical procedures using a genetic algorithm. Analytical Chimica Acta, 265(2):211–225, 1992. 71. P. B. Wilson and M. D. Macleod. Low implementation cost IIR digital filter design using genetic algorithms. In IEE/IEEE Workshop on Natural Algorithms in Signal Processing, pages 4/1–4/8, Chelmsford, U.K., 1993. 72. R. S. Zebulum, M. A. Pacheco, and M. Vellasco. A multi-objective optimisation methodology applied to the synthesis of low-power operational amplifiers. In Ivan Jorge Cheuri and Carlos Alberto dos Reis Filho, editors, Proceedings of the XIII International Conference in Microelectronics and Packaging, volume 1, pages 264–271, Curitiba, Brazil, August 1998. 73. Gengui Zhou and Mitsuo Gen. Genetic Algorithm Approach on Multi-Criteria Minimum Spanning Tree Problem. European Journal of Operational Research, 114(1), April 1999. 74. Eckart Zitzler. Evolutionary Algorithms for Multiobjective Optimization: Methods and Applications. PhD thesis, Swiss Federal Institute of Technology (ETH), Zurich, Switzerland, November 1999. 75. Eckart Zitzler, Kalyanmoy Deb, and Lothar Thiele. Comparison of Multiobjective Evolutionary Algorithms: Empirical Results. Evolutionary Computation, 8(2):173– 195, Summer 2000. 76. Eckart Zitzler, J¨ urgen Teich, and Shuvra S. Bhattacharyya. Multidimensional Exploration of Software Implementations for DSP Algorithms. VLSI Signal Processing Systems, 1999. (To appear). 77. Eckart Zitzler and Lothar Thiele. An Evolutionary Algorithm for Multiobjective Optimization: The Strength Pareto Approach. Technical Report 43, Computer Engineering and Communication Networks Lab (TIK), Swiss Federal Institute of Technology (ETH), Zurich, Switzerland, May 1998. 78. Eckart Zitzler and Lothar Thiele. Multiobjective Evolutionary Algorithms: A Comparative Case Study and the Strength Pareto Approach. IEEE Transactions on Evolutionary Computation, 3(4):257–271, November 1999.

An Overview in Graphs of Multiple Objective Programming Ralph E. Steuer Terry College of Business University of Georgia Athens, Georgia 30602-6253 USA

Abstract. One of the keys to getting one’s arms around multiple objective programming is to understand its geometry. With this in mind, the purpose of this paper is to function as a short tutorial on multiple objective programming that is accomplished maximally with graphs, and minimally with text.

1

Introduction

Consider the multiple objective program max {f1 (x) = z1 } .. . max {fk (x) = zk } s.t. x ∈ S

(1)

where k is the number of objectives, the zi are criterion values, and S is the feasible region in decision space. Let Z ⊂ Rk denote the feasible region in criterion space where z ∈ Z iff there exists an x ∈ S such that z = (f1 (x), . . . , fk (x)). Let K = {1, . . . , k}. Criterion vector z¯ ∈ Z is nondominated iff there does not exist another z ∈ Z such that zi ≥ z¯i for all i ∈ K and zi > z¯i for at least one i ∈ K. The set of all nondominated criterion vectors is designated N and is called the nondominated set. A point x ¯ ∈ S is efficient iff its criterion vector z¯ = (f1 (¯ x), . . . , fk (¯ x)) is nondominated. The set of all efficient points is designated E and is called the efficient set. Letting U : Rk → R be the utility function of the decision maker (DM), any 0 z ∈ Z that maximizes U over Z is an optimal criterion vector and any x0 ∈ S such that (f1 (x0 ), . . . , fk (x0 )) = z 0 is an optimal solution. We are interested in the efficient and nondominated sets because if U is coordinatewise increasing (i.e., more is always better that less of each fi (x)), z 0 ∈ N and any inverse image x0 ∈ E. Thus, instead of searching all of Z, we need only find the best criterion vector in N to locate an optimal solution to a multiple objective problem. To overview the nature of multiple objective programming problems and methods for solving them, we have the following tutorial topics: E. Zitzler et al. (Eds.): EMO 2001, LNCS 1993, pp. 41–51, 2001. c Springer-Verlag Berlin Heidelberg 2001

42

R.E. Steuer

1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13.

Decision Space vs. Criterion Space Ideal Way to Solve a Multiple Objective Program? Graphically Detecting Nondominated Criterion Vectors Reference Criterion Vectors Size of the Nondominated Set Weighted Tchebycheff Metrics Points on Smallest Intersecting Contours Lexicographic Weighted Tchebycheff Sampling Program T-Vertex λ-Vectors Wierzbicki’s Aspiration Criterion Vector Method Tchebycheff Method Why Not Weighted-Sums Approach? Other Interactive Procedures

x2 x3

x7

z2 3

3

x4

x8

z4

c1

c2

z3

Z

x5 x1

x1

z7

z8

z1 z1

z2

x3

x2

x6

Fig. 1. S in Decision Space

2

z6

z5

Fig. 2. Z in Criterion Space

Tutorial Topics

1. Decision Space vs. Criterion Space (Figs. 1–2). Whereas single objective programming is typically studied in decision space, multiple objective programming is mostly studied in criterion space. To illustrate, consider the two-objective multiple objective linear program (MOLP) of Fig. 1 in which c1 = (3, 1, −2) and c2 = (−1, 2, 0) are the gradients of the objective functions, and S, the feasible region in decision space, is the unit cube in R3 . Fig. 2 shows the feasible region Z in criterion space in which the eight z i are the images of the eight extreme points of S. Note that (a) not all extreme points of S map into extreme points of Z, (b) Z is at most of dimensionality k, and (c) Z is not necessarily confined to the nonnegative orthant.

An Overview in Graphs of Multiple Objective Programming

43

2. Ideal Way to Solve a Multiple Objective Program? (Fig. 3). While one might consider maximizing U over Z as in Fig. 3 to be an ideal way to solve a multiple objective program, this approach does not work in practice because (a) of the impossibility of obtaining U , (b) the approach does not give the user a feel for the nondominated set N , and (c) the approach does not allow for “learning” during the course of the solution process. Therefore, without explicit knowledge of U , the emphasis is on methods that only rely on implicit information (e.g., extracting from the DM answers to questions such as which in a group of solutions is the most preferred, or which objectives can be relaxed to enable more achievement in others).

z2

zo

Z z1

Fig. 3. Maximizing U over Z

3. Graphically Detecting Nondominated Criterion Vectors (Figs. 4– 7). Let R+ be the nonnegative orthant in Rk . To determine graphically whether a z¯ ∈ Z is dominated or nondominated, translate R+ to z¯. This forms the set called the translated nonnegative orthant at z¯, designated {¯ z } ⊕ R+ where ⊕ denotes set addition. Theorem 1. Criterion vector z¯ ∈ Z is nondominated iff ({¯ z } ⊕ R+ ) ∩ Z = {¯ z }. In other words, a z¯ ∈ Z is nondominated if and only if, aside from z¯, no other points reside in the intersection between the nonnegative orthant translated to z¯ and Z except for z¯ itself. In the integer multiple objective program of Fig. 4 in which Z = {z i | 1 ≤ i ≤ 6}, N = {z 2 , z 3 , z 6 }. For instance, z 3 is nondominated because if there were a z i ∈ Z dominating z 3 , it would have to be in the translated nonnegative orthant. On the other hand, z 5 is dominated because z 6 is in the intersection. In the MOLP of Fig. 5, N = bls[z 1 → z 2 ], where the notation designates the boundary line segment in the clockwise direction from z 1 to z 2 . For instance, z 4 is nondominated because the intersection is empty other than for z 4 . On the other hand, z 3 is dominated. With regard to the extreme points

44

R.E. Steuer

of Z, of the five, two are nondominated. In the multiple objective program of Fig. 6, N = {z 1 } ∪ bls(z 2 → z 3 ], where the left parenthesis in the “bls” signifies that z 2 is an open endpoint. This occurs because z 2 is dominated by z 1 (i.e., z 1 ∈ ({z 2 } ⊕ R+ )). In Fig. 7, N = bls[z 1 → z 2 ) ∪ bls[z 3 → z 4 ] ∪ bls(z 5 → z 6 ].

z2

z2

z1

z2 z3

z3 z1

z6

z4

Z

z4 z5

z2

z1

Fig. 4. Nondominance in an Integer Case

z2

z1

Fig. 5. Nondominance in an MOLP

z2 zref z1

z1 z2

z3

Z z4

Z

z2 z5

z3

Fig. 6. Nondominance in a Nonlinear Case

z1 z6

z1

Fig. 7. Nondominance in Another Nonlinear Case

4. Reference Criterion Vectors (Fig. 8). Let K = 1, . . . , k and let z ref ∈ Rk be a reference criterion vector whose components are given by ziref = max {fi (x) | x ∈ S} + i where the i need only be small positive values. An often convenient scheme is to use values for i that raise each ziref to the smallest integer greater than


45

max {fi (x) | x ∈ S} as in Fig. 8. A z ref serves two purposes. One is to define the domain of the problem D = {z ∈ Rk | zi ≤ ziref }, the region to the “lower left” of the dashed lines in which everything relevant happens. The other, since z ref dominates all points in N , is to function as point from which downward probes can be made to sample N .

z2 zref

Z z1

Fig. 8. Construction of a z ref Reference Point

5. Size of the Nondominated Set (Table 1). Now a few facts about the nondominated set. While N is always connected in the linear case, N can be disconnected in integer and nonlinear cases. Also, N is always a portion of the surface of Z. However, since the portion is often quite large, finding a most preferred point in N is often not a trivial task. From computational results gleaned from Steuer [10], Table 1 indicates the numbers of nondominated extreme points typically possessed by MOLPs by size. While N grows with the number of variables and constraints, it grows most substantially with the number of objectives.

Table 1. Nondominated Extreme Point Indications of Size of N

MOLP Problem Size

Typical Number of Nondominated Extreme Points

3 × 30 × 25 3 × 50 × 50 4 × 30 × 50 5 × 40 × 25

100 500 1000 3000

46

R.E. Steuer

6. Weighted Tchebycheff Metric (Fig. 9). To compute a distance between a z ∈ Z and z ref , it is often useful to employ a λ-weighted Tchebycheff metric

z − z ref λ = max { λi | zi − z ref |} i ∞ i∈K

P where (a) λ ∈ Λ = {λ ∈ Rk | λi ∈ (0, 1), i∈K λi = 1} and (b) associated with each λ-weighted Tchebycheff metric is a probing ray emanating from z ref in the downward direction −( λ11 , . . . , λ1k ). The contours (of points in Rk equidistant from z ref ) of a given λ-weighted Tchebycheff metric form a family of rectangles centered at z ref . Moreover, in the domain D of a problem, the vertices of all of the rectangles lie along the probing ray. In Fig. 9 with the probing ray in the direction −(2, 1), the rectangles are contours of the λ = ( 13 , 23 ) weighted Tchebycheff metric. With this metric, z 1 is closest to z ref because it lies on the smallest rectangle, z 2 is the next closest, and so forth. Note that by changing the λ-vector, we change the direction of the probing ray and thus the shape of the rectangular contours.

z2 zref z2 z1

z3 z5 z4

z6 z1

Fig. 9. Determining Points Closest to z ref

7. Points on Smallest Intersecting Contours (Figs. 10–12). In Fig. 10, N = bls[z 1 → z 2 ]. With the probing ray as drawn, it is only necessary to show the portion of the smallest intersecting rectangular contour in D to see that z 3 is the point in Z closest to z ref . Because the portion of any rectangular contour in D also portrays a translated nonnegative orthant, we further observe that z 3 is nondominated. Several questions now arise. What happens if (a) the point on the smallest intersecting contour does not occur at the vertex of the contour as in Fig. 11? (b) there is more than one point on the smallest intersecting contour as in Fig. 12? Are they all nondominated?

An Overview in Graphs of Multiple Objective Programming z2

z2

zref

47

zref

z1

Z

z3

Z

z1

z2

z1

z1

Fig. 10. Point Ecountered with Vertex

Fig. 11. Point Encountered on Side

z2 zref z1

Z

z2 z4 z3 z1

Fig. 12. Ties on Smallest Intersecting Contour

As long as the point on the smallest intersecting contour is unique, by Theorem 2 (a generalization of Theorem 1), the point is nondominated. Theorem 2. Let z¯ ∈ Z and let z v ∈ Rk function as the vertex of a translated nonnegative orthant such that ({z v } ⊕ R+ ) ∩ Z = {¯ z }. Then z¯ in nondominated. In answer to (b), let Zλ ⊂ Z be the set of points on the smallest intersecting contour. By Theorem 3, at least one point in Zλ is nondominated. Theorem 3. Let λ ∈ Λ. Then z¯ is nondominated if it is a point in Zλ that is closest to a z ref according to a L1 -metric. In Fig. 12 with Zλ = bls[z 4 → z 2 ], z 2 is seen to be nondominated as it is the point in Zλ that minimizes the sum of the coordinate deviations between it and z ref , or in other words, z 2 is the point that solves " k # X ref min (zi − zi ) z∈Zλ

i=1

48

R.E. Steuer

8. Lexicographic Weighted Tchebycheff Sampling Program. With regard to the ability of a weighted Tchebycheff metric to generate a nondominated criterion vector, we have a two-stage process. In the first stage, we compute Zλ , the set of points in Z closest to z ref according to the λ-weighted Tchebycheff metric. If Zλ is a singleton set, the point in Zλ is the nondominated point generated. If Zλ contains more than one point, the second stage is called into action to compute, as the nondominnated point generated, a point in Zλ closest to z ref according to the L1 -metric. Incorporating this geometry into an optimization problem, we have the two-stage lexicographic weighted Tchebycheff sampling program for lex min{ α,

k X i=1

s.t.

(ziref − zi )}

(2)

α ≥ λi (ziref − zi ) fi (x) = zi x∈S

0 ≤ α ∈ R, z ∈ Rk unrestricted generating, not only a nondominated criterion vector, but an inverse image (i.e., an efficient point) from S that goes with it. Note that the first optimization stage minimizes the scalar α to implement the λ-weightedP Tchebycheff metric, ref and that the second stage, when invoked, minimizes − zi ) to i∈K (zi implement the L1 -metric. It is called a “sampling” program because in this way, with a group of dispersed representatives from Λ, and solving (2) for each of them, we have a strategy for sampling points from N . 9. T-Vertex λ-Vectors. Note that in some cases, many different λ-vectors could cause the lexicographic weighted Tchebycheff sampling program to generate the same nondominated point. However, out of each such set, one is special and it is called the T-vertex λ-vector. The T-vertex λ-vector is the one that causes the smallest intersecting contour to hit the nondominated point in question headon with its vertex. For a given z ∈ N and z ref , the coordinates of a T-vertex λ-vector are given by  −1 k X 1 1   λi = ref (3) ref zi − zi j∈K zj − zj 10. Wierzbicki’s Aspiration Criterion Vector Method (Figs. 13–14). As an introduction to the world of interactive procedures of multiple objective programming, we first discuss Wierzbicki’s Aspiration Criterion Vector method [12]. The purpose of the procedure is to find at each iteration h the point z (h) ∈ N that is closest to that iteration’s aspiration criterion vector q (h) < z ref , where q (h) ’s purpose is to capture the DM’s criterion value hopes, expectations, and aspirations of the moment.

An Overview in Graphs of Multiple Objective Programming z2

zref

z1

z2

49

zref

z1

q (1) z(1)

Z

Z z2

z(2) q (2)

z2 z1

z1

Fig. 13. Wierzbicki 1-st Iteration

Fig. 14. Wierzbicki 2-nd Iteration

1. h = 0. Establish a z ref ∈ Rk . 2. h = h + 1. Specify a q (h) aspiration criterion vector. 3. Compute the λ(h) ∈ Λ that causes the probing ray to pass through q (h) . Equation (3) can be used by substituting q (h) for z ref . 4. Using λ(h) in (2), obtain the nondominated point z (h) closest to q (h) as computed by the lexicographic weighted Tchebycheff sampling program. 5. If after examining z (h) the DM decides to continue with another iteration, go to Step 2. Otherwise, terminate with z (h) as the final solution. Consider the feasible region Z in Figs. 13 and 14 with z ref = (5, 4). On the first iteration, let the DM’s aspiration criterion vector be q (1) = (3 12 , 3 12 ). Then λ(1) = ( 14 , 34 ) and the nondominated point generated by (2) is z (1) . Continuing with another iteration, the DM specifies q (2) = (3, 1). Then λ(2) = ( 35 , 25 ) and the nondominated point generated by (2) is z (2) . This iteration is interesting because, recognizing that q (2) is dominated, the method produces a superior nondominating point. Lacking a formal stopping criterion, the method continues as long as the DM is willing to specify new aspiration criterion vectors. 11. Tchebycheff Method (Figs. 15–16). Instead of generating only one solution at each iteration, the Tchebycheff Method conducts multiple probes by sampling each in a sequence of progressively small subsets of N . Letting P be the number of solutions presented to the DM at each iteration, we begin by selecting P dispersed λ-vectors from Λ(1) = Λ to form a group of dispersed probing rays as in Fig. 15. Then the lexicographic weighted Tchebycheff program (2) is solved for each of the λ-vectors. From the P resulting nondominated criterion vectors, the DM selects the most preferred, designating it z (1) . Now, about the T-vertex λ-vector defined by z (1) and z ref , a reduced subset Λ(2) ⊂ Λ is centered. Then P dispersed λ-vectors are selected from Λ(2) to form a group

50

R.E. Steuer

of more concentrated probing rays as in Fig. 16, and (2) is solved for each of them. From the P resulting nondominated criterion vectors, the DM selects the most preferred, designating it z (2) . Now, about the T-vertex λ-vector defined by z (2) and z ref , a further reduced subset Λ(3) ⊂ Λ is centered. Then P dispersed λ-vectors are selected from Λ(3) , and so forth. z2

z2 ref

zref

z z1

z1

z(1)

Z

Z z2

z2 z1

Fig. 15. Tchebycheff 1-st Iteration

z1

Fig. 16. Tchebycheff 2-nd Iteration

12. Why Not Weighted-Sums Approach? One might ask why not to considered assigning a λi -weight to each objective function and solve the weighted-sums program max{

k X

λi fi (x) | x ∈ S}

i∈K

The reason is that the weighted-sums program only computes points that support hyperplanes and is unable to compute unsupported nondominated criterion vectors. A z¯ ∈ N is unsupported if and only if there exists a convex combination of other nondominated criterion vectors that dominates z¯. Otherwise, z¯ is supported. Let N u and N s designate the sets of unsupported and supported nondominated criterion vectors, respectively. For example in Fig. 4, N u = {z 3 } and N s = {z 2 , z 6 }. In Fig. 6, N u = bls(z 2 → z 3 ) and N s = {z 1 , z 3 }, and so forth. If an unsupported point were optimal, the weighted-sums program would be unable to compute it. In contrast, the lexicographic weighted Tchebycheff program can compute any nondominated criterion vector without reservation. 13. Other Interactive Procedures. In addition to the Aspiration Criterion Vector and Tchebycheff methods, there are other procedures of multiple objective programming including STEM [1], Global Shooting [2], TRIMAP [3], Light Beam Search [5], Pareto Race [6], Bi-Reference Procedure [7], Fuzzy Satisficing [8], PSI [9], and FFANN [11], among others. While embodying various philosophies, most of these procedures nonetheless use variants of the lexicographic weighted Tchebycheff program [4] to probe N in different ways.


3

51

Conclusion

Because the lexicographic weighted Tchebycheff sampling program and its variants in other procedures can be configured for solution using conventional single criterion mathematical programming software, the procedures of multiple objective programming can generally address problems with as many constraints and variables as in the single criterion case. However, there is a limit to the number of objectives. While problems with up to 5–6 objectives can generally be accommodated, above this number gets us into uncharted territory where future research is needed.

References [1] Benayoun, R., J. de Montgolfier, J. Tergny, and O. Larichev (1972). “Linear Programming with Multiple Objective Functions: Step Method (STEM),” Mathematical Programming, 1, 366-375. [2] Benson, H. P. and S. Sayin (1997). “Towards Finding Global Representations of the Efficient Set in Multiple Objective Mathematical Programming,” Naval Research Logistics, 44, 47-67. [3] Climaco, J. and C. Antunes (1989). “Implementation of a User-Friendly Software Package—A Guided Tour of TRIMAP,” Mathematical and Computer Modelling, 12, 1299-1309. [4] Gardiner, L. R. and R. E. Steuer (1994). “Unified Interactive Multiple Objective Programming,” European Journal of Operational Research, 74, 391-406. [5] Jaszkiewicz, A. and R. Slowinski (1999). “The Light Beam Search Approach: An Overview of Methodology and Applications,” European Journal of Operational Research, 113, 300-314. [6] Korhonen, P. and J. Wallenius (1988). “A Pareto Race,” Naval Research Logistics, 35, 277-287. [7] Michalowski, W. and T. Szapiro (1992). “A Bi-Reference Procedure for Interactive Multiple Criteria Programming,” Operations Research, 40, 247-258. [8] Sakawa, M. and H. Yano (1990). “An Interactive Fuzzy Satisficing Method for Generalized Multiobjective Programming Problems with Fuzzy Parameters,” Fuzzy Sets and Systems, 35, 125-142. [9] Statnikov, R. B. and J. B. Matusov (1995). Multicriteria Optimization and Engineering, Chapman & Hall, New York. [10] Steuer, R. E. (1994). “Random Problem Generation and the Computation of Efficient Extreme Points in Multiple Objective Linear Programming,” Computational Optimization and Applications, 3, 333-347. [11] Sun, M., A. Stam and R. E. Steuer (1996). “Solving Multiple Objective Programming Problems Using Artificial Feed-Forward Neural Networks: The Interactive FFANN Procedure,” Management Science, 42, 835-849. [12] Wierzbicki, A. P. (1986). “On the Completeness and Constructiveness of Parametric Characterizations to Vector Optimization Problems,” OR Spektrum 8, 73-87.

Poor-Definition, Uncertainty, and Human Factors – Satisfying Multiple Objectives in Real-World Decision-Making Environments I. C. Parmee Advanced Computational Technologies, Exeter, UK. [email protected]

Abstract. Ill-definition, uncertainty and multiple objectives are primary characteristics of real-world decision-making processes. During the initial stages of such processes little knowledge appertaining to the problem at hand may be available. A primary task relates to improving problem definition in terms of variables, constraint and both quantitative and qualitative objectives. The problem space develops with information gained in a dynamical process where optimisation plays a secondary role following the establishment of a well-defined problem domain. The paper speculates upon the role of evolutionary computing, complementary computational intelligence techniques and interactive systems that support such problem definition where multiobjective satisfaction plays a major role.

1 Introduction The author’s area of interest has primarily been within the field of evolutionary engineering design particularly relating to the higher levels of the design process where problem conceptualisation can represent a highly complex human-centred activity supported by a range of relatively basic machine-based models of the problem domain. The process generally consists of search across an ill-defined space of possible solutions using fuzzy objective functions and vague concepts of the structure of the final solution. Solutions and partial solutions are explored and assessed in terms of their feasibility with regard to those constraints and objectives considered relevant at that time. Heuristics, approximation and experimentation play a major role with a high degree of flexibility evident in the establishment of domain bounds, objectives and constraints. The design environment itself will evolve with the solutions as the designer/design team gain understanding of the functional requirements and the resulting structures. Simple human and computer-based models which may be largely qualitative in nature are utilised in order to establish initial direction. The decisionmaking environment is characterised by uncertainty in terms of lack of available data and a poorly defined initial specification. Discovery and the accumulation of knowledge appertaining to problem definition and objective preferences are prevalent in this highly dynamical human / machine-based process The following quote [1] relating to creative design captures these aspects:

E. Zitzler et al. (Eds.): EMO 2001, LNCS 1993, pp. 52-66, 2001. © Springer-Verlag Berlin Heidelberg 2001

Poor-Definition, Uncertainty, and Human Factors

53

…problem formulation and reformulation are integral parts of creative design. Designers’ understanding of a problem typically evolves during creative design processing. This evolution of problem understanding may lead to (possibly radical) changes in the problem and solution representations. [….] in creative design, knowledge needed to address a problem typically is not available in a form directly applicable to the problem. Instead, at least some of the needed knowledge has to be acquired from other knowledge sources, by analogical transfer from a different problem for example. […] creativity in design may occur in degrees, where the degree of creativity may depend upon the extent of problem and solution reformulation and the transfer of knowledge from different knowledge sources to the design problem.

2 Changing Objectives during Decision-Making Discovery and knowledge accumulation aspects of problem formulation are common across decision-making as a whole. Whether we are designing an engineering system, developing a financial strategy or establishing a business process, exploration involving initial variables, constraints and objectives will likely result in reformulation of the problem domain through iterative search and user analysis of identified solutions. This can be illustrated relatively simply through a decision-making process familiar to most which, although unrelated to industrial or commercial activities, could be seen as analogous in terms of discovery, knowledge accumulation, problemreformulation and the eventual identification of a best compromise solution. For illustrative purposes let us therefore consider a job-related relocation to a new city and the daunting problem of finding a family home. Initial investigation will likely relate to identifying appropriate districts based upon criteria relating to quality of local schools; safety / security issues; proximity to places of work, transport, highway networks, shopping and leisure facilities etc. plus average price and type of housing and overall environment. Other criteria relate directly to the ideal property such as maximum cost, number of bedrooms, garden, garage, parking etc. Several of the above criteria would be considered hard constraints (i.e. maximum cost) in the first instance. The decision-making team is the family who would all probably rate the relative importance of the above criteria in a slightly different manner and whose opinions will carry a varying degree of influence. It is likely that initially there is a pretty clear vision of what the ideal property will look like and the preferred location. Initial information gathering will provide quantitative and qualitative data relating to location from a wide variety of sources some reliable and some based upon hearsay. Gradually an overall picture will be established which will result in possible elimination of some options and the inclusion of new possibilities. New possible locations will be discovered during explorative trips to those already identified. As details of properties are gathered it will likely become apparent that the ideal solution is hard to find and the concept of compromise becomes a reality. Hard constraints may soften whereas objective preferences will constantly be discussed and re-defined in the light of accumulated knowledge regarding districts and property availability within them. Particular characteristics of areas initially thought to be

54

I.C. Parmee

unsuitable may suddenly appear attractive. Search concentration may shift as it is discovered that such areas have suitable properties within the pre-set price range. Alternatively, the initial hard constraint relating to maximum price may soften as close to ideal properties in favoured locations become available. Other possible compromises are investigated in an attempt to accommodate increased costs. The whole decision-making process becomes an uncertain mix of subjective / objective decisions as goal-posts move, objectives rapidly change in nature and external pressures relating to time constraints begin to take precedence. At the end of the day it is quite probable that the chosen home differs significantly from the one first envisaged. That guest bedroom may have been sacrificed and the garden may be far smaller but the location is ideal. Alternatively, the route to work may be longer and more tortuous but a property close to ideal at the right price in an up-and-coming neighbourhood has been found. Although a seemingly simple problem the overall search process is highly complex and uncertainty, compromise and problem re-definition are inherent features. Although a little far removed from commercial and industrial decision-making scenarios analogies are apparent. It is suggested that we can learn much from such everyday decision-making scenarios and utilise this knowledge when designing interactive evolutionary search environments that can support more complex decisionmaking processes.

3 Knowledge Generation and Extraction A machine-based search and exploration environment has been proposed that provides relevant problem information to the designer / decision-making team [2,3]. The intention is that such information can be processed and subsequent discussion can result in the recognition of similarities with other problem areas and the discovery of possible alternative approaches. One of the major characteristics of population-based evolutionary search is the generation of a large amount of possibly relevant information most of which may be discarded through the actions of various operators. The development of interactive systems may support the capture of such information and its utilisation in the subsequent re-formulation of the problem through the application and integration of experiential knowledge. It can be argued that such problem re-formulation captures this knowledge which then plays a significant role in further evolutionary search relating to the re-defined problem. The re-definition of objectives and objective preferences is an important aspect of this evolution of the problem space. It is apparent that a core activity within the decision-making process relates to the gathering of information relating to diverse aspects of the problem space. It has been proposed [4] that a primary role of evolutionary machine-based search and exploration processes can provide a central role in the generation of such information. This moves the utilisation of EC away from application over a set number of generations or until some convergence criteria is met to a more continuous exploratory process where changes to objective weightings, variable ranges and constraint based upon information generated results in a moving, evolving problem space. The primary task of such an approach is the design of an optimal problem space as opposed to the identification of an optimal solution.


55

This theme has been central to much of the author’s previous work where the development of EC strategies relating to the higher levels of the design process has related to the identification of high performance regions of complex conceptual design space (vmCOGAs, [5,6]) or the identification of optimal alternative system configurations through the utilisation of dual-agent strategies for search across mixed discrete / continuous design hierarchies [7,8]. Other work relates to the concurrent satisfaction of both quantitative and qualitative criteria through the integration of fuzzy rule bases with evolutionary search [9]. More recent work has led to the establishment of an experimental interactive evolutionary design system (IEDS) that supports a relatively continuous iterative user / evolutionary search process that involves EC, agent-based approaches and a number of other complementary techniques. An overview of this research that illustrates the manner in which EC-based information gathering can support decision-making in complex multi-objective design environments follows. A much more detailed treatment can be found in the referenced text whereas the author’s research as a whole is presented in the book ‘Evolutionary and Adaptive Computing in Engineering Design’ [10].

4 Experimental Approaches

4.1

The Qualitative Evaluation System (QES)

Early work related to the development of a Qualitative Evaluation System. The QES strategy provides support to the designer when attempting to determine trade-offs between both quantitative and qualitative criteria. This support utilises a linguistic rule base (generated in close collaboration with Rolls Royce turbine engineers) which resides within a fuzzy expert system. The rules relate to the comparative effectiveness of a GA-generated design solution in terms of manufacturability, choice of materials and a number of special preferences relating to in-house capabilities. Quantitative aspects of a design are combined with qualitative ratings to generate a measure of the overall fitness of the solutions. Domain knowledge concerning variable preferences and heuristics is utilised and combined using a concept of compromise [11,12]. The work concerns the preliminary design of gas turbine engine cooling hole geometries. The primary objective is to minimise the mass flow through the radial cooling hole passage. Adaptive Restricted Tournament Selection (ARTS [13]) identifies a number of single high performance solutions from the design space. The qualitative evaluation system receives all the design variable values of each of these solutions as inputs and develops an overall qualitative rating concerning the effectiveness of the design. The ARTS multi-modal GA is utilised to first identify a number of ‘good’ quantitative (i.e. minimal mass coolant flow) design solutions. These “good” solutions are next evaluated by the QES which takes the variable values of each solution as inputs and outputs a qualitative rating for the design. The QES has three components, the fuzzifier, the fuzzy inference engine and the defuzzifier. Designer

56

I.C. Parmee

knowledge provided by Rolls Royce engineers is stored in a static fuzzy rule base. During the fuzzification stage each variable range is divided into five sub-ranges, and expressed using linguistic terms. A crisp value for the effectiveness is obtained through centre-of-gravity type defuzzification. The knowledge base for the system is developed using fuzzy rules and facts embodying qualitative aspects of the design problem in terms of manufacturability, choice of materials and some designer’s special preferences. The knowledge base is presented in three categories: Inter Variable Knowledge which relates to the relative importance of each variable in terms of the objective function; Intra Variable Knowledge which relates to preferred subsets of each variables’ range e.g. blade wall thickness needs to be low in terms of material cost but high in terms of stress considerations; Heuristics which mostly concern specific cases where there is no uncertainty concerning the conclusion. The inter and intra variable knowledge is then integrated using a concept of compromise which is implemented to reduce the severity of qualitative ratings. Inter variable knowledge determines the degree of compromise possible on every variable (slight compromise, less compromise, compromise and more compromise). A more complete definition of the fuzzy rule base can be found in [9 & 11]. Having evaluated a solution both quantitatively via the ARTS GA process and qualitatively via the QES the results can be combined and presented in a graphical manner that facilitates overall understanding of the major aspects of the problem. Four solutions for each of three internal cooling-hole geometries (plane, ribbed and pedestal) are presented in figure 1with their relative quantitative fitness plainly shown by the major bars of the chart. The qualitative ratings for each solution are then shown as a series of embedded, shaded bars. Such a representation contains much information in a relatively transparent manner. It is apparent, for instance, that although the plane cast internal geometry provides a low quantitative fitness the solutions are relatively robust in terms of the qualitative criteria. The qualitative bars relating to the other two geometries show a much greater degree of fluctuation. This can perhaps provide insight into the problem and criteria characteristics which aid the designer in terms of both modelling the system and determining preference rankings for each criteria. For instance, if the priority is for a solution that can be considered low risk in terms of possible problems relating to manufacturing, material and special preferences aspects and losses relating to quantitative performance can be made up within other areas of the turbine design then a compromise can be made and a plane cast internal geometry can be chosen. If, however, quantitative performance is paramount then a pedestal geometry that best satisfies preferences relating to the three qualitative criteria may be considered appropriate. The QES provides a good indication of the relative merits of high-performance solutions in terms of a number of qualitative criteria. A possible problem area here however is the flexibility of the rule-base. There is a requirement for on-line rule changes that should be easy to implement by users with no knowledge of fuzzy inference technologies. A high degree of flexibility in terms of the representation of objectives and their weightings is a major requirement during these higher levels of the design process. It is possible that the major utility offered by the QES relates to more routine design tasks where problem definition is already high.


57

Fig. 1. Graphical representation of ARTS and the QES

4.2 The Interactive Design System

4.2.1 Introduction The QES illustrates the manner in which qualitative criteria can be combined with quantitative evaluation but it does not readily support on-line interaction. The requirement for a system that supports the on-line extraction of information that can be presented to the user in a succinct manner thereby supporting easily implemented change has led to an investigation of various techniques that can be combined within an overall architecture. The satisfaction of multiple objectives (i.e.> 10) is a major requirement and such objectives must be entirely flexible in terms of preferences / weightings to allow adequate exploration of the problem domain and to support a better understanding of the complex interactions between variable space and objective space. The developed system involves a number of machine-based processes that can communicate as shown simply in figure 2. The user is an integral part of the system accepting, analysing and processing information from the system, introducing objective change via the Preferences component and variable parameter changes directly into the Evolutionary component. The Evolutionary component can operate in several modes: 1. Single evolutionary process 2. Multiple individual evolutionary processes – no co-operation 3. Multiple co-evolving processes

58

I.C. Parmee

Mode 1 relates to problem decomposition aspects where the Cluster-oriented Genetic Algorithms of the Information Gathering component extract information relating to variable interaction, variable redundancy and the setting of appropriate variable parameter ranges. This is describe fully in references [3 & 4] and is not included in the following text as it does not directly relate to multi-objective aspects.

Co-evolutionary / Stand-alone Multi-objective Processes

Information Gathering Processes COGAs Taguchi etc

Linguistic Preferences / Objective Weighting

Decision-maker / Designer Fig. 2. Components of the Interactive Evolutionary Design System

4.2.2 COGAs as Multi-objective Information Gatherers Mode 2 concerns the concurrent identification of high-performance (HP) regions of the problem space relating to individual objectives and the subsequent definition of common HP regions where best compromise solutions may be found. Again, the COGA techniques of the Information Gathering component are involved. The basic structures of COGAs and the associated adaptive filter (AF) have been described in a number of papers [4,5,6]. Their function relates to the rapid decomposition of complex, multi-variate design space into regions of high-performance. At the COGA core is an explorative genetic algorithm (GA). Exploration has initially been promoted through variable mutation regimes (vmCOGA) and more recently through the integration of various sampling techniques [13]. The AF mechanism extracts and scales populations (in terms of fitness) from a continuous GA evolutionary process only allowing solutions that lie above a filter threshold to pass into a final clustering set. The design exploration capabilities are well described in Parmee and Bonham [4] along with extensive discussion relating to possible interactive utilisation. Of particular interest here is the identification of high-performance regions relating to differing objectives from consecutive runs of COGA. Identified HP regions can be


59

overlaid upon selected two-dimensional hyperplanes described by pairs of variables selected from the set of variable parameters that describe the problem space. The utilisation of the Evolutionary and Information Gathering components is demonstrated within a design domain relating to the preliminary design of military aircraft. This is a complex design domain characterised by uncertain requirements and fuzzy objectives relating to the long gestation periods between initial design brief and realisation of the product. Changes in operational requirements in addition to technological advances cause a demand for a responsive, highly flexible strategy where design change and compromise are inherent features for much of the design period. Design exploration leading to innovative and creative activity must be supported. The ability to introduce rapid change to satisfy the many operational, engineering and marketing considerations as they themselves change is essential. In this case the COGA software is manipulating the BAE Systems mini-CAPS model. This model is a much condensed version of the CAPS (Computer-aided Project Studies) suite of software for conceptual and preliminary airframe design. MiniCAPS maintains many of the characteristics of the overall suite especially in terms of multiple objectives. The nine input variables that define the problem space can generate up to thirteen outputs, Figure 3a shows high-performance regions relating to three mini-CAPS objectives: attained turn rate (ATR), specific excess power (SEP) and Ferry Range (FR) plotted on the gross wing plan area / wing aspect ratio variable parameter hyperplane. As can be seen regions relating to ATR and FR overlap forming a region containing HP compromise solutions. There is no mutually inclusive HP region relating to SEP however. By returning to COGA and reducing the severity of the adaptive filter in relation to SEP solutions the SEP region can be expanded as shown in figure 3band 3c until a mutually inclusive region involving all objectives is identified. This relaxing of the adaptive filter threshold allows lower performance SEP solutions through to the final clustering set. This could be considered equivalent to a lessening of the relative importance of this objective. The technique allows the projection of objective space onto variable space. This gives a visual appreciation of the interaction between the various objectives and supports the user in the determination of initial preferences concerning their relative performance. Current work is investigating the relationship of the solutions within the mutually inclusive regions to the non-dominated solutions of the Pareto frontier. This work is indicating that a good approximation to the Pareto front is contained within these regions which can be realised by identifying the non-dominated solutions contained within the high performance regions describing all objectives. It is stressed that this visual representation is an indication only. Even if mutually inclusive compromise regions are apparent in all variable parameter hyperplanes there still exists a possibility that these regions do not exist to the extent suggested in the graphical representations. This could be due to highly convoluted high-performance regions. Current work relates to the development of agent-based systems that check the validity of compromise regions across all dimensions. These agents will then inform the designer of any possible problem. This is not a complex procedure as all solution vectors describing the regions are available.

60

(a)

I.C. Parmee

(b)

Fig. 3. Identification of compromise high-performance regions relating through filter threshold relaxation (a) A common region for Ferry Range and Turn Rate has been identified but Specific Excess Power objectives cannot be satisfied. (b) Relaxing the SEP filter threshold allows lower fitness solutions through and boundary moves (c) Further relaxation results in the identification of a common region for all objectives.

(c) The aim of this work, however, is to support a better understanding of objective interaction and conflict through graphical representation rather than providing a succinct and accurate representation of compromise regions or of the Pareto frontier. In this sense, the technique again supports the generation of information appertaining to the problem at hand where variables and objectives and can vary as problem knowledge expands. The approach therefore takes into consideration the uncertainties and ill-definition inherent in the utilisation of preliminary design models and of the degree of initial understanding of the problem domain. A visual representaion of the degree of possible conflict and the manner in which a changing of objective preferences can result in a relaxation of such conflict is considered more viable than the utilisation of more sophisticated techniques that identify optimal non-dominated solutions that lie upon the true Pareto frontier at this stage. The basic notion of ‘rubbish in, rubbish out’ must be taken into consideration. Much time could be spent upon more definitive analysis to identify Pareto optimal points that prove erroneous upon the introduction of more definitive problem models. The strategy therefore indicates a probable best way forward rather than the global solution to the problem which, at this stage, is poorly defined.


61

4.2.2 The Preference Component Having gained a better understanding of objective interactions and of problems relating to the degree of difficulty likely to be encountered in the satisfaction of initial objective preferences a highly flexible interface for the introduction of such preferences to a more definitive multi-objective search process is required. A methodology that supports on-line variation of design preferences has been developed. Efficient exploration across the many different design variants that the designer wishes to assess is of more interest than the identification of single optimal solutions. The system should therefore be able to further support such exploration whilst also suggesting best design direction. It is generally accepted that it is easier for the decision-maker to give qualitative ratings to objectives i.e. ‘Objective A is much more important than objective B’ than to set the weight wA of objective A to, say, 0.1 or to 0.09. The method of fuzzy preferences [14] and induced preference order can be utilised to introduce such rulebased preference representation for transformation into appropriate objective weightings. The following predicates can be introduced [15]: Table 1. Rule-based preference representation

relation

intended meaning

relation

intended meaning

is much less important

, can help build the relationship matrix R necessary for a ‘words to numbers’ transformation. For this transformation, concepts of ‘leaving score’ [14] amongst other techniques, can be employed. It is first necessary for the engineer to rank the objectives in terms of relative importance but numeric weightings are not required. If transitivity is assumed, then the number of required questions to establish overall preference ratings is reduced. The preference algorithm has been described fully in a number of publications [2,15] and it is not intended to reproduce it here. Examples from the graphical user interface follow which illustrate the preference procedure. The problem domain again relates to BAE preliminary airframe design. The user first selects those objectives that require investigation. In this case Takeoff Distance, Landing Speed, Ferry Range and Mass at Take-off have been selected from a possible thirteen outputs from the mini-CAPS model. Having selected the objectives it is necessary to establish equivalence classes which classify the objectives in terms of relative performance. In the example (figure 4), two of the objectives are considered to be equally important, and two further objectives are considered to have different levels of importance. Three different levels of importance are therefore processed.

62

I.C. Parmee

Fig. 4. Establishing equivalence classes

The interface facilitates the on-line change of objective preferences which allows further exploratory runs providing information relating to possible problem redefinition. Having selected objectives, established objective preferences and performed the machine-based ‘words-to-numbers’ transformation the numeric weightings can be passed to the Evolutionary process module. 4.2.3 The Co-evolutionary Multi-objective Approach (Mode 3) The Preference component has been linked with the core co-evolutionary processes. The goal is to explore high-performance solutions relating to several objectives whilst providing maximum information concerning: appropriate regions of complex, multidimensional, Pareto surfaces; single objective optimal solutions and a number of solutions that best satisfy a range of ideal scenarios. This approach is an alternative to the generation of n-dimensional trade-off surfaces comprising very large numbers of non-dominated solutions that can be achieved using standard EC-based Pareto approaches. Again, the intention is to generate information that supports a better understanding of the multiple criteria aspects of the problem rather than identity Pareto-optimal solutions. The distributed method involves individual GAs for the optimisation of each objective. Search relating to an individual objective takes place upon each evolutionary process. Subsequently, through the application of penalties, the coevolving processes are drawn into that region of the overall space that offers best


63

compromise relating to all objectives and their pre-set preferences (Parmee I. et al 2000). During the co-evolutionary run the fitness for each objective is normalised relative to the maximum and minimum values found for each GA with constant adjustment as new upper and lower limits are identified. In each generation, the variables of solutions relating to each objective are compared with those of the best individual from the other co-evolving GA populations. If a variable is outside a range defined by a range constraint map it is adjusted by a penalty function. The range constraint map reduces maximum allowable distances between variables at each generation. Initially the map must allow each GA to produce a good solution based on its own specified objective. As the run progresses inflicted penalties increasingly reduce variable diversity to draw all concurrent GA searches from their separate objectives towards a single compromise design region where all objectives are best satisfied. This process is illustrated in figure 5(b) where the individual evolution of each objective is projected upon the Ferry Range objective hyperplane. In this case all objectives are of equal importance. The machine-generated numeric weightings resulting from the preference ranking introduced by the user can now modify the penalties inflicted. A heavy penalty inflicted upon a ‘much more important’ objective is therefore moderated in order to allow some influence upon the co-evolutionary search whereas such penalties upon objectives of lesser importance may not change or may be modified to take into account objective ranking. The effect of varying the relative importance of the Ferry Range objective via the Preference component is shown in figure 5(a), 5(b) and 5(c). In most real decision-making situations variables will have differing degrees of influence upon any given objective. An on-line sensitivity analysis which ranks variables according to their influence upon each objective has been introduced. This design sensitivity ranking is then used to adjust the fitness of each solution to ensure that the values of the most influential variables are within the range defined by the constraint map. Solutions are assigned the highest fitness penalty where their most influential variables lie outside of the current constraint map range. This ensures that populations contain high levels of compromise solutions in terms of the most influential variables and relatively redundant variables have little or no effect on overall solution fitness. The Taguchi method has been selected to determine the sensitivity of each input [16]. Again, the concentration is upon information-gathering and visual representation rather than the identification of Pareto optimal points. The co-evolutionary multiobjective approach provides the following information within one run of the process: high-performance solutions relating to the individual objectives; evolutionary 'tracks' that trace the Pareto surface to some extent; the bounds of a compromise region where all objectives will likely be best satisfied and the identification of influential and redundant variables relating to each objective. A more in-depth description of the process with results can be found in reference [17]. 4.2.4 Agent-Based Support Stochastic population-based search generates a mass of information much of which is discarded. The intention is to introduce agents that monitor solutions generated from single or co-evolutionary processes and identify those that may be considered ‘interesting’ by the decision-maker. The notion of ‘interesting’ may relate to: a good

64

I.C. Parmee

solution with a large Hamming or Euclidean distance from the majority of the population; a good solution that may satisfy the majority of constraints or objectives but is not satisfactory in a few; a not particularly high-performance solution where the constituent variable values lie within preferred ranges.

(b) (a)

( c)

Fig. 5. (a) F erry Range is much more important (b) All objectives are of equal importance (c) Ferry Range is much less important

The concept of ‘interesting’ may be largelay subjective which suggest that a degree of machine-learning may be appropriate where the responsible agents ‘learn’ from user reaction to possible interesting solutions presented to them. This is obviously an area requiring extensive further research. Experimental negotiating agent systems utilising the rule-based preferences have been established for the identification of solutions that satisfy a range of design scenarios relating to multiple objectives and ideal variable values. For instance, the designer is likely to have several ideal scenarios such as: ‘I would like objective A to be greater than 0.6 and objective C to be less than 83.5; objectives B, D, E should be maximised; variable 2 should have a value of between 128.0 and 164.5; a value greater than 0.32 is prefered for variable 7…etc’. The Incremental Agent operates as follows: use designer’s original preferences for both objectives and scenarios and run


65

the optimisation process; if some scenarios are not fulfilled, the agent suggests an increase in the importance of these scenarios; if some scenarios are still not fulfilled even when classed as ‘most important’ agent suggests change to variable ranges in scenario; if some scenarios are still not fulfilled the agent reports to designer and asks for assistance. The Incremental Agent strategies have been integrated with the Preferences and Co-evolutionary Multi-objective component on an experimental basis. Both the Scenario and Incremental Agent components sit between the designer and the Preference module drawing information from both. For a more detailed description of the processes and initial results based upon a miniCAPS example the reader is directed to Cvetkovic D. [18].

5 Discussion The paper discusses complexities relating to real-world multi-objective decisionmaking processes where the problem domain develops with information gained from evolutionary search and exploration. The intention has been to illustrate the manner in which EC can support such processes through the establishment of highly interactive systems where generated information provides problem insights which result in problem reformulation. An initial framework has been briefly outlined that supports the concept of an Interactive Evolutionary Design System (IEDS). Much further research and development is required to achieve relatively seamless development of the problem space where the decision-maker’s knowledge becomes embedded within an iterative human / evolutionary computational process. The entire concept moves away from the identification of non-dominated solutions and the generation of an n-dimensional Pareto frontier. The reasoning is that the inherent uncertainties and human-centred aspects of complex decision-making environments renders such approaches less viable although their utility is wellfounded in more well-defined problem areas. The intention is also to move away from the identification of solutions through the short-term application of evolutionary search techniques. The goal is a continuous, dynamic explorative process primarily made possible by the search and exploration capabilities of iterative designer / evolutionary systems. Although ambitious, it is suggested that such a concept could best utilise the processing capabilities of present and future computing technology during complex human / machine-based decisionmaking activities. The proposed architecture and IEDS concept provides an indication of what is possible in terms of interaction, information gathering and problem reformulation relating to variables and objectives. Further research may result in a much modified structure where agent technologies play a major and, to some extent, autonomous role to ensure appropriate communication and information processing capabilities. It is hoped that the concepts presented here will stimulate interest and such further research.

66

I.C. Parmee

References 1. 2. 3. 4. 5.

6.

7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18.

Goel A. K.: Design, Analogy and Creativity. IEEE Expert, Intelligent Systems and their Applications, 12 (3). (1997) 62 – 70 Parmee I. C., Cvetkovic C., Watson A. H., Bonham C. R.: Multi-objective Satisfaction within an Interactive Evolutionary Design Environment. Evolutionary Computation. 8 (2), (2000) 197 – 222. Parmee I. C., Cvetkovic C., A. H., Bonham C. R., Packham I.: Introducing Prototype Interactive Evolutionary Systems for Ill-defined Design Environments. To be published in Journal of Advances in Engineering Software, Elsevier, (2001). Parmee I. C., Bonham C. R.: Towards the Support of Innovative Conceptual Design Through Interactive Designer / Evolutionary Computing Strategies. Artificial Intelligence for Engineering Design, Analysis and Manufacturing Journal; Cambridge University Press, 14, (1999) 3 – 16. Parmee I. C.: The Maintenance of Search Diversity for Effective Design Space Decomposition using Cluster-Orientated Genetic Algorithms (COGAs) and Multi-Agent Strategies (GAANT). Proceedings of 2nd International Conference on Adaptive Computing in Engineering Design and Control, PEDC, University of Plymouth; (1996) 128 – 138. Parmee, I. C.: Cluster Oriented Genetic Algorithms (COGAs) for the identification of High Performance Regions of Design Spaces. First International Conference on Evolutionary Computation and its Applications, EvCA 96, Presidium of the Russian Academy of Sciences, Moscow; (1996) 6675. Parmee, I.C.: The Development Of A Dual-Agent Strategy For Efficient Search Across Whole System Engineering Design Hierarchies. Proceedings of Parallel Problem Solving from Nature. (PPSN IV), Lecture notes in Computer Science No. 1141; Springer-Verlag, Berlin (1996) 523-532. Parmee I. C.: Evolutionary and Adaptive Strategies for Efficient Search Across Whole System Engineering Design Hierarchies. Journal of Artificial Intelligence for Engineering Design, Analysis and Manufacturing; 12 (1998) 431 – 435. Roy R, Parmee I. C, Purchase G.: Integrating the Genetic Algorithm with the Preliminary Design of Gas Turbine Cooling Systems. Proceedings of 2nd International Conference on Adaptive Computing in Engineering Design and Control, PEDC, University of Plymouth (1996). Parmee I. C.: Evolutionary and Adaptive Computing in Engineering Design. Springer Verlag, London (2001). Roy R., Parmee I. C., Purchase G.: Qualitative Evaluation of Engineering Designs using Fuzzy Logic. Proceedings of ASME Design Engineering Technical Conferences and Computers in Engineering Conference, Irvine, California; (1996) 96-DETC/DAC-1449. Roy R., Parmee I. C.: Adaptive Restricted Tournament Selection for the Identification of Multiple Sub-optima in a Multi-modal Function. Lecture Notes in Computer Science, Evolutionary Computing; Springer-Verlag, (1996) 236-256. Bonham C. R., Parmee I. C.: An Investigation of Exploration and Exploitation in Cluster-oriented Genetic Algorithms. Proceedings of the Genetic and Evolutionary Computation Conference, Orlando, Florida, USA; (1999) 1491 – 1497. Fodor J., Roubens M.: Fuzzy Preference Modelling and Multi-criteria Decision Support. System Theory, Knowledge Engineering and Problem Solving, 14; Kluwer Academic Publishers (1994). Cvetkovic D., Parmee I. C.: Designer’s Preferences and Multi-objective Preliminary Design Processes. Evolutionary Design and Manufacture: Proceedings of the Fourth International Conference on Adaptive Computing in Design and Manufacture. Springer-Verlag (2000) 249 – 260. Peace G. S.: Taguchi Methods. Addison Wesley, Reading, M. A. (1992). Parmee I. C., Watson A. W.: Preliminary Airframe Design using Co-evolutionary Multi-objective Genetic Algorithms. Proceedings of the Genetic and Evolutionary Computation Conference, Orlando, Florida, USA; (1999) 1657 - 1665. Cvetkovic D.: Evolutionary Multi-objective Decision Support Systems for Conceptual Design. PhD Thesis, University of Plymouth (2000).

Controlled Elitist Non-dominated Sorting Genetic Algorithms for Better Convergence Kalyanmoy Deb and Tushar Goel Kanpur Genetic Algorithms Laboratory (KanGAL) Indian Institute of Technology Kanpur Kanpur, PIN 208 016, India {deb,tusharg}@iitk.ac.in http://www.iitk.ac.in/kangal

Abstract. Preserving elitism is found to be an important issue in the study of evolutionary multi-objective optimization (EMO). Although there exists a number of new elitist algorithms, where elitism is introduced in different ways, the extent of elitism is likely to be an important matter. The desired extent of elitism is directly related to the so-called exploitation-exploration issue of an evolutionary algorithm (EA). For a particular recombination and mutation operators, there may exist a selection operator with a particular extent of elitism that will cause a smooth working of an EA. In this paper, we suggest an approach where the extent of elitism can be controlled by fixing a user-defined parameter. By applying an elitist multi-objective EA (NSGA-II) to a number of difficult test problems, we show that the NSGA-II with controlled elitism has much better convergence property than the original NSGA-II. The need for a controlled elitism in evolutionary multi-objective optimization, demonstrated in this paper should encourage similar or other ways of implementing controlled elitism in other multi-objective evolutionary algorithms.

1

Introduction

It is now well established through a number of studies [1,11] that elitist multiobjective evolutionary algorithms (MOEAs) have better convergence characteristics than non-elitist MOEAs. Motivated by these studies, researchers and practitioners now concentrate on developing and using elitist MOEAs. This have resulted in a number of elitist MOEAs, such as strength Pareto EA or SPEA [13], Pareto-archived evolution strategy or PAES[8], and others. After the early suggestion of a non-elitist multi-objective genetic algorithm (NSGA) [9], the first author and his students have also suggested an elitist, fast, and parameter-free multi-objective GA (NSGA-II) [2,4]. All these elitist algorithms are interesting and have shown tremendous potential in solving multi-objective optimization problems. In the context of single objective optimization, the elitism is introduced in a number of different ways. Preserving elitism means emphasizing the currentlybest solutions in the subsequent generations. In some implementations, this is E. Zitzler et al. (Eds.): EMO 2001, LNCS 1993, pp. 67–81, 2001. c Springer-Verlag Berlin Heidelberg 2001

68

K. Deb and T. Goel

achieved by simply carrying over the best % of the population in the next generation. In other implementations, the parent and child populations are combined together and the best 50% of the population is retained. This way previouslyfound good solutions are given a chance to carry over to subsequent generations. In the context of multi-objective optimization, the meaning of elite solutions is different from that in single objective optimization. Here, all solutions that belong to the currently-best non-dominated front are best solutions in the population and are all equally important. Thus, all these solutions are elite solutions. In many occasions, a population may be mostly comprised of currently-best non-dominated solutions. When this happens, the preservation of elitism means acceptance of all such solutions. In such a scenario, not many new solutions can be accepted in the population. As a result, the search process may stagnate or prematurely converge to a suboptimal solution set. Thus, there is a need of introducing elitism in a controlled manner, in the context of multi-objective optimization. In this paper, we address the issue of controlling elitism from the point of maintaining a balance between underlying exploitation and exploration issues. Thereafter, we argue that our earlier elitist implementation NSGA-II can have uncontrolled elitism in tackling certain problems. We suggest a controlled elitist approach, where only a certain portion of the population is allowed to contain the currently-best non-dominated solutions. The dominated solutions are purposefully kept in the population to reduce the elitism effect. By introducing a parameter to control the extent of elitism, we study its effect on five complex test problems. In all simulation results, it is clear that the controlled NSGA-II has a better convergence property than the original NSGA-II with uncontrolled elitism.

2

Elitist Non-dominated Sorting Genetic Algorithm (NSGA-II)

The details of NSGA-II algorithm appear elsewhere [4]. Essentially, NSGA-II differs from our original NSGA implementation [9] in a number of ways. Firstly, NSGA-II uses an elite-preserving mechanism, thereby assuring preservation of previously found good solutions. Secondly, NSGA-II uses a fast non-dominated sorting procedure. Thirdly, NSGA-II does not require any tunable parameter, thereby making the algorithm independent of the user. Initially, a random parent population P0 is created. The population is sorted based on the non-domination. A special book-keeping procedure is used in order to reduce the computational complexity to O(M N 2 ). Each solution is assigned a fitness equal to its non-domination level. Binary tournament selection, recombination, and mutation operators are used to create a child population Q0 of size N . Thereafter, we use the algorithm shown in Figure 1 in every generation. First, a combined population Rt = Pt ∪ Qt is formed. This allows parent solutions to be compared with the child population, thereby ensuring elitism. The population Rt is of size 2N . Then, the population Rt is sorted according to

Controlled Elitist Non-dominated Sorting Genetic Algorithms

69

Rt = Pt ∪ Qt F = fast-non-dominated-sort(Rt ) Pt+1 = ∅ and i = 1 until |Pt+1 | + |Fi | ≤ N Pt+1 = Pt+1 ∪ Fi crowding-distance-assignment(Fi ) i=i+1 Sort(Fi , ≺n ) Pt+1 = Pt+1 ∪ Fi [1 : (N − |Pt+1 |)] Qt+1 = make-new-pop(Pt+1 ) t=t+1 Fig. 1. NSGA-II algorithm is shown.

non-domination [10] and different non-dominated fronts F1 , F2 , and so on are found. The algorithm is illustrated in the following: The new parent population Pt+1 is formed by adding solutions from the first front F1 and continuing to other fronts successively till the size exceeds N . Individuals of each front are used to calculate the crowding distance—the distance between the neighboring solutions [4]. Thereafter, the solutions of the last accepted front are sorted according to a crowded comparison criterion and a total of N points are picked. Since the diversity among the solutions is important, the crowded comparison criterion uses a relation ≺n as follows: Definition 1 Solution i is better than solution j in relation ≺n if (irank < jrank ) or ((irank = jrank ) and (idistance > jdistance )). That is, between two solutions with differing non-domination ranks we prefer the point with the lower rank. Otherwise, if both the points belong to the same front then we prefer the point which is located in a region with smaller number of points (or with larger crowded distance). This way solutions from less dense regions in the search space are given importance in deciding which solutions to choose from Rt . This constructs the population Pt+1 . This population of size N is now used for selection, crossover and mutation to create a new population Qt+1 of size N . We use a binary tournament selection operator but the selection criterion is now based on the crowded comparison operator ≺n . The above procedure is continued for a specified number of generations. It is clear from the above description that NSGA-II uses (i) a faster nondominated sorting approach, (ii) an elitist strategy, and (ii) no niching parameter. It has been shown elsewhere [2] that the above procedure has O(M N 2 ) computational complexity. 2.1

Exploitation Versus Exploration Issue

The above description of NSGA-II raises an important issue relating to EA research: the issue of exploitation and exploration [7]. Let us imagine that at a

70

K. Deb and T. Goel

generation, we have a population Rt where most of the members lie on the nondominated front of rank one and this front is distant from the true Pareto-optimal front. This will happen in the case of multi-modal problems, where a population can get attracted to a local Pareto-optimal front. Since most members belong to the current best non-dominated front, the elitism operation will result in deleting most members belonging to other fronts. In the above NSGA-II algorithm, elitist solutions are emphasized in two occasions. Once in the make-new-pop(Pt+1 ) operation and again during the elitism operation in the until loop. The former operation involves the crowded tournament selection operator, which emphasizes the elitist solutions (the currently-best non-dominated solutions). In the latter case, solutions are selected starting from the currently-best non-dominated solutions till all population slots are filled. This way, the elitist solutions also get emphasized. This dual emphasis of elitist solutions will cause a rapid deletion of solutions belonging to non-elitist fronts. Although the crowding tournament operator will ensure diversity along the current non-dominated front, lateral diversity will be lost. In many problems, when this happens the search slows down, simply because there may be a lack of diversity in certain decision variables left to push the search towards better regions of optimality. Thus, in order to ensure better convergence, a search algorithm may need diversity in both directions— along the Pareto-optimal front and lateral to the Pareto-optimal front, as shown in Figure 2. In the test problems suggested elsewhere [5], the lateral diversity is

f2 Front 1

2

3 Lateral Diversity

Diversity along a front

Pareto−optimal front

f1

Fig. 2. Controlled elitism procedure is illustrated.

ensured by the functional g() with (n−1) decision variables. Solutions converging to any local Pareto-optimal front will make all these decision variables to take an identical value. The dual elitism will reduce the variability in these solutions and eventually prevent the algorithm to move towards the true Pareto-optimal front.


71

The difficulty arises because of the way elitism is implemented in NSGA-II. There is no control on the exploitation of the currently best non-dominated solutions. In the above discussion, it is clear that in certain complex functions, NSGA-II, in the absence of a lateral diversity-preserving operator such as mutation, causes too much exploitation of currently-best non-dominated solutions. In order to counteract this excessive selection pressure, an adequate exploration by means of the search operators must be used. A proper balance of these two issues is not possible to achieve with the uncontrolled elitism mechanism in NSGA-II. In an earlier study [2], we have shown that in the test problem ZDT4 with Rastrigin’s multi-modal function as the g functional, NSGA-II could not converge to the global Pareto-optimal front. However, when a mutation operator with a larger mutation strength is used, NSGA-II succeeds in converging to the global Pareto-optimal front. Increasing variability through mutation enhances the exploration power of NSGA-II and a balance between enhanced exploitation of NSGA-II and the modified exploration can be maintained. Although many researchers have adopted an increased exploration requirement by using a large mutation strength in the context of single objective EAs, the extent of needed exploration is always problem dependent. In the following section, instead of concentrating on changing the search operators, we suggest a controlled elitism mechanism which will control the extent of exploitation rather than controlling the extent of exploration.

3

Controlled Approach

In the proposed controlled NSGA-II, we restrict the number of individuals in the currently best non-dominated front adaptively. We attempt to maintain a pre-defined distribution of number of individuals in each front. Specifically, we use a geometric distribution for this purpose: ni = rni−1 ,

(1)

where ni is the maximum number of allowed individuals in the i-th front and r (< 1) is the reduction rate. Although the parameter r is user-defined, the procedure is adaptive as follows. First, the population Rt = Pt ∪ Qt is sorted for non-domination. Let us say that the number of non-dominated fronts in the population (of size 2N ) is K. Thus, according to the geometric distribution, the maximum number of individual allowed in the i-th front (i = 1, 2, . . . , K) in the new population of size N is 1 − r i−1 ni = N r . (2) 1 − rK Since r < 1, the maximum allowable number of individuals in the first front is highest. Thereafter, each front is allowed to have an exponentially reducing number of solutions. This exponential distribution considered above is an assumption and must be tried with other distributions such as an arithmetic distribution or a harmonic distribution. But the principle in all these approaches is

72

K. Deb and T. Goel

the same—forcibly allow solutions from all non-dominated fronts to co-exist in the population. Although equation 2 denotes the maximum allowable number of individuals ni in each front i, in a population, there may not exist exactly ni individuals in front i. We resolve this problem by starting a procedure from the first front. The number of individuals in the first front is counted. Let us say that there are nt1 individuals. If nt1 > n1 (that is, there are more solutions than allowed), we only choose n1 solutions using the crowded tournament selection. This way, exactly n1 solutions that are residing in less crowded region are selected. On the other hand, if nt1 < n1 (that is, there are less solutions in the population than allowed), we choose all nt1 solutions and count the number of remaining slots ρ1 = n1 − nt1 . The maximum allowed number of individuals in the second front is now increased to n2 → n2 + ρ1 . Thereafter, the actual number of solutions nt2 present in the second front is counted and is compared with n2 as above. This procedure is continued till all N individuals are selected. Figure 3 shows that a population of size 2N (having four non-dominated fronts with topmost subpopulation representing front one and so on) is reduced to a new population Pt+1 of size N using the above procedure. In the transition shown in the right, all four fronts have representative solutions. Besides this elitism procedure the rest of the procedure is kept the same as that in NSGA-II. The figure also shows

NSGA−II Pt+1

111 000 000nt n1 111 000 1 111 000 111 000 111 000 t n2 111 000 111 n2 000 111 N

Rt

111 000 000 111 0001 111 000 111 000 111 000 111 000 111 0002 111 000 111 000 111 t 111 n3 000 3

Controlled NSGA−II Pt+1

1111 0000 0000n1 1111 0000 1111 0000 1111 0000 1111 0000nn32 1111

1111 0000 0000 1111 0000 1111 n 0000 1111 000 111 0000 1111 0004 111 n1111 0000 0000 1111 N

4

t 4

2N

Fig. 3. Controlled elitism procedure is illustrated.

the new population Pt+1 which would have obtained using the usual NSGA-II procedure. It is clear that the new population under the controlled NSGA-II is more diverse than that under NSGA-II. Since the population is halved, it is likely that in each front there would be more solutions than allowed. However, there could be some situations where after all 2N solutions are processed as above, there are still some slots left in the new


73

population to be filled. This may happen particularly when r is large. In such cases, we make another pass with the left-out individuals from the first front, continuing to other fronts, and start including them till we fill up the remaining slots. 3.1

Discussions

As mentioned earlier, keeping individuals from many non-dominated fronts in the population help to the recombination operator to create diverse solutions. NSGA-II and many other successful MOEAs thrive at maintaining diversity among solutions of independent non-dominated fronts. The controlled elitism procedure suggested above will help to maintain diversity in solutions across the non-dominated fronts. In solving difficult multi-objective optimization problems, this additional feature may be helpful in progressing towards the true Paretooptimal front. It is intuitive that the parameter r is important in maintaining the correct balance between the exploitation and exploration issue discussed earlier. This parameter sets up the extent of exploration allowed in an MOEA. If r is small, the extent of exploration is large and vice versa. In general, the optimal value of r will depend on the problem and will be difficult to find theoretically. In the following section, we present simulation results on a number of difficult problems to investigate if there exists any range of r, where NSGA-II performs well.

4

Simulation Results

In order to demonstrate the working of the proposed methodology, we use a set of test problems. The first four problems have multiple Pareto-optimal fronts, among those many fronts, one is the globally Pareto-optimal set. Next, we consider one constrained test problem, which has infeasible regions restricting the search towards the true Pareto-optimal front. In order to investigate the effect of the controlled elitism alone, we do not use the mutation operator. For controlled NSGA-II runs, we do not use the selection operator in make new pop() to create the child population. For all problems, we use a population size of 100, a crossover probability of 0.95, and spread factor for the SBX operator [6] of 20. All simulation runs are continued until 200 generations are over. 4.1

Multi-objective Rastrigin’s Problem

This problem is identical to the ZDT4 function, introduced elsewhere [12]:  Minimize f1 (x) = x1 h  i    Minimize f (x) = g(x) 1 − px /g(x) 2 1 ZDT4 : (3) P10 2  g(x) = 91 + x − 10 cos(4πx )  i i i=2   x1 ∈ [0, 1], xi ∈ [−5, 5], i = 2, . . . , 10.

74

K. Deb and T. Goel

It was also observed in another study [2] that NSGA-II has difficulties in converging to the global Pareto-optimal front. However, when the mutation strength is increased, NSGA-II could converge to the correct front. Figure 4 shows that a simulation run with NSGA-II could not converge to the true Pareto-optimal front (the plot shown with diamonds). Since mutation is not

14

8

12

NSGA−II r=0.9 r=0.2 Functional g()

8 f_2

NSGA−II

7

10

6 4

6

5 Controlled Elitism

4

2 0

0

0.1

0.2

0.3

0.4

0.5 0.6 f_1

0.7

0.8

0.9

1

Fig. 4. Distribution of obtained set of solutions for ZDT4.

3

0

0.1

0.2

0.3 0.4 0.5 0.6 0.7 Reduction ratio, r

0.8

0.9

Fig. 5. Average g() for controlled and uncontrolled NSGA-IIs for ZDT4.

used, NSGA-II also faced difficulty in maintaining a diverse set of solutions in the obtained front. The figure also shows two other simulations with controlled elitism (r = 0.2 and r = 0.9), starting from the same initial population. The figure clearly shows that when controlled elitism is used, existence of multiple fronts ensures better convergence and better diversity among obtained solutions. To make a thorough investigation, we have used 19 controlled elitist NSGA-IIs in the range r ∈ [0.05, 0.9] with an interval of 0.05 and compared the results with the original NSGA-II. For each NSGA-II, we have performed 25 simulation studies, each starting with a different initial population. But for all NSGA-IIs, 25 identical populations are used. The average value of the best functional g() in 200 generations is calculated and plotted in Figure 5. Equation 3 reveals that all solutions having g = 1 lie in the global Pareto-optimal front. Thus, an MOEA with a smaller value of functional g() can be considered to have done well in solving the above problem. The figure clearly shows that all controlled elitism runs have done much better than the original NSGA-II. The average g() value is much closer to one than NSGA-II. Although there is some fluctuations in the obtained g() values for different setting of the reduction rate, all controlled NSGA-IIs are better. In order to investigate the composition of population with controlled elitism, we count the number of solutions in the first and the second fronts in 25 different NSGA-II and controlled NSGA-II with r = 0.5 runs. The average of these numbers is plotted in Figures 6 and 7. Figure 6 shows that in the case of original


75

NSGA−II

100

80

60

r=0.5

40

20

0

0

20

40

60

80

100 120 140 160 180 200

Generation number

Fig. 6. Average number of solutions in the first (best) non-dominated front.

Solutions in the second front

Solutions in the first front

NSGA-II, the number of solutions is in the first front grows very rapidly after a certain number of generations. Within about 90 generations, all population members belong to the best non-dominated front. Thereafter, NSGA-II works by keeping all population members in the first front. The only way a new solution will be accepted, if it lies in the current best non-dominated front and if it resides in a less crowded area. On the other hand, with controlled NSGA-II (with r = 0.5) the population is never filled with currently-best non-dominated solutions alone. With r = 0.5, only about 50% population members belong to the best non-dominated front. Moreover, the rate of increase of solutions in the best non-dominated front is also small and importantly, the growth of solutions in this front begins much later than that with the original NSGA-II. Figure 7

30 r=0.5

25 20 15 10 5 0

NSGA−II 0

20

40

60 80 100 120 140 160 180 200 Generation number

Fig. 7. Average number of solutions in the second non-dominated front.

shows the number of solutions in the second front. The figure clearly shows that in the original NSGA-II, there exists no member in the second front after about 90 generations, meaning that all solutions belong to the first non-dominated front. But, in the case of controlled NSGA-II, about 25% population belongs to the second front. The presence of so many solutions in the second front and subsequent fronts provides a lateral diversity needed for a better convergence to the global Pareto-optimal front. We would like to distinguish the original NSGA-II algorithm with controlled NSGA-II having r = 0. With r = 0, the allowed number of solutions in the best non-dominated front is N (the population size). Thus, there is no pressure to maintain other fronts in the population. This algorithm may apparently look the same as the original NSGA-II, but there is a difference. In the r = 0 controlled NSGA-II, the tournament selection in the make new pop() operator is eliminated. This way, the selection pressure for currently-best elitist solutions is smaller than that in the original NSGA-II. Although this simple change in NSGA-II exhibits a better performance, the controlled NSGA-IIs with r > 0 are

76

K. Deb and T. Goel

generic. Moreover, NSGA-IIs with some values of r > 0 show better performance than NSGA-II with r = 0. It is a matter of future research to investigate if a dynamically changing r with generation makes the convergence better than a fixed r. However, the effect of r is evident in the following problem. 4.2

Biased Test Function

Next,we construct a test problem using equation 3, with the funcitonal g() as given by the following equation [5]. P30 P30 min !γ i=2 xi − i=2 xi . (4) g(x) = 1 + 9 P30 max P 30 min x − i=2 i i=2 xi where γ = 0.25. Here, the variables xi are allowed to vary in the limits [0, 1]. The function has the property of having more solutions away from the Paretooptimal front, thus making the search more and more difficult to come to the Pareto-optimal front. This function has the globally Pareto-optimal front with the functional g(x) = 1. Figure 8 shows a typical distribution on the Pareto-optimal front for NSGA-II runs and different controlled elitist NSGA-II on this function without mutation. Here, the weak definition of the dominance is used. It is clear from the Figure 9

9

4

7

3.6

6 3.4

f_2

Functional g()

NSGA−II r=0.0 r=0.65

8

NSGA−II

3.8

3.2

Controlled Elitism

3

4 3

2.8 2.6

5

2 0

0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 Reduction ratio r

Fig. 8. Distribution of obtained set of solutions for ZDT4 with a biased function.

1

0

0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 f_1

1

Fig. 9. Average g() for controlled and uncontrolled NSGA-IIs for ZDT4 with a biased function.

that controlling elitism is useful. The best performance of the MOEA is achieved at r = 0.65. The performance of NSGA-II improves with r, but after a critical r the performance deteriorates. For small r, not enough fronts exist in the population, thereby slowing the performance. On the other hand, when r is large, not


77

much selection pressure is assigned to the current best non-dominated solutions. Figure 8 shows the lateral diversity for a typical run for r = 0, r = 0.65 and the original NSGA-II runs. It is clear that diversity on the front is maintained in all the fronts. There exist a number of points in the run for r = 0.65 which are not on the best non-dominated front. These are the points which exist on the different fronts and provide the needed diversity to help proceed NSGA-II towards the Pareto-optimal region. The figure confirms the concept of surviving different fronts simultaneously to achieve the better convergence. 4.3

Multi-objective Griewangk Problem

Next, we construct a problem using equation 3, except that the functional g() is now different (g() is a Greigwank’s function [5]): g(x) = 2 +

10 X

√ 10 x2i /4000 − Πi=2 cos(xi / i).

(5)

i=2

Here, the variables x2 until x10 are all allowed to vary in [−512, 511]. This function has 1639 local Pareto-optimal fronts, of which only one is globally Paretooptimal front having g(x) = 1. Figure 10 shows a typical performance plot of NSGA-II and controlled elitist NSGA-IIs on this function without mutation. It is clear that controlled elitism 10

5

9

NSGA−II r=0.75 r=0.5

8

4 Functional g()

7

f_2

6 5 4 3 2

3.5 3 Controlled elitism

2.5 2 1.5

1 0

NSGA−II

4.5

0

0.1

0.2

0.3

0.4

0.5 0.6 f_1

0.7

0.8

0.9

1

Fig. 10. Distribution of obtained set of solutions for ZDT4 with Griewangk’s function.

1

0

0.1

0.2


0.8

0.9

Fig. 11. Average g() for controlled and uncontrolled NSGA-IIs for ZDT4 with Griewangk’s function.

runs are better converged near the true Pareto-optimal front. Because of lateral diversity present in the controlled NSGA-II runs, diversity in the obtained set of solutions also comes as a bonus. Figure 11 shows a detailed comparative study. Once again, the figure confirms that the controlled NSGA-II results are better.

78

K. Deb and T. Goel

4.4

Nonuniform Distribution

We now use the problem ZDT6, which was used in another study [12].  6 Minimize f1 (x) = 1 − exp(−4x  1 ) sin (6πx h i 1)   2   Minimize f2 (x) = g(x) 1 − (x1 /g(x)) hP i0.25 ZDT6 : 10   g(x) = 1 + 9 ( x )/9 i  i=2   x1 ∈ [0, 1], xi ∈ [−5, 5], i = 2, . . . , 10.

(6)

The above problem should not cause much difficulty in converging to the correct front (g(x) = 1), but causes difficulty in maintaining a uniform spread of solutions in the front. Even in this problem, we observe from Figures 12 and 13 that the original NSGA-II without the help of mutation cannot come closer to the Pareto-optimal front. Moreover, the distribution of solutions in the obtained set is also non-

6.4

7

6.2 NSGA−II r=0.6 r=0.1

6

6 Functional g()

5.8

f_2

5.6 5.4 5.2 5 4.8

5.5 5 Controlled elitism 4.5 4 3.5

4.6 4.4 0.2

NSGA−II

6.5

0.3

0.4

0.5

0.6 f_1

0.7

0.8

0.9

1

Fig. 12. Distribution of obtained set of solutions for ZDT6.

3

0

0.1

0.2


0.8

0.9

Fig. 13. Average g() for controlled and uncontrolled NSGA-IIs for ZDT6.

uniform. Controlled NSGA-IIs performs better than the original NSGA-II in both converging near the true Pareto-optimal front and maintaining a uniformlike distribution. Figure 12 shows that NSGA-II’s crowding mechanism is good enough to maintain a good distribution of solutions in this problem. But, NSGAII’s large selection pressure through uncontrolled elitism is detrimental. Once again, the performance of controlled NSGA-IIs is more or less insensitive to the chosen r value.


4.5

79

Constrained Test Problem (CTP7)

Finally, we attempt to solve a constrained test problem shown below [3]:  Minimize f1 (x) = x1     Minimize f (x) = g(x) 1 − f1 (x) 2 g(x) CTP7 :  Subject to c(x) ≡ cos(θ)(f (x) − e) − sin(θ)f1 (x) ≥ 2    c d a |sin (bπ (sin(θ)(f2 (x) − e) + cos(θ)f1 (x)) )| .

(7)

The decision variable x1 is restricted to [0, 1]. The functional g() is the Rastrigin’s function used in equation 3. But, here we use five variables, instead of 10 used in ZDT4. Other parameter values are as follows: θ = −0.05π,

a = 40,

b = 5,

c = 1,

d = 6,

e = 0.

The feasible search space and the corresponding disconnected Pareto-optimal regions are shown in Figure 14.

2

1.5

f2 1

0.5 Pareto−optimal regions 0

0

0.2

0.4

0.6

0.8

1

f1

Fig. 14. Constrained test problem CTP7.

In the absence of a mutation operator, we observe that NSGA-II’s strong elitism prevents the algorithm to come closer to the true Pareto-optimal front (Figure 15). The outcome of 25 runs suggests that the controlled elitism can overcome this problem somewhat and help NSGA-II to converge closer to the true Pareto-optimal front (Figure 16). The absence of mutation in all NSGAII runs prohibits them to maintain a diverse set of population members in the obtained set.

80

K. Deb and T. Goel 7

8

6

NSGA−II

NSGA−II r=0.15 r=0.8 Functional g()

5

7

f_2

4 3 2

6

Controlled elitism

5

4

1 0

0

0.2

0.4

0.6

0.8

1

f_1

Fig. 15. Distribution of obtained set of solutions for CTP7.

5

3

0

0.1

0.2


0.8

0.9

Fig. 16. Average g() for controlled and uncontrolled NSGA-IIs for CTP7.

Conclusion

In this paper, we have discussed the need to make a balance between exploitation offered by a selection operator along with an elite-preserving mechanism with exploration offered by a recombination operator. Although NSGA-II has been largely successful in many problems, in some difficult problems, it showed difficulty in converging to the Pareto optimal front. Here, we have clearly shown that the uncontrolled elitism present in NSGA-II produces a large selection pressure for currently-best non-dominated solutions. In difficult multi-modal problems and other problems, this forces NSGA-II without any mutation operator to have a premature convergence to a suboptimal front. By forcing a number of non-dominated fronts to co-exist in an NSGA-II, we have shown that the selection pressure offered by NSGA-II’s elitism operator can be controlled. On five difficult test problems, including a difficult constrainthandling problem, we have shown that the controlled NSGA-II has a better convergence property than the original NSGA-II. Since diverse non-dominated fronts are also maintained in the population, controlled NSGA-II also produces a better distribution of solutions than the original NSGA-II. The controlled elitism mechanism implemented here with NSGA-II is generic and can also be implemented with other elitist MOEAs. It would be a matter of future research to investigate whether the convergence property of other MOEAs improves with such a controlled elitism operator. Acknowledgements. Authors acknowledge the support provided by Department of Science and Technology (DST) for this study.


81

References 1. Corne, D. W., Knowles, J. D., and Oates, M. J. (2000). The Pareto envelopebased selection algorithm for multiobjective optimization. Proceedings of the Parallel Problem Solving from Nature VI Conference, pp. 839–848. 2. Deb, K., Pratap, A., Agrawal, S. and Meyarivan, T. (2000). A fast and elitist multiobjective genetic algorithm: NSGA-II. Technical Report No. 2000001. Kanpur: Indian Institute of Technology Kanpur, India. 3. Deb, K., Mathur, A. P., Meyarivan, T. (2000). Constrained test problems for multiobjective evolutionary optimization. Technical Report No. 200002. Kanpur: Kanpur Genetic Algorithms Laboratory, IIT Kanpur, India. 4. Deb, K., Agrawal, S., Pratap, A., Meyarivan, T. (2000). A Fast Elitist Nondominated sorting genetic algorithm for multi-objective optimization: NSGA-II. Proceedings of the Parallel Problem Solving from Nature VI Conference, pp. 849– 858. 5. Deb, K. (1999) Multi-objective genetic algorithms: Problem difficulties and construction of test functions. Evolutionary Computation, 7(3), 205–230. 6. Deb, K. and Agrawal, R. B. (1995) Simulated binary crossover for continuous search space. Complex Systems, 9 115–148. 7. Goldberg, D. E. (1989). Genetic algorithms in search, optimization, and machine learning. Reading: Addison-Wesley. 8. Knowles, J. and Corne, D. (1999) The Pareto archived evolution strategy: A new baseline algorithm for multiobjective optimisation. Proceedings of the 1999 Congress on Evolutionary Computation, Piscataway: New Jersey: IEEE Service Center, 98–105. 9. Srinivas, N. and Deb, K. (1995). Multi-objective function optimization using nondominated sorting genetic algorithms. Evolutionary Computation(2), 221–248. 10. Steuer, R. E. (1986). Multiple criteria optimization: Theory, computation, and application. New York: Wiley. 11. Zitzler, E. (1999). Evolutionary algorithms for multiobjective optimization: Methods and applications. Doctoral thesis ETH NO. 13398, Z¨ urich: Swiss Federal Institute of Technology (ETH), Aachen, Germany: Shaker Verlag. 12. Zitzler, E., Deb, K., and Thiele, L. (2000). Comparison of multiobjective evolutionary algorithms: Empirical results. Evolutionary Computation Journal, 8(2), 173–196. 13. Zitzler, E. and Thiele, L. (1998). An evolutionary algorithm for multiobjective optimization: The strength Pareto approach. Technical Report No. 43 (May 1998). Z¨ urich: Computer Engineering and Networks Laboratory, Switzerland.

Specification of Genetic Search Directions in Cellular Multi-objective Genetic Algorithms Tadahiko Murata 1, Hisao Ishibuchi 2, and Mitsuo Gen 1 1 Department of Industrial and Information Systems Engineering,

Ashikaga Institute of Technology, 268 Omae-cho, Ashikaga 326-8558, Japan {murata, gen}@ashitech.ac.jp 2 Department of Industrial Engineering, Osaka Prefecture University, 1-1 Gakuen-cho, Sakai, Osaka 599-8531, Japan [email protected] Abstract. When we try to implement a multi-objective genetic algorithm (MOGA) with variable weights for finding a set of Pareto optimal solutions, one difficulty lies in determining appropriate search directions for genetic search. In our MOGA, a weight value for each objective in a scalar fitness function was randomly specified. Based on the fitness function with the randomly specified weight values, a pair of parent solutions are selected for generating a new solution by genetic operations. In order to find a variety of Pareto optimal solutions of a multi-objective optimization problem, weight vectors should be distributed uniformly on the Pareto optimal surface. In this paper, we propose a proportional weight specification method for our MOGA and its variants. We apply the proposed weight specification method to our MOGA and a cellular MOGA for examining its effect on their search ability.

1 Introduction Genetic algorithms have been successfully applied to various optimization problems [1]. The extension of GAs to multi-objective optimization was proposed in several manners (for example, Schaffer [2], Kursawe [3], Horn et al. [4], Fonseca & Fleming [5], Murata & Ishibuchi [6], Zitzler & Thiele [7]). The aim of these algorithms is to find a set of Pareto-optimal solutions of a multi-objective optimization problem. Another issue in multi-objective optimization is to select a single final solution from Pareto-optimal solutions. Many studies on multi-objective GAs did not address this issue because the selection totally depends on the decision maker’s preference. In this paper, we also concentrate our attention on the search for finding a set of Paretooptimal solutions. In this paper, we try to improve the search ability of our multi-objective genetic algorithm (MOGA) in [6] and its variants (i.e., extensions of our MOGA). Fig. 1 shows some extended algorithms in our previous studies [8-10]. By hybridizing our MOGA with a local search procedure, we have already extended it to a multiobjective genetic local search algorithm (MOGLS [8]). We have also extended our MOGA to a cellular multi-objective genetic algorithm (C-MOGA [9]) by introducing E. Zitzler et al. (Eds.): EMO 2001, LNCS 1993, pp. 82-95, 2001. © Springer-Verlag Berlin Heidelberg 2001

Cellular Multi-objective Genetic Algorithms

83

a cellular structure. We have employed a local search procedure and a cellular structure in a cellular MOGLS [10]. Furthermore we have extended the cellular algorithms by introducing a relocation procedure (i.e., a kind of immigration) in [10]. Each individual is relocated to a cell at every generation based on the values of multiple objectives (i.e., the location in the multi-dimensional objective space). Those extended algorithms, which are based on the cellular structure and the immigration procedure, are referred to as Cellular Immigrative (“CI-”) algorithms in Fig. 1. Local Search MOGA

MOGLS

C-MOGA

C-MOGLS

CI-MOGA

CI-MOGLS

Cellular structure Immigration

Fig. 1. Extensions of our MOGA by introducing local search, cellular structures and immigration procedures

When we try to implement our MOGA and its variants with variable weights, one difficulty lies in determining appropriate search directions for genetic search. In those algorithms, the weight value for each objective in a scalar fitness function is randomly specified. Based on the scalar fitness function with the randomly specified weight values, a pair of parent solutions are selected for generating a new solution by genetic operations. In order to find a variety of Pareto optimal solutions of a multi-objective optimization problem, a proportional weight specification method is more desirable than the random specification method. In this paper, we propose a proportional weight specification method for our MOGA and its variants. We apply the proposed weight specification method to our MOGA and a cellular MOGA for examining its effect on their search ability. The concept of cellular genetic algorithms was proposed by Whitley [11]. In cellular genetic algorithms, each individual (i.e. a chromosome) resides in a cell of a spatially structured space. Genetic operations for generating new individuals are locally performed in the neighborhood of each cell. While the term “cellular genetic algorithm” was introduced by Whitley, such algorithms had already been proposed by Manderik & Spiessens [12]. A similar concept was also studied in evolutionary ecology in the framework of “structured demes” (Wilson [13], Dugatkin & Mesterton-Gibbons [14]). The effect of spatial structures on the evolution of cooperative behavior has also been examined in many studies (e.g., Nowak & May [15], Wilson et al. [16], Oliphant [17], Grim [18], and Ishibuchi et al. [19]) where each individual was located in a cell of single-dimensional or two-dimensional gridworlds. The concept for generating a grid world on an n-objective space is also employed in the Pareto Archived Evolution Strategy (PAES) [20], where each individual is located in a grid on the objective space. The PAES employs a grid world in order to avoid introducing a niche size in the algorithm.

84

T. Murata, H. Ishibuchi, and M. Gen

2 Multi-objective Optimization Let us consider the following multi-objective optimization problem with n objectives: Maximize f1 (x) , f 2 (x) , ..., f n (x) ,

(1)

where f 1 (⋅) , f 2 (⋅) , ..., f n (⋅) are n objectives. When the following inequalities hold between two solutions x and y, the solution y is said to dominate the solution x:

∀i : f i (x) ≤ f i (y ) and ∃j : f j (x) < f j (y ) .

(2)

If a solution is not dominated by any other solutions of the multi-objective optimization problem, that solution is said to be a Pareto-optimal solution. The task of multi-objective algorithms in this paper is not to select a single final solution but to find all Pareto-optimal solutions of the multi-objective optimization problem in (1). When we use heuristic search algorithms such as taboo search, simulated annealing, and genetic algorithms for finding Pareto-optimal solutions, we usually can not confirm the optimality of obtained solutions. We only know that each of the obtained solutions is not dominated by any other solutions examined during the execution of those algorithms. Therefore obtained solutions by heuristic algorithms are referred to as “nondominated” solutions. For a large-scale multi-objective optimization problem, it is impossible to find all Pareto-optimal solutions. Thus our task is to find many near-optimal nondominated solutions in a practically acceptable computational time. The performance of different multi-objective algorithms is compared based on several quality measures of obtained nondominated solutions.

3 Multi-objective Genetic Algorithms (MOGA) In this section, we explain our MOGA [6], which is the basic algorithm of the CMOGA (See Fig. 1). In our MOGA, the weighted sum of the n objectives is used as a fitness function:

f (x) = w1 f1 (x) + w2 f 2 (x) + K + wn f n (x) ,

(3)

where w1 ,K, wn are nonnegative weights for the n objectives, which satisfy the following relations:

wi ≥ 0 for i = 1, 2,K, n ,

(4)

w1 + w2 + L + wn = 1 .

(5)

This fitness function is utilized when a pair of parent solutions are selected for generating a new solution by crossover and mutation. One characteristic feature of our MOGA is to randomly specify weight values whenever a pair of parent solutions are selected. That is, each selection (i.e., the selection of two parents) is performed based on a different weight vector. This means that each of newly generated solutions by the genetic operations has its own weight vector. The other characteristic feature of our MOGA is preserving all nondominated solutions which are obtained during the execution of the algorithm. We describe these characteristic features in the following subsections.


85

3.1 Selection Operation When a pair of parent solutions are to be selected from a current population in a selection operation for generating an offspring by genetic operations, first the n weight values ( w1 , w2 , K, wn ) are randomly specified as follows:

wi = randomi /( random1 + L + random n ) , i = 1, 2,K, n ,

(6)

where randomi is a nonnegative random real number. For example, when N pairs of parent solutions are selected for generating a new population, N different weight vectors are specified by (6). This means that N search directions are utilized in a single generation. In other words, each selection (i.e., the selection of two parents) is governed by a different fitness function. 3.2 Elitist Strategy Our MOGA separately stores two different sets of solutions: a current population and a tentative set of nondominated solutions. After genetic operations are applied to the current population, it is replaced with newly generated solutions. At the same time, the tentative set of nondominated solutions is updated. That is, if a newly generated solution is not dominated by any other solutions in the current population and the tentative set of nondominated solutions, this solution is added to the tentative set. Then all solutions dominated by the added one are removed from the tentative set. In this manner, the tentative set of nondominated solutions is updated at every generation in our MOGA. From the tentative set of nondominated solutions, a few solutions are randomly selected and added to the current population (see Fig. 2). The randomly selected nondominated solutions may be viewed as elite solutions because they are added to the current population with no modification. When a multi-objective optimization problem has a non-convex Pareto front, weighted sum approaches with constant weights fail to find its entire Pareto solutions. This is because those algorithms try to find a single optimal solution with respect to the fixed weights by their single trial. Our approach remedies such a difficulty by using variable weights and storing the tentative set of nondominated solutions. This set is updated by examining the Pareto optimality of every solution generated by genetic operations during the execution of the algorithm. It was shown in [6, 8] that our approach found nondominated solutions on a non-convex Pareto front of a twoobjective continuous optimization problem. In [6, 8], our approach was also applied to two-objective flowshop scheduling problems with non-convex Pareto fronts. 3.3 Algorithm Let us denote the population size by N pop . We also denote the number of nondominated solutions added to the current population by N elite (i.e., N elite is the number of elite solutions, see Fig. 2). Using these notations, our MOGA can be written as follows.

86


Step 0) Initialization: Randomly generate an initial population of N pop solutions. Step 1) Evaluation: Calculate the values of the n objectives for each solution in the current population. Then update the tentative set of nondominated solutions. Step 2) Selection: Repeat the following procedures to select ( N pop − N elite ) pairs of parent solutions. a) Randomly specify the weight values w1 , w2 ,K, wn in the fitness function (3) by (6). b) According to the following selection probability P (x) , select a pair of parent solutions from the current population Ψ .

P ( x) =

f (x) − f min (Ψ ) , { ∑ f (y ) − f min (Ψ )}

(7)

y∈Ψ

where f min (Ψ ) is the minimum fitness value in the current population Ψ . Step 3) Crossover and Mutation: Apply a crossover operator to each of the selected ( N pop − N elite ) pairs of parent solutions. A new solution is generated from each pair of parent solutions. Then apply a mutation operator to the generated new solutions. Step 4) Elitist Strategy: Randomly select N elite solutions from the tentative set of nondominated solutions, and add the selected N elite solutions to the ( N pop − N elite ) solutions generated in Step 3 to construct a population of

N pop solutions. Step 5) Termination Test: If a prespecified stopping condition is satisfied, end the algorithm. Otherwise, return to Step 1. Current population

Next population

Genetic operations

Update

Elite solutions

Non-dominated solutions

Update

Non-dominated solutions

Fig. 2. Illustration of the elitist strategy in the MOGA


87

4 Cellular Algorithms 4.1

Relation between Cell Location and Weight Vector

In cellular algorithms, each individual (i.e. a solution) resides in a cell in a spatially structured space (e.g., two-dimensional grid-world). For utilizing a cellular structure in our MOGA, we assign a different weight vector to each cell. For our n-objective optimization problem, cells are structured in an n-objective weight space. Fig. 3 shows an example of structured cells for a two-dimensional optimization problem where the two weights w1 and w2 are used for the calculation of the fitness function

f (x) as f (x) = w1 f1 (x) + w2 f 2 (x) . In this figure, the population size is eleven because an individual exists in each cell. As shown in Fig. 3, the location of each cell corresponds to its weight vector. In order to allocate cells on uniformly distributed weight vectors, we generate weight vectors systematically (not randomly). For example, weight vectors in Fig. 3 are (1.0, 0.0), (0.9, 0.1), ..., (0.0, 1.0). As shown in Fig. 3, we can easily generate uniform weight vectors on the twodimensional weight space. In order to generate uniformly distributed weight vectors for multi-objective optimization problems with three or more objectives, we propose a weight specification method on an n-dimensional grid world. Let us consider weight vectors satisfying the following conditions. w2

11 1.0

10 9 8 7 6

5 4 3 2

0

1.0

1 w1

Fig. 3. Location of each cell in the two-dimensional weight space

These conditions show that weight vectors are generated by combining n nonnegative integers with the sum of d. In our cellular algorithm, a cell is located on every weight vector satisfying the above conditions. Thus the number of cells (i.e., the population size) is equal to the total number of weight vectors satisfying the above conditions. This means that the population size is determined by d. For example, when we specify d as d = 10 in (8) for the case of two-objective problems, we will have eleven weight vectors (10, 0), (9, 1), ..., (0, 10). Each of these weight vectors has the same direction as the corresponding weight vector in Fig. 3.

88


w2 (0, 4, 0) (1, 3, 0) (0, 3, 1) (2, 2, 0)

(1, 2, 1) (0, 2, 2)

(3, 1, 0) (1, 1, 2) (0, 1, 3)

(4, 0, 0)

(2, 1, 1)

0

w1 (3, 0, 1) (2, 0, 2)

w3

(0, 0, 4)

(1, 0, 3)

Fig. 4. Location of each cell in the three-dimensional weight space by the proposed method

w1 + w2 + L + wn = d ,

(8)

wi ∈ {0,1, 2, ..., d } .

(9)

This weight specification method is easily extended to the case with three or more objectives. For example, Fig. 4 shows an example of the three-objective case where d is specified as d = 4 . From Fig. 4, we can observe that the value of d can be considered as the number of partitions of the edge between two extreme points (e.g., (0,4,0) and (4,0,0)). By this weight specification method, we can uniformly distribute cells on the n-dimensional space. We can calculate the number of cells generated for n-objective problems as follows:

N 2 (d ) = d + 1 ≈ O(d ) ,

(10)

N 3 (d ) = ∑id= 0 N 2 (i ) = ∑id= 0 (i + 1) = (i + 1)(i + 2) / 2 ≈ O (d 2 ) , N 4 (d ) = ∑id=0 N 3 (i ) = ∑id=0 (i + 1)(i + 2) / 2 ≈ O (d 3 ) ,

(11)

M

M

(12)

M

N n (d ) = ∑id=0 N n −1 (i ) ≈ O (d n −1 ) ,

(13)

where N j (d ) , j = 2, ..., n are the number of generated cells for j-objective problems. We can see from the above equations that the number of cells can be calculated recursively. We also see that the order of the number of cells is d n −1 for nobjective problems. Since the number of cells is determined from the value of d, the population size of our cellular algorithm can be specified by d. In other words, we should specify the value of d according to an appropriate population size.


4.2

89

Definition of Neighborhood

We can arbitrary define a neighborhood structure among cells. That is, we can utilize any distance between cells in the n-dimensional space in which cells are structured. For example, the Euclid distance can be used for measuring the distance between cells. In this paper, we use the Manhattan distance. That is, we define the distance between a cell with the weight vector w = ( w1, w2 , ..., wn ) and another cell with

v = (v1, v2 , ..., vn ) as follows: n

Distance(w, v) = ∑ | wi − vi | .

(14)

i =1

We define the neighborhood of the weight vector w as

N (w ) = {v | Distance(w, v) ≤ D} .

(15)

For example, when D = 2 in Fig. 5, the cell with the weight vector (2,1,1) has six neighboring cells (i.e., shaded cells, (1,2,1), (1,1,2), (2,0,2), (3,0,1), (3,1,0), and (2,2,0) in Fig. 4) and that cell itself in its neighborhood. As shown in this example, the neighborhood of each cell is defined by its nearby cells within the distance D including that cell itself. 4.3

Selection

Two parents for generating a new individual in a cell are selected from its neighborhood. When D = 2 in Fig. 5, the parent solutions for the cell on (2,1,1) can be selected from that cell and its six neighbors. It is noted that the fitness value of each neighbor is recalculated based on the weight vector assigned to the cell for which a new individual is generated. That is, each individual is differently evaluated by this recalculation procedure of the fitness function in the selection for each cell. This corresponds to the selection procedure of our original MOGA where the selection of each pair of parents was governed by a different weight vector (see Step 2 in Subsection 3.3). It is noted that the modification of the normalization condition from (5) to (8) has no effect on the selection procedure (Step 2 (a) in Subsection 3.3). Let w′ , which satisfies the normalization condition (8), be a weight vector generated by the proposed weight specification method. A weight vector w = ( w1, w2 ,..., wn ) satisfying the normalization condition (5) can be easily obtained from the relation w′ = d ⋅ w = (dw1, dw2 ,..., dwn ) . Let us denote our scalar fitness function with the weight vectors w and w′ by f (x, w ) and f (x, w′) , respectively, for a solution x in the current population. Since our scalar fitness function in linear with respect to weight values, we have f (x, w′) = d ⋅ f (x, w ) and f min (Ψ , w′) = d ⋅ f min (Ψ , w ) in the selection procedure defined by (7). Thus the same selection probability is obtained from w and w′ for each solution x in the current population Ψ . This means that the modification of the normalization condition from (5) to (8) has no effect on the selection procedure.

90

4.4


Other Genetic Opearations

In the previous Subsections 4.1 to 4.3, we show the characteristic features in our CMOGA. As for other genetic operations such as crossover, mutation, and elite preserve strategy, we can employ the same operations which can be used in the MOGA. That is, the same crossover and mutation operations can be employed for the C-MOGA. As shown in Fig. 2, some solutions are selected from the tentative set of nondominated solutions, and add them as elite solutions to the current population randomly.

5 Computer Simulations 5.1

Test Problems

We applied the C-MOGA with the proposed weight specification method to flowshop scheduling problems. Flowshop scheduling is one of the most well-known scheduling problems. Since Johnson’s work [21], various scheduling criteria have been considered. Among them are makespan, maximum tardiness, total tardiness, and total flowtime. Several researchers extended single-objective flowshop scheduling problems to multi-objective problems (see, for example, Daniels & Chambers [22]). In this paper, we use the makespan and the total tardiness as two scheduling criteria in our two-objective flowshop scheduling problems. The makespan is the maximum completion time of all jobs to be processed. The total tardiness is the total overdue of all jobs. We also employ the total flowtime together with these two criteria in our three-objective flowshop scheduling problems. The total flowtime is the total completion time of all jobs. Let g1 (x) , g 2 (x) , and g3 (x) be the makespan, the total tardiness, and the total flowtime, respectively. Since these scheduling criteria are to be minimized, we specify the three objectives f1 (x) , f 2 (x) and f3 (x) of our flowshop scheduling as f1 (x) = − g1 (x) , f 2 (x) = − g 2 (x) and f3 (x) = − g3 (x) . Since flowshop scheduling is to find a job permutation that optimizes the given objectives, a sequence of jobs is handled as an individual (i.e., as a string) in our algorithm. As test problems, we generated ten 20-job and 10-machine flowshop scheduling problems with two and three objectives. The processing time of each job on each machine was specified as a random integer in the interval [1, 99], and the duedate of each job was defined randomly. Our task is to find a set of Pareto-optimal solutions of each test problem. 5.2

Quality Measures of Solution Sets

Since multi-objective algorithms find a set of nondominated solutions with respect to multiple objectives (not a single final solution with respect to a single objective), the comparison between different multi-objective algorithms is not easy. For this purpose, we use the following measures for evaluating the quality of a solution set obtained by each algorithm.


91

1) The number of obtained nondominated solutions The number of nondominated solutions obtained by each algorithm is a measure to evaluate the variety of the solution set. 2) The number of solutions that are not dominated by other solution sets For comparing different solution sets with one another, we examine whether each solution is dominated by any other solutions in other sets. If a solution is dominated by another solution, we remove that solution. In this manner, we remove solutions dominated by other solution sets. The number of remaining solutions in each solution set is a measure for evaluating its relative quality with respect to the other solution sets. 3) Set quality measure proposed by Esbensen Esbensen [23] proposed an evaluation method of the quality of a solution set. Let us denote a solution set by Ω . The best solution x * for a given weight vector w = ( w1, w2 ,..., wn ) can be chosen from Ω for the n-objective optimization problem as follows:

f (x*) = w1 f1(x*) + w2 f 2 (x*) + L + wn f n (x*) = max{w1 f1(x) + w2 f 2 (x) + L + wn f n (x) | x ∈ Ω} .

(16)

Esbensen [23] proposed an idea of measuring the quality of the solution set Ω by calculating the expected value of f (x*) over possible weight vectors. In this paper, we calculate the expected value of f (x*) by randomly generating 10,000 weight vectors by (6). That is, the quality of the solution set Ω is calculated as follows:

q (Ω) =

1 10000 ∑ max{w1i f1(x) + w2i f 2 (x) + L + wni f n (x) | x ∈ Ω} , 10000 i =1

(17)

where q (Ω) is the quality of the solution set Ω and w i = ( w1i , w2i , ..., wni ) , i = 1, 2,K , 10000 are randomly specified weight vectors. 5.3

Simulation Results on Two-Objective Flowshop Scheduling Problems

In our computer simulations, we applied three algorithms (i.e., the MOGA with random weights, the MOGA with weights generated by the proposed method, and the C-MOGA) to test problems in order to show the effectiveness of the weight specification method and compare the search ability of the C-MOGA with that of the MOGAs. We employed the following parameter specifications: Crossover: Two-point order crossover (crossover rate: 0.8), Mutation: Shift mutation (mutation rate: 0.3), Number of elite solutions: N elite = 3 , Neighborhood structure for the local search: Shift, Stopping condition: Examination of 50,000 solutions.

92


We used the above stopping condition in order to compare the three algorithms under the same computation load. In a single trial of each algorithm, 50,000 solutions were examined. The parameter d, which determines the population size, was specified as d = 100 for two-objective problems. This means that the population size was 101 (see the equation (10)). The weight vectors of 101 cells were ( w1, w2 ) = (100, 0), (99, 1), ..., (0, 100). For the C-MOGA, we specified the value of D as D = 20 . Therefore parent solutions for each cell are selected from neighboring cells within the Manhattan distance 20. We examined the effect of the introduction of the weight specification method and the cellular structure (i.e., the locally restricted genetic operations) in this experiment. We obtained a set of nondominated solutions by each algorithm. In Table 1, we summarize the average results over 100 trials for each algorithm (i.e. 10 trials for each of 10 test problems). In this table, “A” is the number of nondominated solutions obtained by each algorithm, and “B” is the number of solutions that are not dominated by other solutions obtained by the other algorithm. The ratio of these two numbers is shown in the column of B/A. “Quality” is the set quality measure of Esbensen, and “SD of Q” shows the standard deviation of the value of Quality. In the calculation of “SD of Q”, we averaged the standard deviation for each of ten test problems. From Table 1, we can see that most solutions obtained by the MOGA with random weights are dominated by solutions obtained by the MOGA with the proposed method or the C-MOGA. Thus we can conclude that the weight specification method proposed in this paper is effective in the MOGA and the C-MOGA. We can also observe that the average and the standard deviation of the Quality value for the CMOGA are better than those for the MOGAs. Next, we examined the specification of the parameter D in the C-MOGA. Table 2 shows the average results over 100 trials for each specification of the neighborhood structure (i.e., each specification of D) in the C-MOGA. In this table, the C-MOGA with D = 200 is the MOGA with the proposed weight specification method. When D = 200 , all solutions in the current population are considered as neighbors of every cell in the selection procedure. From Table 2, we can observe that the restriction of the genetic operations within some neighboring cells is effective for improving the ability to find good sets of nondominated solutions. Table 1. Comparison of MOGA with C-MOGA (Two-Objective) A B B/A Quality MOGA (random) 14.6 2.8 0.200 -1063.4 MOGA (proposed) 17.1 10.8 0.648 -967.4 C-MOGA ( D = 20 ) 17.5 9.3 0.536 -963.6

SD of Q 48.4 15.2 10.6

A: The number of nondominated solutions of the method. B: The number of nondominated solutions that are not dominated by those obtained by the other method. Quality: Set quality measure of Esbensen. SD of Q: Standard deviation of Quality.


93

Table 2. Effect of the choice of D in C-MOGA (Two-Objective) 4

D

10

20

Quality

-976.4

-968.6

-963.6

SD of Q

17.9

14.3

10.6

50

200

-966.0

-967.4

12.9

15.2

Table 3. Comparison of MOGA with C-MOGA (Three-Objective) A B B/A MOGA 44.8 8.4 0.190 C-MOGA 61.2 63.8 0.966

Quality SD of Q -8004.7 65.54 -7850.9 42.13

Table 4. Effect of the choice of d in C-MOGA (Three-Objective) D

10

11

12

13

14

Poplation Size

66

78

81

105

120

# of Generations

758

642

618

477

417

Quality

5.4

-7871.0 -7866.7 -7852.9 -7850.9 -7864.7

Simulation Results on Three-Objective Flowshop Scheduling Problems

We also applied the C-MOGA and the MOGA with random weights to threeobjective test problems. We used the same parameter specifications as in the previous subsection except for the population size. Since we defined d = 13 for the C-MOGA, the population size was 105 from the equation (11). In order to compare the two algorithms under the same computation load, we specified the population size in the MOGA as 105. Simulation results are summarized in Table 3 and Table 4. From Table 3, we can see that the performance of the C-MOGA is better than that of the MOGA. Table 4 shows the effect of the choice of a value of d on the performance of the C-MOGA. The second row shows the population size calculated from the value of d. It is noted that each algorithm with a different value of d was terminated when the number of examined solutions exceeded the termination condition. The number of generations is shown in the third row of Table 4 for each specification of d. From Table 4, we can see that the best quality value was obtained by the C-MOGA with d = 13 .

94


6 Conclusion In this paper, we proposed a weight specification method for the cellular multiobjective genetic algorithm (C-MOGA), which is an extension of a multi-objective genetic algorithm (MOGA) in our former study (Murata & Ishibuchi [6]). In the proposed C-MOGA, each individual is located in a cell with a different weight vector. This weight vector governs the selection operation. The selection is performed in the neighborhood of each cell. The effectiveness of the C-MOGA with the proposed weight specification method was demonstrated by computer simulations on two- and three-objective flowshop scheduling problems.

References 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14.

Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, MA: Addison-Wesley (1989). Schaffer, J.D.: Multi-objective optimization with vector evaluated genetic algorithms. Proc. of 1st Int’l Conf. on Genetic Algorithms (1985) 93-100. Kursawe, F.: A variant of evolution strategies for vector optimization. In H.-P.Schwefel and R.Männer (Eds.), Parallel Problem Solving from Nature, Springer-Verlag, Berlin (1991) 193-197. Horn, J., Nafpliotis, N. and Goldberg, D.E.: A niched Pareto genetic algorithm for multiobjective optimization. Proc. of 1st IEEE Int’l Conf. on Evolutionary Computation (1994) 82-87. Fonseca, C. M. and Fleming, P. J.: An overview of evolutionary algorithms in multiobjective optimization, Evolutionary Computation 3 (1995) 1-16. Murata, T. and Ishibuchi, H.: Multi-objective genetic algorithm and its applications to flowshop scheduling. International Journal of Computers and Engineering 30, 4 (1996) 957-968. Zitzler, E. and Thiele, L.: Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto Approach. IEEE Trans. on Evolutionary Computation 3 (1999) 257-271. Ishibuchi, H. and Murata, T.: A multi-objective genetic local search algorithms and its application to flowshop scheduling. IEEE Trans. on System, Man, and Cybernetics, Part C 28 (1998) 392-403. Murata, T. and Gen, M.: Cellular genetic algorithm for multi-objective optimization. Proc. of 4th Asian Fuzzy System Symposium (2000) 538-542. Murata, T., Ishibuchi, H., and Gen, M.: Cellular genetic local search for multi-objective optimization. Proc. of the Genetic and Evolutionary Computation Conference 2000 (2000) 307-314. Whitley, D.: Cellular Genetic Algorithms. Proc. of 5th Int’l Conf. on Genetic Algorithms (1993) 658. Manderick, B. and Spiessens, P.: Fine-grained parallel genetic algorithms. Proc. of 3rd Int’l Conf. on Genetic Algorithms (1989) 428-433. Wilson, D. S.: Structured demes and the evolution of group-advantageous traits. The American Naturalist 111 (1977) 157-185. Dugatkin, L. A. and Mesterton-Gibbons, M.: Cooperation among unrelated individuals: Reciprocal altruism, by-product mutualism and group selection in fishes. BioSystems 37 (1996) 19-30.


95

15. Nowak, M. A. and May, M.: Evolutionary games and spatial chaos. Nature 359 (1992) 826-859. 16. Wilson, D. S., Pollock, G. B., and Dugatkin, L. A.: Can altruism evolve in purely viscous populations? Evolutionary Ecology 6 (1992) 331-341. 17. Oliphant, M.: Evolving cooperation in the non-iterated Prisoner’s Dilemma: The importance of spatial organization. in R. A. Brooks and P. Maes (Eds.), Artificial Life IV, MIT Press, Cambridge (1994) 349-352. 18. Grim, P.: Spatialization and greater generosity in the stochastic Prisoner’s Dilemma. BioSystems 37 (1996) 3-17. 19. Ishibuchi, H., Nakari, T., and Nakashima T.: Evolution of Strategies in Spatial IPD Games with Structured Demes, Proc. of the Genetic and Evolutionary Computation Conference 2000 (2000). 20. Knowles, J.D., and Corne, D.W.: Approximating the nondominated front using the Pareto Archived Evolution Strategy, Evolutionary Computation (MIT Press), 8, 2 (2000) 149172. 21. Johnson, S.M.: Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1 (1954) 61-68. 22. Daniels, R.L. and Chambers, R.J.: Multiobjective flow-shop scheduling. Naval Research Logistics 37 (1990) 981-995. 23. Esbensen, H.: Defining solution set quality. Memorandum (No.UCB/ERL M96/1, Electric Research Laboratory, College of Engineering, Univ. of California, Berkeley, USA, Jan., 1996).

Adapting Weighted Aggregation for Multiobjective Evolution Strategies Yaochu Jin, Tatsuya Okabe, and Bernhard Sendhoff Future Technology Research Honda R&D Europe (D) GmbH 63073 Offenbach/Main, Germany [email protected]

Abstract. The conventional weighted aggregation method is extended to realize multi-objective optimization. The basic idea is that systematically changing the weights during evolution will lead the population to the Pareto front. Two possible methods are investigated. One method is to assign a uniformly distributed random weight to each individual in the population in each generation. The other method is to change the weight periodically with the process of the evolution. We found in both cases that the population is able to approach the Pareto front, although it will not keep all the found Pareto solutions in the population. Therefore, an archive of non-dominated solutions is maintained. Case studies are carried out on some of the test functions used in [1] and [2]. Simulation results show that the proposed approaches are simple and effective.

1

Introduction

A large number of evolutionary multiobjective algorithms (EMOA) have been proposed [3,4]. So far, there are three main approaches to evolutionary multiobjective optimization, namely, aggregation approaches, population-based nonPareto approaches and Pareto-based approaches [4]. In the recent years, the Pareto-based approaches have gained increasing attention in the evolutionary computation community and several successful algorithms have been proposed [5]. Despite their weaknesses, the aggregation approaches are very easy to implement and computationally efficient. Usually, aggregation approaches can provide only one Pareto solution if the weights are fixed using problem-specific prior knowledge. However, it is also possible to find more than one Pareto solution using this method by changing the weights during optimization. In [6], the weights of the different objectives are encoded in the chromosome to obtain more than one Pareto solution. Phenotypic fitness sharing is used to keep the diversity of the weight combinations and mating restrictions are required so that the algorithm can work properly. Most of the EMOAs are based on Genetic Algorithms and relatively little attention has been paid to evolution strategies. Some exceptions are [2,7,8,9]. In [7], average ranking is used to dictate the deletion of a fraction of the population. E. Zitzler et al. (Eds.): EMO 2001, LNCS 1993, pp. 96–110, 2001. c Springer-Verlag Berlin Heidelberg 2001

Adapting Weighted Aggregation for Multiobjective Evolution Strategies

97

A predator-prey-model is proposed in [9]. A selection method that is similar to the VEGA approach [10] is adopted in [8]. An algorithm called Pareto Archived Evolution Strategy (PAES) is suggested in [2], in which a non-Pareto approach together with an archive of the found Pareto solutions are used. This paper investigates two methods using the aggregation-based approach. To approximate the Pareto front instead of a certain Pareto solution, the weight for each objective should be changed systematically. One method is to distribute the weights uniformly among the individuals in the population. The other method is to periodically change the weights with the process of the evolution. Although these methods seem to be very simple, we will show that they work effectively for two objective optimization problems. Simulations are carried out on different test functions studied in [1,2]. Different evolution strategies, including the standard evolution strategy [11], the Evolution Strategy with Rotation Matrix Adaptation [11] and the Evolution Strategy with Covariance Matrix Adaptation [12,13] are employed. What is quite surprising from our simulation results is that our algorithms work well even for problems with a concave Pareto front (see Section 4 for details), which is usually thought to be not obtainable by aggregation based methods [4]. Our preliminary explanation is that if the search algorithm goes through the concave region of the Pareto front (which is locally near-optimal when the objectives are aggregated into one single objective function) and if the near optimal solutions are archived, then the Pareto solutions within the concave region can also be found using the aggregation method. Further results on this issue will be reported elsewhere.

2 2.1

The Aggregation Based Multiobjective Algorithms The Evolution Strategies

In the standard Evolution Strategy (ES), the mutation of the objective parameters is carried out by adding an N (0, σi2 ) distributed random number. The step sizes σi are also encoded in the genotype and subject to mutations. A standard Evolution Strategy can be described as follows: ˜ x(t) = x(t − 1) + z σi (t) = σi (t − 1)exp(τ 0 z)exp(τ zi ); i = 1, ..., n

(1) (2)

˜ is an nwhere x is an n-dimensional parameter vector to be optimized, z ˜ ∼ N (0, σ(t)2 ), z and zi are normally dimensional random number vector with z distributed random numbers with z, zi ∼ N (0, 1). Parameters τ , τ 0 and σi are the strategy parameters, where σi is mutated as in equation(2) and τ , τ 0 are constants as follows: q √ −1 √ −1 τ= 2 n ; τ0 = 2n (3)

98

Y. Jin, T. Okabe, and B. Sendhoff

There are several extensions to the above standard ES. In our simulations, an ES with Rotation Matrix Adaptation and an ES with Covariance Matrix Adaptation as well as the standard ES are used to investigate the effectiveness of the proposed multiobjective algorithms using different search strategies. For the detailed description of the evolution strategies, please refer to [11,12] respectively. Two main different selection schemes are used in evolution strategies. Suppose there are µ and λ individuals in the parent and offspring population, usually µ ≤ λ. One method is to select the µ parent individuals only from the λ offspring, which is usually noted as (µ,λ)-ES. If the µ parent individuals are selected from a combination of the µ parent individuals and the λ offspring individuals, the algorithm is noted as (µ + λ)-ES. In our study, the (µ, λ)-ES is adopted. 2.2

Random Distribution of Weights within a Population

For the sake of clarity, we consider the two objective problems in the current discussion; the extension to problems with more than two objectives is straightforward. For a conventional aggregation method, the fitness function is the weighted sum of the two different objectives f1 and f2 : F itness = w1 f1 + w2 f2 ,

(4)

where w1 and w2 are two constants determined using a prior knowledge about the problem. It is clear that by using a pair of fixed weights, only one Pareto solution can be obtained. Imagine that we run the algorithm so many times that every weight combination has been used. In this way, we can obtain all Pareto solutions that the Pareto front consists of. Notice, that it has been argued that the Pareto solutions locating in the concave region of the Pareto front cannot be obtained by aggregation methods. However, in the experiments in Section 4, we found that our algorithms are successful in obtaining a very complete concave Pareto front for low dimensional problems (e.g. n = 2), and a quite complete concave Pareto front with a dimension as high as 10. Of course, it is unpractical, if not impossible to run the evolutionary algorithm so many times to exhaust all the weight combinations. Since we are using evolutionary optimization, it is natural to take advantage of the population for this purpose. If the different weight combinations can be distributed among the individuals, the population may be able to approach the Pareto front during the process of evolution. Suppose we use the (µ, λ)-ES, then the weight combinations can be distributed uniformly among the λ individuals in the offspring population. Let w1i (t) = random(λ)/λ, w2i (t) = 1.0 − w1i (t),

(5) (6)

where i = 1, 2, ..., λ and t is the index for generation number. The function random(λ) generates a uniformly distributed random number between 0 and λ.

Adapting Weighted Aggregation for Multiobjective Evolution Strategies Evolutionary Optimization

11 00 00 11 00 11 00 11 00 11 00 11 00 11

Uniform Random Weight Generator 1111111 0000000 0 1 0000000000 1111111111 0000000 1111111 0 1 0000000000 1111111111 t 0000000 1111111 0 0000000000 1111111111 wt w1 wt 0000000 1111111 0 0000000000 1 n 000000021 1111111 0 1111111111 1 0000000000 1111111111 0000000 1111111 0 1 0000000000 1111111111 0000000 1 1111111 0 0000000000 1111111111 0 1 Generation t

Individual 1

Individual 2

11 00 11 00 1 0 11 00 11 00 0 1

Individual n

Uniform Random

Generation t+1

99

Weight Generator 0000000 1 1111111 0 0000000000 1111111 0000000 0 1111111111 1 0000000000 1111111111 0000000 1111111 t +1 0 1 0000000000 1111111111 w w t +1 0000000w t +1 1111111 0 0000000000 0000000 1111111 1 21 n 0 1111111111 1 0000000000 1111111111 0000000 1111111 0 1 0000000000 0000000 1 1111111 0 1111111111 0000000000 1111111111 0000000 1111111 0 1 Individual n Individual 1 Individual 2 11 00 00 11 00 11 00 11 00 11 00 11 00 11

1 0 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 00 11 00 11 0 1 0 1 00 11 00 11 0 1 0 1 00 11 00 11

Fig. 1. Determination of the weights: Random distribution.

In this way, we can get a uniformly distributed random weight combination (w1i , w2i ) among the individuals, where 0 ≤ w1i , w2i ≤ 1 and w1i + w2i = 1, refer also to Fig.1, in which U (0, 1) denotes a uniform distribution. Notice that the weight combinations are regenerated in every generation. 2.3

Generation-Based Periodical Variation of the Weights

The idea of a uniformly distributed weight combination can straightforwardly be extended to a generation based approach. However, if we still use a random weight combination, convergence of the evolutionary algorithm will be in question. Therefore, instead of using a randomly distributed weight combination, we use a weight combination that is changed gradually and periodically with the process of the evolution. In this work, this is realized as follows: w1 (t) = |sin(2πt)/F |, w2 (t) = 1.0 − w1 (t),

(7) (8)

where t is the number of generation and | · | gives the absolute value. We can see from equation (7) that w1 (t) changes from 0 to 1 periodically. The change frequency can be adjusted by F . In our study, we set F = 400, which means that in every 400 generations, w1 will change from 0 to 1 and then from 1 to 0 four times. Fig.2 shows an example of how the weights change during evolution within 200 generations. We found that the results of the algorithm are not very sensitive to F , although it seems reasonable to let the weight change from 0 to 1 twice. Notice in this case, all the individuals have the same weight combination in the same generation.

100

Y. Jin, T. Okabe, and B. Sendhoff 1.2

1 w1 w2

weight

0.8

0.6

0.4

0.2

0

0

20

40

60

80

100 generation

120

140

160

180

200

Fig. 2. Determination of weights: Generation-based periodical variation, all individuals have the same weight combination within a generation.

2.4

An Archive of Pareto Solutions

In our algorithm, the population is not able to keep all the found Pareto solutions, although it is able to approach the Pareto front dynamically. Therefore, it is necessary to record the Pareto solutions that have been found so far. The idea of building a Pareto archive is inspired from [2], although we use quite a different method to aggregate and maintain the archive. The pseudo-code for building the archive is listed in Algorithm 1. The similarity is measured by the Euclidean distance in the fitness space. It should be noticed that it is possible for one solution in the archive is dominated by another.

3

Test Functions

To evaluate the effectiveness of the proposed algorithms, simulations are carried out on four test functions used in [1,2]. – The first test function (F1 ) used here is the second function in [2] and we extend it to an n-dimensional function: n 1X 2 f1 = x (9) n i=1 i n

f2 =

1X (xi − 2.0)2 n i=1

(10)

– The second test function (F2 ) is the first function in [1], which has a convex Pareto front: f1 = x1

(11) n X

9 xi n − 1 i=2 p f2 = g × (1.0 − f1 /g)

g(x2 , ..., xn ) = 1.0 +

where xi ∈ [0, 1].

(12) (13)

Adapting Weighted Aggregation for Multiobjective Evolution Strategies

101

for each individual o in offspring population do if (o dominates an individual in parent population p) and (o is not dominated by any solutions in the archive) and (o is not similar to any solutions in the archive) then if archive is not full then add o to the archive else if o dominates any solution a in the archive then replace a with o else if any solution a1 in the archive dominates another solution a2 then replace a2 with o else discard o end if else discard o end if end for for each solution in the archive do if solution a1 dominates a2 then remove a2 end if end for Algorithm 1: Pseudo-code for maintaining an archive of Pareto solutions.

– The third test function (F3 ) is the second function in [1], which has a concave Pareto front: f1 = x1

(14)

g(x2 , ..., xn ) = 1.0 +

9 n−1

n X

xi

(15)

i=2

f2 = g × (1.0 − (f1 /g)2 )

(16)

where xi ∈ [0, 1]. – The fourth test function (F4 ) is the third function in [1], whose Pareto front consists of a number of separated convex parts: f1 = x1

(17) n X

9 xi n − 1 i=2 p f2 = g × (1.0 − f1 /g − (f1 /g)sin(10πf1 ))

g(x2 , ..., xn ) = 1.0 +

where xi ∈ [0, 1].

(18) (19)

102

4


Case Studies

The goal of the simulations is to verify the effectiveness of the proposed algorithms using three different evolution strategies. The first part of the simulation is to demonstrate that both the random distribution of the weights among the population (hereafter noted as Method 1) and the generation based periodical variation of the weights (hereafter called Method 2) proposed in Section 2 are able to approximate the Pareto front for different low-dimensional problems, even for a concave Pareto front, which is usually considered to be impossible by aggregation methods. Please refer to our comments in Section 1. The second part of the simulation is intended to compare the effectiveness of Method 1 and Method 2 for high-dimensional problems. It is found that Method 2 is more effective for finding a complete Pareto front. Finally, we also show that different ES algorithms have different performance for multiobjective optimization with the same fitness assignment method. From these comparative studies, we conclude that the ES with Rotation Matrix Adaptation using Method 2 gives consistently satisfying results on different kinds of problems. In all the simulations, a (15, 100)-ES is used and the maximal number of generation is 500. 4.1

Comparison of Both Methods for Low Dimensional Problems

In this part, we use the standard ES for all the four test functions with dimension n = 2. In the figures hereafter, the stars(’∗’) denote the archived solutions and the plus signs (’+’) denote the individuals in the offspring population. Figures 3(a) and (b) show the archived solutions and the offspring in the 10th and 500th generation, respectively, using Method 1 for F1 . It is clearly seen that the population has successfully approximated the Pareto front. Figures 4, 5 and 6 show the corresponding results for F2 , F3 and F4 using Method 1. From the figures, 4.5

4.5

4

4

3.5

3.5

f

f2

3

2.5

2

3

2.5

2

2

1.5

1.5

1

1

0.5

0.5

0

0

(a)

0.5

1

1.5

2

f1

2.5

3

3.5

4

0

4.5

0

0.5

1

1.5

2

f1

2.5

3

3.5

4

4.5

(b)

Fig. 3. Method 1 for F1 (n=2) using the standard ES: (a) generation 10, (b) generation 500.

Adapting Weighted Aggregation for Multiobjective Evolution Strategies 4

4

3.5

3.5

3

2.5

2

f2

f2

3

2.5

1.5

2

1.5

1

1

0.5

0.5

0

103

0

0.1

0.2

0.3

0.4

0.5 f1

0.6

0.7

0.8

0.9

0

1

(a)

0

0.1

0.2

0.3

0.4

0.5 f1

0.6

0.7

0.8

0.9

1

(b)

Fig. 4. Method 1 for F2 (n=2) using the standard ES: (a) generation 10, (b) generation 500. 4

3.5

3

3

2.5

2.5

2

f2

f2

4

3.5

1.5

2

1.5

1

1

0.5

0.5

0

0

(a)

0.1

0.2

0.3

0.4

0.5 f1

0.6

0.7

0.8

0.9

0

1

0

0.1

0.2

0.3

0.4

0.5 f1

0.6

0.7

0.8

0.9

1

(b)


we find that Method 1 is working effectively for all different test functions, which shows that the idea of using a uniformly random weight distribution among the individuals of the population is for multi-objective optimization feasible. Next, we run simulations on all four test functions with n = 2 using Method 2. The results are shown in Figures 7, 8, 9 and 10. From these figures, it is demonstrated that Method 2 has been successful in obtaining a very complete Pareto front for all the four test functions. The difference between Method 1 and Method 2 is that the individuals in the population in Method 2 converged more completely to the Pareto front than the individuals in Method 1 at the end of the evolution. The most interesting fact is that both methods have obtained very complete Pareto solutions for F3 , which has a concave Pareto front. Our empirical results show that in principle, concave Pareto solutions can be obtained by aggregation methods if the search algorithm is able to go through the concave region and if an archive is used to store the found Pareto solutions.


4

4

3.5

3.5

3

3

2.5

2.5 2 1.5

2

2 1.5

f

f

2

104

1

1

0.5

0.5

0

0

−0.5

−0.5

−1

0

0.1

0.2

0.3

0.4

0.5 f1

0.6

0.7

0.8

0.9

−1

1

(a)

0

0.1

0.2

0.3

0.4

0.5 f1

0.6

0.7

0.8

0.9

1

(b)

Fig. 6. Method 1 for F4 (n=2) using the standard ES: (a) generation 10, (b) generation 500. 4.5

4.5

4

4

3.5

3.5

3

2.5

f

2

f2

3

2.5

2

2

1.5

1.5

1

1

0.5

0.5

0

0

(a)

0.5

1

1.5

2

f1

2.5

3

3.5

4

0

4.5

0

0.5

1

1.5

2

f

2.5

3

3.5

4

4.5

1

(b)


4.2

Comparison of Both Methods for High Dimensional Problems

The performance of Method 1 and Method 2 is compared in this part of the simulations. The purpose of the simulations is to investigate the efficiency of Method 1 and Method 2 for more complex problems. In the results presented in the following, the standard ES is used for the four test functions with a dimension of 10 and 500 generations are run. Figures 11 and 12 give the results using Method 1. It can be seen that the performance of Method 1 on 10-dimensional problems becomes worse compared to those obtained in the two dimensional problems. In contrast, Method 2 is still able to provide very good results on the same problems, as shown in Figures 13 and 14. Notice that Method 1 shows particularly bad performance on test functions F3 and F4 , which have a concave or discontinuous Pareto front. However, Method 2 shows quite good performance on all the four test functions. 4.3

Comparison of Different Evolution Strategies for Method 2

This part of the simulation aims at comparing the performance of different ES algorithms for more difficult problems (with higher dimension in this context).


4

3.5

3.5

3

2.5

2

f2

f2

3

2.5

1.5

2

1.5

1

1

0.5

0.5

0

105

0

0.1

0.2

0.3

0.4

0.5 f1

0.6

0.7

0.8

0.9

0

1

(a)

0

0.1

0.2

0.3

0.4

0.5 f1

0.6

0.7

0.8

0.9

1

(b)

Fig. 8. Method 2 for F2 (n=2) using the standard ES: (a) generation 10, (b) generation 500. 4

4

3.5

3.5

3

2.5

2

f2

f2

3

2.5

1.5

2

1.5

1

1

0.5

0.5

0

0

(a)

0.1

0.2

0.3

0.4

0.5 f1

0.6

0.7

0.8

0.9

0

1

0

0.1

0.2

0.3

0.4

0.5 f1

0.6

0.7

0.8

0.9

1

(b)


Since Method 2 exhibits much better performance in the above part of experiments, only Method 2 will be used in the following simulations. The algorithms considered in this work are the standard ES, the ES with Rotation Matrix Adaptation and the ES with Covariance Matrix Adaptation. The problems studied in this part of the simulation are the four test functions with n = 30. Results using the standard ES on the four functions are shown in Figures 15 and 16. The results using the ES with Rotation Matrix Adaptation are given in Figures 17 and 18. Finally, the ES with Covariance Matrix Adaptation is tested and the results are presented in Figures 19 and 20. In all the simulations, 500 generations are run. As it is shown in the above figures, the standard ES together with Method 2 can always provide quite a complete Pareto front, but unfortunately, the accuracy of the solutions is not satisfactory. On the other hand, the ES with Rotation Matrix Adaptation gives consistently good results on all the four problems, which are comparable to or even better than those of the Pareto-based algorithms described in [1]. Interestingly, the ES with CMA produced very good results on F1 , but failed on F3 and F4 . This may be ascribed to the fact that the ES with CMA


4

4

3.5

3.5

3

3

2.5

2.5 2 1.5

2

2 1.5

f

f

2

106

1

1

0.5

0.5

0

0

−0.5

−0.5

−1

0

0.1

0.2

0.3

0.4

0.5 f1

0.6

0.7

0.8

0.9

−1

1

(a)

0

0.1

0.2

0.3

0.4

0.5 f1

0.6

0.7

0.8

0.9

1

(b)

Fig. 10. Method 2 for F4 (n=2) using the standard ES: (a) generation 10, (b) Generation 500. 4.5

4

4

3.5

3.5

3

3

2.5

f

2

f2

2.5

2

2

1.5 1.5

1

1

0.5

0.5

0

0

0.5

1

1.5

2

f1

2.5

(a)

3

3.5

4

0

4.5

0

0.1

0.2

0.3

0.4

0.5 f1

0.6

0.7

0.8

0.9

1

(b)

Fig. 11. Method 1 using the standard ES for (a) F1 (n=10) and (b) F2 (n=10).

is a more deterministic algorithm that converges quickly before it can explore a wider region of the search space. At the same time, as for the low dimensional problems studied in Section 4.1 of this section, the ES with RMA is able to obtain a quite complete concave Pareto front with the dimension of 30. This was surprising taking into account the fact that it is a simple, dynamic aggregation based approach.

5

Conclusion

Two aggregation based methods for multiobjective optimization are proposed in this paper. The idea is to use dynamic weights instead of fixed weights to achieve the Pareto solutions. We found that both methods work well on low-dimensional problems. However, for high-dimensional problems, the second method outperforms the first one. Furthermore, the simulation results also depend on the type of evolution strategy that is employed. On the other hand, it also depends on the performance of the evolution strategy. In our experiment, the Evolution Strategy with Rotation Matrix Adaptation gives better performance than the standard Evolution Strategy. At the same time, the Evolution Strategy with Covariance


107

4 3.5

3.5

3

3 2.5 2

2

2

f

f2

2.5

1.5 1

1.5

0.5

1 0

0.5

0

−0.5

0

0.1

0.2

0.3

0.4

0.5 f1

0.6

0.7

0.8

0.9

−1

1

(a)

0

0.1

0.2

0.3

0.4

0.5 f1

0.6

0.7

0.8

0.9

1

(b)

Fig. 12. Method 1 using the standard ES for (a) F3 (n=10) and (b) F4 (n=10). 4.5

4

4

3.5

3.5

3

3

2.5

f

2

f2

2.5

2

2

1.5 1.5

1

1

0.5

0.5

0

0

0.5

1

1.5

2

f

2.5

3

3.5

4

0

4.5

1

(a)

0

0.1

0.2

0.3

0.4

0.5 f1

0.6

0.7

0.8

0.9

1

(b) Fig. 13. Method 2 using the standard ES for (a) F1 (n=10) (b) F2 (n=10).

Matrix Adaptation provides very good results on smooth, high-dimensional problems, but its performance degrades seriously on problems with a discontinuous and non-convex Pareto-optimal front. In our approach, no changes have to be made to the conventional evolutionary algorithm except for the dynamic weights and an archive of the found Pareto solutions. Therefore, the methods can straightforwardly be applied to all existing evolutionary algorithms with only minor modifications. Another interesting phenomenon is that the proposed algorithms are able to find the Pareto solutions with a concave Pareto front. This is a very encouraging point when we are applying aggregation-based methods to multi-objective optimization. Further investigation of this issue will be part of our future work. The problems studied in this paper are all two-objective ones. Theoretically, the proposed methods can be extended to problems with more than two objectives. Expected problems are the increasing complexity and the decreasing efficiency, which, however, is also true for the Pareto-based approaches. Acknowledgments. The authors would like to thank E. K¨ orner and W. von Seelen for their support and T. Arima for his insightful comments.

108


4

4 3.5

3.5

3

3 2.5 2

2

2

f

f2

2.5

1.5 1

1.5

0.5

1 0

0.5

0

−0.5

0

0.1

0.2

0.3

0.4

0.5 f1

0.6

0.7

0.8

0.9

−1

1

(a)

0

0.1

0.2

0.3

0.4

0.5 f1

0.6

0.7

0.8

0.9

1

(b)

Fig. 14. Method 2 using the standard ES for (a) F3 (n=10) and (b) F4 (n=10). 4.5

4

4

3.5

3.5

3

3

2.5

f

2

f2

2.5

2

2

1.5 1.5

1

1

0.5

0.5

0

0

0.5

1

1.5

2

f

2.5

3

3.5

4

0

4.5

0

0.1

0.2

0.3

0.4

0.5 f

0.6

0.7

0.8

0.9

1

1

1

(a)

(b)

Fig. 15. Method 2 using the standard ES for (a) F1 (n=30) and (b) F2 (n=30). 4

4 3.5

3.5

3

3 2.5 2

2

2

f

f2

2.5

1.5 1

1.5

0.5

1 0

0.5

0

−0.5

0

0.1

0.2

0.3

0.4

(a)

0.5 f1

0.6

0.7

0.8

0.9

−1

1

0

0.1

0.2

0.3

0.4

0.5 f

0.6

0.7

0.8

0.9

1

1

(b)

Fig. 16. Method 2 using the standard ES for (a) F3 (n=30) and (b) F4 (n=30).

References 1. E. Zitzler, K. Deb, and L. Thiele. Comparison of multiobjective evolution algorithms: empirical results. Evolutionary Computation, 8(2):173–195, 2000. 2. J. D. Knowles and D. W. Corne. Approximating the nondominated front using the Pareto archived evolution strategies. Evolutionary Computation, 8(2):149–172, 2000.

Adapting Weighted Aggregation for Multiobjective Evolution Strategies 4.5

4

4

3.5

3.5

109

3

3

2.5

f

2

f2

2.5

2

2

1.5 1.5

1

1

0.5

0.5

0

0

0.5

1

1.5

2

f

2.5

3

3.5

4

0

4.5

0

0.1

0.2

0.3

0.4

1

(a)

0.5 f1

0.6

0.7

0.8

0.9

1

(b)

Fig. 17. Method 2 using the ES with RMA for (a) F1 (n=30) and (b) F2 (n=30). 4

4 3.5

3.5

3

3 2.5 2

2

2

f

f2

2.5

1.5 1

1.5

0.5

1 0

0.5

0

−0.5

0

0.1

0.2

0.3

0.4

0.5 f1

0.6

0.7

0.8

0.9

−1

1

0

0.1

0.2

0.3

0.4

0.5 f

0.6

0.7

0.8

0.9

1

1

(a)

(b)

Fig. 18. Method 2 using the ES with RMA for (a) F3 (n=30) and (b) F4 (n=30). 4.5

4

4

3.5

3.5

3

3

2.5

f

2

f2

2.5

2

2

1.5 1.5

1

1

0.5

0.5

0

0

0.5

1

1.5

2

f

2.5

3

3.5

4

0

4.5

1

(a)

0

0.1

0.2

0.3

0.4

0.5 f1

0.6

0.7

0.8

0.9

1

(b)

Fig. 19. Method 2 using the ES with CMA for (a) F1 (n=30) and (b) F2 (n=30).

3. C.A.C. Coello. A comprehensive survey of evolutionary-based multiobjective optimization techniques. Knowledge and Information Systems, 1(3):269–308, 1999. 4. C. M. Fonseca and P. J. Fleming. Multiobjective optimization. In Th. B¨ ack, D. B. Fogel, and Z. Michalewicz, editors, Evolutionary Computation, volume 2, pages 25–37. Institute of Physics Publishing, Bristol, 2000. 5. D. A. Van Veldhuizen and G. B. Lamont. Multiobjective evolutionary algorithms: Analyzing the state-of-art. Evolutionary Computation, 8(2):125–147, 2000.

110


4

4 3.5

3.5

3

3 2.5 2

2

2

f

f2

2.5

1.5 1

1.5

0.5

1 0

0.5

0

−0.5

0

(a)

0.1

0.2

0.3

0.4

0.5 f1

0.6

0.7

0.8

0.9

−1

1

0

0.1

0.2

0.3

0.4

0.5 f

0.6

0.7

0.8

0.9

1

1

(b)

Fig. 20. Method 2 using the ES with CMA for (a) F3 (n=30) and (b) F4 (n=30).

6. P. Hajela and C. Y. Lin. Genetic search strategies in multicriteria optimal design. Structural Optimization, 4:99–107, 1992. 7. F. Kursawe. A variant of evolution strategies for vector optimization. In H.-P. Schwefel and R. M¨ anner, editors, Parallel Problem Solving from Nature, volume I, pages 193–197, 1991. 8. T. Binh and U. Korn. Multiobjective evolution strategy with linear and nonlinear constraints. In Proceedings of the 15th IMACS World Congress on Scientific Conputation, Modeling and Applied Mathematics, pages 357–362, 1997. 9. M. Laumanns, G. Rudolph, and H.-P. Schwefel. A spatial predator-prey approach to multi-objective optimization. In A.E. Eiben, Th. B¨ ack, M. Schoenauer, and H.-P. Schwefel, editors, Parallel Problem Solving from Nature, volume V, pages 241–249, 1998. 10. J. D. Schaffer. Multiple objective optimization with vector evaluated genetic algorithms. In Proceedins of an International Conference on Genetic Algorithms and Their Applications, pages 93–100, 1985. 11. H.-P. Schwefel. Evolution and Optimum Seeking. Sixth-Generation Computer Technologies Series. John Wiley & Sons, Inc., 1994. 12. N. Hansen and A. Ostermeier. Adapting arbitrary normal mutation distributions in evolution strategies: The covariance matrix adaption. In Proc. 1996 IEEE Int. Conf. on Evolutionary Computation, pages 312–317. IEEE Press, 1996. 13. N. Hansen and A. Ostermeier. Completely derandomized self-adaptation in evolution strategies. Evolutionary Computation, 2000. To appear.

Incrementing Multi-objective Evolutionary Algorithms: Performance Studies and Comparisons 1

K. C. Tan , T. H. Lee, and E. F. Khor Department of Electrical and Computer Engineering National University of Singapore 10 Kent Ridge Crescent Singapore 119260 1 Email: [email protected]

Abstract. This paper addresses the issue by presenting a novel "incrementing" multi-objective evolutionary algorithm (IMOEA) with dynamic population size that is adaptively computed according to the on-line discovered trade-off surface and its desired population distribution density. It incorporates the method of fuzzy boundary local perturbation with interactive local fine-tuning for broader neighborhood exploration to achieve better convergence as well as discovering any gaps or missing trade-off regions at each generation. Comparative studies with other multi-objective (MO) optimization are performed on benchmark problem. The new suggested quantitative measures together with other well-known measures are employed to access and compare their performances statistically.

1. Introduction Evolutionary techniques for MO optimization are currently gaining significant attention from researchers in various fields [1-7]. The methods, however, need to ’guess’ for an optimal constant population size in order to discover and distribute the non-dominated individuals along the usually sophisticated trade-off surface. As addressed by Arabas et al. [8], evolutionary algorithm may suffer from premature convergence if the population size is too small. If the population is too large, undesired computational resources may be incurred and the waiting time for a fitness improvement may be too long in practice. Therefore the selection of an appropriate population size in evolutionary optimization is important and could greatly affect the effectiveness and efficiency of the optimization performance [9-13]. In the case of single objective (SO) optimization, various methods of determining an optimal population size from different perspectives have been proposed. Grefenstette [14] applied a Meta genetic algorithm to control the population size of another genetic algorithm. Smith [15] and Arabas et al. [8] proposed the approach of determining the population size adaptively according to the “age” of a chromosome. Zhuang et al. [16] proposed an adaptive population size by adapting it to the degree of improvement achieved at each generation. Unlike these approaches that are only applicable to single objective optimization [12,14,15,16], this paper generalizes the work in our earlier developed MOEA [5] and E. Zitzler et al. (Eds.): EMO 2001, LNCS 1993, pp. 111-125, 2001. © Springer-Verlag Berlin Heidelberg 2001

112

K.C. Tan, T.H. Lee, and E.F. Khor

proposes an incrementing multi-objective evolutionary algorithm (IMOEA) with dynamic population size for effective MO optimization. Instead of having a constant population to explore the solution space, IMOEA adaptively computes an appropriate population size according to the on-line evolved trade-offs and its desired population distribution density. This approach reduces the computational effort due to unnecessary extra individuals and avoids the pre-mature convergence or incomplete trade-offs resulting from insufficient number of individuals. In addition, the IMOEA incorporates a fuzzy boundary local perturbation technique with dynamic number of local perturbations per parent to encourage and reproduce the "incrementing" individuals for better MO optimization, whereas any ’extra’ individuals will be filtered through the method of switching preserve strategy proposed in the paper. While maintaining the global search capability, the scheme enhances the local exploration and fine-tuning of the evolution at each generation so as to fill-up any discovered gaps or discontinuities among the non-dominated individuals that are loosely located or far away from each other along the trade-off surface. Details of the IMOEA with fuzzy boundary local perturbation and other advanced features are described in Section 2. Section 3 presents extensive simulations and comprehensive quantitative/statistical comparisons of IMOEA, with other famous MO optimization algorithms, on benchmark problem. Conclusions are drawn in Section 4.

2. Incrementing Multi-objective Evolutionary Algorithm As addressed in the Introduction, current evolutionary techniques for MO optimization face a common difficulty in determining an optimal population size in order to efficiently explore the solution space as well as to distribute along the tradeoff surface with sufficient number of non-dominated individuals. Intuitively, it is hard to achieve a good evolution if the population size is too small with loosely distributed individuals leading to insufficient exchange of genetic information. If the population size is too large, however, undesirable computational effort may be incurred in practice. In single objective evolutionary optimization, the population size is often "guessed" according to the size of the search space in the parameter domain [8]. This is, however, not applicable to MO optimization where the global optimal is not a single solution but is often a set of Pareto optimal points covering the entire trade-off surface in the objective domain. Further, since the exact trade-offs is often unknown in a-priori to an optimization process, it is difficult to estimate an optimal number of individuals necessary for effective exploration of the solution space as well as good representation of the trade-off surface. The issue of dynamic population in MO optimization currently remains an open problem for researchers in the field of evolutionary computation as pointed out by [4]. Extending from our earlier work of MOEA [5], an incrementing multi-objective evolutionary algorithm is proposed to deal with this problem by adaptively computing an appropriate population size at each generation. The population size in IMOEA is thus dynamic and is increased or decreased based upon the on-line discovered Paretofront and its desired population distribution density along the trade-offs.

Incrementing Multi-objective Evolutionary Algorithms

113

2.1 Dynamic Population Size Instead of ’guessing’ for an optimal population size in MO optimization, an adaptation mechanism is employed in IMOEA such that the population size is evolved based upon the on-line evolved trade-offs and the required population distribution density defined by the user according to his/her preference on how close the non-dominated individuals should be distributed apart from each other on the Pareto-front. Consider (n) an m-dimensional objective space, the desired population size, dps , with the desired population size per unit volume, ppv, and the approximated trade-off hyper-area of (n) Ato [17] discovered by the population at generation n can be defined as.

lowbps ≤ dps ( n) = ppv × Ato ( n) ≤ upbps

(1)

where lowbps and upbps is the lower and upper bound for the desired population (n) size dps , respectively, which can be treated as hard bounds that are optionally defined by the user. The trade-offs for an m-objective optimization problem is in the form of an (m-1) dimensional hyper-surface as pointed out by Horn and Nafpliotis [18] (note that 1-dimensional surface is actually a curve while 0-dimensional surface (n) is in point form), which could be approximated by the hyper-surface Ato of a hypersphere as given by [17], ( m−1) / 2

 d ( n) ×  m − 1   2  !  2 

π Ato (n ) ≈

   

m−1

(2)

where d (n) is the diameter of the hyper-sphere at generation n. The above estimation of population size is valid for both convex and concave surfaces [17]. (n )

Furthermore, the same computation procedure of diameter d can also be easily extended to any multi-dimensional objective space [17]. Clearly, eqns. 1 and 2 provide a simple estimation of the desired population size at each generation according to the on-line discovered trade-off surface Ato and the desired population density ppv, which is more efficient and appropriate than the idea of guessing for an optimal population size in a-priori to an optimization process as adopted in existing methods. 2.2 Fuzzy Boundary Local Perturbation In this section, a fuzzy boundary local perturbation (FBLP) scheme that perturbs the set of non-dominated individuals to produce the necessary "incrementing" individuals for the desired population size in IMOEA as given by eqns. 1 and 2 is proposed. In brief, the FBLP is implemented for the following objectives: 1.

Produce additional “good” individuals in filling up the gaps or discontinuities among existing non-dominated individuals for better representation of the Pareto-front as shown in Fig. 2;

114


f2

(n)

Fx

dominated individuals non-dominated individuals

dmin(n) d1 (n)

d (n) (n)

Fy (n)

Fz

d2(n)

f1 Fig. 1. The diameter d

2. 3.

(n )

of a trade-off curve

Perform interactive fine-learning to overcome weakness of local exploration in an evolutionary algorithm [19,20] and to achieve better convergence for evolutionary MO optimization; Provide the possibility of perturbation beyond the neighborhood to avoid premature convergence or local saturation.

Minimization

f2

No local perturbation for parents closed together

Fuzzy neighborhood boundary Parent Perturbed child Pareto Frontier

Local perturbation for parents apart from each other

Minimization

f1

Fig. 2. FBLP for non-dominated parents with low niched cost (apart from other parents)

These additional Pareto points can be effectively obtained via the method of fuzzy boundary local perturbation at each generation. Note that only parent individuals that are being selected for reproduction from the tournament selection will be perturbed with the FBLP, and the selection criteria for the tournament is solely based upon the individuals’ niched cost in the objective domain [3] instead of the cost of objective functions in order to encourage uniform distribution. Therefore parents with low niched cost (located apart from other parents) will be given higher probability to be perturbed as compared to those with a high niched cost (located close to other parents). Also, the neighborhood boundary for the parents to be perturbed is fuzzy in


115

such a way that the probability of perturbation is higher within the neighborhood region than those outside the neighborhood [17]. In conclusion, the FBLP differs in two aspects as compared to other local search methods in single-objective evolutionary optimization [19,21]. The first is that, unlike simple mutation, the perturbation probabilities in FBLP vary according to the significance of the genes in a chromosome for ease of implementation and computation efforts. In addition, there is no hard boundary of the neighborhood size in the perturbation, which gives a non-zero chance to produce offspring that are far away from their parents in order to keep maintaining the diversity of evolution. The second is that FBLP produces a number of offspring from each selected parent without immediate cost evaluation as to determine the acceptance or rejection for each of the perturbed individual, which can be regarded as an extension of mutation with at least one (instead of one) locally perturbed offspring per parent. 2.3 Program Flowchart of IMOEA The overall program flowchart of IMOEA is shown in Fig. 3. The dynamic sharing method for niched cost estimation from [5] is applied here to provide a simple computation of σshare at each generation, which is capable of distributing the population uniformly along the Pareto-front without the need of a-priori knowledge in setting the σshare. The detail procedures within the box of special genetic operations for IMOEA in the program flow are unveiled in Fig. 4. Instead of simple mutation, fuzzy boundary local perturbation is performed to encourage or reproduce the "incrementing" individuals needed for a better trade-off representation. While maintaining the global search capability, the scheme enhances the local exploration and fine-tuning of the evolution at each generation so as to fill-up any discovered gaps or discontinuities among the non-dominated individuals that are loosely located or far away from each other along the trade-off surface. As shown in Fig. 3, the evolved population with the desired population size of (n+1) dps will be combined with the reserved non-dominated individuals at generation n (n+1) to form a combined population that has a size larger or equal to dps . Individuals in the combined population are then selected for next generation such that a stable and well-distributed Pareto-front could be maintained at each generation. Concerning this, a switching preserved strategy (SPS) [17], as highlighted in the shaded region, that preserves the non-dominated individuals to be evolved together with the population is proposed is employed.

3. Performance Comparisons on Benchmark Problems In this section, performance comparisons are performed among various evolutionary approaches for multi-objective optimization using both quantitative and statistical measures. Besides IMOEA, other well-known algorithms including VEGA from Schaffer [9], HLGA from Hajela Lin [22], NPGA from Horn and Nafpliotis [18], MOGA from Fonseca and Fleming [23], NSGA from Srinivas and Deb [2], SPEA from Zitzler and Thiele [7] and MOEA from Tan et al. [5] are included in this paper. Also, five different performance indexes/measures for MO optimization are employed

116


for such comparisons, apart from the usual performance measure based upon the results of final trade-offs graph. Some of these measures are taken from recent literatures while others are carefully designed and added in the paper for a more comprehensive comparison. Population initialization

Final Population

Is stopping criteria met?

Yes

No Special Genetic Operations

new population

non-dominated individuals

Dynamic sharing

Population size of dps(n+1) Cost Evaluation

Evolved Population

+ Pareto Cost Assignment

Switching Preserved Strategy

Combined Population Size(nondom) >dps(n+1)

No

Filtering-based on Pareto ranked cost

Yes Dynamic Sharing

Filtering-based on shared costs

Fig. 3. Overall program flowchart with fixed (MOEA) and dynamic (IMOEA) population size


117

Special Genetic Operations: (n)

Let, dps = the size of population at current generation n (n) pop = population of current generation n (n) Step 1) From current pop , the desired population size in next generation is computed according to the adaptation mechanism in eqn. 1: (n+1) (n) dps = ppv × Ato Step 2) Perform tournament selection. The selected population is called (n) selpop . Step 3) Perform simple crossover with crossover probability pc and (n) mating restriction (Fonseca, 1995) for selpop . The resulted (n) population is called crosspop . (n) Step 4) Perform FBLP. The resulted population is called evolpop . Fig. 4. Detail procedures within the box of “Special Genetic Operations” in Fig. 3

The Fonseca’s two-objective minimization problem is applied as a benchmark problem for the performance comparisons. This problem is chosen as it has been widely studied by others [5,6,23] and it has a large and non-linear trade-off curve that should challenge the MO evolutionary algorithm’s ability to find and maintain the entire Pareto-front uniformly. Besides, this problem can be easily used for visualization and comparison as adopted by Fonseca and Fleming [23]. The twoobjective functions, f1and f2, to be minimized are given as

 8   f1,1 ( x1 ,..., x8 ) = 1 − exp − ∑  xi −  i =1   8   f1,2 ( x1 ,..., x8 ) = 1 − exp − ∑  xi +  i =1 

2 1     8   2 1     8  

(3)

where, −2 ≤ xi < 2, ∀i = 1,2,...,8 . According to eqn. 3, there are 8 parameters (x1,…,x8) to be optimized so that f1 and f2 are minimal. The trade-off line is shown by the curve in Fig. 5, where the shaded region represents the unfeasible area in the objective domain. Five different quantitative interpretations of statistical MO optimization performances are applied. Some of them are taken from other literatures, while others are carefully designed by the authors and added in this paper for a more comprehensive comparison. Note that these measures were chosen such that the actual Pareto sets are not needed in the computation, which is often obtained through deterministic enumeration and is not always practically implementable [6]. i)

Ratio of Non-dominated Individuals (RNI) This performance measure is denoted here as the ratio of non-dominated individuals (RNI) for a given population X and is mathematically formulated as:

118


RNI (X ) =

nondom_indiv P

(4)

where nondom_indiv is the number of non-dominated individuals in population X while P is the size of population X. Therefore the value RNI = 1 means all the individuals in the population are non-dominated while the opposite, RNI = 0 represents the situation where none of the individuals in the population are nondominated.

f 1,2

Trade-off curve

Unfeasible region

f 1,1

Fig. 5. Trade-off curve in the objective domain for the test problem 1

ii)

Size of Space Covered (SSC) This measure is originated from Zitzler and Thiele [7]. Since the original definition only accommodate maximization problem, it is generalized in this paper for both minimization and maximization process as follow. Let xi ∈ X be an i-th individual member in a population X. The function SSC(X) gives the volume enclosed by the union of area in the objective domain where any point within the area is always dominated by at least one individual xi in the population X. The higher the value of SSC(X), the larger the dominated volume in the objective domain and hence the better the population is.

iii) Coverage of Two Set (C) It is a measure to compare the domination of two population in a pair-wise manner, i.e., how good population i dominate population j as well as how good population j dominate population i. This measure was proposed by Zitzler and Thiele [7] and is detailed as below: Let X’, X"⊆ X be two sets of decision vectors. The function C transforms the ordered pair (X’, X") to the interval [0, 1] given as,

C ( X ’, X " ) =

{a"∈ X "; ∃a’∈ X ’: a’dominate or nondominate a"} X"

(5)


119

The value C(X’, X") = 1 indicates that all solutions in X" are dominated by or equal to solutions in X’, while C(X’, X") = 0 means none of the points in X" are covered by the population X’. iv)

Uniform Distribution (UD) of Non-dominated Population Most MO optimization methods attempt to spread the non-dominated individuals uniformly throughout the Pareto-front using various types of fitness sharing and niching scheme as discussed in [24]. This paper proposes an improved alternate measure of uniform distribution (UD) for non-dominated population. Mathematically, UD(X’) for a given set of non-dominated individuals X’ in a population X, where X’ ⊆ X, is defined as,

UD(X ’) =

1 1 + S nc

(6)

where Snc is the standard deviation of niche count of the overall set of nondominated individuals X’, and is formulated as, N x’

(

∑ nc( x’i ) − nc( X ’)

S nc =

i

)

N x’ − 1

(7)

where Nx’ is the size of the set X’; nc(x’i) is the niche count of i-th individual x’i where x’i ∈ X’; and nc(X ’) is the mean value of nc(x’i), ∀ i = 1, 2, … Nx’, as shown in the following equations, N x’ 1, dis (i, j ) < σ share nc( x’i ) = ∑ f (i, j ), where f (i, j ) =  else 0, j, j ≠ i

(8)

N x’

∑ nc( x’i )

nc( X ’) = i

N x’

(9)

where dis(i, j) is the distance between individual i and j in the objective domain. Note that the main advantage of this measure is that the actual Paretofront is not needed in a-priori. v)

Algorithm Effort (AE) The performance in MO optimization is often evaluated not only in terms of how good the final Pareto-front is, but also in terms of the computational time required in obtaining such optimal solutions, which includes the effort of performing genetic operations, ranking, fitness sharing and etc., Generally, the algorithm effort (AE) can be defined as the total number of function evaluations Neval over a fixed period of simulation time as given by,

120


AE =

T run N eval

(10)

As shown in eqn. 10, for a fixed period of Trun, more number of function evaluations being performed indirectly indicates that less computational effort is required by the optimization algorithm and hence resulting in a smaller AE. For uniform comparisons, the sharing distance for MOGA, NSGA, NPGA, HLGA as well as the performance measure of UD for all methods are set as 0.01 in the normalized space since the population size was set at 100. Since dynamic sharing [5] was used for both MOEA and IMOEA, the sharing distance is computed dynamically at each generation, whereas no distance parameter is needed for SPEA as proposed by Zitzler and Thiele [7]. Tournament selection scheme with tournament size of 2 is used in MOGA, SPEA, MOEA and IMOEA as suggested in their original literature. The Pareto tournament selection scheme with tdom = 10% of the population size is used in NPGA for a tight and complete population distribution as recommended by [1]. In order to guarantee a fair comparison, all algorithms considered are implemented with the same coding scheme, crossover and mutation. Note that each parameter is represented by 3-digit decimal and concatenated to form the chromosomes. In all cases, standard mutation with a probability of 0.01 and standard crossover with twopoint crossover and a probability of 0.7 are used. For IMOEA, the parameters of ppv and upbps are set as 100 in order to distribute the non-dominated individuals with the density of 100 individuals in unit size of normalized trade-off region. All methods under comparison were implemented with the same common subfunctions using the same programming language in Matlab [25] on an Intel Pentium II 450 MHz computer. Each of the simulation was terminated automatically when a fixed pre-specified simulation period (for each test problem) is reached, in the same platform that is free from other computation or being interrupted by other programs. The period for all algorithms being compared is 180 sec. 30 independent simulation runs have been performed for each method in each test problem so as to study the statistical performance such as consistency and robustness of the methods. Here, a random initial population was created for each of the 30 runs, except SPEA and IMOEA, with an initial population size of 100 for all methods under studied. For SPEA, as according to [7], three combinations of {P, P’}, namely {95, 5}, {70, 30} and {30, 70}, where P + P’ = 100 in each case, are used. To test the ability of IMOEA in automatically adapting the population size to discover the Pareto-front, an initial population size of only 10 (instead of 100) was randomly generated for each of the 30 runs in each test problem. The indexes of compared algorithms on each test problem are in the sequence: VEGA, HLGA, NPGA, MOGA, NSGA, SPEA1, SPEA2, SPEA3, MOEA and IMOEA. SPEA 1, 2, and 3 representing the {P, P’} combinations of {95, 5}, {70, 30} and {30, 70}, respectively. Fig. 6 summarizes the simulation results for the performances of each algorithm in respects to each performance measure. The distribution simulation data of 30 independent runs is represented in box plot format [26], which has been applied by [7] to visualize the distribution of simulation data efficiently. In the respects of the


121

number of function evaluations (Neval) and algorithm effort (AE) per run under a fixed CPU time, it can be seen from the first and second row of graphs in Fig. 6 that, VEGA, HLGA and NPGA have a relatively high Neval and low AE. This indicates that these algorithms are less computational expensive as compared to others and hence more iterations were being performed per run within the fixed period of CPU time.

Fig. 6. Box plots based on the measures of Neval, AE, RNI, SSC and UD

For the measure of ratio of non-dominated individuals (RNI), it is noticed that MOEA and IMOEA has relatively high mean value of RNI, which clearly indicates its ability to provide useful non-dominated solutions from a given size of population due to the incorporation of switching preserved strategy (SPS) and fuzzy boundary local perturbation (FBLP), where more offspring are perturbed in the neighborhood of the non-dominated individuals. The value of RNI in SPEA is mainly based on the setting of {P, P’} where it is noticeable that the higher the ratio of P’/(P + P’), the higher the measure of RNI is, and as a consequence, the higher the cost of computation is needed in the clustering algorithm of SPEA in order to filter out the extra external individuals. Concerning the measure of size of space cover (SSC), the performance of IMOEA is outstanding. It is also evident that MOEA is the second best in terms of measure of SSC for all test problems. In the context of uniform distribution (UD) of the nondominated population, VEGA gives the lowest value of UD indicating that it has the low ability to distribute the non-dominated individuals evenly since it doesn’t has any operation to take care of the population distribution. Also, IMOEA has shown to be the best in the measure of UD, followed by MOEA with a good performance slightly below the IMOEA. This difference is probably due to the additional operation of FBLP in IMOEA that provides the local fine-tuning to discover any gaps or missing trade-offs at each generation. Besides IMOEA and MOEA, SPEA has also shown to be performing well in the measure of UD. The performance measures of C(Xi, Xj) for the comparison sets between algorithms i and j where, i, j = 1,2, …, 10 on test problem 1 and, i, j = 1,2, … 8 on test problem 2

122


and 3, are shown in Fig. 7. Again, box plots are used to summarize the sample distributions of 30 independent runs per each case. The ranges of y- and x- axis of each graph are [0, 1] and [1, 10]. It is noticeable (concerning the rectangles C(X10, X1)) that IMOEA dominate other algorithms most obviously as compared to other 10 algorithms in the respective test problems. Also, IMOEA is dominated the least by any other algorithms in all rectangles.

C(X1,X1-10)

C(X2,X1-10)

C(X3,X1-10)

C(X4,X1-10)

C(X5,X1-10)

C(X6,X1-10)

C(X7,X1-10)

C(X8,X1-10)

C(X9,X1-10)

C(X10,X1-10)

Fig. 7. Box plot based on C measure. Each rectangle, refers to the measure of C(Xi, X1-n), represented by box plots arranged left to right, between i algorithm and algorithms ranging from 1 to 10.

Figs. 8 unveils the distribution of non-dominated individuals in the objective domain. These distributions are best selected, among the 30 independent runs, in respect to the measures of SSC. In general, the purpose of producing these figures are to visually inspect the performances of various algorithms in terms of the population distribution at the final generation since the quantitative performance measure alone may not provide enough information for full observation and understanding.

4. Conclusions A novel incrementing multi-objective evolutionary algorithm that has a dynamic population size based upon the on-line discovered Pareto-front and its desired population distribution density has been proposed. The algorithm implements the concept of Pareto optimal domination with adaptive niche induction technique to evolve a set of non-dominated individuals uniformly distributing along the trade-off surface. In addition, the method of fuzzy boundary local perturbation with dynamic local fine-tuning is incorporated to achieve broader neighborhood explorations as well as to eliminate any gaps or discontinuities along the Pareto-front for better convergence and trade-offs representations. Furthermore, extensive quantitative comparisons between IMOEA and other well-known MO optimization methods on


123

benchmark problems have been performed in this paper. Results obtained show that IMOEA has performed well in searching and maintaining the non-dominated solutions to be uniformly distributed along the global Pareto-front, with no significant computational effort needed as compared to others.

(a) VEGA

(b) HLGA

(c) NPGA

(d) MOGA

(e) NSGA

(f) SPEA1

(g) SPEA2

(h) SPEA3

Fig. 8. Best selected distribution of nondominated individuals with respect to SSC.

(i) MOEA

(j) IMOEA

References 1.

2. 3. 4. 5.

6.

Horn, J., Nafpliotis, N. and Goldberg, D.E.: A Niched Pareto Genetic Algorithm for Multiobjective Optimisation. Proceeding of First IEEE Conference on Evolutionary Computation, IEEE World Congress on Computational Intelligence (1994), vol. 1, 82-87. Srinivas, N. and Deb, K.: Multiobjective Optimization using Nondominated Sorting in Genetic Algorithms. Evolutionary Computation, MIT Press Journals (1994), vol. 2(3), 221-248. Fonseca, C.M.: Multiobjective Genetic Algorithms with Application to Control Engineering Problems. Ph.D. Thesis, Dept. Automatic Control and Systems Eng., University of Sheffield, Sheffield, UK (1995). Coello Coello, C.A.: An Updated Survey of GA-based Multiobjective Optimization Techniques. Technical Report: Lania-RD-98-08, Laboratorio Nacional de Informatica Avanzada (LANIA), Xalapa, Veracruz, Mexico (1998). Tan, K.C., Lee, T.H. and Khor, E.F.: Evolutionary Algorithms with Goal and Priority Information for Multi-Objective Optimization. IEEE Proceedings of the Congress on Evolutionary Computation, Washington, D.C, USA (1999), vol. 1, 106-113. Van Veldhuizen, D.A. and Lamont G.B.: Multiobjective Evolutionary Algorithm Test Suites. Symposium on Applied Computing, San Antonio, Texas (1999), 351-357.

124

7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17.

18. 19. 20.

21. 22.


Zitzler, E., and Thiele, L.: Multiobjective Evolutionary Algorithms: A Comparative Case Study and the Strength Pareto Approach. IEEE Transactions on Evolutionary Computation (1999), vol. 3(4), 257-271. Arabas, J., Michalewicz, Z., and Mulawka, J.: GAVaPS-A Genetic Algorithm with Varying Population Size. Proceedings of the First Conference on Evolutionary Computation (1994), vol. 1, 73-74. Schaffer, J.D.: Multiple-Objective Optimization using Genetic Algorithm. Proceedings of the First International Conference on Genetic Algorithms (1985), 93-100. Goldberg, D.E.: Genetic Algorithms in Search, Optimisation and Machine Learning. Addision-Wesley, Reading, Masachusetts (1989). Alander, J.T.: On Optimal Population Size of Genetic Algorithms. IEEE Proceedings on Computer Systems and Software Engineering (1992), 65-70. Odetayo, M.O.: Optimal Population Size for Genetic Algorithms: An Investigation. Proceedings of the IEE Colloquium on Genetic Algorithms for Control Systems, London (1993), 2/1-2/4. Sasaki, T., Hsu, C.C., Fujikawa, H., and Yamada, S.I.: A Multi-Operator Selfrd Tuning Genetic Algorithm for Optimization. 23 International Conference on Industrial Electronics (1997), vol. 3, 1034-1039. Grefenstette, J.J.: Optimization of Control Parameters for Genetic Algorithms. IEEE Transactions on Systems, Man and Cybernetics (1986), vol. 16(1), 122128. Smith, R.E.: Adaptively Resizing Populations: An Algorithm and Analysis. In: Forrest, S. (ed.): Proceeding of the Fifth International Conference on Genetic Algorithms, Morgan Kaufmann Publishers, Los Altos, CA (1993), 653. Zhuang, N., Benten, M.S., and Cheung, P.Y.: Improved Variable Ordering of BDDS with Novel Genetic Algorithm. IEEE International Symposium on Circuits and Systems (1996), vol. 3, 414-417. Khor, E.F., Tan, K.C., Wang, M.L. and Lee, T.H.: Evolutionary Algorithm with Dynamic Population Size for Multi-Objective Optimization. Accepted by Third Asia Conference on Simulated Evolution and Learning (SEAL2000) (2000), 2768-2772. Horn, J. and Nafpliotis, N.: Multiobjective Optimization Using the Niche Pareto Genetic Algorithm. IlliGAL Report 93005, University of Illinois at UrbanaChampain, Urbana, Illinois, USA (1993). Dengiz, B., Altiparmak, F., and Smith, A.E.: Local Search Genetic Algorithm for Optimal Design of Reliable Networks. IEEE Transactions on Evolutionary Computation (1997), vol. 1(3), 179-188. Liong, S.Y., Khu, S.T., and Chan, W.T.: Novel Application of Genetic Algorithm and Neural Network in Water Resources: Development of Pareto Front. Eleventh Congress of the IAHR-APD, Yogyakarta, Indonesia (1998), 185-194. Hagiwara, M.: Pseudo-hill Climbing Genetic Algorithm (PHGA) for Function Optimization. Proceedings of the International Conference on Neural Networks (1993), vol. 1, 713-716. Hajela, P., and Lin, C.Y.: Genetic Search Strategies in Multicriterion Optimal Design. Journal of Structural Optimization (1992), vol. 4, 99-107.


125

23. Fonseca, C.M. and Fleming, P.J.: Genetic Algorithm for Multiobjective Optimization, Formulation, Discussion and Generalization. In: Forrest, S. (ed.): Genetic Algorithms: Proceeding of the Fifth International Conference. Morgan Kaufmann, San Mateo, CA (1993), 416-423. 24. Sareni, B., and Krähenbühl, L.: Fitness Sharing and Niching Methods Revisited. IEEE Transactions on Evolutionary Computation (1998), vol. 2(3), 97-106. 25. 25. The Math Works, Inc.: Using MATLAB, The Math Works Inc. (1998), version 5. 26. Chambers, J.M., Cleveland, W.S., Kleiner, B., and Turkey, P.A.: Graphical Methods for Data Analysis. Wadsworth & Brooks/Cole, Pacific CA (1983).

A Micro-Genetic Algorithm for Multiobjective Optimization Carlos A. Coello Coello1 and Gregorio Toscano Pulido2 1 CINVESTAV-IPN Depto. de Ingenier´ıa Eléctrica Secci´ on de Computaci´ on Av. Instituto Politécnico Nacional No. 2508 Col. San Pedro Zacatenco México, D. F. 07300 [email protected] 2 Maestr´ıa en Inteligencia Artificial LANIA-Universidad Veracruzana Xalapa, Veracruz, México 91090 [email protected]

Abstract. In this paper, we propose a multiobjective optimization approach based on a micro genetic algorithm (micro-GA) which is a genetic algorithm with a very small population (four individuals were used in our experiment) and a reinitialization process. We use three forms of elitism and a memory to generate the initial population of the micro-GA. Our approach is tested with several standard functions found in the specialized literature. The results obtained are very encouraging, since they show that this simple approach can produce an important portion of the Pareto front at a very low computational cost.

1

Introduction

A considerable number of evolutionary multiobjective optimization techniques have been proposed in the past [3,20]. However, until recently, little emphasis had been placed on efficiency issues. It is well known that the two main processes that consume most of the running time of an EMOO algorithm are: the ranking of the population (i.e., the comparisons required to determine non-dominance) and the mechanism to keep diversity (evolutionary algorithms tend to converge to a single solution because of stochastic noise; it is therefore necessary to avoid this with an additional mechanism). Recent research has shown ways of improving the efficiency of an EMOO technique (see for example [14,6]). The main emphasis has been on using an external file that stores nondominated vectors found during the evolutionary process which are reinserted later in the population (this can be seen as a form of elitism in the context of multiobjective optimization [10,17,22]). Following the same line of thought of this current research, we decided to develop an approach in which we would use a GA with a very small population size and a reinitialization process (the so-called micro-GA) combined with an E. Zitzler et al. (Eds.): EMO 2001, LNCS 1993, pp. 126–140, 2001. c Springer-Verlag Berlin Heidelberg 2001

A Micro-Genetic Algorithm for Multiobjective Optimization

127

external file to store nondominated vectors previously found. Additionally, we decided to include an efficient mechanism to keep diversity (similar to the adaptive grid method of Knowles & Corne [14]). Our motivation was to show that a micro-GA carefully designed is sufficient to generate the Pareto front of a multiobjective optimization problem. Such approach not only reduces the amount of comparisons required to generate the Pareto front (with respect to traditional EMOO approaches based on Pareto ranking), but also allows us to control the amount of points that we wish to obtain from the Pareto front (such amount is in fact a parameter of our algorithm).

2

Related Work

The term micro-genetic algorithm (micro-GA) refers to a small-population genetic algorithm with reinitialization. The idea was suggested by some theoretical results obtained by Goldberg [8], according to which a population size of 3 was sufficient to converge, regardless of the chromosomic length. The process suggested by Goldberg was to start with a small randomly generated population, then apply to it the genetic operators until reaching nominal convergence (e.g., when all the individuals have their genotypes either identical or very similar), and then to generate a new population by transferring the best individuals of the converged population to the new one. The remaining individuals would be randomly generated. The first to report an implementation of a micro-GA was Krishnakumar [15], who used a population size of 5, a crossover rate of 1 and a mutation rate of zero. His approach also adopted an elitist strategy that copied the best string found in the current population to the next generation. Selection was performed by holding 4 competitions between strings that were adjacent in the population array, and declaring to the individual with the highest fitness as the winner. Krishnakumar [15] compared his micro-GA against a simple GA (with a population size of 50, a crossover rate of 0.6 and a mutation rate of 0.001). Krishnakumar [15] reported faster and better results with his micro-GA on two stationary functions and a real-world engineering control problem (a wind-shear controller task). After him, several other researchers have developed applications of micro-GAs [13, 7,12,21]. However, to the best of our knowledge, the current paper reports the first attempt to use a micro-GA for multiobjective optimization, although some may argue that the multi-membered versions of PAES can be seen as a form of micro-GA1 [14]. However, Knowles & Corne [14] concluded that the addition of a population did not, in general, improve the performance of PAES, and increased the computational overhead in an important way. Our technique, on the other hand, uses a population and traditional genetic operators and, as we will show in a further section, it performs quite well. 1

We recently became aware of the fact that Jaszkiewicz [11] proposed an approach in which a small population initialized from a large external memory and utilized it for a short period of time. However, to the best of our knowledgem this approach has been used only for multiobjective combinatorial optimization.

128

3

C.A. Coello Coello and G.T. Pulido

Description of the Approach

In this paper, we propose a micro-GA with two memories: the population memory, which is used as the source of diversity of the approach, and the external memory, which is used to archive members of the Pareto optimal set. Population memory is respectively divided in two parts: a replaceable and a non-replaceable portion (the percentages of each can be regulated by the user). The way in which our technique works is illustrated in Fig. 1. First, an initial random population is generated. This population feeds the population memory, which is divided in two parts as indicated before. The non-replaceable portion of the population memory will never change during the entire run and is meant to provide the required diversity for the algorithm. The initial population of the micro-GA at the beginning of each of its cycles is taken (with a certain probability) from both portions of the population memory as to allow a greater diversity. During each cycle, the micro-GA undergoes conventional genetic operators: tournament selection, two-point crossover, uniform mutation, and elitism (regardless of the amount of nondominated vectors in the population only one is arbitrarily selected at each generation and copied intact to the following one). After the micro-GA finishes one cycle (i.e., when nominal convergence is achieved), we choose two nondominated vectors2 from the final population (the first and last) and compare them with the contents of the external memory (this memory is initially empty). If either of them (or both) remains as nondominated after comparing against the vectors in this external memory, then they are included there. All the dominated vectors are eliminated from the external memory. These two vectors are also compared against two elements from the replaceable portion of the population memory (this is done with a loop, so that each vector is only compared against a single position of the population memory). If either of these vectors dominates to its match in the population memory, then it replaces it. The idea is that, over time, the replaceable part of the population memory will tend to have more nondominated vectors. Some of them will be used in the initial population of the micro-GA to start new evolutionary cycles. Our approach uses three types of elitism. The first is based on the notion that if we store the nondominated vectors produced from each cycle of the micro-GA, we will not lose any valuable information obtained from the evolutionary process. The second is based on the idea that if we replace the population memory by the nominal solutions (i.e., the best solutions found when nominal convergence is reached), we will gradually converge, since crossover and mutation will have a higher probability of reaching the true Pareto front of the problem over time. This notion was hinted by Goldberg [8]. Nominal convergence, in our case, is defined in terms of a certain (low) number of generations (typically, two to five in our case). However, similarities among the strings (either at the phenotypical 2

This is assuming that we have two or more nondominated vectors. If there is only one, then this vector is the only one selected.


129

Fig. 1. Diagram that illustrates the way in which our micro-GA works.

or genotypical level) could also been used as a criterion for convergence. The third type of elitism is applied at certain intervals (defined by a parameter called “replacement cycle”). What we do is to take a certain amount of points from all the regions of the Pareto front generated so far and we use them to fill in the replaceable memory. Depending on the size of the replaceable memory, we choose as many points from the Pareto front as necessary to guarantee a uniform distribution. This process intends to use the best solutions generated so far as the starting point for the micro-GA, so that we can improve them (either by getting closer to the true Pareto front or by getting a better distribution). This also avoids that the contents of the replaceable memory becomes homogeneous.

130


To keep diversity in the Pareto front, we use an approach similar to the adaptive grid proposed by Knowles & Corne [14]. The idea is that once the archive that stores nondominated solutions has reached its limit, we divide the search space that this archive covers, assigning a set of coordinates to each solution. Then, each newly generated nondominated solution will be accepted only if the geographical location to where the individual belongs is less populated than the most crowded location. Alternatively, the new nondominated solution could also be accepted if the individual belongs to a location outside the previously speficied boundaries. In other words, the less crowded regions are given preference so that the spread of the individuals on the Pareto front can be more uniform. The pseudo-code of the algorithm is the following: function Micro-GA begin Generate starting population P of size N and store its contents in the population memory M /* Both portions of M will be filled with random solutions */ i=0 while i < Max do begin Get the initial population for the micro-GA (Pi ) from M repeat begin Apply binary tournament selection based on nondominance Apply two-point crossover and uniform mutation to the selected individuals Apply elitism (retain only one nondominated vector) Produce the next generation end until nominal convergence is reached Copy two nondominated vectors from Pi to the external memory E if E is full when trying to insert indb then adaptive grid(indb ) Copy two nondominated vectors from Pi to M if i mod replacement cycle then apply second form of elitism i=i+1 end while end function The adaptive grid requires two parameters: the expected size of the Pareto front and the amount of positions in which we will divide the solution space for each objective. The first parameter is defined by the size of the external memory


131

and it is provided by the user. The second parameter (the amount of positions in which we will divide the solution space) has to be provided by the user as well, although we have found that our approach is not very sensitive to it (e.g., in most of our experiments a value of 15 or 25 provided very similar results). The process of determining the location of a certain individual has a low computational cost (it is based on the values of its objectives as indicated before). However, when the individual is out of range, we have to relocate all the positions. Nevertheless, this last situation does not occur too often, and we allocate a certain amount of extra room in the first and last locations of the grid to minimize the occurrence of this situation. When the external memory is full, then we use the adaptive grid to decide what nondominated vectors will be eliminated. The adaptive grid will try to balance the amount of individuals representing each of the elements of the Pareto set, so that we can get a uniform spread of points along the Pareto front.

4

Comparison of Results

Several test functions were taken from the specialized literature to compare our approach. In all cases, we generated the true Pareto fronts of the problems using exhaustive enumeration (with a certain granularity) so that we could make a graphical comparison of the quality of the solutions produced by our micro-GA. Since the main aim of this approach has been to increase efficiency, we additionally decided to compare running times of our micro-GA against those of the NSGA II [6] and PAES [14]. In the following examples, the NSGA was run using a population size of 100, a crossover rate of 0.8 (using SBX), tournament selection, and a mutation rate of 1/vars, where vars = number of decision variables of the problem. In the following examples, PAES was run using a depth of 5, a size of the archive of 100, and a mutation rate of 1/bits, where bits refers to the length of the chromosomic string that encodes the decision variables. The amount of fitness function evaluations was set such that the NSGA II, PAES and the micro-GA could reasonably cover the true Pareto front of each problem. 4.1

Test Function 1

Our first example is a two-objective optimization problem defined by Deb [5]:

Minimize f1 (x1 , x2 ) = x1

Minimize f2 (x1 , x2 ) =

g(x2 ) x1

(1)

(2)

132


where: ( ( 2 ) 2 ) x2 − 0.2 x2 − 0.6 g(x2 ) = 2.0 − exp − − 0.8 exp − 0.004 0.4

(3)

and 0.1 ≤ x1 ≤ 1.0, 0.1 ≤ x2 ≤ 1.0.

Fig. 2. Comparison of results for the first test function.

The parameters used by the micro-GA for this example were: size of the external memory = 100, size of the population memory = 50, number of iterations = 1500, number of iterations of the micro-GA (to achieve nominal convergence) = 2, number of subdivisions of the adaptive grid = 25, crossover rate = 0.7, mutation rate = 0.029, percentage of non-replaceable memory = 0.3, population size (of the micro-GA) = 4, replacement cycle at every 50 iterations. Our first test function has a local Pareto front to which a GA can be easily attracted. Fig. 2 shows the true Pareto front for this problem with a continuous line, and the results found by the NSGA II, PAES and our micro-GA are shown with points. Similar fronts were found by the three approaches. For this example, both the NSGA II and PAES performed 12,000 evaluations of the fitness function. The average running time of each algorithm (over 20 runs) were the following: 2.601 seconds for the NSGA II (with a standard deviation of 0.33555913), 1.106 seconds for PAES (with a standard deviation of 0.25193672) and only 0.204 seconds for the micro-GA (with a standard deviation of 0.07764461).


4.2

133

Test Function 2

Our second example is a two-objective optimization problem proposed by Schaffer [18] that has been used by several researchers [19,1]:  −x if    −2 + x if Minimize f1 (x) = 4 − x if    −4 + x if

x≤1 1<x≤3 3<x≤4 x>4

Minimize f2 (x) = (x − 5)2

(4)

(5)

and −5 ≤ x ≤ 10.

Fig. 3. Comparison of results for the second test function.

The parameters used for this example were: size of the external memory = 100, size of the population memory = 50, number of iterations = 150, number of iterations of the micro-GA (to achieve nominal convergence) = 2, number of subdivisions of the adaptive grid = 25, crossover rate = 0.7, mutation rate = 0.056 (1/L, where L=18 bits in this case), percentage of non-replaceable memory = 0.3, population size (of the micro-GA) = 4, replacement cycle at every 25 iterations.

134


This problem has a Pareto front that is disconnected. Fig. 3 shows the true Pareto front for this problem with a continuous line (the vertical line is obviously not part of the true Pareto front, but it appears because we used linear segments to connect every pair of nondominated points). We used points to represent the solutions found by the NSGA II, PAES and our micro-GA. Again, similar Pareto fronts were found by the three approaches. For this example, both the NSGA II and PAES performed 1,200 evaluations of the fitness function. The average running time of each algorithm (over 20 runs) were the following: 0.282 seconds for the NSGA II (with a standard deviation of 0.00014151), 0.107 seconds for PAES (with a standard deviation of 0.13031718) and only 0.017 seconds for the micro-GA (with a standard deviation of 0.0007672). 4.3

Test Function 3

Our second example is a two-objective optimization problem defined by Deb [5]:

Minimize f1 (x1 , x2 ) = x1

(6)

Minimize f2 (x1 , x2 ) = g(x1 , x2 ) · h(x1 , x2 )

(7)

g(x1 , x2 ) = 11 + x22 − 10 · cos(2πx2 )

(8)

where:

( h(x1 , x2 ) =

1− 0

q

f1 (x1 ,x2 g(x1 ,x2

if f1 (x1 , x2 ) ≤ g(x1 , x2 ) otherwise

(9)

and 0 ≤ x1 ≤ 1, −30 ≤ x2 ≤ 30. This problem has 60 local Pareto fronts. Fig. 4 shows the true Pareto front for this problem with a continuous line. The results obtained by the NSGA II, PAES and our micro-GA are displayed as points. The parameters used by the micro-GA for this example were: size of the external memory = 100, size of the population memory = 50, number of iterations = 700, number of iterations of the micro-GA (to achieve nominal convergence) = 4, number of subdivisions of the adaptive grid = 25, crossover rate = 0.7, mutation rate = 0.029, percentage of non-replaceable memory = 0.3, population size (of the micro-GA) = 4, replacement cycle at every 50 iterations. Once again, the fronts produced by the three approaches are very similar. For this example, both the NSGA II and PAES performed 11,200 evaluations of the fitness function. The average running time of each algorithm (over 20


135

Fig. 4. Comparison of results for the third test function.

runs) were the following: 2.519 seconds for the NSGA II (with a standard deviation of 0.03648403), 2.497 seconds for PAES (with a standard deviation of 1.03348519) and only 0.107 seconds for the micro-GA (with a standard deviation of 0.00133949). 4.4

Test Function 4

Our fourth example is the so-called “unitation versus pairs” problem [9], which involves the maximization of two functions over bit strings. The first function, f1 is the number of pairs of adjacent complementary bits found in the string, and the second function, f2 is the numbers of ones found in the string. The Pareto front in this case is discrete. We used a string length of 28, and therefore, the true Pareto front is composed of 15 points. The parameters used for this example were: size of the external memory = 100, size of the population memory = 15, number of iterations = 1250, number of iterations of the micro-GA (to achieve nominal convergence) = 1, number of subdivisions of the adaptive grid = 3, crossover rate = 0.5, mutation rate = 0.035, percentage of non-replaceable memory = 0.2, population size (of the micro-GA) = 4, replacement cycle at every 25 iterations. Fig. 5 shows the results obtained by our micro-GA for the fourth test function. A total of 13 (out of 15) elements of the Pareto optimal set were found on average (only occasionally was our approach able to find the 15 target elements). PAES was also able to generate 13 elements of the Pareto optimal set on average, and the NSGA II was only able to generate 8 elements on average.

136


f2

Unitation versus pairs 28

1

27

0 0 1

26

0 0 0 0 1

25

0 0 0 0 0 0 1

24

0 0 0 0 0 0 0 0 1

23

0 0 0 0 0 0 0 0 0 0 1

22

0 0 0 0 0 0 0 0 0 0 0 0 1

21

0 0 0 0 0 0 0 0 0 0 0 0 0 0 1

20

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1

19

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1

18

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1

17

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1

16

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1

15

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

14

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

13

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

12

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

11

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

10

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

9

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

8

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

7

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

6

0 0 0 0 0 0 0 0 0 0 0 0 0

5

0 0 0 0 0 0 0 0 0 0 0

4

0 0 0 0 0 0 0 0 0

3

0 0 0 0 0 0 0

2

0 0 0 0 0

1

0 0 0

0

0 0 1 2 3 4 5 6 7 8 9 101112131415161718192021222324252627 f1

Fig. 5. Results of the micro-GA for the fourth test function.

For this example, both the NSGA II and PAES performed 5,000 evaluations of the fitness function. The average running time of each algorithm (over 20 runs) were the following: 2.207 seconds for the NSGA II, 0.134 seconds for PAES and only 0.042 seconds for the micro-GA. Borges & Barbosa [2] reported that were able to find the 15 elements of the Pareto optimal set for this problem, using a population size of 100 and 5,000 evaluations of the fitness function, although no actual running times of their approach were reported. 4.5

Test Function 5

Our fifth example is a two-objective optimization problem defined by Kursawe [16]:

Minimize f1 (x) =

n−1 X i=1

Minimize f2 (x) =

q −10 exp −0.2 x2i + x2i+1 n X

|xi |0.8 + 5 sin(xi )3

(10)

(11)

i=1

where: −5 ≤ x1 , x2 , x3 ≤ 5

(12)


137

Fig. 6. Comparison of results for the fifth test function.

Fig. 6 shows the true Pareto front for this problem as points. The results obtained by the NSGA II, PAES and our micro-GA are also shown as points. It is worth mentioning that PAES could not eliminate some of the dominated points in the runs performed. The parameters used for this example were: size of the external memory = 100, size of the population memory = 50, number of iterations = 3000, number of iterations of the micro-GA (to achieve nominal convergence) = 2, number of subdivisions of the adaptive grid = 25, crossover rate = 0.7, mutation rate = 0.019, percentage of non-replaceable memory = 0.3, population size (of the micro-GA) = 4, replacement cycle at every 50 iterations. For this example, both the NSGA II and PAES performed 2,400 evaluations of the fitness function. The average running time of each algorithm (over 20 runs) were the following: 6.481 seconds for the NSGA II (with a standard deviation of 0.053712), 2.195 seconds for PAES (with a standard deviation of 0.25408319) and only 0.704 seconds for the micro-GA (with a standard deviation of 0.00692099).

5

Conclusions and Future Work

We have introduced an approach that uses a GA with a very small population and a reinitialization process to generate the Pareto front of a multiobjective optimization problem. The technique has a exhibited a low computational cost when compared to the NSGA II and PAES in a few test functions. The approach uses three forms of elitism, including an external file of nondominated vectors

138


and a refilling process that allows us to approach the true Pareto front in a successive manner. Also, we use an adaptive grid (similar to the one used by PAES [14]) that maintains diversity in an efficient way. The approach still needs more validation (particularly, with MOPs that have more decision variables and constraints), and needs to be compared with other EMOO approaches (under similar conditions) using some of the metrics that have been proposed in the literature (see for example [22]). We only provided running times produced on a PC, but a more exhaustive comparison is obviously lacking. However, the preliminary results presented in this paper, indicate the potential of the approach. Some other future work will be to refine part of the process, so that we can eliminate some of the additional parameters that the approach needs. Since some of them are not very critical (e.g., the number of grid subdivisions, or the amount of iterations to reach critical convergence), we could probably automatically preset them to a reasonable value so that the user does not need to provide them. Finally, we are also interested in using this approach as a basis to develop a model of incorporation of preferences from the decision maker [4]. Acknowledgements. We thank the anonymous referees for their comments that helped us improve the contents of this paper. The first author gratefully acknowledges support from CONACyT through project 34201-A. The second author acknowledges support from CONACyT through a scholarship to pursue graduate studies at the Maestr´ıa en Inteligencia Artificial of LANIA and the Universidad Veracruzana.

References 1. P. J. Bentley and J. P. Wakefield. Finding Acceptable Solutions in the ParetoOptimal Range using Multiobjective Genetic Algorithms. In P. K. Chawdhry, R. Roy, and R. K. Pant, editors, Soft Computing in Engineering Design and Manufacturing, Part 5, pages 231–240, London, June 1997. Springer Verlag London Limited. (Presented at the 2nd On-line World Conference on Soft Computing in Design and Manufacturing (WSC2)). 2. Carlos C.H. Borges and Helio J.C. Barbosa. A Non-generational Genetic Algorithm for Multiobjective Optimization. In 2000 Congress on Evolutionary Computation, volume 1, pages 172–179, San Diego, California, July 2000. IEEE Service Center. 3. Carlos A. Coello Coello. A Comprehensive Survey of Evolutionary-Based Multiobjective Optimization Techniques. Knowledge and Information Systems. An International Journal, 1(3):269–308, August 1999. 4. Carlos A. Coello Coello. Handling Preferences in Evolutionary Multiobjective Optimization: A Survey. In 2000 Congress on Evolutionary Computation, volume 1, pages 30–37, Piscataway, New Jersey, July 2000. IEEE Service Center. 5. Kalyanmoy Deb. Multi-Objective Genetic Algorithms: Problem Difficulties and Construction of Test Problems. Evolutionary Computation, 7(3):205–230, Fall 1999.


139

6. Kalyanmoy Deb, Samir Agrawal, Amrit Pratab, and T. Meyarivan. A Fast Elitist Non-Dominated Sorting Genetic Algorithm for Multi-Objective Optimization: NSGA-II. KanGAL report 200001, Indian Institute of Technology, Kanpur, India, 2000. 7. G. Dozier, J. Bowen, and D. Bahler. Solving small and large scale constraint satisfaction problems using a heuristic-based microgenetic algorithm. In Proceedings of the First IEEE Conference on Evolutionary Computation, pages 306–311, 1994. 8. David E. Goldberg. Sizing Populations for Serial and Parallel Genetic Algorithms. In J. David Schaffer, editor, Proceedings of the Third International Conference on Genetic Algorithms, pages 70–79, San Mateo, California, 1989. Morgan Kaufmann Publishers. 9. Jeffrey Horn, Nicholas Nafpliotis, and David E. Goldberg. A Niched Pareto Genetic Algorithm for Multiobjective Optimization. In Proceedings of the First IEEE Conference on Evolutionary Computation, IEEE World Congress on Computational Intelligence, volume 1, pages 82–87, Piscataway, New Jersey, June 1994. IEEE Service Center. 10. Hisao Ishibuchi and Tadahiko Murata. Multi-Objective Genetic Local Search Algorithm. In Toshio Fukuda and Takeshi Furuhashi, editors, Proceedings of the 1996 International Conference on Evolutionary Computation, pages 119–124, Nagoya, Japan, 1996. IEEE. 11. Andrzej Jaszkiewicz. Genetic local search for multiple objective combinatorial optimization. Technical Report RA-014/98, Institute of Computing Science, Poznan University of Technology, 1998. 12. E.G. Johnson and M.A.G. Abushagur. Micro-Genetic Algorithm Optimization Methods Applied to Dielectric Gratings. Journal of the Optical Society of America, 12(5):1152–1160, 1995. 13. Charles L. Karr. Air-Injected Hydrocyclone Optimization via Genetic Algorithm. In Lawrence Davis, editor, Handbook of Genetic Algorithms, pages 222–236. Van Nostrand Reinhold, New York, 1991. 14. Joshua D. Knowles and David W. Corne. Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy. Evolutionary Computation, 8(2):149–172, 2000. 15. K. Krishnakumar. Micro-genetic algorithms for stationary and non-stationary function optimization. In SPIE Proceedings: Intelligent Control and Adaptive Systems, pages 289–296, 1989. 16. Frank Kursawe. A variant of evolution strategies for vector optimization. In H. P. Schwefel and R. M¨ anner, editors, Parallel Problem Solving from Nature. 1st Workshop, PPSN I, volume 496 of Lecture Notes in Computer Science, pages 193–197, Berlin, Germany, oct 1991. Springer-Verlag. 17. Geoffrey T. Parks and I. Miller. Selective Breeding in a Multiobjective Genetic Algorithm. In A. E. Eiben, M. Schoenauer, and H.-P. Schwefel, editors, Parallel Problem Solving From Nature — PPSN V, pages 250–259, Amsterdam, Holland, 1998. Springer-Verlag. 18. J. David Schaffer. Multiple Objective Optimization with Vector Evaluated Genetic Algorithms. PhD thesis, Vanderbilt University, 1984. 19. N. Srinivas and Kalyanmoy Deb. Multiobjective Optimization Using Nondominated Sorting in Genetic Algorithms. Evolutionary Computation, 2(3):221–248, fall 1994. 20. David A. Van Veldhuizen and Gary B. Lamont. Multiobjective Evolutionary Algorithms: Analyzing the State-of-the-Art. Evolutionary Computation, 8(2):125–147, 2000.

140


21. Fengchao Xiao and Hatsuo Yabe. Microwave Imaging of Perfectly Conducting Cylinders from Real Data by Micro Genetic Algorithm Coupled with Deterministic Method. IEICE Transactions on Electronics, E81-C(12):1784–1792, December 1998. 22. Eckart Zitzler, Kalyanmoy Deb, and Lothar Thiele. Comparison of Multiobjective Evolutionary Algorithms: Empirical Results. Evolutionary Computation, 8(2):173– 195, Summer 2000.

Evolutionary Algorithms for Multicriteria Optimization with Selecting a Representative Subset of Pareto Optimal Solutions 1

1

Andrzej Osyczka and Stanislaw Krenich 1

Department of Mechanical Engineering Cracow University of Technology Al.Jana Pawla II 37, 31-864 Krakow, Poland {osyczka, krenich}@mech.pk.edu.pl

Abstract. In this paper the method of selecting a representative subset of Pareto optimal solutions is used to make the search of Pareto frontier more effective. Firstly, the evolutionary algorithm method for generating a set of Pareto optimal solutions is described. Then, indiscernibility interval method is applied to select representative subset of Pareto optimal solutions. The main idea of this method consists in removing from the set of Pareto optimal solutions these solutions, which are close to each other in the space of objectives, i.e., those solutions for which the values of the objective functions differ less than an indiscernibility interval. The set of Pareto optimal solutions is reduced using indiscernibility interval method after running a certain number of generations. This process can be called the filtration process in which less important Pareto optimal solutions are removed from the existing set. Finally, two design optimization problems are solved using the proposed method. From these examples it is clear that the computation time can be reduced significantly and still the real Pareto frontier obtained.

1 Introduction While running evolutionary algorithms for multicriteria optimization a set of Pareto solutions increases with the number of generations. For some problems the final result of running the program is the Pareto set which contains hundreds or even thousands of solutions and some of them might be very close to each other considering the values of the objective functions. For the decision maker it is difficult and tiresome to analyze all these solutions. Moreover, in each generation a new generated solution is compared with all solutions from the Pareto set. If the set of Pareto solution becomes larger the calculation time increases proportionally to the size of this set. Osyczka & Montusiewicz, 1994 while using a simple random search method, noticed this problem. They proposed some methods of selecting a representative subset of Pareto optimal solutions. Montusiewicz, 1999 has developed further one of these methods. While using E. Zitzler et al. (Eds.): EMO 2001, LNCS 1993, pp. 141−153, 2001.  Springer-Verlag Berlin Heidelberg 2001

142

A. Osyczka and S. Krenich

evolutionary algorithms these methods can be very useful considering both computation time and the decision-making problem. In this paper the method for selecting the representative set of Pareto optimal solutions is described and applied to the evolutionary algorithm to make the search more effective.

2 Method for Generating Pareto Optimal Solutions Pareto set distribution method is used to generate the set of Pareto optimal solutions. The general idea of this is as follows: Within each new generation a set of Pareto solutions is found on the basis of two sets: the set of Pareto solutions from a previous generation and the set of solutions created by genetic algorithm operations within the considered generation. The new set of Pareto solutions, thus created is distributed randomly to the next generation for a half of the population. The remaining half of the population is bred by randomly chosen strings from the previous generation. The steps of the method are as follows: Step 1. Let t = 1, where t is the index of a generation. Step 2. Generate an initial population. Step 3. If t = 1 find the set of Pareto solutions. If t > 1 find and create the set of Pareto solutions from the following sets: Pareto set from the t - 1 generation and all solutions from the t generation. Step 4. Check if there is any improvement in the Pareto set through the last t* generations, i.e., if any new Pareto solution was found through the last t* generations, where t* is the user’s preassigned number. If there is an improvement go to step 5, otherwise, terminate the calculations. Such a situation means that the genetic algorithm has not been able to find a new Pareto optimal solution through the last t* generations. Step 5. Substitute t = t+1. If t ≤ T go to step 6, where T is the preassigned number of generations to be considered. Otherwise, terminate the calculations. Step 6. Create a new t generation in the following way: for odd strings substitute randomly chosen strings from the Pareto set obtained in the t-1 generation whereas for even strings substitute randomly chosen strings from the t - 1 generation. Note that it may happen that some strings may be copied twice but in different places. This refers only to Pareto optimal strings. Step 7. Perform the genetic algorithm operations (crossover and mutation) on the strings of the whole population, and go to step 3. Here two types of termination criteria are used. The first, which indicates that there is absolutely no improvement in the Pareto set after running t* number of generations, is the more important criterion. The other criterion is related to the computational time needed for generating the Pareto solutions, i.e., the method is stopped after the assumed number of generations is executed. The graphical illustration of this method is shown in Fig.1. For the continuous decision variables the method generates a large number of Pareto solutions, which are very close to each others in the space of objective functions. Thus indiscernibility interval method is used to select a representative set of Pareto optimal solutions.

Evolutionary Algorithms for Multicriteria Optimization

set of Pareto solutions generation t -1

1 2 3

set of Pareto solutions 1 2 3 4

generation t

1 2 3 4 5 6 7 8 9 10

143

1 2 3 4 5 6 7 8 9 10

generation t +1 1 2 3 4 5 6 7 8 9 10

Fig. 1. Graphical illustration of the Pareto Set Distribution Method.

3 Indiscernibility Interval Method The main idea of this method consists in removing from the set of Pareto optimal solutions these solutions, which are close to each other, i.e., those solutions for which the values of the objective functions differ less than an indiscernibility interval. The method introduces an indiscernibility interval ui for the i-th objective function. This interval given in percentages defines differences between the values of the objective functions which qualify the solution to be removed from the Pareto set. In other words, if there is more than one solution in the interval ui one solution remains in the Pareto set and others are discarded. The method is based on the following definition: A solution x ^ ∈ X is a non-dominated solution in the indiscernibility interval sense if and only if there is no solution x + ∈ X such that:

u  ( ) ( ) and f (x )⋅ 1 + 100  > f (x )

for f i x ^ ≥ 0 :

( )

fi x^ < fi x +

( )

fi x^ < fi x +

for f i x ^ < 0 :

^

i

+

i





i



i

u  ( ) ( ) and f (x )⋅ 1 − 100  > f (x ) ^

i

+

i



This definition is illustrated graphically in Fig.2 in which the indiscernibility intervals u1 and u2 are denoted by shaded areas. In this case for the first objective function solution 16 eliminates solutions 15 and 17 and solution 20 eliminates solution 21. For the second objective function solution 6 eliminates solutions 5 and 6. Montusiewicz, 1999, gives a more detailed description of this method.

144


Fig. 2. Graphical illustration of the indiscernibility interval method.

Note that for selecting the representative subset of Pareto optimal solutions the minmax method as presented by Osyczka & Montusiewicz, 1994 can also be applied here. Note also that the method of selecting the representative subset of Pareto optimal solutions may be also used at the end of running any evolutionary algorithm multicriteria optimization method. In this case instead of making the decision on the basis of hundreds of Pareto optimal solutions generated by the evolutionary algorithm the decision maker chooses the most preferable solution from only several solutions, which are evenly distributed over the Pareto frontier.

4

Evolutionary Algorithm Method with Selecting the Representative Subset of Pareto Solutions

The idea of the method consists in reducing the set of Pareto optimal solutions using indiscernibility interval method after running a certain number of generations. This process can be called the filtration process in which less important Pareto optimal solutions are removed from the existing set. The steps of the method are as follows: Step 1. Set t = 1, where t is the number of the currently run generation. Step 2. Generate the set of Pareto optimal solutions using any evolutionary algorithm method. Step 3. Is the criterion for filtration the set of Pareto solutions satisfied? If yes, select the representative subset of Pareto solutions using the indiscernibility interval method and go to step 4. Otherwise, go straight to step 4.


145

Step 4. Set t = t + 1 and if t T, where T is the assumed number of generations, go to step 2. Otherwise, terminate the calculations. Note that if in the step 3 the answer is yes we start the process, which can be called the filtrating process since we filtrate and retain in the Pareto set only these solutions which are not close to each other in the space of objectives. Note also that in Step 3 the term the criterion for filtration is introduced. Three types of criteria can be used here: Type 1. The number of solutions in the Pareto set exceeds the assumed number P, for example 100. Type 2. The number of solutions in the Pareto set is assumed as P. The first filtration is made if the number of solutions in the Pareto set exceeds this number. The following filtration is made when P new Pareto optimal solutions is added to the set. Type 3. The filtration is made after running the assumed number of generations P and in this case the number of the solutions in the Pareto set is not controlled. These three types of criteria may produce slightly different results but generally all of them reduce the computation time significantly. The choice of the criterion depends on the problem to be solved. Using these three criteria the choice of P should be made with great care. If P is too small the number of Pareto solutions might not be representative for the problem and the evolutionary algorithm may not reach the real Pareto frontier. If P is too large we lose the effect of reducing the calculation time. Also the choice of the indiscernibility interval ui is very important. If ui is too small the number of rejected solutions is also too small and there is no effect in reducing the set of Pareto solutions, whereas too big a value of ui may make the subset of the obtained solutions to small too be representative.

5 Numerical Examples 5.1

Beam Design Problem

Let us consider the problem of optimum design of the beam the scheme of which is presented in Fig.3. The multicriteria optimization problem is formulated as follows: The vector of decision variables is:

x = [x1 , x 2 ,..., x N ]T , where xn is the thickness of the n-th part of the beam. The objective functions are: - the volume of the beam

f1 (x ) = bl ∑ xn N

n =1

146


- displacement under the force F: N i 3 − (i − 1)3  Fl 3  1  f 2 (x ) = + ∑  2 E  I1 n = 2 Ii  where

In =

bxn3 12

for n = 1, 2,..., N

F

x6

x5

x4

x3

l

l

l

l

x2

l

x1

l

b

Fig. 3. Scheme of the beam.

The constraints are: 6 F × nl

bx n2

≤

g

for n = 1, 2,..., N

0 ≤ x1 , x n ≤ x n +1 , x N ≤ d

for n = 1, 2,..., N-1

The problem was run for the following data: N = 6, l = 50[mm], b = 50[mm], F = 10000[N], E = 2.06 × 10 [N/mm ], sg=360[N/mm ], d = 32[mm] 5

2

2

The problem was considered as a continuous programming problem with the following ranges of decision variables: 12 < x i < 32 [mm] for i=1,2...6 The evolutionary algorithm parameters were as follows: - Number of generation T=1000

- Population size J = 100 - Crossover rate Rc = 0,6 - Mutation rate R m = 0,08 - Penalty rate r = 10 5 Experiments were carried out using indiscernibility interval u i =5% for i = 1,2,...,6 and for P = 100. The results of experiments are shown in Fig.4 in which Pareto frontiers for solutions without filtration and with filtration are compared for three types of the filtration criteria. The solutions depicted by black points are obtained while running


Fig. 4. Sets of Pareto optimal solutions for the beam design problem.

147

148


the evolutionary algorithm without filtration process whereas, depicted by almost white points are obtained while running the evolutionary algorithm with the assumed type of filtration. In Table 1 the number of generated Pareto optimal solutions obtained during each experiment and the computing time for each experiment are presented. From these experiments it is clear that using the indiscernibility interval method with the evolutionary algorithm the computation time may be reduced several times and still almost the same Pareto frontier is obtained, which in some parts is even better than the one obtained by the ordinary evolutionary algorithm. Table 1. Comparison of the results for different filtration types for the beam design problem.

Method Without filtration Filtration Type 1 Filtration Type 2 Filtration Type 3

5.2

Number of Pareto solution 2007 152 1102 207

Time [s] 608 29 184 34

Robot Gripper Problem Design

Let us consider an example of the optimum design of a robot gripper as formulated by Krenich and Osyczka, 2000. The scheme of the gripper is presented in Fig.5. For this T gripper the vector of decision variables is x = [ a,b,c,e,f,l,d] , where a,b,c,e,f,l, are dimensions of the gripper and d is the angle between b and c elements of the gripper. The geometrical dependencies of the gripper mechanism are (see Fig.6):  e  g = (l − z )2 + e 2 , φ = atan , l−z

a 2 = b 2 + g 2 − 2 ⋅ b ⋅ g ⋅ cos(β + φ ) , b 2 = a 2 + g 2 − 2 ⋅ a ⋅ g ⋅ cos(α − φ ) ,

 a2 + g 2 − b2   +φ , α = arc cos   2⋅a ⋅ g 

]

E

D

β

α

 b2 + g 2 − a2 β = arc cos 2⋅b ⋅ g 

δ

  −φ  

F H

)N

I

\

)N O

Fig. 5. Scheme of the robot gripper mechanism.


149

% E

D

δ

β ]

)N

H

φ

$

I

γ

&

φ

J

α

F

\ G

' O]

O

Fig. 6. Geometrical dependencies of the gripper mechanism.

The distribution of the forces is presented in Fig.7 and so we have:

R ⋅ sin(α + β ) = Fk ⋅ c , R =

P P ⋅b , Fk = ⋅ sin(α + β ) 2 ⋅ cos(α ) 2 ⋅ c ⋅ cos(α )

5 α

D 3

E

β

β

δ

F

α

)N

Fig. 7. Distribution of the forces in the mechanism of the griper.

Using the above formulas the objective functions can be evaluated as follows: - The first objective function is the difference between the maximum and minimum griping forces for the assumed range of gripper ends displacement:

f 1 (x ) = max Fk (x , z ) − min Fk (x , z ) z

z

- The second objective function is the force transmission ratio:

f 2 (x ) =

P min Fk (x , z ) z

Note that both objective functions depend on the vector of decision variables and on the displacement z. Thus for the given vector x the values of f1(x) and f2(x) can be evaluated by using a special procedure which finds the maximum of Fk (x , z ) and the

minimum of Fk (x , z ) for different values of z. This procedure makes the objective functions computationally expensive and the problem becomes more complicated than a general nonlinear programming problem.

150


From the geometry of the gripper the following constraints can be derived:

g1 (x ) ≡ Ymin − y (x , Z max ) ≥ 0 , g 2 (x ) ≡ y (x , Z max ) ≥ 0, g3 (x ) ≡ y (x ,0 ) − Ymax ≥ 0, g 4 (x ) ≡ YG − y (x ,0 ) ≥ 0, g5 (x ) ≡ (a + b )2 − l 2 − e 2 ≥ 0, g 6 (x ) ≡ (1 − Z max )2 + (a − e )2 − b 2 ≥ 0, g 7 (x ) ≡ 1 − Z max ≥ 0 where: y (x , z ) = 2 ⋅ [e + f + c ⋅ sin(β + δ )] displacement of the gripper ends,

Ymin – minimal dimension of the griping object, Y max – maximal dimension of the griping object, YG – maximal range of the gripper ends displacement, Z max – maximal displacement of the gripper actuator, D

E E D

H

E D

α O

α

H

O=PD[

Fig. 8. Constraints illustration a) constraint V, b) constraint VI.

The method was run using the following data: 1. Side constraints: 10 a 250, 10 b 250, 100 c 300, 0 e 50, 10 f 250, 100 l 300, 1.0 d 3.14. 2. Geometric parameters:

Ymin = 50 , Ymax = 100, YG = 50 , Z max = 50 , P = 100. Ymax = 100, 3. Parameters for the evolutionary algorithm: - Length of the string for every decision variable 18 bits. - Crossover rate pc = 0.6, - Mutation rate pm = 0.01, - Population size J = 400. - Number of generations T = 1000.


151

The problem was considered as continuous nonlinear programming problem. Experiments were carried out using indiscernibility interval u i = 5% for i = 1,2,...,6 and for P=100. The results of experiments are shown in Fig. 8 in which Pareto frontiers for solutions without filtration and with filtration are compared for three types of the filtration criteria. The solutions depicted by black points are obtained while running the evolutionary algorithm without filtration process whereas depicted by almost white points are obtained while running the evolutionary algorithm with the assumed type of filtration. In Table 2 the number of generated Pareto optimal solutions obtained during each experiment and the computing time for each experiment are presented. From these experiments it is clear that using the indiscernibility interval method with the evolutionary algorithm the computation time may be reduced several times and still almost the same Pareto frontier obtained, which in some parts is even better than the one obtained by the ordinary evolutionary algorithm. Table 2. Comparison of the results for different filtration types for the robot gripper design.

Method Without filtration Filtration Type 1 Filtration Type 2 Filtration Type 3

Number of Pareto solution 1882 308 247 270

Time [s] 682 83 67 69

6 Conclusions The paper deals with the problem of reducing the calculation time while generating the Pareto optimal solutions for multicriteria continuous nonlinear programming problems. The main idea of the presented approach is to maintain only a representative subset of Pareto optimal solutions while running the evolutionary algorithm based method. The indiscernibility interval method is applied to select a representative subset of Pareto optimal solutions. The results obtained using this method with the genetic algorithm indicate that the computation time can be reduced significantly and yet the real Pareto frontier obtained. The process of selecting the representative subset of Pareto optimal solutions can be called the filtration process in which less important Pareto optimal solutions are removed from the existing set. Three different types of the filtration processes can be performed and they are presented in the paper. All these types give a significant reduction in the computation time but from the experiments carried out so far it is difficult to recommended the best one. More experiments are needed and this will be the subject of future investigation. Acknowledgments. This study was sponsored by Polish Research Committee (KBN) under the Grants No. 7 T07A 07 19 and No. 7 T07A 08 19.

152


Fig. 9. Sets of Pareto optimal solutions for the gripper design problem.


153

References 1. Coello C. A. C. (1999) A Comprehensive Survey of Evolutionary-Based Multiobjective Optimization Techniques, Knowledge and Information Systems, Vol. 1, No. 3, pp. 269-308. 2. Krenich, S. & Osyczka, A. (2000): Optimization of Robot Grippers Parameters Using Geth netic Algorithms. The 13 CISM-IFToMM Symposium on the Theory and Practice of Robots and Manipulators. July 3-6, 2000, Zakopane, Poland. 3. Montusiewicz J. (1999) Division of the Set of Nondominated Solutions by Means of the Undifferentiation Interval Method, In: The Technological Information Systems, pp. 65-72, Societas Scientiarum Lublinensis, Lublin. 4. Osyczka A., Montusiewicz J. (1994) A Random Search Approach to Multicriterion Discrete Optimization, IUTAM Symposium on Discrete Structural Optimization, Springer-Verlag, pp. 71-79. 5. Osyczka A., Tamura H., Saito Y. (1997) Pareto Set Distribution Method for Multicriteria Design Optimization Using Genetic Algorithm, In: Proceedings of Engineering Design and Automation Conference, Bangkok, Thailand, pp. 228-231. 6. Osyczka A., Tamura H. (1996) Pareto Set Distribution Method for Multicriteria Optimization Using Genetic Algorithm, In: Proceedings of Genetic Algorithms ’96, (MENDEL-96)International Conference, Brno, Czech Republic, pp.135-143. 7. Steuer R.E. (1986) Multiple Criteria Optimization – Theory, Computation and Application, Wiley, New York.

Multi-objective Optimisation Based on Relation Favour Nicole Drechsler, Rolf Drechsler, and Bernd Becker Institute of Computer Science Albert-Ludwigs-University 79110 Freiburg im Breisgau, Germany email: ndrechsler,drechsler,[email protected]

Abstract. Many optimisation problems in circuit design, in the following also refereed to as VLSI CAD, consist of mutually dependent sub-problems, where the resulting solutions must satisfy several requirements. Recently, a new model for Multi-Objective Optimisation (MOO) for applications in Evolutionary Algorithms (EAs) has been proposed. The search space is partitioned into so-called Satisfiability Classes (SCs), where each region represents the quality of the optimisation criteria. Applying the SCs to individuals in a population a fitness can be assigned during the EA run. The model also allows the handling of infeasible regions and restrictions in the search space. Additionally, different priorities for optimisation objectives can be modelled. In this paper, the model is studied in further detail. Various properties are shown and advantages and disadvantages are discussed. The relations to other techniques are presented and experimental results are given to demonstrate the efficiency of the model.

1 Introduction Evolutionary Algorithms (EAs) become more and more important as a tool for search and optimisation. Especially for hard combinatorial problems they often have been applied successfully (see e.g. [Mic94,Dre98]). This type of problem is often encountered in Very Large Scale Integration CAD (VLSI CAD), since there often problem instances of several million components have to be considered. Multiple, competing criteria have to be optimised subject to a large number of non-trivial constraints. One strategy is to artificially divide a problem into a number of subproblems, which are then solved in sequence. Obviously, this is not a promising strategy if the objectives are conflicting. EAs are well suited for solving this kind of problems, when mutually dependent sub-problems are considered in parallel. One problem that arises when using EAs is to evaluate the solutions of a population. Thus it is necessary to determine a ranking of the elements to see which solutions are better than others. Traditionally, the evaluation is done by an objective function which maps a solution of multiple objectives to a single value. A classical method is the linear combination by weighted sum, where the value of each objective is weighted by a constant coefficient. The values of the weights determine how strong the specific objective influences the value of a single fitness value. Disadvantages are that e.g. the weights have to be E. Zitzler et al. (Eds.): EMO 2001, LNCS 1993, pp. 154-166, 2001. © Springer-Verlag Berlin Heidelberg 2001

Multi-objective Optimisation Based on Relation Favour

155

known in advance to find good solutions or have to be determined by experiments. Obviously, this is time consuming and not desirable, since the parameters resulting from different runs may vary, ending in “in-stable” algorithms [Esb96]. 1.1 Previous Work Advanced methods for ranking solutions with multiple objectives have been developed over the years. If priorities exist between the objectives, a simple lexicographic order can be used. (Information on lexicographic sorting of vectors can be found in standard mathematical literature.) In [Gol89] a method is described where solutions with multiple objectives without preferences can be compared. This is realised by a relation, called dominate. A solution x dominates y, if x is equal or better for each objective than y, and x is for at least one component strongly better than y. Thus, the solutions in the search space can be ranked by the relation dominate. This approach of ranking solutions is the core of many EA-tools for Multi-Objective Optimisation (MOO) [SD95,FF95,ZT99]. In [EK96] another approach is proposed, where the search space is divided in a satisfiable, acceptable, and invalid range. This model has successfully been applied to one specific problem in the area of VLSI CAD, but it requires user interaction. The designer has to specify the limits between satisfiable, acceptable, and invalid solutions. The limits have to be adapted during the program run to obtain high quality results. Recently, in [DDB99] a new model for ranking solutions of MOO problems has been proposed. A relation favour is defined analogously to dominate in [Gol89]. The search space is divided into several Satisfiability Classes (SCs). Thus the approach can be seen as a generalisation of the approach in [EK96] using a finer granularity. 1.2 Results In this paper the model from [DDB99] is studied in further detail. The relation favour in comparison to other models, like weighted sum and dominate [Gol89], is shown, e.g. favour is able to compare solutions which are not comparable using relation dominate. By this technique no user interaction is required any more. This is a very important aspect in VLSI CAD tools, since they are often so complex that it is very hard for a user to keep control. Furthermore, handling of priorities is also supported. Infeasible solutions are assigned to their own SCs depending on the objectives which are in an infeasible range. The SCs can be efficiently manipulated using operations on graphs. Finally, also experimental evaluations are given.

156

N. Drechsler, R. Drechsler, and B. Becker

2 Multi-objective Optimisation Problems In general, many optimisation problems consist of several mutually dependent subproblems. MOO problems can be defined as follows: Let ∏ be the feasible range of n solutions in a given search space. The objective function fc : ∏ → R + assigns a cost to each objective of a solution s, where fc(s) = (fc1(s),fc2(s),…,fcn(s)), with s ∈ ∏, n ∈N and R+ the positive real valued numbers1. To compare several multi-objective solutions superior points in the search space can be determined. In the following we restrict to minimisation problems. The relation n dominate is defined as proposed in [Gol89]. Let x, y ∈ R + be the costs of two different solutions. x dominates y (x (9) p p c2 = < b1 , b2 , b3 , ..., an , an+1 , bn+1 , ..., a2n , b2n > . One of these progenies will be selected according to their fitness values. Two Point Crossover. The two point crossover operator randomly selects two crossover points within a chromosome. Further, it interchanges the two parent chromosomes between these points (segment interchange) to produce the two new offsprings. Arithmetic Crossover. If git and gjt are two chromosomes of the population at generation t, then after arithmetic crossover two new chromosomes git+1 , gjt+1 at generation t + 1 are produced: git+1 = αgjt + (1 − α)git gjt+1

=

αgit

+ (1 −

(10)

α)gjt

α is either a constant (uniform arithmetical crossover), or a variable depending on the generation number (non-uniform arithmetical crossover). 2.3

Estimation of the Probabilities of Random Solutions

Using random sets of decision variables (weights) we extrapolated the number of function evaluations required by a random search method to obtain points on the Pareto front. We have found that a two-dimensional normal density function

Comparison of Evolutionary and Deterministic Multiobjective Algorithms

171

f (x) in some cases can be used to describe the distribution of these random points in the objectives space known also as bi-loss map for two objectives [10]. The density function is: 1 1 T −1 f (x) = exp − (x − µ) Σ (x − µ) (11) 2 2π | Σ |1/2 where

Σ=

σ11 σ12 σ12 σ22

(12)

with σ11 = σx2 and σ12 = σ21 = cov(x, y) = E[(x − µx )(y − µy )] = ρσx σy . E(x) is the expectation value of x, σx , σy are the variances in x and y respectively and ρ the correlation coefficient.

3

Results

The convergence of the Strength Pareto Evolutionary Approach algorithm (SPEA) [11] is shown in Fig. 1. For a breast implant with 250 sources the population averages of the surface and volume dose variances < fS > and < fV > are shown for 500 generations. A convergence is observed after 100 generations.

Fig. 1. An example of the convergence of < fS > and < fV > for the SPEA algorithm.

172

N. Milickovic et al.

In order to compare the efficiency of SPEA and the deterministic algorithms we have evaluated the probability to obtain at random a solution presented by these algorithms. We generated 2500000 random sets of weights. The distribution of these points in search space for a cervix implant with 215 sources is shown in Fig. 2. We use Powells optimization method [7] to fit the parameters σij , i, j = 1, 2 and µ of (12) to this distribution. The result is shown in Fig. 3 where the fit and the experimental value for bins with a non-zero number of entries is shown unfolded as a one dimensional distribution.

Fig. 2. Probability P (fS , f :V ) of a generation of a random point at fS ±0.05, fV ±0.05.

In Fig. 4 we show the probability distribution for the cervix implants of obtaining a solution at a point fS ± 0.05, fV ± 0.05. The distributions is shown for 100000 random solutions and for the non-dominated solutions from SPEA and the deterministic algorithm. The distribution of weights obtained for the gradient based optimization for the cervix implant is shown in Fig. 5. Only a small part of the weights is significant. Fig.6 like Fig.4 shows the result for a implant with 250 sources where the global Pareto front is closer to the majority of the random solutions in the search space. Consequently the difference between probabilities of the solutions of the deterministic and the SPEA algorithm is smaller. In all cases which we studied the Pareto fronts of the multiobjective evolutionary algorithms MOEAs are local and between the global Pareto front found


173

Fig. 3. A fit of a two-dimensional normal distribution.

Fig. 4. Probability distribution for a cervix implant with 215 sources for 100000 random, SPEA and deterministic algorithm solutions.

174


Fig. 5. Distribution of the weights for the deterministic algorithm for the importance factors wV = 0.0 and 0.3, see 4.

Fig. 6. Probability distribution for a breast implant with 250 sources for 100000 random, SPEA and deterministic algorithm solutions.


175

by the deterministic algorithms and the majority of random solutions in the search space. The shape of this set depends on the geometry of the implant and the topology of the sources. For implants with a large number of sources the majority of the random solutions is far from the the global Pareto front. K. Deb described some reasons why convergence to the true Pareto-optimal front may not occur: Multimodality, deception, isolated optimum and collateral noise [12]. For the objectives used multimodality can be excluded. The most important reason is the isolated minimum. Since only a extreme small part of the search space is located close to the true Pareto front it is not possible for the evolutionary algorithm to acquire information about the position of the Pareto front from crossover and mutation. As described in [13] code-substrings that have above average fitness values are sampled at an exponential rate for inclusion in subsequent generations. This does however not imply that a convergence to the global Pareto-front will occur. In contrast the gradient based algorithms use very efficient the information from local gradients and converge extremely fast to the Pareto-optimal front. Collateral noise seems to be present when there is an excessive noise coming from other parts of the solution vector. Without initialization the population moves smoothly and converges to a local Pareto front. If a small part of the population is initialized with solutions from the deterministic algorithm then members of the population cover a much larger part of the search space. This shows that the solutions require a extreme fine tuning of the decision variables which the conventional genetic operators used in this study can not handle. We analyzed the influence of different mutation and crossover operators, described previously in Methods, on the efficiency of different evolutionary algorithms. In all cases the parameters of 0.85 for the cross-over probability and 0.0065 for the mutation probability are used. The best coverage of objective space was obtained by using the geometric crossover. The mutation operator did not influence the evolutionary algorithm efficiency as much as the crossover. In order to compare the effectiveness of the evolutionary algorithms we generated 100000 points in the objective space from a corresponding number of random sets of weights. The efficiency of evolutionary algorithms highly depends on how far these random solutions are from the global Pareto front. In Fig. 7 the case of a prostate implant with 20 sources is presented. We can conclude that the random solutions cover the objective space very satisfactorily and approach the Pareto front. This means that the evolutionary algorithms should be able to produce Pareto sets which will converge toward the deterministic solutions. In different case, see Fig. 8, evolutionary algorithms could only theoretically approach the deterministic Pareto set after a extreme large number of generations. The Pareto set obtained by the evolutionary algorithms converges toward the global Pareto set better in the direction in which the majority of random solutions is nearer to the global Pareto set. In the case that the majority of random solutions in objective space is far from the Pareto global front, then the evolutionary algorithms produce only local

176


Pareto sets. An optimal set of parameters and genetic operators does not improve the convergence to the global Pareto set as significantly as an initialization with solutions from the deterministic algorithm. With only four deterministic solutions, see Figs. 7 and 8, the evolutionary algorithms reproduce the Pareto global front. We have found that the objective functions used in deterministic algorithms for this initialization need not to be exactly the same as used by the evolutionary algorithms. For example the avoidance of high dose values inside the PTV can be satisfied by a small dose variance inside the PTV. Another objective function which can be used is for this purpose is a penalty function which penalizes solutions with dose values above a given limit. In this case the deterministic gradient based algorithms due to the presence of local minima can not be applied. We analyzed the efficiency of different evolutionary algorithms compared with deterministic ones. The Pareto sets produced by SPEA, FFGA, FFGA with elitism [14],[15], and the niched Pareto algorithm (NPGA) [16], and the Pareto set evaluated by the Fletcher deterministic method, are compared. Pareto fronts from SPEA and FFGA with elitism are converging to the deterministic evaluated Pareto front much better than FFGA and NPGA, see Fig. 8. The main reason for this is the elitism implemented in the former two methods. In the case of multiobjective evolutionary algorithms it is important to save the nondominated solutions. Even in the case that the previously described initialization is applied, the non-elitistic algorithms do not produce better results as the algorithm does not ”remember” the external nondominated set. This means that an initialization of evolutionary algorithms requires the inclusion of elitism. For NPGA and FFGA an additional problem in comparison to SPEA is that a value for the sharing radius is required which can vary from case to case. The problem of the SPEA algorithm is that the extension of the Pareto front is not very large as FFGA. It does not cover the ”ends”, see Figs. 7 and 8, as the extension requires a fine tuning of the weights which can not be reached by the evolutionary algorithms, except if an additional initialization was made first. We usually run algorithms for up to 500 generations although the population converges to a local Pareto front as shown in Fig. 9 after 100 generations. The Pareto front is not significant modified even if the calculations has been extended up to 10000 generations in some cases. For implants with 200 and more sources, the computation time with 10000 generations requires up to 10 hours. We solved this problem by initialization of four members of the initial population with solutions from deterministic algorithm. In this case, the algorithm converges to the deterministic evaluated Pareto set in less than 100 generations. Even if we could use for other objectives a weighted sum approach with deterministic algorithms, this would require to use a very large number of weights to reconstruct the Pareto set, especially with increasing number of objectives. Here the evolutionary algorithms in combination with deterministic methods are more effective in generating non dominated solutions.


177

Fig. 7. An example of the distribution of 100000 random solutions in objective space for a prostate implant with 20 sources. The Pareto set obtained by the deterministic algorithm is presented by the line. The non dominated solutions of SPEA and FFGA with elitism are shown without initialization. For SPEA additional the Pareto set is show if four members of the population are initialized with solutions from a deterministic algorithm.

4

Conclusions

We have compared standard multiobjective evolutionary algorithms with deterministic optimization methods with objectives such that a weighted sum approach can be used to obtain the global Pareto fronts. This comparison was done for the dose-optimization problem in HDR brachytherapy. The number of decision variables can be as high as 300. From the distribution of random generated weights we were able to estimate in some cases the probabilities of generating randomly a point in the objective space. This enabled us to estimate the performance of the multiobjective evolutionary and the deterministic algorithms in comparison to a random search. The evolutionary algorithms have been found to be a factor 105 − 1012 more effective than a random search. The deterministic are more efficient which exceeds in some cases 1030 . This could explain why evolutionary algorithms were not able to generate solutions close to the global Pareto front. The Pareto front reached depends on the probability of generating a point in the objective space. The evolutionary algorithms with the standard genetic operators described in this work are not able to significantly improve the performance. An initialization from deterministic algorithms improves the performance and helps to reconstruct the Pareto front around the initial seeds of the deterministic algorithm.

178


Fig. 8. An example of the SPEA algorithm for the case of a breast implant with 250 sources. The majority of random solutions in the objective space is very far from the global Pareto front.Without initialization the evolutionary algorithms do not reach the Pareto front. The path of the deterministic algorithm is shown for a set of fixed weights.

Our previous results of evolutionary algorithms with objectives where gradient based deterministic algorithms can not be used showed that the results were compatible or even better than by other phenomenological dose-optimization methods [1]. With this study we have found that if a part of the population is initialized with a good initial estimate of the Pareto front, that the results of the evolutionary algorithms improve significant more better than by any optimization of the GA parameters. We do not know if there are special genetic operations which if applied could fill the gap between the Pareto fronts found by the evolutionary and deterministic algorithms. It seems that the global solutions requires a fine tuning of the decision variables which is far beyond what evolutionary algorithms can achieve in an acceptable number of generations. If a part of the population reaches via initialization a part of this region then the evolutionary algorithm is able to find solutions around this region. A weakness of the MO evolutionary algorithms is the large number of function evaluations required to obtain a reasonable good local Pareto front. In the past MOEAs were compared for problems involving only very few decision variables. In such cases a random set of a few thousand sets of decision variables covers a large part of the objective space and evolutionary algorithms are able to produce fast solutions very close to the global Pareto front. The population size increases the efficiency of the MOEA algorithms by generating solutions


179

Fig. 9. An example of the SPEA algorithm for the case of an breast implant with 250 sources. The convergence in the objective space is presented at different number of generations t.

closer to the global Pareto set although population sizes of more than few hundred are not very practical and useful. In problems like in brachytherapy with up to 300 decision variables points close to the global Pareto front are in some cases of extreme low probability. In this case the evolutionary algorithms can not reach these regions whereas deterministic algorithms using information from local gradients are guided into these regions after only 10-20 iterations. In each such iteration a few times a line minimization is performed. We have considered here only a simple coupling of the deterministic algorithm which delivers some optimal solutions as a starting point. We have found that the performance of the MOEA algorithms is significantly enhanced even if the initial solutions are obtained using different objectives for the deterministic algorithm. In the past algorithms were proposed where the evolutionary algorithms produce starting points for deterministic algorithms. Another possibility is to use a hybrid version of the evolutionary and deterministic algorithms. There are version where a hill-climbing operator is applied, with some probability which could be adapted to the performance of the algorithm. We have estimated in some cases the performance of the MOEAs from Monte Carlo sampling experiments. We will in the future consider other approaches such as simulated multiobjective annealing where an external population is filled with the nondominated solutions found. This population is used in the optimization process by picking random members as starting points. We have to compare if

180


such an algorithm with a single member can produce better results than MOEAs where it is assumed that the performance can be explained by mechanisms such as the implicit parallelism. Acknowledgments. We would like to thank Dr. E. Zitzler and P. E. Sevin¸c for the FEMO library. This investigation was supported by a European Commission Grant (IST-1999-10618, Project: MITTUG).

References 1. Lahanas, M., Baltas, D., Zamboglou, N.: Anatomy-based three-dimensional dose optimization in brachytherapy using multiobjective genetic algorithms. Med. Phys. 26 (1999) 1904–1918 2. Lahanas, M., Milickovic, N., Baltas, Zamboglou, N.: Application of multiobjective evolutionary algorithms for dose optimization problems in brachytherapy. These proceedings 3. Bazaraa, M. S., Sherali, H. D., Shetty, C. M.: Nonlinear Programming, Theory and Algorithms. Wiley, New York. 1993 4. Zitzler, E., Deb, K., Thiele, L.: Comparison of Multiobjective Evolutionary Algorithms: Empirical Results. Evolutionary Computation. 8 (2000) 173–195 5. Yang, G., Reinstein, L. E., Pai, S., Xu, Z.: A new genetic algorithm technique in optimization of permanent 125 I prostate implants. Med. Phys. 25 (1998) 2308–2315 6. Yu, Y., Schell, M. C.: A genetic algorithm for the optimization of prostate implants. Med. Phys. 23 (1996) 2085–2091 7. Press,W. H., Teukolsky,S. A., Vetterling, W.T., Flannery,B. P.: Numerical Recipes in C. 2nd ed. Cambridge University Press, Cambridge, England. 1992 8. Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs. Springer Verlag. 1996 9. Vicini, A., Quagliarella, Q.: Airfoil and wing design through hybrid optimization strategies. American Insitute of Aeronautics and Astronautics. Report AIAA-982729 (1998) 10. Das, I. Dennis, J.: A Closer Look at Drawbacks of Minimizing Weighted Sums of Objectives for Pareto Set Generation in Multicriteria Optimization Problems. Structural Optimization 14 (1997) 63–69 11. Zitzler, E., Thiele, L.: Multiobjective Evolutionary Algorithms: A Comparative Case Study and the Strength Pareto Approach. IEEE Transactions on Evolutionary Computation. 37 (1999) 257–271 12. Deb, K.: Multi-objective Genetic Algorithms: Problem Difficulties and Construction of Test Problems. Evolutionary Compuation 7 (1999) 205–230 13. Holland, J. H.: Adaptation in Natural and Artificial Systems. Ann Arbor, Unicersity o Michigan Press. 1975 14. Fonseca, M., Fleming, P. J.: Multiobjective optimization and multiple constraint handling with evolutionary algorithms I: A unified formulation Research report 564, Dept. Automatic Control and Systems Eng. University of Sheffield, Sheffield, U.K., Jan. 1995 15. Fonseca, M., Fleming, P. J.: An overview of evolutionary algorithms in multiobjective optimization. Evolutionary Computation 3 (1995) 1–16 16. Horn, J., Nafpliotis, N.: Multiobjective optimization using the niched Pareto genetic Algorithm. IlliGAL Report No.93005. Illinois Genetic Algorithms Laboratory. University of Illinois at Urbana-Champaign, 1993

On The Effects of Archiving, Elitism, and Density Based Selection in Evolutionary Multi-objective Optimization Marco Laumanns, Eckart Zitzler, and Lothar Thiele ETH Zürich, Institut TIK, CH–8092 Zürich, Switzerland, {laumanns,zitzler,thiele}@tik.ee.ethz.ch, http://www.tik.ee.ethz.ch/aroma

Abstract. This paper studies the influence of what are recognized as key issues in evolutionary multi-objective optimization: archiving (to keep track of the current non-dominated solutions), elitism (to let the archived solutions take part in the search process), and diversity maintenance (through density dependent selection). Many proposed algorithms use these concepts in different ways, but a common framework does not exist yet. Here, we extend a unified model for multiobjective evolutionary algorithms so that each specific method can be expressed as an instance of a generic operator. This model forms the basis for a new type of empirical investigation regarding the effects of certain operators and parameters on the performance of the search process. The experiments of this study indicate that interactions between operators as well as between standard parameters (like the mutation intensity) cannot be neglected. The results lead not only to better insight into the working principle of multi-objective evolutionary algorithms but also to design recommendations that can help possible users in including the essential features into their own algorithms in a modular fashion.

1

Introduction

Evolutionary algorithms have shown to be a useful auxiliary tool for approximating the Pareto set of multi-objective optimization problems. Several surveys of evolutionary multi-objective algorithms can be found in the literature, e.g., [5,17,1], which reflects the large number of different evolutionary approaches to multi-objective optimization proposed to date. While most of these algorithms were designed with regard to two common goals, fast and reliable convergence to the Pareto set and a good distribution of solutions along the front, virtually each algorithm represents a unique combination of specific techniques to achieve these goals. As a consequence, there are no common guidelines available, how to best tailor an evolutionary algorithm to an application involving multiple objectives. Recently, some researchers have tried to address this problem by carrying out extensive comparative case studies, which can roughly be divided into two different categories. The first group compares different algorithms [17,8,19,18,20], but as the algorithms usually differ in more that just one aspect, it is very difficult to identify the features which are mainly responsible for the better performance of one algorithm over another. On the contrary, a few other studies take one algorithm and focus on a specific operator or parameter to tune, e.g. the selection method [10,12]. In this case the results are valid for the algorithm E. Zitzler et al. (Eds.): EMO 2001, LNCS 1993, pp. 181–196, 2001. c Springer-Verlag Berlin Heidelberg 2001

182

M. Laumanns, E. Zitzler, and L. Thiele

under concern and highly dependent on the other algorithmic parameters. Hence, it has remained open up to now – how a certain parameter or a certain operator affects the overall performance independent of the specific implementation and the other techniques used, and – how the parameters and operators influence each others’ performance. The reason why these questions cannot be answered easily is the vast number of details by which the various implementations differ. To overcome this difficulty, in a first step we have developed a unified model representing a general structure that most algorithms have in common; this allows to assess important algorithmic features by separating them from the implementations-specific details [9]. Based on this model, we here investigate archiving, elitism, and density estimation methods and present an appropriate statistical methodology to identify significant effects and interactions, which will be carried out for the example of the knapsack problem. Section 2 starts with the classification of the key concepts in evolutionary multiobjective optimization and the description of the model. The experimental design is explained in section 3. In the remaining parts, experiments focus on the key parameters and operators in multi-objective evolutionary algorithms: Section 4 describes the notion of elitism and investigates the benefits of elitism and the interactions with mutation. In section 5 we deal with archiving methods and different possibilities to limit the size of the archive. In section 6 we investigate different density estimation techniques and how they can be used to guide the selection of parents for the next generation. Finally, we discuss the results and their implications for the design of multi-objective evolutionary algorithms.

2 2.1

Background Issues in Evolutionary Multi-objective Optimization

Fig. 1 gives an overview on the different techniques that are applied in most multiobjective evolutionary algorithms. Though some are also used in single-objective optimization (e.g. fitness sharing), most of the features are especially devoted to the task of maintaining a diverse set of solutions in an multi-dimensional objective space. Many multi-objective evolutionary algorithms maintain a secondary population – or archive – parallel to the normal offspring population [17, pp.3-26–3-28]. Generally, an archive can be used to store any kind of useful information gathered during the run, but in most cases it just contains non-dominated solutions and therefore approximates the Pareto set. If the archived solutions reproduce as well, we say the algorithm uses elitism. Recent studies suggest that the use of elitism improves multi-objective evolutionary algorithms [10,12,18]. Another issue is the assignment of fitness values to the individuals. In this study we concentrate on Pareto-based methods because of their acknowledged advantages over aggregation and population-based methods [5]. Different techniques inferring a scalar value from the partially ordered objective vectors include the dominance level (or nondominated sorting [6,15]), the dominance grade or rank [4] and the ’strength’ measure [20]. Some algorithms use a further means to reach a better or more uniform distribution

On The Effects of Archiving, Elitism, and Density Based Selection population

population + archive

Population structure

no archive

bounded archive

unbounded archive

Archiving

only from population

from population and archive

only from archive

Selection / Elitism

dominance level

dominance grade

density based (e.g. fitness sharing)

others (e.g. strength)

none

183

Primary Fitness

Secondary Fitness

Fig. 1. A taxonomy of techniques in multi-objective evolutionary algorithms, the arrows indicate existing combinations.

of solutions: Individuals receive a secondary fitness value, mainly based on the density of search points near them. This density value can then be used to modify the primary fitness, e.g. via fitness sharing. 2.2 The Unified Model The framework we use in this study is based on the Unified Model for Multi-objective Evolutionary Algorithms (UMMEA [9]), which is characterized by a decomposition of algorithms into abstract operators. Existing techniques can be classified, formalized, and mapped onto the operators. Hence, it is not only possible to emulate the behavior of specific algorithms, but also to combine the different techniques arbitrarily, which is important for our statistical analysis. The main concept of this model is the coexistence of a ’normal’ offspring population (B, |B t | = b) and an archive of ’elite’ individuals (A, |At | ≤ a), which represents the current approximation of the Pareto set. All modifications of these multi-sets of individuals can be expressed by (stochastic) operators that can be arbitrarily combined in a modular fashion. Fig. 2 shows the generic algorithm based on this model (left) and a schematic view of the transition of one generation to the other (right). The initialize operator usually sets the archive A0 to the empty set and B 0 to a random sample of the search space. If the archive size is bounded (1 ≤ a < ∞), a strategy must be defined to deal with more non-dominated solutions than can be stored. This is done by the truncate operator. The ’elitism intensity’ is modeled by the parameter pe , which represents the probability to select a parent from the archive instead of the normal population. As long as the termination predicate is not satisfied, the archive and the population are evolved. In each iteration, the update operator updates the archive with individuals from the current offspring population; usually, only non-dominated solutions are stored. In the adapt operator, possible control mechanisms for the elitism intensity can be modeled, but in this study we leave pe constant during the run.

184


t := 0 (A0 , B 0 , p0e ) := initialize() while terminate(At , B t , t) = f alse do t := t + 1 At := truncate(update(At−1 , B t−1 )) pte := adapt(At , B t−1 , pt−1 ) e B t := vary(sample(evaluate(At , B t−1 , pte ))) end while

Population B t-1

Archive A t-1

1-pe

evaluate sample vary

New Population Bt

pe

update truncate

New Archive A t-1

Fig. 2. Left: The general algorithm based on the unified model, At denotes the archive, B t the population and pte the elitism intensity at generation t. Right: A schematic view of the transition from one generation to the other.

The evaluate operator calculates the target sampling rates for each individual depending on the individuals in the archive and the population. For example, the primary fitness of individuals is derived from their rank with respect to their dominance level, usually referred to as ’non-dominated sorting’ [15]. From these ranks, the sampling rates of an individual b in a set of individuals (population) B are calculated to simulate binary tournament selection. According to these sampling rates, the sample operator then selects the required number of individuals from both the archive and the population as parents of the next generation. These parents are finally modified in the vary operator, where both recombination and mutation take place. In this study we use use one-point crossover and constant mutation rates σmut .

3

Experimental Design

Our aim is to investigate how the quality of the Pareto set approximation of the algorithms depends on certain algorithmic variables or parameters. This is a challenging task since the design space of the algorithm is huge and the performance indicators are noisy. In this study we pursue a novel approach which will be explained next, followed by a short descriptions of the test problem and the performance measure. 3.1

Methodology

In the design of an algorithm and specifically in the instances of our unified model, we face different types of design variables. In order to investigate the effect of these (independent) variables on the performance of the algorithm, we want to deal with all of them simultaneously in a common framework. For this purpose we distinguish – ordinal, continuous variables (like the elitism intensity pe ) – ordinal, discrete variables (like the population size) – categorical variables (like different operators)

On The Effects of Archiving, Elitism, and Density Based Selection

185

Categorical variables are mainly given by different operator instances, e. g. the archive limitation strategy in truncate. For each experiment, we first decide on the variable(s) whose influence is to be assessed, and fix all other variables to some standard or optimal value from previous experiments (if those are available). The free variables are then varied randomly in their respective domain, and from each setting one observation of the performance indicator is drawn, i. e. the EA run once with with each setting.1 After a large number of data has been collected in this manner (usually 1000 observations per experiment), we look for a linear model that yields a good description of the data. The general form of this model for the i-th observation is (1)

V i = a0 + a1 · xi

(2)

+ a2 · xi

(n)

+ . . . + an · xi

+ Ei

(1)

where x(1) , . . . , x(n) are the explanatorial variables and V i is the response (or target variable) – in our case the performance value. Ei are the random error caused by the randomness in the algorithm itself.2 The variables x(j) , 1 ≤ j ≤ n of the model can be any transformation or combination of original variables. Thus, the model is only linear in the coefficients, and non-linear dependencies from the variables (which are very likely for complex systems like evolutionary algorithms) can easily be traced. It furthermore allows to include the categorical variables, which have no natural value or order. This is done by indicator variables, where one variable is used for each category. If an observation falls into a specific category, the respective indicator variable is set to one, otherwise to zero. The coefficient of this indicator variable then shows the difference in the response that is caused by this category. If only categorical variables were used, this method would be equivalent to analysis of variance (ANOVA), which has been applied to parameter studies of evolutionary algorithms by Schaffer et at. [14]. Here, we try to keep variables in their respective domain and want to use the order of the variables wherever possible. From the models we can then identify, which variables significantly effects the algorithmic performance. 3.2

Multi-objective 0/1 Knapsack Problems

To study the performance of different algorithmic configurations the multi-objective 0/1 knapsack problem is used, which has been subject to recent empirical case studies, both in the evolutionary computation community [19,8] and in the field of multiple criteria decision analysis [16]. The multi-objective 0/1 knapsack problem is a function of the form k : {0, 1}n 7→ m IR , where n is the number of decision variables and m the number of objectives. In this work we refer to the definition in [19] and use the same parameters for the weights 1

We prefer this over doing replications with identical settings for it leads to a better distribution of samples in the design space of the algorithm. 2 In order for a linear regression to be viable, the random errors are assumed to be independent and identically distributed by a normal distribution with zero mean and equal variance. In this study ˜ i, we verified these assumptions using graphical diagnosis tools for the residuals Ri = Vi − V like Normal plot and Tukey-Anscombe plot. Generally, an appropriate transformation of the target variable V led to the desired results.

186


and profits of the items and the same constraint handling technique. Here we restrict ourselves to the bi-objective case as a baseline for further comparison, an extension of the experiments to m > 2 is straightforward. The number of decision variables and the allowed number of objective function calls is depicted in Table 1. Each individual represents one decision alternative as a bit-sting of length n. 3.3 Performance Measure For the quality or performance measure V we apply a volume based approach according to [20] with slight modifications. Here, a reference volume between the origin and an utopia point – defined by the profit sums of all items in each objective – is taken into account. The aim is to minimize the fraction of that space, which is not dominated by any of the final archive members. We consider this as the most appropriate scalar indicator since it combines both the distance of solutions (towards some utopian trade-off surface) and the spread of solutions.

4

Elitism

This section focuses on the influence of elitism and its possible interdependence with the mutation intensity. To isolate these effects, no truncation of the archive (a = ∞) and no density dependent selection is applied, i.e. the evalutate operator assigns sampling rates only on the basis of the dominance level. Here, elitism in the sense of [9] is assumed, i. e. the best individuals are not only stored permanently, they also take part in the selection of offspring. Our previous study indicated that there may be interaction between the mutation strength and the benefit of elitism. As in the original version of UMMEA, the elitism intensity is characterized by a parameter pe ∈ [0, 1] which basically represents the probability to select a parent individual from the archive instead of the previous offspring population. This concept allows us to emulate the different elitist multi-objective evolutionary algorithms which have been proposed so far. 4.1

Experiments

In the first experiment, we vary pe randomly and uniformly in [0, 1] and the mutation rate between 1/n and 10/n. The regression analysis shows significant interactions between the elitism intensity pe and the normalized mutation rate σ = σmut · n, where σmut denotes the mutation probability for each of the n bits. σ now gives the expected number of changed bits per mutation of an individual. The interactions are clearly visible in Fig. 4: For low mutation rates σ < 2, the performance decreases monotonously with pe , while for σ > 5 the performance increases with pe . The region around the critical mutation rate σ ≈ 3 has the lowest variance in performance. However, the best results Table 1. Different instances of the knapsack problem and default parameters for this study. Knapsack Problem Decision variables n Maximal objective function calls Standard population size b

KN1 250 40,000 150

KN2 KN3 500 750 80,000 120,000 200 250

0.55

0.55

median of V 0.53 0.54

median of V 0.53 0.54


sigma

0.0-0.1

pe 0.1-0.3

0-1

1-3

3-5

0.3-0.5 0.5-0.7

0.52

0.52

1-2 8-10 2-4 4-6 6-8 5-7 7-9 9-10 pe ⋅ 10

187

0.7-0.9 0.9-1 1-2

2-4

4-6 6-8 sigma

8-10

Fig. 3. Interaction plots for the combined influence of the mutation rate σ and the elitism intensity pe on V for the knapsack problem with n = 750. The median for each combination is shown.

are achieved on either sides: There is a local optimum at σ ≈ 1 and pe ∈ [0, 0.1] and a global optimum around σ ≈ 6 and pe = 1, while their difference seems to increase with n (see Fig. 4). These results show that elitism is not always beneficial, it can even be harmful, if the mutation rate is too low, which is surprisingly the case for the popular rule σmut = 1/n. Nevertheless, the best results are achievable for pe = 1. At this point we refer to two other studies, which compared different algorithms on the same test problems. In [20], a constant mutation rate of σmut = 0.01 was used for all algorithms, and the advantage of the elitist SPEA (Strength Pareto EA, [20]) became more visible with increasing problem size. This may be explained as follows: A mutation rate of 0.01 leads for n = 250 to σ = 2.5, which is still not high enough to make the influence of elitism strong. For n = 500 and n = 750, however, the values are σ = 5 and σ = 7.5, respectively, and thereby in a range where elitism is very important. In [8] the performance of SPEA was improved by increasing the archive size relative to the population and (due to the specific selection method used) implicitly the elitism intensity from 0.36 to 0.96. According to our findings this is crucial especially when a mutation rate of 0.01 is used on the knapsack problem with n = 750. These observations support the assumption that non-elitist EA only work well, if the mutation strength lies under a certain threshold [11]. Otherwise selection is no longer able to compensate the low success rate of mutation to create dominating individuals, which usually decreases as the mutation rate increases. For multi-objective problems, where the success rate also decreases with the number of objectives, this can pose a further problem: For high dimensional objective spaces, no mutation rate may exist for which non-elitist algorithms lead to positive progress, unless the population size is very large and a high selection pressure is used. On the other hand, elitist EAs have a significantly higher optimal mutation rate, which in turn increases with the elitism intensity. Here, the archived solutions preclude divergence. 4.2

Key Results

The main observation is that the usefulness of elitism strongly depends on the mutation strength:

188


Fig. 4. Estimated response surface of the performance measure V to the normalized mutation rate σ and the elitism intensity pe for n = 750. Two local minima arise at (pe = 1, σ ≈ 6) and (pe = 0, σ = 1). A third order orthogonal polynomial was used as the model, the coefficients were estimated via linear regression.

– If the usually recommended mutation rate σ = 1 is taken, the best performance is achieved without elitism (pe =0). – The best overall performance can be reached with strong elitism (pe > 0.7) in combination with high mutation rates (σ ≈ 5). – The combination of strong elitism with low mutation rates or weak elitism with high mutation rates shows the worst performance.

5

Bounding the Archive Size

In the previous section the influence of the mutation rate and the elitism intensity has been explored under the assumption that the archive is unbounded and can contain all non-dominated individuals found so far. In some cases, however, it may be desirable – or even mandatory – to limit its size for several reasons: – The size of the true non-dominated set of the multi-objective problem may be exponentially large or even infinite. – All implementations are restricted to limited resources (i. e. storage space). – The complexity of the archive updating operator increases with the archive size. – Genetic drift can occur since over-represented regions of the search space are favored in the (uniform) sampling process. While the first three points mean that one has to limit the archive size for practical considerations though it would ideally be unlimited, the last point indicates that a (useful) truncation of the archive may also lead to a performance gain. In the following we set the maximum archive size a := b and examine how different archive truncation methods affect the algorithmic performance.


189

5.1 Truncation Operators Rudolph and Agapie [13] provide theoretical results about convergence properties of different archiving and selection strategies for multi-objective optimizers in finite search spaces. The authors state that algorithms with unlimited archive sizes do have the desired convergence properties provided that the variation operators match certain preconditions. However, they are usually not of practical relevance because of limited resources. Instead, they propose an updating operator that respects a maximum archive size via a strong elite preserving strategy, thus keeping the desired convergence properties. In our experiment this operator is named truncate1 , and it assures that for each dominated former archive member, at least one dominating individual must be included in the new archive. In contrast, the operator truncate2 just makes a random choice which individuals to delete. Another possibility to reduce the archive size is clustering: The possible members of the archive are grouped into distinct clusters based on some similarity measure. Then, each cluster will be represented in the archive by certain individuals. Clustering-based approaches are not strongly elite preserving, and they can be very time consuming. Many algorithms are based on iterative melioration of a given partitioning according to a predefined necessary optimality condition and can therefore lead to partitions which are only locally optimal. Clustering-based archive reduction is used in SPEA [20]: The individuals are clustered by the average linkage method into a distinct clusters, from which the centroid individual is included in the new archive. Here, we implement this as the truncate3 operator. Other approaches to limit the archive size can roughly be categorized as density dependent ranking techniques. We will discuss density estimation later in the context of biasing selection. The idea for this concept is quite intuitive: Though the archive must be truncated, one would like it to be as ’diverse’ as possible. Hence, individuals in a densely populated area receive lower values and are discarded from the archive in favor of others. Different implementations of this concept are applied in [12], [7], [8], [2], or [3]. In this study we represent the method used in NSGA-II [3] by the operator truncate4 : For each objective coordinate the absolute difference of its predecessor and successor is aggregated for each individual, higher total values lead to better ranks. Table 2 gives an overview of these different techniques and the implementations we use in our experiments. As a baseline, the truncate0 operator is included, which represents the unlimited archive. 5.2

Experiments

At first two experiments were carried out where the normalized mutation rate was fixed at σ = 1 and σ = 4, respectively, while for each trial pe was again varied randomly in [0, 1] and one of the four truncate operators was picked with equal probability. For σ = 4 the truncate operator had no significant effect on the results at all. This is not surprising since in these cases the archive size rarely exceeds a. For the small mutation rate σ = 1, where we had very large archives in the experiments before, the effect of the truncate operator becomes significant. Fig. 5 (left) shows the box plots for the different operators. However, there is a strong interaction with the elitism intensity: The effect of the truncate operator increases with pe . Once again, if the archive is not

190


Table 2. Archive truncation methods in multi-objective evolutionary algorithms and operator instances for this study. Method No Reduction Operator truncate0 Examples VV [13] PR [13]

may grow very large, genetic drift

Density-based truncate4 PAES [7] M-PAES [8] PESA [2] NSGA-II [3] efficiency easy good good preserving, implementation, discrimination, discrimination, unreachable low complexity, adaptive metrics, medium points genetic drift high complexity complexity

pe

median of V 0.520 0.525

0.53

0.52

0.8 - 1.0 0.6 - 0.8 0.4 - 0.6

0.515

V for KN2, sigma=1

0.54

0.51

0.50

Clustering truncate3 SPEA [20]

0.530

Features

Conservative Random truncate1 truncate2 AR-1 [13] AR-2 [13]

0.2 - 0.4 0.0 - 0.2

0

1

2 3 truncate operator

4

0

1

2 3 truncate operator

4

Fig. 5. Left: Box plots for n = 500, σ = 1 and different truncate operators. The boxes range from the lower to the upper quartile of the observations, the median is marked with a bold line, outliers with an asterisk. The notches show confidence intervals for the group medians, by not overlapping they indicate a difference in location on a rough 5% significance level. Right: Interaction plots for the combined influence of the truncate operator and the pe level on V. The median for each combination is shown.

used in the reproduction of offspring (pe = 0), the effect of the truncate operator is the weakest, this can be visualized by the interaction plots in Fig. 5 (right). As a result we can claim that, if a reduction of the archive is necessary, is should be done carefully to minimize information loss. The random choice is always worst. In no case was the clustering approach significantly inferior to the unbounded archive, while it was the best for large pe and low σ = 1. This shows that a ’good’ reduction method is able to bias the search in favor of under-represented regions. Surprisingly, the density-based method does not reach significantly higher V values than the conservative method. The reason may be found in the specific technique, which has difficulties to deal with identical objective vectors, and not in this type of reduction method. Nonetheless, there are other methods which directly influence the sampling rate of individuals based on their density, these will be discussed in the next section. One of the questions will be whether density dependent selection itself will lead to a higher performance gain than archive reduction.


5.3

191

Key Results

Depending on the choice of the truncation operator, archive reduction can either decrease or increase the performance: – The clustering-based method leads to an increase of the average performance over the whole range of pe and σ values. In other words: Clustering reduces the algorithm’s sensitivity to suboptimal parameter settings without, however, a further improvement for the optimal settings. – Random truncation lead to a significantly worse performance than the conservative method, which in turn was not significantly worse than the unbounded archive.

6

Density Dependent Selection

In multi-objective optimization, a uniform distribution of efficient points may be desirable in general. Unfortunately, the randomness in the evolutionary operators (genetic drift), the granularity of the search space or the topology of the objective function can make the archived solutions as well as the population itself exhibit a rather non-uniform distribution. A uniform sampling from the archive even reinforces these effects: Overrepresented regions will be sampled by parents more often, and - given at least a certain locality of the variation operators - more offspring will be produced there. One way to tackle this problem indirectly can be through a reduction of the archive, as described in the last section. A more direct approach, however, would be to bias the selection process in favor of under-represented regions. This will then be independent of the actual archive size and is much more flexible. 6.1

Density Estimation Methods

The density of individuals in a set A can serve as an a posteriori estimate of the probability density for the creation of the individuals in this set. This probability distribution is usually implicitly defined by the stochastic process which governs the evolutionary algorithm. However, it can easily be estimated (using standard probability density estimation techniques) and then be used to bias the sampling rates accordingly. The relevance of density estimation in the context of (multi-objective) evolutionary algorithms has been put forward by [5], where the authors noted that the standard fitness sharing concept is essentially the application of a kernel density estimator. In [4], existing results from kernel density estimation were used to derive guidelines for the fitness sharing parameters. Many advanced multi-objective evolutionary algorithms use some form of density dependent selection. Furthermore, nearly all techniques can be expressed in terms of density estimation, a classification is given in Table 3. We will make use of this as a further step towards a common framework of evolutionary multi-objective optimizers, and present the relevant enhancement of the unified model. A straightforward density estimate is the histogram: The (multi-variate) space is divided into equally sized cuboids, and the number of points inside a cuboid is the estimate of the density for this subspace. Here we apply this technique in the evaluate1 operator. Kernel density estimation is represented in evaluate2 by the niche count function

192


Table 3. Density estimation techniques in multi-objective evolutionary algorithms and operators used in this study. Method Operator Examples

None Histogram Kernel evaluate0 evaluate1 evaluate2 PAES all algorithms M-PAES with PESA fitness sharing

Features: continuous smoothing control

Nearest Neighbor evaluate3 NSGA-II

no as kernel function no bin width window width local density

0.54 0.53

0.53 0.52

V 0.52 0.51

0.51 0.50

0.50 0

1

2

evaluate

3

0

1

2

3

evaluate

Fig. 6. Box plots for n = 500, σ = 1 (left) and σ = 4 (right) for different evaluate operators. For n = 250 and n = 750 the plots a similar.

known from standard fitness sharing. The evaluate3 operator uses the technique from NSGA-II, where the distances to neighboring individuals is used to calculate a volume around each individual. The reciprocal value of this volume then serves as an estimate of the density, which is typical for nearest neighbor density estimates. For the calculation of the target sampling rates, the normalized density estimate for each solution is added to its basic cost. If the minimal basic cost difference of differently valued solutions is at least 1 (like in our case of the dominance level), it will be assured that lower valued individuals always receive lower sampling rates regardless of their density. Thus, this method is used to bias selection only between equally valued individuals. Finally, a rank based assignment of target sampling rates is performed as before. 6.2

Experiments

In order to first investigate the effect of the density estimation alone, the elite preserving truncate1 operator is used3 and the maximal archive size is set to a := b. σ ∈ [1, 10] and pe ∈ [0, 1] are again chosen randomly. The evaluate0 operator is the reference case, where no density estimation is applied. In contrast to the previous section, the influence of the evaluate operator is now significant for the whole range of σ ∈ [1, 10]. Figure 6 shows the box plots, again for 3

We chose this as the common baseline since it did not show significant differences to the unlimited archive.


193

Fig. 7. Interaction plots for n = 500 for different evaluate operators. The upper row shows no density estimation (left) and the histogram method (right), the middle row the kernel density estimator (left) and the NSGA-II-based method (right), the lower row the clustering based truncation operator combined with the kernel density estimator (left) and the histogram method (right).

the medium size problem with n = 500. Notice that for σ = 1 the location differences of the V distribution between the first three operators are stronger than for σ = 4, while for σ = 4 the differences in the minimal V values are stronger. Fig. 7 visualizes how the behavior of the different evaluate operators interacts with different pe and σ settings. Obviously, the kernel density estimator as well as the histogram method lead to lower V values in all groups. The NSGA-II based method, however, does not change performance at lower mutation rates and only improves a few groups with stronger mutation. The corresponding fronts show that the performance

194


gain of density dependent selection is only due to a broadening of the current nondominated set, while approximation does not come closer in the middle. Comparisons to the real efficient set show that the evolutionary algorithm still finds solutions only in the central region of the real efficient set, even with the density dependent selection operators considered here. Finally, the different density estimation techniques are combined with the clustering based truncate operator. Though this does not improve much on the top performance, the lower row of Fig. 7 shows that the truncation method reduces the sensitivity to suboptimal parameter settings, especially for low mutation rates. 6.3 Key Results The performance gain of density dependent selection strongly depends on the accuracy of the applied density estimator: – In general, the kernel density estimator as well as the histogram method improves the performance for all pe and mutation rate settings. – The combination of these techniques with the clustering-based archive truncation method leads to synergy effects in the sense that the algorithm becomes even less sensitive to suboptimal parameter settings than without density based selection.

7

Conclusion and Outlook

In this study we identified and analyzed the key elements of evolutionary multi-objective optimizers. From the results we can derive some design guidelines: – Strong elitism should be used to achieve best performance, but in connection with a high mutation rate. The right combination of elitism intensity and mutation rate is the decisive factor for the performance. – Density based selection can further improve the algorithmic performance by a broader distribution of solutions along the trade-off surface. Here, enough effort should be put in the density estimation technique since only a good estimate brings forth the desired results; fitness sharing as a simple kernel density estimator is a good choice. – A good archive reduction method like clustering should be incorporated to make the algorithm robust concerning suboptimal parameter settings. However, the truncation operator has to be chosen carefully as inappropriate methods can decrease the performance. As for the methodology of comparing different algorithms it should be noted that – In comparisons of elitist against non-elitist algorithm not only the influence of the mutation rate must be considered but also the intensity of the elitism, which is often defined implicitly. – When new algorithms are developed, the effect of all new features should be examined separately. At present, these results are only valid for the bi-objective knapsack problem, but we believe that some fundamental characteristics have been found. It is subject to ongoing research to verify this for other problem classes and higher objective space dimensions. It can be expected, however, that performance differences increase, when more objectives and more difficult problems are considered.


195

References 1. Carlos A. Coello Coello. A comprehensive survey of evolutionary-based multiobjective optimization. Knowledge and Information Systems, 1(3):269–308, 1999. 2. D. W. Corne, J. D. Knowles, and M. J. Oates. The pareto envelope-based selection algorithm for multiobjective optimisation. In Marc Schoenauer et al., editor, Parallel Problem Solving from Nature – PPSN VI, Berlin. Springer. 3. K. Deb, S. Agrawal, A. Pratap, and T. Meyarivan. A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. In Marc Schoenauer et al., editor, Parallel Problem Solving from Nature – PPSN VI, Berlin. Springer. 4. C. M. Fonseca and P. J. Fleming. Multiobjective genetic algorithms made easy: Selection, sharing and mating restrictions. In First Int’l Conf. on Genetic Algorithms in Engineering Systems: Innovations and Applications (GALESIA 95), pages 45–52, London, UK, 1995. The Institution of Electrical Engineers. 5. C. M. Fonseca and P. J. Fleming. An overview of evolutionary algorithms in multiobjective optimization. Evolutionary Computation, 3(1):1–16, 1995. 6. D. E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, Massachusetts, 1989. 7. J. D. Knowles and D. W. Corne. The pareto archived evolution strategy: A new baseline algorithm for pareto multiobjective optimisation. In Congress on Evolutionary Computation (CEC99), volume 1, pages 98–105, Piscataway, NJ, 1999. IEEE Press. 8. J. D. Knowles and D. W. Corne. M-PAES: A memetic algorithm for multiobjective optimization. In Congress on Evolutionary Computation (CEC 2000), volume 1, pages 325–332, Piscataway, NJ, 2000. IEEE Press. 9. M. Laumanns, E. Zitzler, and L. Thiele. A unified model for multi-objective evolutionary algorithms with elitism. In Congress on Evolutionary Computation (CEC 2000), volume 1, pages 46–53, Piscataway, NJ, 2000. IEEE Press. 10. S. Obayashi, S. Takahashi, and Y. Takeguchi. Niching and elitist models for MOGAs. In A. E. Eiben et al., editor, Parallel Problem Solving from Nature – PPSN V, pages 260–269, Berlin, 1998. Springer. 11. G. Ochoa. Consensus sequence plots and error thresholds: Tools for visualising the structure of fitness landscapes. In M. Schoenauer et al., editor, Parallel Problem Solving from Nature – PPSN VI, pages 129–138, Berlin, 2000. Springer. 12. G. T. Parks and I. Miller. Selective breeding in a multiobjective genetic algorithm. In A. E. Eiben et al., editor, Parallel Problem Solving from Nature – PPSN V, pages 250–259, Berlin, 1998. Springer. 13. G. Rudolph and A. Agapie. Convergence properties of some multi-objective evolutionary algorithms. In Congress on Evolutionary Computation (CEC 2000), volume 2, pages 1010– 1016, Piscataway, NJ, 2000. IEEE Press. 14. J. D. Schaffer, R. A. Caruana, L. J. Eshelman, and R. Das. A study of control parameters affecting online performance of genetic algorithms for function optimization. In J. D. Schaffer, editor, Proceedings of the third international conference on genetic algorithms, pages 51–60, San Mateo, CA, 1989. Morgan Kaufmann. 15. N. Srinivas and K. Deb. Multiobjective optimization using nondominated sorting in genetic algorithms. Evolutionary Computation, 2(3):221–248, 1994. 16. E.L. Ulungu, J. Teghem, P.H. Fortemps, and D. Tuyttens. Mosa method: A tool for solving multiobjective compinatorial optimization problems. Journal of Multi-Criteria Decision Analysis, 8(4):221–236, 1999. 17. D. A. Van Veldhuizen. Multiobjective Evolutionary Algorithms: Classifications, Analyses, and New Innovations. PhD thesis, Graduate School of Engineering of the Air Force Institute of Technology, Air University, June 1999.

196


18. E. Zitzler, K. Deb, and L. Thiele. Comparison of multiobjective evolutionary algorithms: Empirical results. Evolutionary Computation, 8(2):173–195, 2000. 19. E. Zitzler and L. Thiele. Multiobjective optimization using evolutionary algorithms — a comparative case study. In Agoston E. Eiben et al., editor, Parallel Problem Solving from Nature – PPSN V, pages 292–301, Berlin, 1998. Springer. 20. E. Zitzler and L. Thiele. Multiobjective evolutionary algorithms:A comparative case study and the strength pareto approach. IEEE Transactions on Evolutionary Computation, 3(4):257– 271, 1999.

Global Multiobjective Optimization with Evolutionary Algorithms: Selection Mechanisms and Mutation Control Thomas Hanne Fraunhofer Institute for Industrial Mathematics (ITWM) Department of Optimization Gottlieb-Daimler-Str. 49 67633 Kaiserslautern Germany e-mail: [email protected]

Abstract. In this paper we discuss some questions of applying evolutionary algorithms to multiobjective optimization problems with continuous variables. A main question of transforming evolutionary algorithms for scalar optimization into those for multiobjective optimization concerns the modification of the selection step. In an earlier article we have analyzed special properties of selection rules called efficiency preservation and negative efficiency preservation. Here, we discuss the use of these properties by applying an accordingly modified selection rule to some test problems. The number of efficient alternatives of a population for different test problems provides a better understanding of the change of data during the evolutionary process. Also effects of the number of objective functions are treated. We also analyze the influence of the number of objectives and the relevance of these results in the context of the 1/5 rule, a mutation control concept for scalar evolutionary algorithms which cannot easily be transformed into the multiobjective case. Keywords: multicriteria decision analysis, stochastic search, evolutionary algorithms, selection mechanism, step sizes, 1/5 rule.

1

Introduction

Since a couple of years there is a growing interest in using evolutionary algorithms, e.g. genetic algorithms (GAs) (see [13], [8]) or evolution strategies (see [1]), for multiobjective optimization (see [4], [5], [26], and [14] for surveys). The main problem of transforming the algorithms from scalar optimization methods into multiobjective optimization tools lies in the modification of the selection procedure. In many approaches this modification is based on a more or less simple aggregation of the several objective functions into one (scalarization). This procedure results in some difficulties, e.g. that such algorithms converge (if they converge) to one or several specific solutions while others cannot be obtained. E. Zitzler et al. (Eds.): EMO 2001, LNCS 1993, pp. 197–212, 2001. c Springer-Verlag Berlin Heidelberg 2001

198

T. Hanne

For these and other reasons, the main interest has focussed on selection strategies which use the Pareto order only. Earlier analyses have shown that additional requirements are needed to prove that such algorithms converge towards efficient solutions ([11], for other results see [21]). These are elitist and conservative features of selection which may have other disadvantages. Especially, a slower introduction of new generated data is a possible drawback. Below, we show some experimental results concerning this question. Another open problem concerns the adaptation of the parameters controlling the strength of mutations. In evolution strategies, the alternatives are encoded as floating point numbers instead of bit strings as in genetic algorithms. This allows a more appropriate representation of multiobjective optimization problems with continuous variables1 and a reaching of higher precision results. For a fast approaching of an optimal solution, the 1/5 rule has been proposed as an adaptation procedure for the mutation strengths in scalar evolutionary algorithms. Below, we discuss why this rule is not applicable in the multiobjective case.

2

Terminology

Let us consider a multiobjective programming (MOP) problem defined as follows: (M OP )

mina∈A f (a)

with f : Rn → Rq , q ≥ 2,
H(x1 , x02 ) + H(x2 , x01 )) Swap(x01 , x02 ) if (f (x01 ) > f (x1 )) P ← P ∪ x01 \ x1 if (f (x02 ) > f (x2 )) P ← P ∪ x02 \ x2 return Best(P )

Fig. 2. A simple form of a genetic algorithm using deterministic crowding (DCGA) as used in our experiments

Pseudocode for the mutation-only, deterministic crowding genetic algorithm (DCGA) is given in Figure 2. The set P is the population of candidate solutions initialized randomly using Init pop(P ). The function H(x, x0 ) measures the genotypic Hamming distance between two solution vectors. At each iteration, two parents are selected from the population at random and two offspring are generated by mutation, one from each parent. Parents and offspring are then paired up so as to minimize the sum of the genotypic Hamming distance between them. Each offspring then replaces the parent it is paired with if it non-worse than that parent. The PESA algorithm used here has been described in detail in [2], and pseudocode for it is given in Figure 3. It has an internal population IP of size PI , and an external population of nondominated solutions EP . Here it is used without crossover so that each generation consists of selecting PI parents from EP and mutating them to produce PI new offspring. Then, the nondominated members of IP are incorporated into EP . The selection operator, select() is based on crowding in objective space. The PESA and DCGA algorithms are quite different in some ways, but do represent analogues of each other at a high level: both algorithms have a popula-

Reducing Local Optima in Single-Objective Problems Initialization:

Main Loop:

Termination:

275

IP ← ∅, EP ← ∅ Init pop(IP) foreach (x ∈ IP) EP ← Reduce(EP ∪ x) IP ← ∅ while (|IP| < PI ) { x ← Select(EP) x0 ← Mutate(x) IP ← IP ∪ x } foreach (x ∈ IP) EP ← Reduce(EP ∪ x) return Best(EP)

Fig. 3. The Pareto envelope-based selection algorithm (PESA)

tion from which parents are selected and used to produce offspring via mutation, and both have a mechanism for maintaining diversity in the population. However, in PESA, the diversity is maintained in the objective space, while with DCGA it is in the genotype space. With PESA, the initial size of the pool of random solutions is PI , and PI solutions are generated at each step. The prevailing size of EP is the size of the pool from which solutions can be selected. In DCGA, the population size P determines the initial pool and the size of the pool from which solutions are selected, and 2 solutions are generated at each step. These differences in detail, however, should not affect the substance of the judgments we make about the performance of these algorithms in our experiments. 3.3

Simulated Annealing

The simulated annealing (SA) algorithm used is identical to the SHC, except for changes to the acceptance function to allow it to accept moves to worse solutions. The acceptance function we employ for accepting degrading moves is the standard exponential function: exp (f (x) − f (x0 )) (5) T where f (x) is the evaluation of the current solution x, f (x0 ) is the evaluation of the neighbouring solution, x0 , and p (accept x0 ) denotes the probability of accepting x0 . We choose to use a simple form of simulated annealing, employing an inhomogeneous, geometric cooling schedule where T is updated after every iteration using: T ← αT (6) Following general procedures outlined in [14], we attempt to set the starting temperature T0 so that between 40% and 60% of moves are accepted. The final temperature is set so that between 0.1% and 2% of moves are accepted. We can then calculate α using: ln(Tf /T0 ) α = exp (7) num evals given that we know the total number of function evaluations num evals required. p (accept x0 ) =

276

4 4.1

J.D. Knowles, R.A. Watson, and D.W. Corne

Problems H-IFF/MH-IFF: An Abstract Illustration

The Hierarchical-if-and-only-if function, H-IFF, is a genetic algorithm test problem designed to model a problem with a building-block structure where the sub-problem that each block represents has strong interdependencies with other blocks. That is, unlike many existing building-block problems, the optimal solution to any block in H-IFF is strongly dependent on how other building-blocks have been solved [16,17]. The fitness of a string using H-IFF can be defined using the recursive function given below. This function interprets a string as a binary tree and recursively decomposes the string into left and right halves. Each resultant sub-string constitutes a building-block and confers a fitness contribution equal to its size if all the bits in the block have the same allele value - either all ones or all zeros. The fitness of the whole string is the sum of these fitness contributions for all blocks at all levels.  if |B| = 1, else  1, (8) f (B) = |B| + f (BL ) + f (BR ), if (∀i{bi = 0} or ∀i{bi = 1}),  f (B ) + f (B ), otherwise, L R where B is a block of bits, {b1 , b2 , . . . , bn }, |B| is the size of the block = n, bi is the ith element of B, and BL and BR are the left and right halves of B (i.e. BL = {b1 , b2 , . . . , bn/2 } and BR = {bn/2+1 , . . . , bn }). The length of the string evaluated, n, must equal 2p where p is an integer (the number of hierarchical levels). Each of the two competing solutions to each block (all-ones and all-zeros) give equal fitness contributions on average. But only when neighbouring blocks match do they confer a bonus fitness contribution by forming a correct block at the next level in the hierarchy. These competing solutions and their interdependencies create strong epistatic linkage in H-IFF and many local optima (see Figure 4 left). These local optima prevent any kind of mutation based hill climber from reliably reaching one of the two global optima in H-IFF (all-ones or all-zeros) in time less than exponential in N, the number of bits in the problem [17]. Figure 4 (left) shows a particular section through the H-IFF landscape. This is the section through a 64-bit landscape starting from all zeros on the left and ending with all ones. Specifically, it shows the fitness of the strings “000 . . . 0”, “100 . . . 0”, “110 . . . 0”, . . . , “111 . . . 1”. This indicates the local optima in H-IFF and the two global optima at opposite corners of the space.  0, if |B| = 1 and b1 6=k, else   1, if |B| = 1 and b1 = k, else (9) fk (B) = |B| + f (B ) + f (B ),  k L k R if (∀i{bi = k}),  fk (BL ) + fk (BR ), otherwise. where f0 (x) is the first objective and f1 (x) is the second. This particular decomposition of H-IFF results in a two-objective problem in which there are no local optima for a multi-objective hill-climber. Figure 4 (right)

Reducing Local Optima in Single-Objective Problems The H-IFF Landscape

277

The MH-IFF Landscape

450

450 400

400

350 300 250

f1

fitness

350

200

300 150 100

250

50 200

0 0

10

20

30

40

50

60

0

50 100 150 200 250 300 350 400 450

number of leading 1s

f0

Fig. 4. H-IFF and MH-IFF

is a section through the two-objective landscape, MH-IFF, using the same strings as used in the section through H-IFF. We see that if neighbouring points on this section are worse in respect to one dimension, they are better in the other. This has transformed the problem into one that is now completely bit-climbable. That is, single bit changes can move a hill-climber from one end of the Pareto front to the other, including every point in between, without ever moving to a dominated point. (In fact, every Pareto optimal solution can be reached by bitclimbing from any start point.) This transformation is possible because we have access to the structure of the function and can thereby separate the conflicting sub-goals inherent in the SOO version. This serves to illustrate the mechanisms of multi-objectivization - but naturally, we will not have this luxury in practical applications, like the TSP. 4.2

TSP/MTSP: Decomposition via Multi-objectivization

The travelling salesperson problem (TSP) is the most well-known of all N P -hard optimization problems. For a comprehensive review and comparison of methods used to solve it see [6], where the problem is stated as follows: We are given a set C = {c1 , c2 , . . . , cN } of cities and for each pair {ci , cj } of distinct cities there is a distance d(ci , cj ). Our goal is to find an ordering π of the cities that minimizes the quantity N −1 X d(cπ(i) , cπ(i+1) ) + d(cπ(N ) , cπ(1) ). (10) i=1

In order to multi-objectivize the TSP, we need to identify sub-problems to be solved. Of course, the TSP is N P-hard for the very reason that there is no good decomposition of the problem, i.e. dependencies between components of the problem exist in most instances. However, an obvious decomposition, although

278


by no means perfect, is simply to divide the problem into two (or more) subtours, each to be minimized. This can be done in a number of ways, and some may be preferable to others depending on how much is known about the problem instance, but here we use a method that is general for the TSP class. Specifically, to make a two-objective formulation of the TSP, we define two distinct subtours to be minimized. The sub-tours are defined by two cities, and the problem becomes: “minimize” f (π, a, b) = (f1 (π, a, b), f2 (π, a, b)) Pπ−1 (b)−1 where f1 (π, a, b) = i=π−1 (a) d(cπ(i) , cπ(i+1) ) PN −1 (11) and f2 (π, a, b) = i=π−1 (b) d(cπ(i) , cπ(i+1) ) + Pπ−1 (a)−1 d(cπ(i) , cπ(i+1) ) + d(cπ(N ) , cπ(1) ) i=1 where a and b are the two cities specified a priori, and if π(a) < π(b) they are swapped. It is intended that a and b are chosen arbitrarily. Notice that the sum of the two objectives is the same as the quantity to be minimized in (10). This ensures that the optimum of (10) is coincident with at least one of the Pareto optima of (11), as required by our definition of multi-objectivizing.

5 5.1

Results H-IFF/MH-IFF

In this section, we present a comparison of hillclimbing algorithms on the H-IFF problem, and its multi-objectivized formulation, MH-IFF. All algorithms were run on a 64-bit version of the problem, for the same number of function evaluations, num evals = 500000. Two different mutation rates pm = 1/n, 2/n, n = 64 were used in each algorithm to investigate whether mutation rate choice substantially affected any of the algorithms. The choice of archive size for PAES was 100. The DCGA and PESA algorithms require population sizes to be set. For DCGA, P = 100, and for PESA, PI = 10. For the simulated annealing algorithm, preliminary runs were performed and T0 and Tf were adjusted until the acceptance probabilities fell into the required ranges described in Section 3. Table 1 shows the full set of results collected on the 64-bit H-IFF problem. In each case, the results were gathered from 30 independent runs of the algorithm. For all algorithms, all best genotypically different solutions were stored off-line, and the tabulated results relate to these off-line results. The table clearly indicates that on H-IFF, removing the local optima through multi-objectivization transforms the problem from one that is very difficult for a neighbourhood searcher, to one that is much easier. The performance of the SOO search algorithms improves with increased mutation rate pm , confirming that they require larger steps to escape the local optima in the H-IFF problem. The multi-objective algorithms are almost unaffected by the choice of pm , indicating that they are able to reach the optima through small neighbourhood moves. These results demonstrate the multi-objectivization principle, clearly and can be understood with reference to the discussion given to the problem in Section 4. In the following section we examine how the multi-objectivization technique established here fares on a real-world problem with a much less readily decomposable structure, the TSP.

Reducing Local Optima in Single-Objective Problems

279

Table 1. Results of the comparison between algorithms on a 64-bit H-IFF problem. Two of the algorithms are multi-objective and use the MH-IFF decomposition of the problem, namely PAES and PESA. The other three algorithms use the H-IFF objective function directly. Essentially the results compare two single-point hill-climbers, SHC and PAES, and two multi-point hill-climbers, DCGA and PESA. In both cases, the multi-objective algorithm significantly outperforms (using any statistical test) its SOO counterpart. The results of the simulated annealing algorithm (SA) act as a benchmark, indicating the level of performance that can be achieved when escape from local optima is made possible on the original landscape. The columns, ‘% one’ and ‘% both’, indicate the percentage of the runs where respectively one of the optima and both optima were found over the thirty independent runs of each algorithm. Note that only PAES and PESA are able to find both optima. Algorithm pm SHC 1/n 2/n PAES 1/n 2/n DCGA 1/n 2/n PESA 1/n 2/n SA 1/n 2/n

5.2

best 288 336 448 448 300 448 448 448 448 448

mean 242.13 267.47 415.20 418.13 270.06 323.93 448.00 448.00 435.20 435.20

σ % one % both 22.52 0 0 29.46 0 0 51.26 70 47 50.68 74 43 13.80 0 0 26.54 3 0 0.00 100 100 0.00 100 100 26.04 80 0 26.04 80 0

TSP/MTSP

We present results for a range of TSP instances of varying size and type. All problems are symmetric, i.e. the distance from A to B is the same as from B to A, where A and B are any two cities. The RAN-20 and RAN-50 problems have 20 and 50 cities respectively, and are non-Euclidean random weight problems where the distance between each pair of cities is a random real number in [0,1). The EUC-50 and EUC-100 are two randomly generated Euclidean problems where the cities are given co-ordinates in a 2-d plane, x ∈ [0, 1), y ∈ [0, 1) and the distance between pairs of nodes is then the Euclidean distance. The problem, kroB100, is taken from TSPLIB and is also a 100-node Euclidean TSP problem. The last problem, mnPeano-92, is a 92-node fractal problem2 with a known optimal solution [13]. In each algorithm, the representation, initialization, and mutation operators used are identical: the representation of a tour is an N -gene permutation of the numbers 1..N ; the initialization procedure simply generates a random permutation of N cities; and the mutation operator used is the 2-change operator, originally put forward in [3]. It works by selecting two non-identical cities and reversing the order of all the cities between (and including) them. This operator preserves all but two edges in the tour. 2

We conjecture that fractal TSP problems may be particularly suitable for multiobjectivization because their inherently hierarchical structure suggests they may be amenable to decomposition.

280


On each different TSP instance, all the algorithms are run for the same number of function evaluations, num evals, given for each problem in Table 2. The PESA and DCGA algorithms further require population sizes to be set. As before, we use the default values of P = 100 for DCGA, and PI = 10 for PESA. Setting the SA parameters is carried out as before using preliminary runs to derive an appropriate T0 and Tf . The choice of city pairs to be used in the multi-objective algorithms is investigated. First, we present results (Table 2) in which - for the multi-objective algorithms, PAES and PESA - a single, random pair of cities was selected and this pair used in all runs. Later, we report the maximum deviation from these results for other choices of city pairs. Finally, we investigate the choice of city pairs using the EUC-50 problem by selecting a pair of cities that are very close, and another pair where they are maximally distant, and repeating our experiments for these choices. Table 2. Summary TSP results. In the ‘Optimum’ column, figures given in bold font represent the known optimum value; other figures are estimates. For the RAN-20 problem, the optimum is an estimate based on the fact that SA reached this value on 30 consecutive runs, and given the small size of the problem. For the RAN-50 problem, the estimated figure is based on the expected limiting value of an optimal tour [6], and similarly for EUC-50√and EUC-100, the estimates are based on the formula for expected tour length = K N A with N the number of cities, A = 1.0 the area in which the cities are placed, and K ≈ 0.7124 [6]. Algorithm Problem num evals SHC RAN-20 500000 PAES RAN-20 500000 SA RAN-20 500000 SHC RAN-50 500000 PAES RAN-50 500000 DCGA RAN-50 500000 PESA RAN-50 500000 SA RAN-50 500000 SHC EUC-50 500000 PAES EUC-50 500000 DCGA EUC-50 500000 PESA EUC-50 500000 SA EUC-50 500000 SHC EUC-100 2000000 PAES EUC-100 2000000 DCGA EUC-100 2000000 PESA EUC-100 2000000 SA EUC-100 2000000 PESA kroB100 2000000 SA kroB100 2000000 SHC mnPeano-92 1000000 PAES mnPeano-92 1000000

Optimum 2.547394 2.547394 2.547394 2.0415 2.0415 2.0415 2.0415 2.0415 5.0374 5.0374 5.0374 5.0374 5.0374 7.124 7.124 7.124 7.124 7.124 22141 22141 5697.93 5697.93

Best 2.550811 2.547394 2.547394 2.620087 2.259948 2.307587 2.189421 2.130675 5.904673 5.801026 5.707789 5.692169 5.692169 8.143720 8.028227 7.902731 7.795515 7.853258 22141 22217 5857.47 5879.63

Mean 2.81 2.66 2.55 3.09 2.73 2.46 2.32 2.30 6.23 6.03 5.76 5.78 5.72 8.55 8.35 8.16 7.97 7.98 22546.1 22529.2 6433.45 6255.30

σ 0.14 0.14 0.00 0.28 0.22 0.09 0.28 0.10 0.20 0.13 0.05 0.08 0.03 0.23 0.24 0.14 0.10 0.07 324.2 173.0 197.1 197.6


281

From Table 2 we can see that, without exception, the results of the PAES algorithm are superior to the SHC algorithm at a statistically significant level3 , over the range of problem instances in the Table. This shows that the number of local optima in the TSP problem, using the 2-change neighbourhood, is reduced by the method of multi-objectivization we have proposed. Although the number of local optima has successfully been reduced by multiobjectivization, this does not make PAES more effective than other methods for solving TSP. We are only using PAES to indicate the basic advantage of multiobjectivization over hill-climbing in a SOO problem. Compared with DCGA, PAES performs poorly on all problems. However, PESA, the multi-objective counterpart of DCGA, outperforms DCGA on all but one of the problems. PESA is also competitive with the SA algorithm, which has its own explicit means of escaping from local optima. This result adds further evidence that multiobjectivization can enable an algorithm to avoid local optima effectively. To investigate the effect of the choice of city pairs, the 50-node Euclidean TSP problem was used. First, a choice of city pair in which the cities were very close to each other and relatively far from others was selected. 30 runs were performed using this pair and the results were: best = 5.804719, mean = 6.10, and σ = 0.22. Then, with cities in opposite corners of the plane the results were: best = 5.818185, mean = 6.09, σ = 0.16. So both are worse than the ‘random’ choice used in the results in Table 2: best = 5.801026, mean = 6.03, σ = 0.13. However, although there is some seeming dependence on city choice, all three of these results are better than the results of the SHC algorithm on this problem. Some alternative choices of city pairs were used on some of the other problems, too. On the random 20-node problem, three different choices of node pair were tried. There was a 1.5% variation in the mean over 30 runs, for the different node-pair choices. On the 50-node Euclidean problem, two different pairs of cities were chosen for the PESA algorithm. The difference in means over 30 runs was 0.4%. On no runs did the choice of city pair affect the mean TSP tour length by more than 2%.

6

Discussion

The examples in the previous sections have illustrated different ways in which additional objectives can be defined for a SOO problem and that this multiobjectivization can facilitate improved search for neighbourhood based algorithms. We suggested earlier that a successful multi-objectivization may involve decomposing the original function into a number of sub-problems and that these sub-problems should be as independent as possible. In the H-IFF/MH-IFF example, we can separate the two competing components of the problem completely, making the problem very easy for a hill-climber. In TSP this is not so easy there is no (known) method to decompose N P-hard problems, like TSP, that creates independent sub-problems - indeed, it is the interdependency of the problem components that puts them in this class. Nonetheless, we suggest that there may be some merit in examining further the parallels between sub-problems in SOO, 3

Using a large-sample test of hypothesis for the difference in two population means [12] (which does not depend upon distribution), at the 95% confidence level.

282


and objectives in MOO. Specifically, if different objectives separate out different components of a problem then different points on the Pareto front correspond to solutions that are more or less specialized to different sub-problems. Our experiments support the intuition that it will be easier to discover a set of different specialists than it is to discover a generalist directly. In the experiments in this paper we used only mutation to investigate this, but if we could find some way to combine together different specialists from the front then perhaps it would facilitate discovery of generalists more directly. In a sense, this is the intuition behind recombination in the multi-objective Messy GA (MOMGA) [15]. However, the MOMGA assumes a number of objectives given a priori, and like other MOO methods, it is not intended as a technique for problem decomposition in SOO problems. But related research suggests that it may be possible to automatically discover objectives relating to sub-problems, and thereby apply a MOMGA-like algorithm to SOO problems. The Symbiogenic Evolutionary Adaptation Model [18] shares some features with the MOMGA but uses group evaluation of individuals to encourage them to self-organize to cover the problem space, and automatically discover sub-problems to be used as the objectives. This algorithm successfully solves the H-IFF problem without the introduction of additional objectives provided by the researcher.

7

Conclusions

In this paper, we have defined a process that we call “multi-objectivization” whereby the scalar function of a SOO problem is replaced by a vector of functions such that the resulting MOO problem has Pareto optima which coincide with the optima of the original problem. We investigated the effects of this transformation, in particular, the reduction of local optima for hill-climbing style algorithms. We illustrated the effect of the approach first on an abstract buildingblock problem, H-IFF, that is trivially amenable to such a decomposition. We then investigated the approach further, using several small instances of the TSP, where decomposition is inherently difficult. We defined a multi-objectivization of the problem based on minimizing two sub-tours. Our results showed that this simple multi-objectivization does seem to reduce the effect of local optima on simple hill-climbing algorithms. These preliminary results, suggest that there is a link between the presence of local optima in SOO problems and an underlying conflict of implicit objectives, and they shed some light on the processes of multi-objective search. Acknowledgments. The authors would like to thank Anthony Bucci, Michiel de Jong, and the anonymous reviewers for their excellent comments and criticisms.

References 1. R. Bellman. Dynamic programming and multi-stage decision processes of stochastic type. In Proceedings of the second symposium in linear programming, volume 2, pages 229–250, Washington D.C., 1955. NBS and USAF.


283

2. D. W. Corne and J. D. Knowles. The Pareto-envelope based selection algorithm for multiobjective optimization. In Proceedings of the Sixth International Conference on Parallel Problem Solving from Nature (PPSN VI), pages 839–848, Berlin, 2000. Springer-Verlag. 3. M. M. Flood. The travelling-salesman problem. Operations Research, 4:61–75, 1956. 4. J. Horn, D. Goldberg, and K. Deb. Long path problems for mutation-based algorithms. Technical Report 92011, Illinois Genetic Algorithms Laboratory, University of Illinois at Urbana-Champaign, Urbana IL, 1992. 5. M. Huynen, P. Stadler, and W. Fontana. Smoothness within ruggedness: The role of neutrality in adaptation. Proceedings of the National Academy of Sciences (USA), 93:397–401, 1996. 6. D. S. Johnson and L. A. McGeoch. The travelling salesman problem: a case study. In E. Aarts and J. K. Lenstra, editors, Local Search in Combinatorial Optimization, pages 215–310. John Wiley and Sons, 1997. 7. T. Jones. Evolutionary Algorithms, Fitness Landscapes and Search. PhD thesis, University of New Mexico, Albuquerque, 1995. 8. J. D. Knowles and D. W. Corne. The Pareto archived evolution strategy: A new baseline algorithm for multiobjective optimisation. In 1999 Congress on Evolutionary Computation, pages 98–105, Washington, D.C., July 1999. IEEE Service Center. 9. J. D. Knowles and D. W. Corne. Approximating the nondominated front using the Pareto archived evolution strategy. Evolutionary Computation, 8(2):149–172, 2000. 10. S. J. Louis and G. J. E. Rawlins. Pareto optimality, GA-easiness and deception. In S. Forrest, editor, Proceedings of the Fifth International Conference on Genetic Algorithms (ICGA-5), pages 118–123, San Mateo, CA, 1993. Morgan Kaufmann. 11. S. W. Mahfoud. Niching methods for genetic algorithms. PhD thesis, University of Illinois at Urbana-Champaign, Urbana, IL, USA, 1995. IlliGAL Report 95001. 12. W. Mendenhall and R. J. Beaver. Introduction to Probability and Statistics - 9th edition. Duxbury Press, International Thomson Publishing, Pacific Grove, CA, 1994. 13. M. G. Norman and P. Moscato. The euclidean traveling salesman problem and a space-filling curve. Chaos, Solitons and Fractals, 6:389–397, 1995. 14. C. R. Reeves. Modern heuristic techniques. In V. Rayward-Smith, I. Osman, C. Reeves, and G. Smith, editors, Modern Heuristic Search Methods, chapter 1, pages 1–26. John Wiley and Sons Ltd., 1996. 15. D. A. Van Veldhuizen and G. B. Lamont. Multiobjective Optimization with Messy Genetic Algorithms. In Proceedings of the 2000 ACM Symposium on Applied Computing, pages 470–476, Villa Olmo, Como, Italy, 2000. ACM. 16. R. A. Watson, G. S. Hornby, and J. B. Pollack. Modeling building-block interdependency. In Parallel Problem Solving from Nature - PPSN V, pages 97–106. Springer-Verlag, 1998. 17. R. A. Watson and J. B. Pollack. Analysis of recombinative algorithms on a hierarchical building-block problem. In Foundations of Genetic Algorithms (FOGA), 2000. 18. R. A. Watson and J. B. Pollack. Symbiotic combination as an alternative to sexual recombination in genetic algorithms. In Proceedings of the Sixth International Conference of Parallel Problem Solving From Nature (PPSN VI), pages 425–436. Springer-Verlag, 2000.

Constrained Test Problems for Multi-objective Evolutionary Optimization Kalyanmoy Deb, Amrit Pratap, and T. Meyarivan Kanpur Genetic Algorithms Laboratory (KanGAL) Indian Institute of Technology Kanpur Kanpur, PIN 208 016, India {deb,apratap,mary}@iitk.ac.in http://www.iitk.ac.in/kangal

Abstract. Over the past few years, researchers have developed a number of multi-objective evolutionary algorithms (MOEAs). Although most studies concentrated on solving unconstrained optimization problems, there exists a few studies where MOEAs have been extended to solve constrained optimization problems. As the constraint handling MOEAs gets popular, there is a need for developing test problems which can evaluate the algorithms well. In this paper, we review a number of test problems used in the literature and then suggest a set of tunable test problems for constraint handling. Finally, NSGA-II with an innovative constraint handling strategy is compared with a couple of existing algorithms in solving some of the test problems.

1

Introduction

Multi-objective evolutionary algorithms (MOEAs) have amply demonstrated the advantage of using population-based search algorithms for solving multiobjective optimization problems [1,14,8,5,6,11]. In multi-objective optimization problems of varying degrees of complexities, elitist MOEAs have demonstrated their abilities in converging close to the true Pareto-optimal front and in maintaining a diverse set of solutions. Despite all these developments, there seem to be not enough studies concentrating procedures for handling constraints. Constraint handling is a crucial part of real-world problem solving and it is time that MOEA researchers focus on solving constrained multi-objective optimization problems. To evaluate any algorithm, there is a need for well understood and tunable test problems. Although there exists a few constraint handling procedures in the literature, they all have been tried on simple problems, particularly having only a few decision variables and having inadequately nonlinear constraints. When an algorithm performs well on such problems, it becomes difficult to evaluate the true merit of it, particularly in the context of its general problem solving. In this paper, we briefly outline a few constraint handling methods suggested in the literature. Thereafter, we review a few popular test problems for their degrees of difficulty. Next, we propose a tunable test problem generator E. Zitzler et al. (Eds.): EMO 2001, LNCS 1993, pp. 284–298, 2001. c Springer-Verlag Berlin Heidelberg 2001

Constrained Test Problems for Multi-objective Evolutionary Optimization

285

having six parameters, which can be set to obtain constrained test problems of desired degree of difficulty. Simulation results with NSGA-II [1] along with the constrained-domination principle and with two other constrained handling procedures bring out the superiority of NSGA-II in solving difficult constrained optimization problems. The difficulty demonstrated by the test problems will qualify them to be used as standard constrained multi-objective test problems in the years to come.

2

Constrained Multi-objective Evolutionary Algorithms

There exists only a few studies where an MOEA is specifically designed for handling constraints. Among all methods, the usual penalty function approach [11,2] where a penalty proportional to the total constraint violation is added to all objective functions. When applying this procedure, all constraints and objective functions must be normalized. Jimenez et al. [7] suggested a procedure which carefully compares two solutions in a binary tournament selection. If one solution is feasible and other is not, the feasible solution is chosen. If both solutions are feasible, Horn et al.’s [6] niched-Pareto GA is used. On the other hand, if both solutions are infeasible, the solution closer to the constraint boundary is more likely to be chosen. Ray et al. [10] suggested a more elaborate constraint handling technique, where constraint violations of all constraints are not simply summed together, instead a non-domination check of constraint violations is made. Based on separate non-domination sorting of a population using objective functions alone, constraint violations alone, and objective function and constraint violation together, the algorithm demands a large computational complexity. Recently, Deb et al. [1] defined a constraint-domination principle, which differentiates infeasible from feasible solutions during the non-dominated sorting procedure: Definition 1 A solution i is said to constrained-dominate a solution j, if any of the following conditions is true: 1. Solution i is feasible and solution j is not. 2. Solutions i and j are both infeasible, but solution i has a smaller overall constraint violation. 3. Solutions i and j are feasible and solution i dominates solution j. This requires no additional constraint-handling procedure to be used in an MOEA. Since the procedure is generic, the above constraint-domination principle can be used with any unconstrained MOEAs.

3

Past Test Problems

In the context of multi-objective optimization, constraints may cause hindrance to an multi-objective EA (MOEA) to converge to the true Pareto-optimal region

286

K. Deb, A. Pratap, and T. Meyarivan

and also may cause difficulty in maintaining a diverse set of Pareto-optimal solutions. It is intuitive that the success of an MOEA in tackling both these problems will largely depend on the constraint-handling technique used. However, first we present some test problems commonly used in the literature and then discuss a systematic procedure of developing a test problem generator. Veldhuizen [13] cites a number of constrained test problems used by several researchers. We present here three problems which are often used by researchers. Srinivas and Deb [11] used the following function:  Minimize f1 (x) = 2 + (x1 − 2)2 + (x2 − 1)2     Minimize f2 (x) = 9x1 − (x2 − 1)2 ,    Subject to c1(x) ≡ x21 + x22 ≤ 225, SRN : c2(x) ≡ x1 − 3x2 + 10 ≤ 0,     −20 ≤ x1 ≤ 20,    −20 ≤ x2 ≤ 20.

(1)

Figure 1 shows the feasible decision variable space and the Pareto-optimal set. The Pareto-optimal solutions [11] correspond to x∗1 = −2.5, x∗2 ∈ [−14.79, 2.50]. The feasible objective space along with the Pareto-optimal solutions are shown in Figure 2. The only difficulty the constraints introduce in this problem is that

15 10 5

x2 0 −5 −10 −15

111111111111 000000000000 000000000000 111111111111 000000000000 111111111111 000000000000 111111111111 000000000000 111111111111 0000000000000 1111111111111 000000000000 111111111111 0000000000000 1111111111111 000000000000 111111111111 0000000000000 1111111111111 000000000000 111111111111 0000000000000 1111111111111 000000000000 111111111111 0000000000000 1111111111111 000000000000 111111111111 0000000000000 1111111111111 000000000000 111111111111 Pareto− 0000000000000 1111111111111 000000000000 111111111111 0000000000000 1111111111111 000000000000 111111111111 optimal 0000000000000 1111111111111 000000000000 111111111111 0000000000000 1111111111111 set 000000000000 111111111111 000000000000 111111111111 000000000000 111111111111 000000000000 111111111111 000000000000 111111111111 000000000000 111111111111 000000000000 111111111111 000000000000 111111111111 000000000000 111111111111 −15 −10 −5

0

5

10

15

x1

Fig. 1. Decision variable space for the test problem SRN.

150 100 50 0 −50

f2 −100 −150

Pareto−optimal set

−200 −250 −300

0

50

100

150

f1

200

250

300

Fig. 2. Objective space for the test problem SRN.

they eliminate some part of the unconstrained Pareto-optimal set (shown with a dashed line in Figure 1).


287

Tanaka [12] suggested the following two-variable problem:  Minimize f1 (x) = x1 ,     Minimize f2 (x) = x2 ,     Subject to c1(x) ≡ x21 + x22 − 1 − 0.1 cos 16 arctan xy ≥ 0, TNK :  c2(x) ≡ (x1 − 0.5)2 + (x2 − 0.5)2 ≤ 0.5,     0 ≤ x1 ≤ π,    0 ≤ x2 ≤ π.

(2)

The feasible decision variable space is shown in Figure 3. Since f1 = x1 and

1.2 80

1

70

0.8

60

x2 0.6 f2

50

A

B

f2 40

Pareto−optimal sets

0.4

30

C D

20

0.2

10

0

0

0.2

0.4

0.6 0.8 x 1, f1

1

1.2

Fig. 3. The feasible decision variable and objective search spaces is shown for TNK.

0 −300

E −250

−200

−150

−100

F −50

0

f1

Fig. 4. Pareto-optimal region for the test problem OSY.

f2 = x2 , the feasible objective space is also the same as the feasible decision variable space. The unconstrained decision variable space consists of all solutions in the square 0 ≤ (x1 , x2 ) ≤ π. Thus, the only unconstrained Pareto-optimal solution is x∗1 = x∗2 = 0. However, the inclusion of the first constraint makes this solution infeasible. The constrained Pareto-optimal solutions lie on the boundary of the first constraint. Since the constraint function is periodic and the second constraint function must also be satisfied, not all solutions on the boundary is Pareto-optimal. The disconnected Pareto-optimal sets are shown in the figure with thick solid lines. Since the Pareto-optimal solutions lie on a non-linear constraint surface, an optimization algorithm may find difficulty in finding a spread of solutions across the entire Pareto-optimal front.

288


Osyczka and Kundu [9] used the following six-variable test problem:  2 2 2 2   Minimize f1 (x) = − 25(x1 − 2) + (x2 − 2) + (x3 − 1) + (x4 − 4)  2  +(x5 − 1) ,    2  Minimize f (x) = x + x22 + x23 + x24 + x25 + x26 ,  2 1    Subject to c1 (x) ≡ x1 + x2 − 2 ≥ 0,    c2 (x) ≡ 6 − x1 − x2 ≥ 0, OSY : c3 (x) ≡ 2 − x2 + x1 ≥ 0,     c4 (x) ≡ 2 − x1 + 3x2 ≥ 0,     c5 (x) ≡ 4 − (x3 − 3)2 − x4 ≥ 0,     c6 (x) ≡ (x5 − 3)2 + x6 − 4 ≥ 0,    0 ≤ x1 , x2 , x6 ≤ 10, 1 ≤ x3 , x5 ≤ 5, 0 ≤ x4 ≤ 6. (3) There are six constraints, of which four are linear. Since, it is a six variable problem, it is difficult to show the feasible decision variable space.However, a careful analysis of the constraints and the objective function reveals the constrained Pareto-optimal front, as shown in Figure 4. The Pareto-optimal region is a concatenation of five regions. Every region lies on the intersection of certain constraints. But for the entire Pareto-optimal region, x∗4 = x∗6 = 0. Table 1 shows the other variable values for each of the five regions. Since the entire Table 1. Pareto-optimal regions for the problem OSY. Optimal values Region x∗1 x∗2 x∗3 AB 5 1 (1, . . . , 5) BC 5 1 (1, . . . , 5) CD (4.056, . . . , 5) (x∗1 − 2)/3 1 DE 0 2 (1, . . . , 3.732) EF (0, . . . , 1) 2 − x∗1 1

Active x∗5 constraints 5 2,4,6 1 2,4,6 1 4,5,6 1 1,3,6 1 1,5,6

Pareto-optimal region demands an MOEA population to maintain subpopulations at different intersections of constraint boundaries, it is a difficult problem to solve.

4

Proposed Test Problems

Although the above test problems (and many others that are discussed elsewhere [13]) somewhat test an MOEA’s ability to handle constrained multi-objective optimization problems, they have a number of difficulties: (i) they have a few decision variables, (ii) most objective functions and constraints are not adequately nonlinear, and (iii) they are not tunable for introducing varying degrees


289

of complexity in constrained optimization. Like in the case of tunable unconstrained test problems [3], we also suggest here a number of test problems where the complexity of constrained search space can be controlled. The proposed test problems are designed to cause two different kinds of tunable difficulty to a multi-objective optimization algorithm: 1. Difficulty near the Pareto-optimal front, and 2. Difficulty in the entire search space. We discuss them in the following subsections. 4.1

Difficulty in the Vicinity of the Pareto-Optimal Front

In this test problem, constraints do not make any major portion of the search region infeasible, except very near to the Pareto-optimal front. Constraints are designed in a way so that some portion of the the unconstrained Pareto-optimal region becomes infeasible. This way, the overall Pareto-optimal front will constitute some part of the unconstrained Pareto-optimal region and some part of the constraint boundaries. In the following, we present a generic test problem:  Minimize f1 (x) = x1  Minimize f2 (x) = g(x) exp(−f1 (x)/g(x)) CTP1 :  Subject to cj (x) = f2 (x) − aj exp(−bj f1 (x)) ≥ 0, j = 1, 2, . . . , J (4) Here, the function g(x) can be a complex multi-variable function. There are J inequality constraints and the parameters (aj , bj ) must be chosen in a way so that a portion of the unconstrained Pareto-optimal region is infeasible. We describe a procedure to calculate (aj , bj ) parameters for J constraints: Step 1 Set j = 0, aj = bj = 1. Also set ∆ = 1/(J + 1) and x = ∆. Step 2 Calculate y = aj exp(−bj x) and aj+1 = (aj + y)/2, bj+1 = − x1 ln(y/aj+1 ). Increment x = x + ∆ and j = j + 1. Step 3 If j < J, Go to Step 2, else Stop. For J = 2 constraints, the following parameter values are found: j aj bj 1 0.858 0.541 2 0.728 0.295 Figure 5 shows the unconstrained Pareto-optimal region (in a dashed line), and two constraints. With the presence of both constraints, the figure demonstrates that about one-third portion of the original unconstrained Pareto-optimal region is now not feasible. The other two-third region of the constrained Pareto-optimal region comes from the two constraints. Since a part of the constraint boundary of each constraint now constitutes the Pareto-optimal region, a spread in Pareto-optimal solutions requires decision

290

K. Deb, A. Pratap, and T. Meyarivan 1.25

1

1111111111111111111 0000000000000000000 0000000000000000000 1111111111111111111

0000000000000000000 1111111111111111111 f2 0.75 0000000000000000000 1111111111111111111 1111111111111111111 0000000000000000000 000000000000000000 111111111111111111 0000000000000000000 1111111111111111111 000000000000000000 111111111111111111 0000000000000000000 1111111111111111111 000000000000000000 111111111111111111 0000000000000000000 1111111111111111111 000000000000000000 111111111111111111 0000000000000000000 1111111111111111111 000000000000000000 111111111111111111 0000000000000000000 1111111111111111111 000000000000000000 111111111111111111 0000000000000000000 1111111111111111111 000000000000000000 111111111111111111 0.5 0000000000000000000 1111111111111111111

0.25

0

0.2

0.4

0.6

0.8

1

f1

Fig. 5. Constrained test problem CTP1 with two J = 2 constraints.

variables (x) to satisfy the inequality constraints with the equality sign. Each constraint is an implicit non-linear function of decision variables. Thus, it may be difficult to find a number of solutions on a non-linear constraint boundary. The complexity of the test problem can be further increased by using more constraints and by using a multi-modal or deceptive g function. Besides finding and maintaining correlated decision variables to fall on the several constraint boundaries, there could be other difficulties near the Paretooptimal front. The constraint functions can be such that the unconstrained Pareto-optimal region is now infeasible and the resulting Pareto-optimal set is a collection of a number of discrete regions. At the extreme, the Pareto-optimal region can become a collection of a set of discrete solutions. Let us first present such a function mathematically and then describe the difficulties in each case.  Minimize f1 (x) = x1     Minimize f (x) = g(x) 1 − f1 (x) CTP2− 2 g(x) CTP7 :  Subject to c(x) ≡ cos(θ)(f2 (x) − e) − sin(θ)f1 (x) ≥    c d a |sin (bπ (sin(θ)(f2 (x) − e) + cos(θ)f1 (x)) )| .

(5)

The decision variable x1 is restricted in [0, 1] and the bounds of other variables depend on the chosen g(x) function. The constraint has six parameters (θ, a, b, c, d, and e). In fact, the above problem can be used as a constrained test problem generator where constrained test problems with different complexities will evolve by simply tuning these six parameters. We demonstrate this by constructing different test problems, where the effect of each parameter is also discussed. First, we use the following parameter values: θ = −0.2π,

a = 0.2,

b = 10,

c = 1,

d = 6,

e = 1.


291

The resulting feasible objective space is shown in Figure 6. It is clear from the figure that the unconstrained Pareto-optimal region becomes infeasible in the presence of the constraint. The periodic nature of the constraint boundary makes the Pareto-optimal region discontinuous, having a number of disconnected continuous regions. The task of an optimization algorithm would be to find as many such disconnected regions as possible. The number of disconnected regions can be controlled by increasing the value of the parameter b. It is also clear that with the increase in number of disconnected regions, an algorithm will have difficulty in finding representative solutions in all disconnected regions.

2

2

1.5

1.5

f2 1

f2 1

0.5

0.5 Pareto−optimal regions

0

0

0.2

0.4

0.6

0.8

1

f1


0

Pareto−optimal solutions 0

0.2

0.4

0.6

0.8

1

f1


The above problem can be made more difficult by using a small value of d, so that in each disconnected region there exists only one Pareto-optimal solution. Figure 7 shows the feasible objective space for d = 0.5 and a = 0.1 (while other parameters are the same as that in the previous test problem). Although most of the feasible search space is continuous, near the Pareto-optimal region, the feasible search regions are disconnected, finally each subregion leading to a singular feasible Pareto-optimal solution. An algorithm will face difficulty in finding all discrete Pareto-optimal solutions because of the changing nature from continuous to discontinuous feasible search space near the Pareto-optimal region. The problem can have a different form of complexity by increasing the value of parameter a, which has an effect of making the transition from continuous to discontinuous feasible region far away from the Pareto-optimal region. Since an algorithm now has to travel through a long narrow feasible tunnel in search of the lone Pareto-optimal solution at the end of tunnel, this problem will be more difficult to solve compared to the previous problem. Figure 8 shows one such problem with a = 0.75 and rest of the parameters same as that in the previous test problem.

292

K. Deb, A. Pratap, and T. Meyarivan 2

2

1.5

1.5

f2 1

f2 1

0.5

0.5 Pareto−optimal solutions

0

0

0.2

Pareto−optimal solutions

0.4

0.6

0.8

1

0

0

0.2

0.4

0.6

0.8

1

f1

f1



In all the three above problems, the disconnected regions are equally distributed in the objective space. The discrete Pareto-optimal solutions can be scattered non-uniformly by using c 6= 1. Figure 9 shows the feasible objective space for a problem with c = 2. Since c > 1, more Pareto-optimal solutions lie towards right (higher values of f1 ). If, however, c < 1 is used, more Paretooptimal solutions will lie towards left. For even higher number of Pareto-optimal solutions towards right, a larger value of c can be chosen. The difficulty will arise in finding all closely packed discrete Pareto-optimal solutions. The parameters θ and e do not have a major role to play in terms of producing a significant complexity. The parameter θ controls the slope of the Paretooptimal region, whereas the parameter e shifts the constraints up or down in the objective space. For the above problems, the Pareto-optimal solutions lie on the following straight line: (f2 (x) − e) cos θ = f1 (x) sin θ.

(6)

It is interesting to note that the location of this line is independent of other major parameters (a, b, c, and d). The above equation reveals that the parameter e denotes the intercept of this line on the f2 axis. The corresponding intercept on the f1 axis is −e/ tan θ. It is important here to mention that although the above test problems will cause difficulty in the vicinity of the Pareto-optimal region, an algorithm has to maintain an adequate diversity much before it comes closer to the Paretooptimal region. If an algorithm approaches the Pareto-optimal region without much diversity, it may be too late to create diversity among population members, as the feasible search region in the vicinity of the Pareto-optimal region is disconnected.


4.2

293

Difficulty in the Entire Search Space

Above test problems provide difficulty to an algorithm in the vicinity of the Pareto-optimal region. Difficulties may also come from the infeasible search regions present in the entire search space. Fortunately, the same constrained test problem generator can also be used here. Figure 10 shows the feasible objective search space for the following parameter values: θ = 0.1π,

a = 40,

b = 0.5,

c = 1,

d = 2,

e = −2.

Notice that the above parameter values are very different from that used in the previous section. Particularly, the parameter value of a is two-order magnitude larger than before. The objective space of this function has infeasible holes of differing widths towards the Pareto-optimal region. Since an algorithm has to overcome a number of such infeasible holes before coming to the island containing the Pareto-optimal front, an algorithm may face difficulty in solving this problem. Moreover, the unconstrained Pareto-optimal region is now not feasible. The entire constrained Pareto-optimal front lies on a part of the constraint boundary. (In this particular test problem, the Pareto-optimal region corresponds to all solutions satisfying 1 ≤ ((f2 − e) sin θ + f1 cos θ) ≤ 2.) The difficulty can be increased further by widening the infeasible regions (or by using a small value of d).

20

2

15

1.5

f210

f2 1

5

0.5 Pareto−optimal front

0

0

0.2

Pareto−optimal regions

0.4

0.6

0.8

0

1

0

0.2

0.4

0.6

0.8

1

f1

f1



The infeasibility in the objective search space can also come along the Paretooptimal region. Using the following parameter values θ = −0.05π,

a = 40,

b = 5,

c = 1,

d = 6,

e = 0,

294


we obtain the feasible objective space, as shown in Figure 11. This problem makes some portions of the unconstrained Pareto-optimal region feasible, thereby making a disconnected set of continuous regions. In order to find all such disconnected regions, an algorithm has to maintain an adequate diversity right from the beginning of a simulation run. Moreover, the algorithm also has to maintain its solutions feasible as it proceeds towards the Pareto-optimal region. Once again, the difficulty can be increased by reducing the width of the feasible regions by simply using a smaller value of d. A careful thought will reveal that this test problem is similar to CTP4, except that a large value of the parameter a is now used. This initiates the disconnectedness in the feasible region far away from the Pareto-optimal region. If it initiates away from the search region dictated by the variable boundaries, the entire search region becomes a patch of feasible and infeasible regions. With the above constraints, a combination of two or more effects can be achieved together in a problem by considering more than one such constraints. 4.3

More Than Two Objectives

Using the above concept, test problems having more than two objectives can also be developed. We modify equation 5 as follows. Using an M -dimensional transformation (rotational R and translational e), we compute f 0 = R−1 (f − e).

(7)

The matrix R will involve (M − 1) rotation angles. Thereafter, the following constraint can be used: 0 fM ≥

M −1 X

c dj aj sin bj πf 0 jj .

(8)

j=1

Here, all aj , bj , cj , dj , and θj are parameters that must be set to get a desired effect. Like before, a combination of more than one such constraints can also be considered.

5

Simulation Results

We compare NSGA-II with the constrained-domination principle, Jimenez’s algorithm and Ray et al.’s algorithms on test problems CTP1 till CTP7 with Rastrigin’s function as the g functional. In all algorithms, we have used the simulated binary crossover [4] with ηc = 20 and polynomial mutation operator [4] with ηm = 20, exactly the same as that used with NSGA-II. Identical recombination and mutation operators are used to investigate the effect of constraint handling ability of each algorithm. A crossover probability of 0.9 and mutation probability of 1/n (where n is the


295

number of variables) are chosen. In all problems, five decision variables1 are used. A population of size 100 and a maximum generation of 500 are used. For the Ray et al.’s algorithm, we have used a sharing parameter σshare = 0.158. For Jimenez’s algorithm, we has used tdom = 10 and σshare = 0.158. It is important to highlight that NSGA-II does not require any extra parameter setting. In all problems, the Jimenez’s algorithm performed poorly by not converging any where near the true Pareto-optimal region. Thus, we do not present the solutions using Jimenez’s algorithm. Figure 12 shows that both NSGA-II and Ray et al.’s algorithm are able to converge close to the true Pareto-optimal front on problem OSY, but NSGA-II’s convergence ability as well as ability to find diverse solutions are better.

80 NSGA−II Ray et al.

70 60

f_2

50 40 30 20 10 0 −300

−250

−200

−150 f_1

−100

−50

0

Fig. 12. Simulation results on OSY.

Figure 13 shows the population after 500 generations with NSGA-II and Ray et al.’s algorithm on CTP2. NSGA-II is able to find all disconnected Paretooptimal solutions, whereas Ray et al.’s algorithm could not converge well on all disconnected regions. Problem CTP3 degenerates to only one solution in each disconnected Paretooptimal region. NSGA-II is able to find a solution very close to the true Paretooptimal solution in each region (Figure 14). Ray et al.’s algorithm cannot quite converge near the Pareto-optimal solutions. As predicted, problem CTP4 caused difficulty to both algorithms. Figure 15 shows that both algorithm could not get near the true Pareto-optimal solutions. The non-uniformity in spacing of the Pareto-optimal solutions seems to be not a great difficulty to NSGA-II (Figure 16), but Ray et al’s algorithm has some difficulty in converging to all Pareto-optimal solutions. 1

As the simulation results show, only five variables caused enough difficulty to the three chosen MOEAs.

296

K. Deb, A. Pratap, and T. Meyarivan 2

2 NSGA−II Ray et al.

NSGA−II Ray et al. 1.5

f_2

f_2

1.5

1

0.5

0

1

0.5

0

0.2

0.4

0.6

0.8

0

1

0

0.2

0.4

f_1

0.6

0.8

1

f_1

Fig. 13. Simulation results on CTP2.

Fig. 14. Simulation results on CTP3. 2

2.5 NSGA−II Ray et al.

NSGA−II Ray et al.

2 1.5

f_2

f_2

1.5 1

1 0.5 0.5

0

0

0.2

0.4

0.6

0.8

1

f_1


0

0

0.2

0.4

0.6

0.8

1

f_1


When the entire search space consists of infeasible patches parallel to the Pareto-optimal front (CTP6 in Figure 17), both MOEAs are able to converge to the right feasible patch and finally very near to the true Pareto-optimal front. All feasible patches are marked with a ‘F’. Although both algorithms performed well in this problem, NSGA-II is able to find a better convergence as well as a better spread of solutions. However, when infeasible patches exist perpendicular to the Pareto-optimal front, both MOEAs had the most difficulty (Figure 18). None of them can find solutions closer to the true Pareto-optimal front. Although Ray et al’s algorithm maintained a better spread of solutions, NSGA-II is able to come closer to the true front. We believe that this is one of the test problems where an algorithm must maintain a good spread of solutions from the beginning of the run and must also have a good converging ability. Algorithms which tend to converge anywhere in the Pareto-optimal front first and then work on finding a spread of

Constrained Test Problems for Multi-objective Evolutionary Optimization 20

297

5



F

F

4

15 F 10

f_2

f_2

3 F

F 2

F F

5 F 0

0

0.2

0.4

F

1

0.6

0.8

1

f_1


0

0

0.2

0.4

0.6

F

0.8

F

1

f_1


solutions will end up finding solutions in a few of the feasible patches. NSGA-II shows a similar behavior in this problem.

6

Conclusion

In this paper, we have discussed the need of having tunable test problems for constrained multi-objective optimization. Test problems commonly used in most MOEA studies are simple and the level of complexity offered by the problems cannot be changed. We have presented a test problem generator which has six controllable parameters. By setting different parameter values, we have created a number of difficult constrained test problems. The difficulty in solving these test problems has been demonstrated by applying three constraint handling MOEAs on a number of these test problems. Although all algorithms faced difficulty in solving the test problems, NSGA-II with a constrained-domination principle has outperformed the other two MOEAs. The study has also shown that certain problem features can cause more difficulty than others. Because of the tunable feature of the proposed test problems and demonstrated difficulties on a number of constrained MOEAs, we believe that these problems would be used as standard constrained test problems in the coming years of research in evolutionary multi-objective optimization. Acknowledgements. Authors acknowledge the support provided by Department of Science and technology (DST) for this study.

References 1. Deb, K., Agrawal, S., Pratap, A., Meyarivan, T. (2000). A Fast Elitist Nondominated sorting genetic algorithm for multi-objective optimization: NSGA-II. Proceedings of the Parallel Problem Solving from Nature VI Conference, pp. 849– 858.

298


2. Deb, K., Pratap, A., Moitra, S. (2000). Mechanical component design for multiple objectives using elitist non-dominated sorting GA. Proceedings of the Parallel Problem Solving from Nature VI Conference, pp. 859–868. 3. Deb, K. (1999) Multi-objective genetic algorithms: Problem difficulties and construction of test Functions. Evolutionary Computation, 7(3), 205–230. 4. Deb, K. and Agrawal, R. B. (1995) Simulated binary crossover for continuous search space. Complex Systems, 9 115–148. 5. Fonseca, C. M. and Fleming, P. J. (1993) Genetic algorithms for multi-objective optimization: Formulation, discussion and generalization. In Forrest, S., editor, Proceedings of the Fifth International Conference on Genetic Algorithms, pages 416–423, Morgan Kauffman, San Mateo, California. 6. Horn, J. and Nafploitis, N., and Goldberg, D. E. (1994) A niched Pareto genetic algorithm for multi-objective optimization. In Michalewicz, Z., editor, Proceedings of the First IEEE Conference on Evolutionary Computation, pages 82–87, IEEE Service Center, Piscataway, New Jersey. 7. Jiménez, F. and Verdegay, J. L. (1998). Constrained multiobejctive optimization by evolutionary algorithms. Proceedings of the International ICSC Symposium on Engineering of Intelligent Systems (EIS’98), pp. 266–271. 8. Knowles, J. and Corne, D. (1999) The Pareto archived evolution strategy: A new baseline algorithm for multiobjective optimisation. Proceedings of the 1999 Congress on Evolutionary Computation, Piscataway: New Jersey: IEEE Service Center, 98–105. 9. Osyczka, A. and Kundu, S. (1995). A new method to solve generalized multicriteria optimization problems using the simple genetic algorithm. Structural Optimization(10). 94–99. 10. Ray, T., Kang, T., and Chye, S. (in press). Multiobjective design optimization by an evolutionary algorithm, Engineering Optimization. 11. Srinivas, N. and Deb, K. (1995). Multi-Objective function optimization using nondominated sorting genetic algorithms. Evolutionary Computation(2), 221–248. 12. Tanaka, M. (1995). GA-based decision support system for multi-criteria optimization. Proceedings of the International Conference on Systems, Man and Cybernetics-2, pp. 1556–1561. 13. Van Veldhuizen, D. (1999). Multiobjective evolutionary algorithms: Classifications, analyses, and new innovations. PhD Dissertation and Technical Report No. AFIT/DS/ENG/99-01, Dayton, Ohio: Air Force Institute of Technology. 14. Zitzler, E. (1999). Evolutionary algorithms for multiobjective optimization: Methods and applications. Doctoral thesis ETH NO. 13398, Zurich: Swiss Federal Institute of Technology (ETH), Aachen, Germany: Shaker Verlag.

Constraint Method-Based Evolutionary Algorithm (CMEA) for Multiobjective Optimization 1

2

S. Ranji Ranjithan , S. Kishan Chetan , and Harish K. Dakshina

3

1

Department of Civil Engineering, Campus Box 7908, North Carolina State University, Raleigh, NC 27695, USA [email protected] 2 Siebel Systems, 6001 Shellmound, Emeryville, CA 94608, USA [email protected] 3 Department of Civil Engineering, Campus Box 7908, North Carolina State University, Raleigh, NC 27695, USA [email protected]

Abstract. Evolutionary algorithms are becoming increasingly valuable in solving large-scale, realistic engineering multiobjective optimization (MO) problems, which typically require consideration of conflicting and competing design issues. The new procedure, Constraint Method-Based Evolutionary Algorithm (CMEA), presented in this paper is based upon underlying concepts in the constraint method described in the mathematical programming literature. Pareto optimality is achieved implicitly via a constraint approach, and convergence is enhanced by using beneficial seeding of the initial population. CMEA is evaluated by solving two test problems reported in the multiobjective evolutionary algorithm (MOEA) literature. Performance comparisons based on quantitative metrics for accuracy, coverage, and spread are presented. CMEA is relatively simple to implement and incorporate into existing implementations of evolutionary algorithm-based optimization procedures.

1 Introduction Tradeoff information in the form of a noninferior, or Pareto optimal set, of solutions is important in considering competing design objectives when making decisions associated with most engineering problems. The use of standard mathematical programming-based techniques, such as constraint method and weighting method (Cohon, 1978) for generating noninferior sets, in many practical engineering problems is limited because the models describing the engineering processes seldom fit into the restrictive function forms required by these mathematical programming techniques. As evolutionary algorithms offer a relatively more flexible way to analyze and solve realistic engineering design problems, their use in multi criterion decision making is becoming increasingly important. An array of multiobjective evolutionary algorithms (MOEAs) has been reported since the early eighties. Detailed summaries of the state-of-the-art in MOEA were discussed recently by Coello (1999a) and Van Veldhuizen and Lamont (2000), and are represented in the special issue of Evolutionary Computation (Vol. 8, No. 2, Summer 2000) on multi criterion optimization (also see Coello (1999b) for an archive of bibliography). E. Zitzler et al. (Eds.): EMO 2001, LNCS 1993, pp. 299-313, 2001. © Springer-Verlag Berlin Heidelberg 2001

300

S.R. Ranjithan, S.K. Chetan, and H.K. Dakshina

The procedure presented in this paper integrates the underlying concepts of traditional multiobjective optimization (MO) techniques into an evolutionary algorithm framework. In the conventional constraint method for MO, one objective is optimized while constraining all other objectives to target levels to identify a noninferior, or Pareto optimal, solution. This is applied iteratively to generate the noninferior set. Solving a number of independent single objective optimization models to obtain the noninferior set, however, renders these MO methods less attractive if obtaining each noninferior solution is computationally intensive. This issue is addressed in some traditional mathematical programming approaches (e.g., linear programming, nonlinear programming) by seeding a search for a new noninferior solution with a previously generated adjacent noninferior solution (i.e., prior basis). Since, for some class of problems, noninferior solutions adjacent in the decision space map to adjacent points in the objective space, this seeding approach reduces the number of steps in the search for each noninferior solution. This paper describes the development of the Constraint Method-Based Evolutionary Algorithm (CMEA), which explicitly uses this adjacency mapping property to its advantage within an MOEA framework. The underlying simple concepts in CMEA allow it to be applied easily within existing implementations of evolutionary algorithms for single objective optimization. First, the general representation of a standard MO problem and definitions of Pareto optimality are presented, followed by a brief overview of existing MOEAs and their applications. The details of CMEA are then described, followed by its application to a couple of published test problems. An extensive performance comparison of CMEA and four commonly accepted MOEAs in solving one of the published test problems is presented. The noninferior solutions are also compared to those obtained via mathematical programming techniques. Finally, concluding remarks are made with a brief discussion of CMEA’s strengths and weaknesses.

2 Background

2.1 A Standard Multiobjective Optimization Problem A general multiobjective optimization problem consisting of k competing objectives and m constraints defined as functions of decision variable set x can be represented as follows: Maximize Z(x) = {Zl(x): l=1,2, …, k} Subject to

gi(x) 0

(1)

"i = 1,2,…,m

(2)

x³X

(3) th

where x = {xj : j = 1,2,…..,n} represents the decision vector, xj is the j decision th variable, X represents the decision space, gi(x) is the i constraint, Z(x) is the th multiobjective vector, and Zl(x) is the l objective function.

Constraint Method-Based Evolutionary Algorithm (CMEA)

301

2.2 Noninferiority Noninferiority, which is also referred as nondominance or Pareto optimality, of a set of solution is formally defined as follows (Cohon, 1978): a feasible solution to a multiobjective problem is non-inferior if there exists no other feasible solution that will yield an improvement in one objective without causing a degradation in at least one other objective. Van Veldhuizen and Lamont (2000) and Zitzler et al. (2000) provide a more rigorous definitions of this and related MO terminology. Based on the definitions by Van Veldhuizen and Lamont (2000) and notations used in Equations 1-3, the following are defined: Pareto Dominance: A multiobjective vector u = (u1,u2,…uk) is said to dominate v = (v1,v2,…vk) (denoted by u ½ v ) if and only if u is partially more than v, i.e., ∀i ∈ {1,2,...k }, ui ≥ vi ∧ ∃i ∈ {1,2,...k } : ui > vi . Pareto Optimality: A solution x ³ X is said to be Pareto optimal with respect to X if ’ ’ and only if there exists no x ³ X for which v = Z(x ) dominates u = Z(x). Pareto Optimal Set: For a given multiobjective problem Z(x), the Pareto optimal set * * P is a set consisting of Pareto optimal solutions. P is a subset of all the possible * solutions in X. Mathematically, P is defined as follows: P := {x ³ X | ½$ x ³ X : Z(x ) ½ Z(x)} *

’

’

(4)

*

Pareto Front: The Pareto front, PF is the set that contains the evaluated objective * * vectors of P . Mathematically PF is defined as: PF := { u = Z(x) | x ³ P } *

*

(5)

2.3 Multiobjective Evolutionary Algorithms (MOEAs) Many procedures have been reported since the pioneering work by Schaffer (1984, 1985) in the area of EAs for MO optimization. Fonesca and Fleming (1993, 1995), Horn (1997), Coello (1999a, 1999b), and Van Veldhuizen and Lamont (2000) present detailed surveys and catalogues of existing MOEAs. Many different bases, e.g., differences in fitness and selection implementations, for higher-level classification of MOEAs are used in these surveys. For instance, Schaffer’s (1985) vector evaluated genetic algorithm (VEGA) uses a special single-objective-based preferential selection procedure, the method by Hajela and Lin (1992) uses an aggregated fitness function, and the methods by Horn et al. (1994), Srinivas and Deb (1994), Zitzler and Thiele (1999), and Knowles and Corne (2000) use Pareto-based selection procedures to determine the noninferior set. Further, these techniques can be categorized by special operators they use, such as niching and sharing (e.g., Horn et. al., 1994; Menczer et. al., 2000), restrictive mating (e.g., Loughlin and Ranjithan, 1997), and elitism (e.g., Knowles and Corne, 2000; Zitzler and Thiele, 1999). Loughlin et al. (2000a) recently presented an EA-based approach that addresses problems with multiple objectives where some may not be easily quantified or modeled. Applications discussed by

302


Hajela and Lin (1992), Ritzel et al. (1994), Cieniawski et al. (1995), Jimenez and Cadenas (1995), Harrell and Ranjithan (1997), Coello et al. (1998), Coello and Christiansen (2000), Loughlin et al. (2000b), Obayashi et al. (2000) are some examples of use of MOEAs in multiobjective optimization of varied realistic engineering problems. VEGA-Vector Evaluated Genetic Algorithm (Schaffer, 1985), NPGA-Niched Pareto Genetic Algorithm (Horn et al., 1994), NSGA-Non-dominated Sorting Genetic Algorithm (Srinivas and Deb, 1994), and SPEA-Strength Pareto Evolutionary Algorithm (Zitzler and Thiele, 1999) are the four selected MOEAs that are used to compare the performance of CMEA presented in this paper.

3 CMEA – Constraint Method-Based Evolutionary Algorithm Based on the concepts of the mathematical programming-based constraint approach (Cohon, 1978) for generating the noninferior set, CMEA achieves Pareto optimality in an implicit manner by ensuring that the population migrates along the noninferior surface. At each iteration, the population converges to a noninferior solution by solving the following single objective optimization problem: Maximize

Zh(x)

Subject to

gi(x) 0

(6)

t

Zl(x) > Zl x³X

"i = 1,2,…,m

(7)

"l = 1,2,…,k; l h

(8) (9)

t

where, Zh is one of the k objectives, and Zl {l=1,2,…k; lh} is the constraint value for t objective l (h) corresponding to a noninferior solution. By varying Zl incrementally, the search migrates from one noninferior solution to an adjacent solution, eventually tracing the noninferior surface. A two-objective illustration is shown in Figure 1. At each intermediate step in which one noninferior solution is obtained, the model given by Equations (6)-(9) is solved. A straightforward implementation of an algorithm that repeats this intermediate step would be similar to iterative execution of a single objective EA, which is not necessarily computationally efficient. Instead, CMEA exploits the basic concept that for some classes of problems, adjacent solutions in the decision space map to adjacent points in the objective space. Its implication is that these decision vectors (xs) (that map to adjacent noninferior points in the objective space) have solution features (i.e., values of xjs) that are only marginally different. This enables the beneficial use of the final population corresponding to the current noninferior solution to seed the search of an adjacent noninferior solution. The new search of course would have an updated constraint set (8) to represent an adjacent noninferior point in the objective space. When the new selection pressure manifesting from the updated constraint vector is applied on the previous population, the population quickly migrates to an adjacent noninferior solution. A systematic update of the constraint set (8) thus enables an efficient mechanism for incrementally tracing the noninferior set. This incremental population migration approach significantly reduces the computational burden compared to that required when solving each single objective EA as independent search problems.

Constraint Method-Based Evolutionary Algorithm (CMEA) Noninferior point D is obtained using solution to C as a starting point

Noninferior set

Z2

303

A

D C

Noninferior point C is the solution to: Maximize Z2(x) Subject to: gi(x) < 0 "i = 1,2,…,m t

Z1(x) > Z1 x³X

D B

Z1t

Z1

Fig. 1. Illustration of the constraint method using a two-objective example

Using a two objective problem as an illustration (Figure 1), let the current t constraint value for objective 1 be Z1 . While at noninferior point C, the updated constraint value corresponding to the search for an adjacent noninferior solution D t would be (Z1 - D), where the magnitude of D determines the minimum interval desired between adjacent noninferior solutions. For example, smaller values of D would result in a finer coverage (or better distribution) of the noninferior set, but would require execution of more intermediate steps, each of which requiring the solution of a single objective EA. At the beginning of the algorithm, the solutions to the two extreme points (A and B in Figure 1) are obtained. Using these solutions, the B A increment D is computed as (Z1 – Z1 )/r, where r is a predefined number of intervals. Then the algorithm starts at extreme point B, and solves the model with the constraint B value of (8) set to Z1 -D. Once the population converges to the adjacent noninferior solution according to some stopping criterion, the best solution is stored. Then the t t constraint value is incremented adaptively to Z1 Z1 -D, and the current population continually undergoes the evolutionary operators and fitness pressure. To introduce higher population diversity at the beginning of each search, the mutation operator is applied in an adaptive manner during each intermediate step, starting with a higher rate and gradually reducing it (e.g., exponential decay) with generations within each step. Thus, at the beginning of each intermediate step the higher mutation rate perturbs the converged population around the previous noninferior point, introducing diversity for the new search. This iterative process is terminated when the constraint value corresponds to the t A extreme point A, i.e., when Z1 = Z1 . Two convergence criteria are implemented to determine when to update the constraint value and when to initiate the search for the next noninferior solution. One of the criteria is to check if the number of generations, generation, exceeds a maximum value, maxGenerations. The other criterion is to track the improvement in the best solution in each intermediate step; convergence is assumed when the best solution does not improve within a certain number (N) of successive generations. If either of the above two criteria is satisfied then the

304


START

Initialize Population intervalNo= 1, generation = 1 Initialize constraint values

Evaluate Fitness Apply Selection Operator Update population generation ← generation + 1 Update mutation rate

Update constraint values intervalNo ← intervalNo + 1 generation = 1 Reinitialize mutation rate

Apply Crossover Operator Apply Mutation Operator

N

generation > maxGenerations? Y

STOP

Y

intervalNo > maxIntervals?

N

Fig. 2. Flowchart for CMEA – Constraint Method-Based Evolutionary Algorithm

constraint value is updated. The key steps of CMEA are shown as a flowchart in Figure 2. Instead of converging the population to the noninferior set simultaneously, at each intermediate step of CMEA, a point in the noninferior set is identified through a search conducted by the whole population, and the final noninferior set is generated by storing all noninferior solutions found at the intermediate steps. The coverage of the noninferior set is achieved explicitly by traversing the noninferior surface through incremental and systematic updates of the constraint values.

4 Testing and Evaluation of CMEA CMEA was applied to two test problems of different difficulty and characteristics. The first application uses Schaffer’s F2 problem (Schaffer, 1985), which is an unconstrained, nonlinear problem. This is included since most other MOEA methods have been tested against it, providing a common basis for comparison. While this application represents a problem in a continuous search space, the second application, which uses the extended 0/1 multiobjective knapsack problem (Zitzler and Thiele, 1999), represents a problem in a combinatorial search space. This problem is a constrained, binary problem. Performance comparisons of several MOEAs in solving this problem are presented by Zitzler and Thiele (1999), and are used here to compare the performance of CMEA. In addition, a noninferior set was generated using a


305

mathematical programming-based weighting method for the extended 0/1 knapsack Ç problem, which was solved using a binary programming solver CPLEX . Several performance criteria are used to evaluate CMEA and to compare it with other approaches: 1) accuracy, i.e., how close are the generated noninferior solutions to the best available prediction; 2) coverage, i.e., how many different noninferior solutions are generated and how well are they distributed; and 3) spread, i.e., what is the maximum range of the noninferior surface covered by the generated solutions. Currently reported as well as newly defined quantitative measures (Chetan, 2000) are used in comparing CMEA with other MOEAs. The robustness of CMEA in solving problems with different characteristics (e.g., real vs. binary variables, constrained vs. unconstrained, continuous vs. combinatorial) is examined, in some limited manner, by applying it to these two different problems. To evaluate the robustness of CMEA in generating the noninferior set and providing good coverage, random trials were performed where the problems were solved repeatedly for different random seeds. A representative solution is used in the comparisons below 4.1 Schaffer’s F2 Problem

4.1.1 Description. The F2 problem is defined as follows: Minimize Minimize

Z1 = x

2

(10)

Z2 = (x – 2)

2

(11)

The range for the decision variable x is [-5,7]. The Pareto optimal solutions constitute all x values varying from 0 to 2. The solution x = 0 is optimum with respect to Z1 while the solution x = 2 is optimum with respect to Z2. That is, objective functions Z1 and Z2 are in conflict in the range [0,2]. 4.1.2 Results. The F2 problem was solved using CMEA with algorithm-specific parameters as shown in Table 1. Results are compared in Figure 3 where the exact solution (obtained analytically using Equations (10) and (11)) for this problem is also shown. Although this is a relatively simple problem, the results indicate that CMEA is very accurate in generating the noninferior set for this problem. Also, it provides good coverage by generating a good distribution of noninferior solutions, and provides a full spread. Table 1. CMEA parameters and settings for solving the test problems

Problem

F2 Knapsack

Variable Type

Real Binary

CMEA No. of intervals 100 100

Pop. size 100 100

Parameters Encoding

Crossover

32 bit Binary Binary

Uniform Uniform

306


5

CMEA Analytical

4

Z2

3

2

1

0 0

1

2

3

4

5

Z1

Fig. 3. The true noninferior tradeoff curve and the noninferior set determined by CMEA for Schaffer’s F2 problem

4.2 Extended 0/1 Multiobjective Knapsack Problem 4.2.1 Description. Zitzler and Thiele (1999) used in their work a knapsack problem that extends the traditional single objective knapsack problem by incorporating two knapsacks that can be filled by items selected from a larger collection of items. Similar to the traditional knapsack problem, each knapsack has a limited weight capacity with different payoff when each item is included in it. The goal is to allocate a limited set of items to maximize the payoff in each knapsack without violating its weight capacity constraint. This multiobjective problem is defined mathematically as follows: n

Maximize

Zl(x) =

∑

pl,j xj

"l = 1,2,…,k

(12)

"l = 1,2,…,k

(13)

j =1

n

Subject to

∑

wl,j xj

cl

j =1

In the formulation, Zl(x) is the total profit associated with knapsack l, pl,j = profit of placing item j in knapsack l, wl,j = weight of item j when placed in knapsack l, cl = n capacity of knapsack l, x = (x1, x2,……, xn) ³ {0,1} such that xj = 1 if selected and = 0 otherwise, n is the number of available items and k is the number of knapsacks.


307

This binary MO problem was solved for the cases with two knapsacks (i.e. k = 2) and 250 and 500 items. The results reported here correspond to n = 500 and k = 2. The data for the problems solved were adapted from Zitzler and Thiele (1999). 4.2.2 Results. The extended knapsack problem was solved by CMEA for the parameter setting shown in Table 1. In addition, the noninferior set was generated using the constraint method for this problem by modeling it as a binary linear programming (BLP) model. This was solved using the binary linear programming Ç solver, CPLEX . In Figure 4, these results are shown along with the results reported by Zitzler and Thiele (1999) for the following MOEAs: VEGA, NPGA, NSGA, and SPEA. To examine the consistency of CMEA in solving this problem, ten trials with different random seeds were conducted, and the results were insensitive to the random seed, indicating robust behavior. Accuracy of the noninferior solutions generated by CMEA should be compared with respect to the best available noninferior set, as well as with the best estimate obtained by the other MOEAs. The mathematical programming-based estimate of the noninferior set, the best available for this problem, is included in Figure 4 to make the first evaluation. Compared to this, the accuracy of noninferior solutions generated by CMEA and the other MOEAs is relatively poor. The combinatorial nature of the search can be attributed to the weak performance by all EAs. Accuracy of CMEA in comparison to other MOEA results , however, is very good. Noninferior solutions obtained by SPEA, the best performing MOEA according to Zitzler and Thiele (1999), appear to dominate the solutions generated by CMEA in the corresponding noninferior region. The spread or range covered by the CMEA generated solutions, however, is far superior to that attained by all other MOEAs, including SPEA. Further, CMEA is able to provide good coverage by identifying noninferior solutions that are better distributed over a wider range of the noninferior set.

5 Performance Metrics and Comparison of MOEAs To compare the performance of CMEA with that of other MOEAs, the following quantitative measures are used. - Accuracy: The S factor used by Zitzler and Thiele (1999) to represent the size of noninferior space covered is used to characterize and compare accuracy. In addition, the approach used by Knowles and Corne (2000) is used to characterize the degree to which a noninferior set outperforms another. An either-or criterion is used to determine if the noninferior set obtained by an MOEA dominates that obtained by another MOEA; the closeness of the two points of intersection are not differentiated statistically. - Spread: Spread is quantified for each objective as the fraction of the maximum possible range of that objective in the noninferior region covered by a noninferior points A and B refer to the two extreme points, i.e., the single objective optimal solutions for objective 1 and 2, respectively, for a two objective case. The maximum range covered by the noninferior solutions represented by the ordered Cq C1 C1 Cq set C = {Ch , " h³ {0,1, …, q}} is (Z1 – Z1 ) and (Z2 – Z2 ) in Z1 and Z2 objective space, respectively. Therefore, the spread metrics in objective space 1 and 2 are Cq C1 B A C1 Cq A B defined as (Z1 – Z1 )/(Z1 – Z1 ) and (Z2 – Z2 )/(Z2 – Z2 ), respectively.

308


Fig. 4. A comparison of noninferior sets obtained using CMEA, VEGA, NPGA, NSGA, SPEA, and mathematical programming approach (BLP-Binary Linear Programming) for the extended 0/1 multiobjective knapsack problem

Coverage: A quantitative measure computed based on the maximum gap in coverage is defined to represent the distribution of the noninferior solutions generated by an MOEA. The Euclidean distance between adjacent noninferior points in the objective space is used to indicate the gap. A smaller value of this metric indicates better distribution of solutions in the noninferior set. This metric is defined separately as V1 and V2 to characterize the coverage within the range of noninferior region defined by 1) the extreme points, and 2) the solutions generated by the MOEA, respectively. Using the illustrations shown in Figure 6, V1 is defined as Max {dh, " h³ {0,1, …, q}}, and V2 is defined as Max {dh , " h³{1, 2, …, q-1}}. A summary of these metrics are compared in Tables 2a-2d for the noninferior solutions generated by all MOEAs shown in Figure 4. These results indicate that overall CMEA performs better than NPGA, NSGA, SPEA, and VEGA with respect to finding nondominated solutions with a good distribution in the noninferior region. This conclusion is specific to the 0/1 extended multiobjective knapsack problem, and similar performance comparisons for other problems are needed to make more general conclusions. Although CMEA provides the best distribution of solutions in the entire noninferior range (based on V1 metric), SPEA provides a better distribution (based on V2 metric) within the narrower noninferior range represented by its solutions.

Constraint Method-Based Evolutionary Algorithm (CMEA) A

309

A

A (Z1 ,Z2 ) C1

Range covered by C in Z2 objective space

Maximum range in Z2 objective space

Z2 ( maximize Å )

d0

d1

C2 d2

dq-1 Cq Range covered by C in Z1 objective space

dq B

B

B (Z1 ,Z2 )

Maximum range in Z1 objective space Z1 ( maximize Å ) Fig. 5. An example two-objective noninferior tradeoff to illustrate the computation of: 1) Spread metric, and 2) Coverage metric Table 2a. Accuracy comparison, based on the S factor (Zitzler and Thiele, 1999), of noninferior sets generated by different MOEAs for the extended 0/1 multiobjective knapsack problem. A larger value indicates better performance; the best is shown in bold

MOEA Method SPEA

NSGA NPGA VEGA CMEA

S Factor 0.89 0.79 0.83 0.81 0.92

6 Summary and Conclusions This paper presents a new MOEA, CMEA-Constrain Method-based Evolutionary Algorithm for solving multiobjective optimization problems. CMEA is founded upon two simple, but powerful concepts borrowed from the mathematical programming literature: 1) optimization of a single objective model with target constraints on all but one objective finds a noninferior, or Pareto optimal, solution; and 2) for some classes of problems, noninferior solutions adjacent in objective space map to adjacent decision vectors with only marginal differences in the decision space. The attractive features of CMEA include: easily adaptable for use with existing implementation of

310


evolutionary algorithms for an optimization problem since no new operators are needed; and relatively less compute intensive since Pareto optimality is ensured in an implicit manner, and therefore expensive sorting and pair-wise comparison operations that are typically required by other Pareto-based MOEAs are eliminated. Table 2b. Accuracy comparison, based on the metric defined by Knowles and Corne (2000), of CMEA with different MOEAs for the extended 0/1 multiobjective knapsack problem

The MOEAs Compared (MOEA1 vs. MOEA2) (CMEA vs. SPEA) (CMEA vs. NSGA) (CMEA vs. NPGA) (CMEA vs. VEGA)

(P1, P2): (Percentage number of times MOEA1 outperforms MOEA2, Percentage number of times MOEA2 outperforms MOEA1) Number of Sampling Lines 108 507 1083 (95.4, 4.6) (95.3, 4.7) (95.2, 4.8) (100, 0) (100, 0) (100, 0) (100, 0) (100, 0) (100, 0) (100, 0) (100, 0) (100, 0)

Table 2c. Comparison of Spread of noninferior sets generated by different MOEAs for the extended 0/1 multiobjective knapsack problem. A larger value indicates better performance; the best is shown in bold

MOEA SPEA NPGA NSGA VEGA CMEA

Spread Metric in Z1 objective space in Z2 objective space 0.28 0.24 0.26 0.20 0.78

0.23 0.25 0.15 0.16 0.47

Table 2d. Comparison of Coverage of noninferior sets generated by different MOEAs for the extended 0/1 multiobjective knapsack problem. A smaller value indicates better performance; the best is shown in bold

MOEA

SPEA NPGA NSGA VEGA CMEA

Coverage Metric V1 (includes the extreme points for each objective) 0.118 0.122 0.121 0.130 0.088

V2 (excludes the extreme points for each objective) 0.011 0.016 0.021 0.015 0.04

To evaluate the applicability of CMEA to MO problems, it was applied to two test problems with different characteristics and levels of difficulty. Test problems


311

covered continuous as well as combinatorial search, unconstrained as well as constrained optimization, real as well as binary variables, and as few as one variable to as high as 500 variables. This evaluation included performance comparisons with other MOEAs and with mathematical programming-based noninferior solutions. Accuracy, coverage, and spread of the noninferior solutions were used to compare the performance. To evaluate the consistency of CMEA in generating the noninferior set, several random trials were performed. Overall, CMEA performed well with respect to these criteria for both problems tested. The spread and coverage of noninferior solutions obtained using CMEA were always better than those demonstrated by other MOEAs. With respect to accuracy, SPEA did better than CMEA for a narrow range of noninferior solutions, but overall CMEA did better over a broader range of the noninferior set. Some known limitations of CMEA include the following. The computational efficiency gain obtained in CMEA is predicated on the existence of similarities in noninferior solutions that correspond to adjacent points in the objective space. For problems where this may not hold true strongly, the search implemented by CMEA becomes analogous to solving a number of independent single objective optimization problems, and therefore, may not realize any significant computational gain. For a problem with more than two objectives, incrementally updating the constraint values to obtain an adjacent point is not necessarily as straightforward as is for the twoobjective cases presented here. More investigation is needed to evaluate this issue when applying CMEA to higher dimensional problems. In the present study, the number of functions evaluations was used as a measure to compare the computational needs of CMEA with that of a single objective-based MO analysis without seeding. CMEA required approximately 75% fewer function evaluations. This measure alone is not sufficient to compare the computational gain, if any, that may be realized by CMEA over the other MOEAs that use explicit Pareto optimality ordering. The computational performance of CMEA and other MOEAs needs to be studied further.

References 1. 2. 3. 4. 5. 6.

Chetan, S. K., (2000). Noninferior Surface Tracing Evolutionary Algorithm (NSTEA) for Multiobjective Optimization, MS Thesis, North Carolina State University, Raleigh, North Carolina. Cieniawski, S.E., Eheart, J. W., and Ranjithan, S., (1995). Using Genetic Algorithms to Solve a Multi-Objective Groundwater Monitoring Problem, Water Resources Research, vol. 31, no. 2, pp. 399-409. Coello, C.A.C., Christiansen, A.D., and Aguirre, A.H., (1998). Using a New GA-Based Multiobjective Optimization Technique for the Design of Robot Arms, Robotica, 16(4), pp. 401-414 Coello, C. A. C., (1999a). A comprehensive survey of evolutionary-based multiobjective optimization techniques, Knowledge and Information System, 1(3), pp. 269-308. Coello, C. A. C., (1999b). List of references on evolutionary multiobjective optimization. Available: www.lania.mx/~ccoello/EMOO Coello, C.A.C. and Christiansen, A.D., (2000). Multiobjective optimization of trusses using genetic algorithms, Computers and Structures, 75(6), pp. 647-660.

312 7. 8. 9. 10. 11.

12.

13. 14. 15. 16. 17. 18. 19. 20. 21. 22. 23. 24. 25.

S.R. Ranjithan, S.K. Chetan, and H.K. Dakshina Cohon, J.L., (1978). Multiobjective programming and planning, Mathematics in Science and Engineering, Vol. 140, Academic Press, Inc. Fonesca, C.M., and Fleming, P.J., (1993). Genetic Algorithms for multiobjective optimization: Formulation, Discussion and generalization, Genetic Algorithms: Proceedings of Fifth International Conference, pp. 416-423. Fonesca, C.M, and Fleming, P.J., (1995). An overview of evolutionary algorithms in multiobjective optimization, Evolutionary Computation, 3(1), pp. 1-16. Hajela, P. and Lin, C.-Y.,(1992). Genetic search strategies in multicriterion optimal design, Structural Optimization, 4, pp. 99-107. Harrell, L. J. and Ranjithan, S., (1997). Generating Efficient Watershed Management Strategies Using a Genetic Algorithms-Based Method, Ed: D. H. Merritt Proceedings of th the 24 Annual Water Resources Planning and Management Conference (ASCE), Houston, TX, April 6-9, 1997, pp. 272-277. Horn, J., and Nafpliotis, N. and Goldberg, D.E., (1994). A niched Pareto genetic algorithm for multiobjective optimization, Proceedings of the First IEEE Conference on Evolutionary Computation, IEEE World Congress on Computational Intelligence, 1, pp. 82-87. Horn, J., (1997). Multicriterion decision making, In Back, T., Fogel, D., and Michalewicz, Z., editors, Handbook of Evolutionary Computation, Volume 1, pp. F1.9:1-F.1.9:15, Oxford University Press, Oxford, England. Jiménez, J. and Cadenas, J.M., (1995). An evolutionary program for the multiobjective solid transportation problem with fuzzy goals, Operations Research and Decisions, 2, pp. 5-20. Knowles, J.D., and Corne, D.W., (2000). Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy, Evolutionary Computation, 8(2): pp. 149-172. Loughlin, D.H., and Ranjithan, S., (1997). The neighborhood constraint method: a genetic algorithm-based multiobjective optimization technique, Proceedings of the Seventh International Conference on Genetic Algorithms, pp. 666-673. Loughlin, D. H., Ranjithan, S., Brill, E. D., and Baugh, J. W., (2000a). Genetic algorithm approaches for addressing unmodeled objectives in optimization problems, to appear in Engineering Optimization (in print). Loughlin, D. H., Ranjithan, S., Baugh, J. W., and Brill, E. D., (2000b). Application of Genetic Algorithms for the Design of Ozone Control Strategies, Journal of the Air and Waste Management Association, 50, June 2000, pp. 1050-1063. Menczer, F, Degeratu, M., and Street, W. N., (2000). Efficient and scalable Pareto optimization by evolutionary local selection algorithms, Evolutionary Computation, 8(2), pp. 223-247. Obayashi, S., Sasaki, D., and Hirose, N., (2000). Multiobjective Evolutionary Computation for Supersonic Wing-Shape Optimization, IEEE Transactions on Evolutionary Computation, 4(2), pp. 182-187. Ritzel, B. J., Eheart, J. W., and Ranjithan, S., (1994). Using Genetic Algorithms to Solve a Multi-Objective Groundwater Remediation Problem, Water Resources Research, vol. 30, no. 5, pp. 1589-1603. Schaffer, J.D., (1984). Multiple objective optimization with vector evaluated genetic algorithms, Ph.D. Thesis, Vanderbilt University. Schaffer, J.D., (1985). Multiple objective optimization with vector evaluated genetic algorithms, Genetic Algorithms and Their Applications: Proceedings of the First International Conference on Genetic Algorithms, pp. 93-100. Srinivas, N., and Deb, K., (1994). Multiobjective optimization using nondominated sorting in genetic algorithms, Evolutionary Computation, 2(3), pp. 221-248. Van Veldhuizen, D.A., and Lamont, G.B., (2000). Multiobjective evolutionary algorithms: Analyzing the state-of-the-art, Evolutionary Computation, 8(2), pp. 125-147.


313

26. Zitzler, E., and Thiele, L., (1999). Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach, IEEE Transactions on Evolutionary Computation, 3(4), pp. 257-271. 27. Zitzler, E., Deb, K., and Thiele, L., (2000). Comparison of multiobjective evolutionary algorithms: empirical results, Evolutionary Computation, 8(2), pp. 173-195.

Pareto-Front Exploration with Uncertain Objectives J¨ urgen Teich? University of Paderborn, D-33100 Paderborn, Germany, [email protected], WWW home page: http://www-date.upb.de

Abstract. We consider the problem of exploration of the set of all global optima (Pareto-points) or an approximation thereof in the context of multi-objective function optimization. Up to now, set oriented techniques assume that the evaluation of the m−dimensional vector of objectives can be done exactly which is important to steer the search process towards global optima. Here, we extend such techniques to allow objectives to be uncertain, i.e., vary within intervals. This may be often the case if the exact computation of objectives is computationally too expensive such that only estimates on the objective values of a design point may be derived. For objective values that are constrained by intervals, we derive a theory of probabilistic dominance, an extension of the definition of Pareto-dominance. Also, we show how this theory may be used in order to guide the selection process to approximate the Pareto-set.

1

Introduction

The need for design space exploration on different levels of abstraction has received wide attention in many different domains today, e.g., in function minimization, during synthesis of electronic systems, etc. The optimization problem is typically multi objective in nature and m design objectives have to be considered simultaneously. Also, not one global optimum is sought in many cases, but a set of so-called Pareto-points. In order to explore the front of Pareto-optimal points, set-oriented optimization techniques have been investigated recently, see, e.g., [2] for continuous problems, and many population-based techniques based on evolutionary algorithms, see e.g., [3], [13], that are applicable also to discrete problems. In both cases, the success of exploration depends heavily on the preciseness of the computed objective functions because these values are used for defining the Pareto-dominance criterion. In reality, however, the objective function is often only an approximation of the real objective. Such approximations are either necessary because of unknown model parameters, computational cost, or, the objectives are based on estimations because there is no analytical way to compute the costs exactly. ?

This work was supported by the Deutsche Forschungsgemeinschaft (DFG) under grant Te 163/5


Pareto-Fronts with Uncertain Objectives

315

In such cases, it is questionable whether a design point dominates another point or not. It turns out, however, that in many cases, the error in estimating an objective may be bounded from below and above such that the objective may be constrained by an interval. Such abstractions are often met, e.g., in evaluating the cost of the design of a technical system or in the latency of a schedule. In this paper, we extend existing techniques for design space exploration based on the Pareto-dominance criterion to the case where one or more objectives of an m−dimensional vector function are subject to uncertainties and given by so called property intervals. By treating an objective y = f (x) on an n−dimensional design point x as a random variable Y , we consider the case of continuous uniform distribution of Y ∈ [f s (x), · · · , f u (x)] with f s (x), f u (x) ∈ R. In this case, we assume that the probability density p(y) is equal and constant over the property interval [f s (x), · · · , f u (x)]. In this paper, we derive formulas for the probability of a design point with a single-objective (m = 1) for continuous distributions and extend this result to the multi objective case (m > 1). This leads to a probabilistic dominance criterion for Pareto-points. The case of discrete distributions will be described in a forthcoming paper. We present an evolutionary multi objective algorithm based on an extension of the SPEA algorithm reported by Zitzler and Thiele [13]. This algorithm is called ESPEA - Estimate Strength Pareto Evolutionary Algorithm. A technical case study introducing a hardware/software partitioning problem is used to provide first results using ESPEA.

2 2.1

Definitions Multiobjective Optimization

First, we give the basic notation for multiobjective optimization problems. Definition 1 (Multiobjective Optimization Problem (MOP)). A MOP includes a set of n parameters (decision variables), a set of m objective functions, and a set of k constraints. Objective functions and constraints are functions of the decision variables. The optimization goal is to minimize y = f (x) = (f1 (x), f2 (x), · · · , fm (x)) subj. to e(x) = (e1 (x), e2 (x), · · · , ek (x)) ≤ 0 where x = (x1 , x2 , · · · , xn ) ∈ X and y = (y1 , y2 , · · · , ym ) ∈ Y and x is called the decision vector, y is the objective vector, X is denoted as the decision space and Y is called the objective space. The constraints e(x) ≤ 0 determine the set of feasible solutions. Definition 2 (Feasible set). The feasible set Xf is defined as the set of decision vectors x that satisfy the constraints e(x): Xf = {x ∈ X | e(x) ≤ 0}

(1)

316

J. Teich

The image of XS f , i.e., the feasible region in the objective space, is denoted as Yf = f (Xf ) = x∈Xf {f (x)}. With this definition, we are able to define Pareto-dominance for any two decision vectors a and b as follows: Definition 3 (Pareto-dominance). For any two decision vectors a and b, a b (a dominates b) iff f (a) < f (b) a b (a weakly dominates b) iff f (a) ≤ f (b) a ∼ b (a is indifferent to b) iff f (a) 6≥f (b) ∧ f (b) 6≥f (a) In this definition, the relations =, ≤ and < on objective vectors are defined as follows: Definition 4. For any two objective vectors u and v, u = v iff ∀i = 1, · · · , m : ui = vi u ≤ v iff ∀i = 1, · · · , m : ui ≤ vi

(2)

u < v iff u ≤ v ∧ u 6=v The relations ≥ and > are defined analogously. Definition 5 (Pareto-optimality). A decision vector x ∈ Xf is said to be non-dominated regarding a set A ⊆ Xf iff 6 ∃a ∈ A : a x If it is clear from the context which set A is meant, is will be simply omitted in the following. Moreover, x is said to be Pareto-optimal iff x is non-dominated regarding Xf . The entirety of all Pareto-optimal points is called the Pareto-optimal set; the corresponding objective vectors form the Pareto-optimal front or surface. Definition 6 (Non-dominated sets and fronts). Let A ⊆ Xf . The function g(A) gives the set of non-dominated decision vectors in A: g(A) = {a ∈ A | a is nondominated regarding A}

(3)

The set g(A) is the non-dominated set regarding A, the corresponding set of objective vectors f (g(A)) is the non-dominated front regarding A. Furthermore, the set Xg = g(Xf ) is called Pareto-optimal set and the set Yg = f (Xg ) is denoted as the Pareto-optimal front.


2.2

317

Random Objectives and Property Intervals

In the following, we define the notion of probabilistic dominance of decision vectors for which each objective is not a number, but a random variable with values bounded by an interval called property interval. First, we assume that our optimization problem has a single objective (m = 1), hence y = f (x) for a given n−dimensional decision vector. Later, we extend our notation to the general case. Definition 7 (Uncertain objective; property interval). Given an n−dimensional decision vector and a one-dimensional objective function f . We assume f : Rn 7→R. f is called uncertain, if for each x ∈ X, y = f (x) ∈ [f s (x), · · · , f u (x)]

(4)

where [f s (x), · · · , f u (x)] with f s (x), f u (x) ∈ R, and f s (x) ≤ f u (x) is called property interval of f at x.1 Example 1. In Fig. 1, there are three decision vectors a, b, and c that have different property intervals. Let without loss of generality the objective function to be minimized, then obviously a dominates c because no matter what value the objective of a assumes in the shown interval, the value is lower than any objective value in the interval of c. The situation is different for the pair a and b: In case f (a) = 2 and f (b) = 8, a dominates b. However, in case f (a) = 10, then no matter what value f (b) ∈ [8, 9] may take, b dominates a. Hence, the dominance is uncertain. a b c 1 2 3 4 5 6 7 8 9 101112131415

Fig. 1. Example of three decision vectors with corresponding property intervals.

From the previous example, it becomes clear that in order to make decisions concerning the dominance of decision vectors with uncertain objective functions that are given by property intervals, we need a notion of probabilistic dominance. In the following, we treat f (x) for each x ∈ X as a distinct random variable Y and consider continuous uniform distributions of Y ∈ [f s (x), · · · , f u (x)].

3

Continuous Uniform Distribution of Objective Values

In this case, we assume that the probability density function is constant over the property interval of each random variable Y = f (x), x ∈ X. 1

W.l.o.g., we assume f u (x) = f s (x) + with ∈ R+ in the following.

318

J. Teich

Definition 8 (Probability density; uniform distribution). Let [y s , · · · , y u ] denote the property interval of the random variable Y = f (x). For a uniform distribution, its probability density function is given by   0 if y < y s 1 s u (5) p(y) = yu −y s if y ≤ y ≤ y  0 if y > y u From the probability density function p(y), we can derive the cumulative distribution function (cdf ), or Rjust distribution function, F (y), as F (y) = P [Y ≤ y y] for all y ∈ R. With F (y) = −∞ p(y)dy, we obtain the probability of [a < Y ≤ Rb b] as P [a < Y ≤ b] = F (b) − F (a) = a p(y)dy. Example 2. Consider again the property intervals of the decision vectors a, b, and c in Fig. 1. For uniformly distributed objective values, the probability density function and the distribution function of the corresponding random variables A = f (a), B = f (b) and C = f (c) are shown in Fig. 2 together with the probability distribution functions P [Y ≤ y].

Fig. 2. Probability density and probability distribution functions (uniform distribution).

3.1

Probability of Dominance: Single-Objective Case

In the following, we elaborate the probability of a design point a with objective value a ∈ [as , · · · , au ] to dominate a design point b with objective value b ∈ [bs , · · · , bu ], again first for a single objective. Theorem 1 (Probability of (weak) Dominance; uniform distribution). Given two design points a and b with objective a ∈ [as , · · · , au ] and b ∈ [bs , · · · , bu ], respectively. The probability of a to dominate b, written P [a b] for uniform distribution functions is given as:  0 if bu < as   u s 1 P [a b] = (6) R s if a < b u u R s b min{a ,b }  y−b  u1 s · dy + 1 − dy if else u s s s s a −a b −b y=a y=max{a ,b }


319

Proof. The first and the second case in Eq.(6) are obvious and correspond to the case when both property intervals do not overlap. The last case is a little bit more complicated and corresponds to the case when both intervals overlap. The probability that random variable A corresponding to the objective of a is smaller than or equal to B is given as Z au 1 P [A ≤ B] = · P [B ≥ y]dy u − as a s y=a With P [B ≥ y] being equal to 1 for values of y < bs and being equal to 1−P [B < s 2 y] ≈ 1 − P [B ≤ y] = 1 − by−b for values of y in the range from bs to bu , we u −bs obtain the above results. Example 3. Consider the two decision vectors a and b introduced in Fig. 1. We want to compute the probability P [a b] which is equal to P [A ≤ B] for the corresponding random variables of the related property intervals. Evaluating 1 7 Eq.(6) with as = 1, au = 11, and bs = 8,bu = 9, we obtain 10 · (bs − as ) = 10 u R b 1 1 for the first term and 10 · bu −b (bu − y)dy for the second term resulting s bs 2

2

−8 )) 1 in 9(9−8)−(1/2(9 = 20 , giving a total of 0.75. Hence, the probability of a 10 (weakly) dominating b is 0.75.

Expected value Definition 9. Let [y s , · · · , y u ] denote the property interval of the random variable Y = f (x). For a uniform distribution, its expected value is given by Z ∞ Z yu 1 E[Y ] = yp(y)dy = y u dy (7) y − ys s −∞ y 1 ys + yu = ((y u )2 − (y s )2 ) = u s 2(y − y ) 2 Example 4. Consider again the three property intervals of decision vectors a, b and c as shown in Fig. 1. Let the corresponding random variables be A, B, and C. For an assumed uniform distribution, the expected values are computed using 1 Eq.(7) as E[A] = 2(au1−as ) ((au )2 − (as )2 ) = 2(11−1) ((11)2 − (1)2 ) = 6. Similarly, 1 1 we obtain E[B] = 2(9−8) ((9)2 −(8)2 ) = 8.5 and E[C] = 2(15−12) ((15)2 −(12)2 ) = 13.5. These values are exactly in the middle of the corresponding intervals. 3.2

Probability of Dominance: Multi-objective Case

Up to now, we have seen how to compute probabilities of dominance in case of single-objective functions. In Fig. 3, it is shown that the question of dominance becomes even more elaborated in case of multiple objectives. We extend the notion of (weak) Pareto-dominance:3 2 3

To be exact, we must integrate only up to bu − where → 0, positive, in the above equation if bu determines the upper bound of the integration interval. We consider the notion of weak dominance here and throughout the rest of the paper.

320

J. Teich

Fig. 3. Pareto-fronts with 2D property intervals. Pareto-points surrounded by dark rectangles.

Theorem 2 (Probability of (weak) Pareto-dominance). For any two n−dimensional decision vectors a and b, and m statistically independent objective functions f1 , f2 , · · · , fm , P [a b] =

m Y

P [fi (a) ≤ fi (b)]

(8)

i=1

Proof. We assume that the random variables associated to each objective and each decision vector are mutually independent. Hence, the conjunction of the Pareto-conditions leads to the product of the corresponding probabilities. Before we will make use of this probability calculus of dominance in the context of steering design space exploration, we give a few more examples. Example 5. Consider two n = 2 dimensional decision vectors a and b with two objectives f1 and f2 . Let the corresponding property intervals be given by f1 (a) ∈ [2, 4], f2 (a) ∈ [2, 4], and f1 (b) ∈ [2, 3], and f2 (b) ∈ [2, 3]. We obtain P [a b] = P [f1 (a) ≤ f1 (b)] · P [f2 (a) ≤ f2 (b))] where P [f1 (a) ≤ f1 (b)] = 1/2(3(3 − 2) − 1/2(32 − 22 )) = 0.25, and also P [f2 (a) ≤ f2 (b)] = 1/2(3(3 − 2) − 1/2(32 − 22 )) = 0.25. Hence, P [a b] = 0.0625. Similarly, we obtain P [b a] = P [f1 (b) ≤ f1 (a)] · P [f2 (b) ≤ f2 (a))] where P [f1 (b) ≤ f1 (a)] equals P [f2 (b) ≤ f2 (a)] = 2(3 − 2) − 1/4(32 − 22 ) = 0.75. Hence, P [b a] = 0.5625.


321

The general case of not necessarily independent objective functions is dealt with in the following theorem: Theorem 3 (Probability of (weak) Pareto-dominance). For any two n−dimensional decision vectors a and b, and m objective functions f1 , f2 , · · · , fm , let pa (X) = pa (X1 , X2 , · · · , Xm ) and pb (Y ) = pb (Y1 , Y2 , · · · , Ym ) denote the probability density functions of a and b, respectively in the objective space with random variable Xi denoting the random variable for the ith objective fi (a) (similarly Yi for fi (b)). Let the property intervals for the ith objective of a be given by [asi , · · · , aui ] (similar [bsi , · · · , bui ] for b). Then P [a b] = P [a1 ≤ b1 , a2 ≤ b2 , · · · , am ≤ bm ] Z au1 Z aum Z min{au1 ,bu1 } = ··· pa (X) · (1 − X1 =as1

Xm =asm

Y1 =max{as1 ,bs1 }

Z ···

(9) u min{au m ,bm }

Ym =max{asm ,bsm }

Proof. In analogy to Theorem 2, P [a b] is obtained as

R au1

X1 =as1

pb (Y ) dY )dX

···

R aum

Xm =asm 4

pa (X) · P [X ≤ b]dX. With P [X ≤ b] = 1 − P [X > b] ≈ 1 − P [X ≥ b], we obtain the above result. It can be seen that in case pa (X) = pa (X1 )·pa (X2 ) · · · ·pa (Xm ) and similarly pb (Y ) = pb (Y1 ) · pb (Y2 ) · · · · pb (Ym ) hold, then the result in Theorem 2 may be directly obtained as a special case. Expected value. The definition of the expected value for the single objective case in Definition 9 directly extends to the multi-objective case as follows: Definition 10. For any two n−dimensional decision vectors y and m objective functions f1 , f2 , · · · , fm , let Y = (Y1 , Y2 , · · · , Ym ) denote the vector of random variables. E[Y ] = (E[Y1 ], E[Y2 ], · · · , E[Ym ]) (10)

4

Evolutionary Algorithm-Based Exploration with Property Intervals

In this chapter, we review basic ideas for design space exploration using evolutionary algorithms. For the so-called SPEA (Strength-Pareto-Approach) introduced by Zitzler and Thiele in [13] and applied to many important areas of multi-objective optimization problems in the context of embedded system design such as system-level synthesis [1] and code scheduling problems for DSPs (digital signal processors) [11,12], we provide extensions to the selection mechanisms of this population-based approach that considers objective values with property intervals. 4

To be exact, we must again integrate only up to bui − where → 0, positive, for all those i = 1, · · · , m in Eq. (9) for which bui determines the upper bound of the integration interval.

322

4.1

J. Teich

Basic Principles of Evolutionary Algorithms

Evolutionary Algorithms (EA) denote a class of optimization methods that are characterized by a) a set of solution candidates (individuals) called population maintained during the optimization process that undergo b) a selection process and c) that are manipulated by genetic operators, usually recombination and mutation. Each individual represents a possible solution, i.e., a decision vector, to the problem under consideration. However, it is not a decision vector but rather encodes it using a particular data structure.5 The set of all possible vectors constitutes the individual space I. A population is thus a (multi-)set of vectors i ∈ I. The quality of an individual with respect to the optimization problem is represented by a scalar value, called fitness. Since the quality of a solution is related to the objective functions and constraints, the solution must be decoded first by a mapping function m to derive a decision vector x = m(i) from i. Applying f to x yields the corresponding objective vector on the basis of which a fitness value is assigned to i. Natural evolution is simulated by an iterative process: In the selection process, low-quality individuals are removed from the population, while high-quality individuals are reproduced. The goal of this operator is to increase the average quality within the population. Recombination and mutation aim at generating new solutions within the search space by variation of existing ones. The population at iteration t (also called generation t) is denoted Mt in the following. The symbol + stands for multi-set union in conjunction with populations. 4.2

The Strength Pareto-Approach (SPEA)

In the following, we review the Strength Pareto-Approach (SPEA) as introduced by Zitzler and Thiele [13] that serves as the basis of our extension called ESPEA. SPEA uses Pareto-Dominance based selection [4] instead of switching the objective during optimization [9] or using an aggregation function, e.g., weighted sum approach where the coefficients are changed during optimization [5]. Also, it uses elitism where the policy is to always include the B best individuals of Mt into Mt+1 in order not to lose them during exploration. as suggested by De Jong [8]. Finally, in order to maintain a high diversity within the population, it uses a special clustering technique shown in Fig. 6 that is different from niching [6,7] and crowding [8] so that altogether, SPEA has shown to provide superior results compared to existing approaches, see, e.g., [13] for many problems of interest. As it is our main goal to extend this algorithm to be able to deal with objectives bounded by property intervals, we shortly reproduce the algorithm here in Fig. 4.

5

Without loss of generality, we assume that this structure is a vector, e.g., a bit vector or a real-valued vector, although other structures like trees might be considered as well.


SPEA

BEGIN

END

IN:

OUT:

323

N : population size; N : maximum size of external set; U : maximum number of generations; pc : crossover probability; pm : mutation rate; A: non-dominated set;

Step 1: Initialization: Set M0 = M0 = ∅ and t = 0. FOR i = 1 TO N DO Choose i according to some probability distribution; M0 := M0 + {i}; OD Step 2: Update of external set: Set M0 = Mt ; M0 = M0 + {i | i ∈ Mt ∧ m(i) ∈ g(m(Mt ))}; Remove individuals from M0 whose corresponding decision vectors are weakly dominated regarding m(M0 ); Reduce the number of individuals externally stored by means of clustering, i.e., call Alg. Cluster with parameters M0 and N , and assign the resulting reduced set to Mt+1 Step 3: Fitness assignment: Calculate the fitness of individuals in Mt and Mt using Alg. Fitness; OD Step 4: Selection: Set M0 = ∅; FOR i = 1 TO N DO Select two individuals i, j ∈ Mt + Mt at random; IF F (i) < F (i) M0 := M0 + {i}; ELSE M0 := M0 + {j}; OD Step 5: Recombination: ... Step 6: Mutation: ... Step 7: Termination: Set Mt+1 = M000 and t = t + 1; IF t ≥ U A = g(m(Mt )); ELSE GOTO Step2.

Fig. 4. Zitzler’s Strength Pareto EA (SPEA).

4.3

ESPEA

We call our extension of SPEA to deal with estimated objective values bounded by intervals ESPEA - Estimate Strength Pareto Evolutionary Algorithm.

324

J. Teich

First, two variants to deal with property intervals seem to be appropriate: – Expected value computation: A straightforward method to deal with objectives with uncertain values is to let SPEA unmodified and work directly with the vectors of expected values E[Y ] of the objective values. The advantage of this approach is that no changes have to be made in the code of SPEA but only code to calculate the expected values for each decision vector has to be added based on the knowledge of the property intervals and probability density functions used. As this first variant is obvious, we concentrate here on the second approach. – ESPEA: Instead of working with expected values, we modify SPEA accordingly. Within SPEA, changes are needed in Step 2 (update of the external set, see Fig. 4) and in the two algorithms Cluster (see Fig.6) and Fitness (see Fig.5). These changes are described next. Update of external set. We describe changes to SPEA to deal with random variables caused by property intervals. First, we consider step 2 of SPEA. Here, the external set is updated to include those members of the actual population Mt that are non-dominated with respect to Mt . With probability intervals, we are only able to state the probability of a vector m(i) to be dominated or not. Given P [m(j) m(i)]. We define X 1 · P [m(j) m(i)] R(i) = N −1 j∈Mt :j6=i

Each of the following three rules seems to be appropriate to decide whether a vector m(i) should be taken over into the external set: – Add m(i) to M0 if R(i) < α; this condition adds all vectors which are smaller in probability to be dominated then α, e.g., let α = 0.25. Or, – add those β % of vectors i with smallest R(i). Or, – those γ ∈ N, γ < N individuals with smallest R(i) are copied into the external set. After updating the external set in either of the above ways, weakly dominated individuals i must be removed regarding m(M0 ). Again, we have to deal with probabilities. We propose the following similar strategy: Let X 1 R(j) = · P [m(i) m(j)] N −1 0 i∈M :j6=i

Then eliminate – those j from M0 where R(j) > α0 (e.g., α0 = 0.9), or – those β 0 % vectors j with largest R(j), or – those γ 0 vectors j with largest R(j). The last step concerns the clustering algorithm called in Step 2 of SPEA, see Fig. 6.


Fitness

IN: OUT:

BEGIN

END

325

Mt : population; Mt : external set; F : fitness;

Step 1: Strength and fitness assignment external set: FOREACH i ∈ Mt DO ∧ m(i)m(j)}| S(i) = |{j | j∈Mt N ; +1 F (i) = S(i); OD Step 2: Fitness assignment population: FOREACH j ∈ Mt DO P F (j) = 1 + i∈Mt ,m(i)m(j) S(i); OD

Fig. 5. Fitness assignment in SPEA.

Cluster IN: OUT: BEGIN

END

0

M : external set; N : maximum size of external set; Mt+1 : updated external set;

Step 1: Initialize each i ∈ M0 as a cluster: C = ∪i∈M0 {{i}}; Step 2: IF |C| ≤ N , goto Step 5, else goto Step 3; Step 3: Distance calculation (objective space) of all possible pairs of clusters: P 1 dc = |c1 |·|c d(i1 , i2 ); | i ∈c 2 1 1 ,i2 ∈c2 Step 4: Amalgate two clusters with minimal distance: C := C \ {c1 , c2 } ∪ {c1 ∪ c2 }; Step 5: Select a representative for each cluster by computing the centroid (point with minimal average distance to all other points in the cluster) M0 := ∪c∈C c;

Fig. 6. Clustering in SPEA.

Clustering algorithm. Depending on the above update of the external set, different numbers of clustering steps might be necessary in order to reduce the update set to its maximal size N .

326

J. Teich

The only point where the objective values of two individuals are needed is for the determination of the distance between two vectors i and j d(i, j) in the objective space. Here, we approximate the distance by the expected value of the distance: E[d(i, j)] = E[||f (m(i)) − f (m(j))||] (11) Fitness assignment algorithm. Finally, the fitness assignment algorithm Fitness called in Step 3 of SPEA (see Fig. 5) must be changed. We consider Step ∧ m(i)m(j)}| 1 first. Here, the strength S(i) = |{j | j∈Mt N is computed. In this +1 formula, the size of the set {j | j ∈ Mt ∧ m(i) m(j)} is a random variable the expected value of which is computed as follows: 1 E(|{j | j ∈ Mt ∧ m(i) m(j)}|) N +1 X 1 = P [m(i) m(j)] N +1

E[S(i)] =

(12)

j∈Mt

Similarly, in Step 2 of the fitness assignment algorithm, we approximate F (j) = P 1 + i∈Mt ,m(i)m(j) S(i) by F (j) ≈ 1 +

X

E[S(i)]

(13)

i∈Mt :P [m(i)m(j)]≥α

The remaining Steps of SPEA (1,4,5,6,7) remain unaffected.

5

Experiments

In this section, we describe our experiments using the example of Pareto-Front exploration for a hardware/software partitioning problem: A task graph is to be mapped onto programmable hardware and software components such that the objectives of period (execution time) and cost should be minimized simultaneously, see [1] for details. The objectives evaluated are the cost of the allocated components and the execution time (period) for the mapping (see Fig. 3 for one example population). In the following, we run a benchmark 5 runs of 200 generations each for four different variations concerning the interval sizes called ex1, ex2, ex3, and ex4 in the following for a population size of 40 and 100 individuals each. ex1 has the smallest intervals for each parameter, ex2 has larger intervals, and ex4 has the largest intervals for cost and execution time of a number of tasks. For α = 0.25, we evaluated two different different values of α0 , namely A1 α0 = 0.5 and A2 α0 = 0.9. In order to compare the performance of these two algorithms for the 4 examples ex1, ex2, ex3, and ex4, we use the following definition:


327

Definition 11. Let A and B be two sets of decision vectors. The function C maps the ordered pair (A,B) to the interval [0,1]: C(A, B) :=

|{b ∈ B; ∃ a ∈ A : a b}| |B|

(14)

The value C(A, B) gives the fraction of B that is covered by members of A. Note that both C(A, B) and C(B, A) have to be taken into account, since not necessarily C(A, B) = 1−C(B, A). On each example, both algorithms ran in pairs on the same initial population; then the expected values of the Pareto-points in the final population were compared for each run. The minimal, maximal, and average values are reported in Tables 1 and 2 for two different population sizes (N = 40 and N = 100). Table 1. Comparison of algorithms A1 and A2 on four examples for population size Test case C(A1,A2) C(A2,A1) N = 40. ex1 ex2 ex3 ex4

mean min max mean min max 100% 100% 100% 90% 83% 100% 50.8% 25% 75% 94% 85% 100% 64.3% 28.5% 100% 95% 85% 100% 83.4% 50% 100% 92% 85% 100%

Table 2. Comparison of algorithms A1 and A2 on four examples for population size Test case C(A1,A2) C(A2,A1) N = 100. ex1 ex2 ex3 ex4

mean min max mean min max 80% 0% 100% 96.6% 83% 100% 73.4% 50% 89% 91% 80% 95% 76.2% 67% 100% 98% 95% 100% 100% 100% 100% 83% 60% 95%

First, we discovered that for each test run and test example, the run-time of algorithm A1 is about 3-5 times higher than with algorithm A2 for equal population size and equal number of populations for all test examples except ex1 (no intervals) where both algorithms had equal run-time. The reason is that in case of A1, the probability level for the selection of a design point as a point of the external set is much lower than in case of A2. We discovered also that the run-time increases about quadratically with the number of points stored in the external set. In algorithm A1, the external set almost constantly contained N points (often with many multiple copies). In case of A2, the probability level was much higher to accept a point as a Pareto-point. Here, the external set contained a considerably less number of points for all our test cases. Concerning the quality of discovered Pareto-points, we see that no matter how large the intervals were, algorithm A2 shows a mean coverage of points explored by A1 by more than 90 %. This shows that although A1 has a much smaller acceptance level and a larger set of non-dominated points, it performed worse. Other experiments such as testing other and larger examples are necessary to support this result, see, e.g., [10]. We would finally like to mention that the concept of probabilistic dominance as introduced here might be used also in other Pareto-set exploring algorithms.

328

J. Teich

In order not to reject possible candidates from the Pareto-set, one should not just take the expected values of the objectives but decide on the probability of dominance if a point should be considered Pareto-point or not. For decision making in case of probabilistic dominance, any of the proposed styles how to update the external set may be used.

References 1. T. Blickle, J. Teich, and L. Thiele. System-level synthesis using Evolutionary Algorithms. J. Design Automation for Embedded Systems, 3(1):23–58, January 1998. 2. M. Dellnitz and O. Junge. An adaptive subdivision technique for the approximation of attractors and invariant measures. Comput. Visual. Sci., 1:63–68, 1998. 3. Carlos M. Fonseca and Peter J. Fleming. An overview of evolutionary algorithms in multiobjective optimization. Evolutionary Computation, 3(1):1–16, 1995. 4. David E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Publishing Company, Inc., Reading, Massachusetts, 1989. 5. P. Hajela and C.-Y. Lin. Genetic search strategies in multicriterion optimal design. Structural Optimization, 4:99–107, 1992. 6. Jeffrey Horn and Nicholas Nafpliotis. Multiobjective optimization using the niched pareto genetic algorithm. IlliGAL Report 93005, Illinois Genetic Algorithms Laboratory, University of Illinois, Urbana, Champaign, July 1993. 7. Jeffrey Horn, Nicholas Nafpliotis, and David E. Goldberg. A niched pareto genetic algorithm for multiobjective optimization. In Proceedings of the First IEEE Conference on Evolutionary Computation, IEEE World Congress on Computational Computation, volume 1, pages 82–87, Piscataway, NJ, 1994. IEEE Service Center. 8. K. A. De Jong. An analysis of the behavior of a class of genetic adaptive systems. PhD thesis, University of Michigan, 1975. 9. J. D. Schaffer. Multiple objective optimization with vector evaluated genetic algorithms. In Proceedings of an International Conference on Genetic Algorithms and Their Applications, pages 93–100, Pittsburgh, PA, 1985. J.J. Grefenstette (Ed.). 10. J. Teich and R. Schemann. Pareto-front exploration with uncertain objectives. Technical report, TR No. 3/00 (revised version), Computer Engineering Laboratory, University of Paderborn, December 2000. 11. E. Zitzler, J. Teich, and S. Bhattacharyya. Evolutionary algorithms for the synthesis of embedded software. IEEE Trans. on VLSI Systems, 8(4):425–456, August 2000. 12. E. Zitzler, J. Teich, and S. S. Bhattacharyya. Multidimensional exploration of software implementations for DSP algorithms. J. of VLSI Signal Processing Systems, 24:83–98, 2000. 13. E. Zitzler and L. Thiele. Multiobjective evolutionary algorithms: A comparative case study and and the strength pareto approach. IEEE Trans. on Evolutionary Computation, 3(4):257–271, November 1999.

Evolutionary Multi-objective Ranking with Uncertainty and Noise Evan J. Hughes Department of Aerospace, Power, and Sensors, Cranfield University, Royal Military College of Science, Shrivenham, Swindon, SN6 8LA, UK, [email protected], http://www.rmcs.cranfield.ac.uk/departments/daps/

Abstract. Real engineering optimisation problems are often subject to parameters whose values are uncertain or have noisy objective functions. Techniques such as adding small amounts of noise in order to identify robust solutions are also used. The process used in evolutionary algorithms to decide which solutions are better than others do not account for these uncertainties and rely on the inherent robustness of the evolutionary approach in order to find solutions. In this paper, the ranking process needed to provide probabilities of selection is re-formulated to begin to account for the uncertainties and noise present in the system being optimised. Both single and multi-objective systems are considered for rank-based evolutionary algorithms. The technique is shown to be effective in reducing the disturbances to the evolutionary algorithm caused by noise in the objective function, and provides a simple mathematical basis for describing the ranking and selection process of multi-objective and uncertain data.

1

Introduction

The use of evolutionary algorithms (EA’s) in engineering is now well established and widespread. As the use of the algorithms migrates deeper into industry, and with more processing power available, the scale and characteristics of the problems being solved are changing. The objective functions are becoming more complex, nonlinear and often uncertain. Many model coefficients are derived by experiment and are therefore subject to experimental errors. In real systems, the true coefficients will not be the same as measured and are often time dependent or correlated with platform motion etc. These errors in the modelling are unavoidable and inevitably propagate into the outputs of the objective functions, the results of which are used to classify the quality of the individual solutions to the problem. All optimisation algorithms attempt to find the problem solution that gives the most favourable output from the objective functions. With complex systems, evolutionary algorithms are a useful tool in that they can tolerate highly nonlinear and noisy system models and objective functions and still provide reasonable suggested solutions [1]. E. Zitzler et al. (Eds.): EMO 2001, LNCS 1993, pp. 329–343, 2001. c Springer-Verlag Berlin Heidelberg 2001

330

E.J. Hughes

This robustness to errors has also been exploited by artificially adding noise to the objectives in an attempt to identify solutions that are robust to noise and uncertainty in the real system [2,3,4]. Noise is also often present when trying to optimise hardware systems such as in robotics. Noise or uncertainty in the objectives tend to slow evolution and reduce solution quality. Attempts to reduce noise by repeating objective calculations and then averaging or combining results have been tried [5], but often with many realistic problems, the time to re-evaluate is prohibitive and often the number of samples used to average must be very small and therefore subject to considerable error. Most evolutionary algorithms to date have accepted these problems as the robustness of the algorithms allows small errors to be tolerated. Therefore we may form two categories of problem: 1. Noisy: Two successive evaluations of the same chromosome information return two different sets of objectives. 2. Uncertain: Two successive evaluations of the same chromosome return the same objective values, but when comparing two different chromosomes, errors in the modelling and model coefficients may cause the objective values returned to classify the wrong solution as being superior. This paper takes a fresh look at the problems of uncertain and noisy systems, both with single and multiple objectives, in order to provide a selection process that is aware of the uncertainties and noise. The techniques discussed form a small step towards creating algorithms that can address the problems associated with the different categories of noisy or uncertain problems.

2

Problem Definition

As most engineering problems have multiple objectives that must be satisfied, the work concentrates on multi-objective evolutionary algorithms (MOEA). Carlos Coello Coello maintains an excellent database of publications relating to multi-objective optimisation [6]. Many of the publications tackling engineering problems (e.g. [7]) use techniques such as MOGA [8] and NSGA [9]. These methods use ranking techniques to address the problems of non-domination, then use sharing to spread the solutions across the objective surface. The use of ranking is widespread in EA’s to prevent good solutions taking over the population in the early generations of the algorithm. Van Veldhuizen and Lamont [10] have studied the benefits / disadvantages of a number of techniques, including MOGA and NSGA, and begun to define techniques for assessing MOEA performance. These have been developed in the context of noise-free and certain problems and similar work is needed to address noisy and uncertain problems but is beyond the scope of this paper. In all evolutionary algorithms, the key medium to evolution is being able to take two potential solutions to a problem, test them in the problem domain against some performance criteria, then given some values relating to the performance of each, decide which solution is better than the other. With noisy or

Evolutionary Multi-objective Ranking with Uncertainty and Noise

331

uncertain problems, we find that given the results of the performance criteria, unless they are very different, we cannot say for certain which solution is better. Thus we must now refer to the probability that one solution is better than the other. This paper aims to review the process needed in order rank a set of objective results, given that we can no longer make a crisp decision about solution superiority.

3 3.1

Comparing Two Uncertain Fitness Measurements Introduction

In a noise free situation, if we have two fitness values, A and B, and are trying to minimise, the lower value is always superior. However, if we know the fitness values are subject to noise, even if the measured fitness A is less than the measured fitness B, the expected value of the distribution from which A is drawn may be greater than the expected value of the distribution from which B is drawn. Therefore we would make the wrong decision. In the presence of noise, if we choose the simple case of take the best measured objective, we need to quantify the probability that we have made the wrong decision. 3.2

Analysis of Distributions with Unknown Expected Values

If we have a pair of samples from distributions with known characteristics and spread, but unknown expected values, we need to be able to calculate the probability that although sample A is less than sample B say, the expected value of distribution B is less than the expected value of distribution A. This will give us a probability of making the wrong decision. Figure 1 shows a scenario with two Gaussian distributions. Here A and B are the measurements that were observed, and µ is an arbitrary point. The observed value A was less than B and is therefore superior. If the expected value of A was actually at point µ, the expected value of B would have to be in any position to the left of µ for us to make the wrong decision. We can calculate the probability of the distributions being in this location as the probability of value A occurring, given µa , multiplied by the probability that µb is less than µa , shown as the shaded region on Fig. 1. This may be described mathematically as Z ∞ P (wrong decision) = pdfA (A − µ) · cdfB ((X − µ) > (B − µ))dµ . (1) −∞

With Gaussian distributions, we may write this as ! Z ∞ Z ∞ 2 (A−µ)2 − y2 − 1 1 2 2σ √ e 2σa √ e b dy dx . P (wrong) = σa 2π −∞ (B−µ) σb 2π

(2)

Equation 3 has the limits on the inner integration adjusted, as the Gaussian distribution is symmetrical pdf(a) = pdf(−a) and cdf(a, ∞) = cdf(−∞, −a). The

332

E.J. Hughes 0.45 µ

B

5 6 Objective

7

A 0.4

0.35

Probability density

0.3

0.25

0.2

0.15

0.1

0.05

0

0

1

2

3

4

8

9

10

11

Fig. 1. Choice between two noisy values

axis is shifted to make sample point B = 0 then distribution B is normalised, modifying distribution A accordingly. Equation 4 has been simplified with the replacements m = (A−B) and s = σa /σb . σb Z P (wrong) = Z P (wrong) =

∞ −∞ ∞ −∞

 

− σb √ e σa 2π

(µ−

A−B 2 2 ) σ σb b 2 2σa

(µ−m)2 1 √ e− 2s2 s 2π

Z

µ

−∞

Z

µ



1 √ e dy  dµ 2π −∞ 2 1 − y2 √ e dy dµ 2π 2 − y2

(3) (4)

We may now use the error function 2 erf (x) = √ π

Z 0

x

2

et dt

(5)

to give ! x (x−m)2 1 + erf ( √ ) 1 2 − 2 √ e 2s P (wrong) = dx 2 s 2π −∞ Z ∞ (x−m)2 1 1 x = + √ e− 2s2 erf ( √ ) dx . 2 2s 2π −∞ 2 Z

∞

(6)

Unfortunately (6) is difficult to integrate directly. An alternative approach is to recognise that the difference between two Gaussian distributions is also


333

Gaussian but with an expected value that is the difference between the expected values of the two distributions and a variance which is a sum of the two variances (Cramer’s Theorem), i.e., N (µa , σa2 ) − N (µb , σb2 ) = N (µa − µb , σa2 + σb2 )

(7)

If A dominates B in a minimisation sense, then the area under the resulting curve from zero to infinity will give the probability that the decision that A dominates B is wrong. If we normalise B to give N(

µa − µb σa2 µa − µb σa2 , 2 ) − N (0, 1) = N ( , 2 + 1) σb σb σb σb = N (m, s2 + 1)

then the probability of being wrong is 1 P (wrong) = p 2π (s2 + 1) =

1 1 + erf 2 2

p

Z

∞ 0

−

e

(9)

(x−m)2 2(s2 +1)

m

(8)

dx

(10)

!

(2 + 2s2 )

.

(11)

Equation 11 can be shown to be equal to (6) by numerical integration. 3.3

Numerical Approximation of Probability

If we cannot afford to do multiple evaluations for each chromosome (often the case), we can choose a random chromosome before running the EA and perform multiple evaluations to estimate the noise standard deviation (and possibly noise distribution). This estimate may be used subsequently for all the comparisons of individual samples using the equations in section 3.2. If the noise statistics are known to be nonlinear, it may be advantageous to either re-estimate the statistics every few generations from an average chromosome, or even from the current population. When the same standard deviation is used for comparing two objective values, σa = σb therefore s = 1. Thus the probability is only determined by the value of m. As the case of s = 1 is likely to be the most commonly used, we can tailor the equations specifically. The equations are calculated as the probability of being wrong in minimisation, this is the same as the probability of acceptance in maximisation. Thus the probability of sample A dominating sample B in maximisation (P (A > B)) is m 1 1 + erf ( ) 2 2 2 1 1 A−B = + erf ( ) , 2 2 2σ

P (A > B) =

therefore if A = 0, B = 5 and σ = 1, P (A > B) = 0 as expected.

(12)

334

E.J. Hughes

Unfortunately, the error function erf (x) is not easy to calculate quickly. It can be approximated using Chebyshev fitting [11, Section 6.2] but even this is not very quick. Recognising that (11) is sigmoidal in shape, other standard sigmoidal curves have been fitted to give a good approximation to the curve, but allow the probability to be calculated quickly. Figure 2 shows the curve approximation and (13) & (14) show the equations. The results of the two different approximations are so similar to each other, they appear as a single line on the graph. P (A > B) ≈ P (A > B) ≈

1 m √ (1 + tanh ) 2 0.8 2 + 2s2 1

(13) (14)

− √2.5 m

1+e

2+2s2

1 s=0.5 0.9 s=1

0.8

s=2

0.7

P(A>B), σb = 1

0.6 0.5 0.4 0.3 0.2 0.1 0 −5

−4

−3

−2

−1

0 m

1

2

3

4

5

Fig. 2. Approximation of P (A > B) against m, dashed curve is (11)

The small errors in the approximation can be tolerated as a tradeoff for the speed gain. Further improvements in calculation speed may be obtained for certain problems by utilising the decomposition of tanh(A + B). This is detailed in [12]. 3.4

Multi-objective Fitness Functions

With multiple objectives, we no longer have only two possible outcomes from comparing two objectives A and B. We now have the possibility of the two


335

objectives being non-dominated. We therefore can have P (A < B), P (A > B), and P (A ≡ B) (A is equivalent to B in Pareto optimal sense). Figure 3 shows the effect graphically, with the point A in the centre of the figure ([0.5, 0.5]) representing one sample of the fitness. The shaded regions correspond to regions in which there is information to drive the evolutionary process, i.e. A is either dominates or is dominated by any point x that lies in the shaded region. In the remaining regions, any point x will be non-dominated when compared to point A and we have no way of deciding between the points. For the ranking process, the points are equivalent, and just as good as each other. If we have two, k objective, independent fitness measurements with corresponding objective values A1 . . . Ak , and B1 . . . Bk , the probabilities P (A < B), P (A > B), and P (A ≡ B) are simply P (A < B) =

k Y

P (Aj < Bj )

(15)

P (Aj > Bj )

(16)

(1 − P (Aj < Bj ))

(17)

j=1

P (A > B) =

k Y j=1

=

k Y j=1

P (A ≡ B) = 1 − P (A < B) − P (A > B) .

4 4.1

(18)

Probabilistic Ranking and Selection Introduction

Ranking is often employed to prevent a superior solution dominating the early populations in the evolutionary process. The conventional ranking process, however, does not take the uncertainty in the measured fitness values into account. The following sections provide a fresh view of the ranking process and develop theory for multi-objective ranking of uncertain fitness measurements. 4.2

Single Objective Ranking

Figure 4 shows seven fitness values to be ranked. If we are minimising, the best fitness value is the lowest. In the case shown, value A will get rank 0, and value G will be rank 6. Values C and D are equal and therefore should be assigned the same rank. We can assign rank values as shown in Table 1 If we did not have a tie between C & D, we could use linear selection (19) to calculate probabilities of selection, based on the ranked fitness, where n is the number of fitness values and Ri is the rank of individual i. The sum of the rank values on the denominator will sum to n(n − 1)/2 = 21 which is the sum of the

E.J. Hughes

1 0.9 0.8 Non−Dominated

P(x>A)

0.7 0.6 Objective 2

336

0.5

A

0.4 0.3 P(x Fi ) is the probability that fitness value j dominates fitness value i. n X Ri = P (Fj > Fi ) (20) j=1 i6=j

In (20), we have to be sure not to compare fitness Fi with itself. If we did, we would get an extra probability of 0.5 added to the sum. We can therefore include Fi in the sum, but subtract the effect of comparing the fitness with itself. This is shown in (21). n X Ri = P (Fj > Fi ) − 0.5 (21) j=1

As (21) is based on probability, if the fitness values are uncertain, we can use (6) or the approximations (13) or (14) to calculate the probability of domination. For example, if fitness values A to G have a standard deviation of σ = 1, the rank positions (using (13)) compared to the no noise case are shown in Table 2. With σ = 0, we have conventional ranking and the probabilities will range from 2/n to zero. If σ = ∞, all of the fitness values will be assigned the same rank, and will have a probability of selection of 1/n. Thus the standard deviation of the uncertainty has a similar effect to selective pressure in conventional selection processes [13].

338

E.J. Hughes Table 2. Ranks with uncertainty of σ = 0 and σ = 1 Value Rank (σ = 0) Rank (σ = 1) A B C D E F G

4.3

0 1 2.5 2.5 4 5 6

0.38 1.27 2.31 2.31 4.17 5.07 5.49

Multi-objective Ranking

With multiple objectives, we now have three possible outcomes from comparing the two fitness values: A dominates B , A is dominated by B , and A and B are non-dominated. If we apply the single objective ranking equation, we find that the total of the rank positions is no longer n(n − 1)/2 as we now have to account for the non-domination. If we have no noise, for two fitness values where A dominates B , P (A > B) = 1, P (A < B) = 0, and P (A ≡ B) = 0 Therefore when we sum the probabilities of domination, the contribution from this pair will be 1. If the fitness values are non-dominated, the corresponding probabilities are P (A > B) = 0, P (A < B) = 0, and P (A ≡ B) = 1. We have now lost the value 1 from the probability of domination calculations, therefore reducing the sum of ranks total. This state will be the same when we compare A to B and also when we compare B to A, therefore if we sum all the probabilities of non-domination, this will give us twice what was lost from the probability of domination calculations. If we consider the ranking case for a single dimension, if A and B are identical, we cannot choose between them and so add in 0.5 to the sum. With non-domination, we also have the situation where we cannot choose between objectives and should therefore add 0.5 to the sum as required. In the case of uncertain measurements, we can multiply the value of 0.5 by the probability of non-domination, and still subtract off 0.5 to allow for comparing the individual with itself, thereby maintaining the sum of the rank positions as n(n − 1)/2. Thus we can add the non-domination term into (21). The rank calculation for multi-objective ranking is shown in (22), where n is the number of measurements being ranked. Ri =

n X j=1

n

P (Fj > Fi ) +

1X P (Fj ≡ Fi ) − 0.5 2 j=1

(22)

This probabilistic ranking equation allows chromosomes to be selected based on uncertain multi-objective fitness measurements. For the objectives shown in Fig. 5, we can calculate the rankings in order to minimise the fitness values. Table 3 shows ranks (R) for no noise, and 1 standard deviation noise.


F

A Objective 2

339

B

E C D

Objective 1 Fig. 5. Multiple fitness values to be ranked

In the example, we see that A is non-dominated with B, C, D, & E and therefore gets a rank of 2. Fitness B is non-dominated with A, C, & D but shares an objective value with E , thus being half dominating and half nondominated with E , the rank of B is 1.5 from the three non-dominated points and 0.25 from E , giving a total of 1.75. We also see that each of the columns of Table 3 sums to 15 ( = n(n − 1)/2 ) as expected. The ranking process is O(n2 ), as are many of the other ranking methods [8,9]. Table 3. Ranks with uncertainty of σ = 0 and σ = 1 Value R (σ = 0) R (σ = 1) A B C D E F

2 1.75 1.5 1.5 3.25 5.0

2.27 1.65 1.42 1.92 3.22 4.53

In the general noisy or uncertain scenario, we see that the proximity of other fitness values, even if only close on one objective, can influence how the rank is assigned. Measurements such as C which are relatively well spaced out on all objectives are ranked more highly than other fitness values that are uncertain.

340

E.J. Hughes

With no noise, the basic ranking by just counting how many points dominate each fitness measurement described by Fonseca and Flemming [8] is very similar, but does not allow for the non-dominated cases. The sum of the rank values will not be consistent if non-dominated solutions are present, causing a bias towards non-dominated solutions over other solutions. The ranking used by Srinivnas and Deb [9] is based on ‘layers’ of non-dominated solutions and has no consistency with regards to how many layers, or ranks, are produced, therefore making calculating selection probabilities awkward. It is interesting to note that if we require an objective to be maximised, setting σ negative will cause the probabilities to be calculated for maximisation, setting σ negative has the same effect as negating the fitness values (the conventional way of converting from minimisation to maximisation). Therefore both minimisation and maximisation objectives may be handled easily by just setting the sign of the corresponding value of σ appropriately. Limits on objectives, constraints on the chromosomes, and sharing can all be implemented easily within this ranking framework, allowing interactive decision making with uncertain or noisy systems viable. The equations for limits, constraints, and sharing are derived and discussed in [12].

5 5.1

Experiment Results Introduction

Noise and uncertainty can be split into two broad categories relating to noise that occurs within the process (Type A) and measurement noise (Type B): 1. Type A Noise: Noise is applied to the chromosome before the objective function is calculated, i.e. O = F (χ + N ). 2. Type B Noise: Noise is applied to the objective function after calculation, i.e. O = F (χ) + N . Both types of noise are of interest and often the observed noise will be a combination of type A and B. Trials have been performed to assess how the noise effects the assigned rank position within a population of chromosomes. For the following results, 100 twoparameter chromosomes were generated uniformly distributed in the range [0,1]. A scaled version of the objective function MOP3, defined by Van Veldhuizen and Lamont [10] and given in (23), was used to provide input data to the ranking processes, with either type A or B noise applied as appropriate. The data were ranked and the assigned rank postion for each chromosome recorded. The process was repeated 1000 times with different values chosen for the applied noise each time. For each chromosome, the standard deviation of the rank position was calculated. The mean standard deviation of the 100 chromosome rank positions was then generated and plotted.


x = 6 χ(1) − 3 y = 6 χ(2) − 3 (x2 + y 2 ) m1 = + sin(x2 + y 2 ) 2 (3x − 2y + 4)2 (x − y + 1)2 m2 = + + 15 8 27 2 2 1 m3 = 2 − 1.1e−x −y 2 x +y +1 m1 O1 = 8.249 m2 − 15 O2 = 46.940 m3 + 0.1 O3 = 0.296

341

(23)

In (23), χ(1) and χ(2) are the two parameters of the input chromosome in the range [0,1]. The parameters x and y are scaled to lie within [-3,3] as defined by Van Veldhuizen and Lamont. The three objective functions are then calculated and scaled to give each of the objectives in the range [0,1]. Noise was then applied either to the input chromosome χ for type A noise, or to the output objectives O for type B noise. The applied noise was Gaussian with a standard deviation of σ. The ranking algorithms from NSGA and MOGA were generated for comparison with the new multi-objective probabilistic selection evolutionary algorithm (MOPSEA) ranking process developed in this paper. With a different set of 100 initial chromosomes, a slightly different set of graphs will result. The differences have been found to be small however. 5.2

Results

From figures 6 & 7 it is clear that both MOGA and MOPSEA outperform the NSGA ranking process in the presence of noise for this objective function. As the uncertainty parameter σn is increased, it is clear that MOPSEA can out perform both alternative algorithms. The specific performance of each algorithm is dependent on the objective function though. Other objective functions are covered in [12].

6

Conclusions

The results have shown that the modified ranking process can reduce the disturbances in the rank positions caused by noisy objectives. Unlike conventional ranking processes, the rank values and therefore the corresponding selection probabilities take some account of the noise and uncertainty in the system. The theory developed in this paper forms an important first step towards addressing

342

E.J. Hughes 20 18

Mean standard deviation of rank values

16 NSGA 14 12 10 8

MOPSEA, σ =0 n

6

MOGA

4 2 0 0.01

MOPSEA, σ =0.3 n

0.02

0.03

0.04

0.05 0.06 Noise, σ

0.07

0.08

0.09

0.1

Fig. 6. Applied noise with respect to mean standard deviation of rank position for MOP3, type A noise. Performance of MOGA and NSGA ranking compared to MOPSEA with σn = 0 & σn = 0.3

22 20

Mean standard deviation of rank values

18 NSGA

16 14 12 10 8 6

MOGA MOPSEA, σ =0

4

n

2

MOPSEA, σ =0.3 n

0 0.01

0.02

0.03

0.04

0.05 0.06 Noise, σ

0.07

0.08

0.09

0.1

Fig. 7. Applied noise with respect to mean standard deviation of rank position for MOP3, type B noise. Performance of MOGA and NSGA ranking compared to MOPSEA with σn = 0 & σn = 0.3


343

directly noise and uncertainty in multi-objective problems. The simplicity of the ranking and selection equations may also provide a route to further theoretical research into the operation and performance of evolutionary algorithms. Acknowledgements. The author would like to acknowledge the use of the Department of Aerospace, Power, and Sensors DEC Alpha Beowulf cluster for the production of the results.

References 1. T. W. Then and Edwin K. Chong. Genetic algorithms in noisy environment. In IEEE International Symposium on Intelligent Control, pages 225–230, Columbus, Ohio, 16-18 August 1994. 2. Adrian Thompson. Evolutionary techniques for fault tolerance. In Control ’96, UKACC International Conference on, volume 1, pages 693–698. IEE, 2-5 September 1996. Conf. Publ. No. 427. 3. T. B¨ ack and U. Hammel. Evolution strategies applied to perturbed objective functions. In IEEE World Congress on Computational Intelligence, volume 1, pages 40–45. IEEE, 1994. 4. Shigeyoshi Tsutsui and Ashish Ghosh. Genetic algorithms with a robust searching scheme. IEEE Transactions on Evolutionary Computation, 1(3):201–8, September 1997. 5. Kumar Chellapilla and David B. Fogel. Anaconda defeats hoyle 6-0: A case study competing an evolved checkers program against commercially available software. In Congress on Evolution Computation - CEC2000, volume 1, pages 857–863, San Diego, CA, 16-19 July 2000. IEEE. 6. Carlos A. Coello Coello. List of references on evolutionary multiobjective optimization. http://www.lania.mx/∼ccoello/EMOO/EMOObib.html. Last accessed 3 July 2000. 7. Anna L. Blumel, Evan J. Hughes, and Brian A. White. Fuzzy autopilot design using a multiobjective evolutionary algorithm. In Congress on Evolution Computation CEC2000, volume 1, pages 54–61, San Diego, CA, 16-19 July 2000. IEEE. 8. Carlos M. Fonseca and Peter J. Flemming. Multiobjective genetic algorithms made easy: Selection, sharing and mating restriction. In GALESIA 95, pages 45–52, 1214 September 1995. IEE Conf. Pub. No. 414. 9. N. Srinivas and Kalyanmoy Deb. Multiobjective optimization using nondominated sorting in genetic algorithms. Evolutionary Computation, 2(3):221–248, 1995. 10. David A. Van Veldhuizen and Gary B. Lamont. Multiobjective evolutionary algorithm research: A history and analysis. Technical Report TR-98-03, Air Force Institute of Technology, 1 Dec 1998. 11. William H. Press, Brian P. Flannery, Saul A. Teukolsky, and William T. Vetterling. NUMERICAL RECIPES in C. The Art Of Scientific Computing. Cambridge University Press, second edition, 1993. 12. Evan J. Hughes. Multi-objective probabilistic selection evolutionary algorithm. Technical Report DAPS/EJH/56/2000, Dept. Aerospace, Power, & Sensors, Cranfield University, RMCS, Shrivenham, UK, SN6 8LA, September 2000. 13. J. E. Baker. Adaptive selection methods for genetic algorithms. In Proc. 1st Int. conf. on Genetic Algorithms, pages 101–111, 1985.

Tabu-Based Exploratory Evolutionary Algorithm for Effective Multi-objective Optimization E. F. Khor, K. C. Tan1, and T. H. Lee Department of Electrical and Computer Engineering National University of Singapore 10 Kent Ridge Crescent Singapore 119260 1 Email: [email protected]

Abstract. This paper proposes an exploratory multi-objective evolutionary algorithm (EMOEA) that makes use of the integrated features of tabu search and evolutionary algorithms for effective multi-objective optimization. It incorporates a tabu list and tabu constraint for individual examination and preservation to enhance the evolutionary search diversity in multi-objective optimization, which subsequently helps to avoid the search from trapping in local optima and at the same time, promotes the evolution towards the global Pareto-front. A novel method of lateral interference is also suggested, which is capable of distributing non-dominated individuals uniformly along the discovered Pareto-front at each generation. Unlike existing niching/sharing methods, lateral interference can be performed without the need of any parameter setting and can be flexibly applied in either parameter or objective domain depending on the nature of the optimization problem involved. The proposed features are experimented in order to illustrate their behavior and usefulness in the algorithm.

1. Introduction Evolutionary algorithms have been recognized to be well suited for MO optimization problems [1,2]. Unlike conventional methods that linearly combine multiple attributes to form a composite scalar objective function, evolutionary algorithm for MO optimization incorporates the concept of Pareto’s optimality or modified selection schemes to evolve a family of solutions at multiple points along the trade-off surface simultaneously. Since Schaffer’s work [3], evolutionary techniques for MO optimization have been gaining significant attentions from researchers in various fields, which are reflected by the high volume of publications in this topic in the last few years (over 25 Ph.D. theses, more than 80 journal papers, and more than 300 conference papers). For more information on various techniques of handling multiobjective optimization problems via evolutionary algorithms, readers may refer to the literatures of [4-6]. This paper proposes a new exploratory multi-objective evolutionary algorithm (EMOEA), which incorporates the memory-based feature of tabu search (TS) to maintain the stability of MO optimization towards a global and uniform Pareto-front. The hybridization of TS in evolutionary optimization helps to improve the MO search performances by avoiding repeats of previously explored paths to the found peaks, E. Zitzler et al. (Eds.): EMO 2001, LNCS 1993, pp. 344-358, 2001. © Springer-Verlag Berlin Heidelberg 2001

Tabu-Based Exploratory Evolutionary Algorithm

345

i.e., local optima in the search space is avoided while good regions are being well explored. Besides, a novel method of lateral interference, which is highly efficient of distributing non-dominated individuals uniformly along the discovered Pareto-front is also proposed. It can be performed without the need of any parameter setting and can be flexibly applied in either parameter or objective domain depending on the nature of the optimization problem involved.

2. Exploratory Multi-objective Evolutionary Algorithm In general, multi-objective (MO) optimization can be defined as the problem of optimizing a vector of non-commensurable and often competing objectives or cost functions, viz, it tends to find a parameter set P for

Min F ( P )

P ∈Φ

(1)

where P = {p1, p2,…, pn} is a individual vector with n parameters and Φ defines a set of individual vectors. {f1, f2,…, fm} are m objectives to be minimized and F = {f1, f2,…, fm}. Instead of a single optima, solution to MO optimization problem is often a family of points known as Pareto optimal set, where each objective component of any point along the Pareto-front can only be improved by degrading at least one of its other objective components [7,8]. In the total absence of information regarding the preferences of objectives, ranking scheme based upon the Pareto optimality is regarded as an appropriate approach to represent the strength of each individual in an evolutionary algorithm for MO optimization [2,8,]. A vector Fa is said to dominate another vector Fb, denoted as Fa p Fb, iff

f a,i ≤ f b,i ∀ i ∈ {1,2,..., m} and ∃ j ∈ {1,2,..., m} where f a, j < f b, j

(2)

The Pareto ranking scheme assigns the same smallest cost for all non-dominated individuals, while the dominated individuals are ranked according to how many individuals in the population dominating them. So, the rank of an individual x in a population can be given by rank(x) = 1 + qx, where qx is the number of individuals dominating the individual x in the objective domain [2]. They also extended the Pareto’s domination scheme in their proposed multi-objective genetic algorithm (MOGA) to include goal and priority information for MO optimization. Although MOGA is a good approach, the algorithm only allows a single goal and priority vector setting, which may be difficult to define in a-priori to an optimization process [4]. With a modified Pareto-domination scheme, Tan et al. [9] proposed a unified multi-objective evolutionary algorithm (MOEA) that is capable of comparing the domination among individuals for multi-objective optimization dealing with both soft and hard optimization constraints. The scheme also allows the incorporation of multiple goals and priorities with different combinations of logical “AND” and “OR” operations for greater flexibility and higher-level decision support. Extending from the Pareto's domination and ranking schemes of Tan et al., [9], this paper proposes an exploratory multi-objective evolutionary algorithm that incorporates the memory-

346

E.F. Khor, K.C. Tan, and T.H. Lee

based feature of tabu search to maintain the stability of MO optimization towards a global and uniform Pareto-front. Sections 2.1 and 2.2 detail the principle of lateral interference and tabu-based individual examination rule, respectively. The algorithm and implementation of EMOEA including the features of lateral interference and tabu-based individual examination system is then fully described in Section 2.3. 2.1 Lateral Interference (LI) In order to evolve an equally distributed population along the Pareto-front and to distribute the population at multiple optima in the search space, many methods [1,10,11] have been proposed. Among them, the ‘niche induction’ technique by means of a sharing function [10] is the most popular approach for evolving an equally distributed population along the Pareto-front in MO optimization. This method creates sub-divisions in the objective domain by degrading an individual’s fitness upon the existence of other individuals in its neighborhood defined by a shared distance. To avoid the setting of sharing distance, a new population distribution method is proposed. It is capable of uniformly distributing all individuals along the Pareto-front for MO optimization without the need of any parameter setting is proposed. It can be applied in either the parameter domain or in the objective domain as needed. The method is called Lateral Interference which is motivated from the ecologist point of view for resources competition [12]. It works based upon the principles of exploitation competition and interference competition, which form the basis of distributing population uniformly along the Pareto-front in MO optimization without the need of any parameter setting. According to the first principle (exploitation competition), individuals with higher fitness or lower cost values will always be more likely to win when compete with individuals with lower fitness or higher cost values. The second principle (interference competition) only takes place among the individuals with same level of fitness or cost, or in other words, individuals that are equally strong in the exploitation competition. Let us consider a sub-population P’ containing N’ equally-fit (or same level of fitness or cost values where the intermediate between two level, t ≥ 0) individuals in the m-dimensional observed feature space S (can be either in objective space or parameter space), x1, x2,…, xN’, xi ∈ U1 × U2 ×…× Um ∀ i = 1, 2,…, N’, Uj = U(aj, bj), where U(aj, bj) is any value within the range of aj and bj while aj and bj are the minimum and maximum boundary values of xj, ∀ j = 1, 2,… m as given by,

{ } b j = max{xi, j ∀i = 1,2,..., N ’} a j = min xi, j ∀i = 1,2,..., N ’

(3a) (3b)

The metric distance between any two individuals, i and j, is defined by: d ( xi , x j ) = xi − x j 2

(4)


where

⋅

2

347

implies the 2-norm. To limit the distance metric to the interval of [0,

(

)

1], normalized metric distance between individual i and j, d xi , x j , is used and computed by dividing the metric distance over the metric distance between a and b, where a and b are the minimum and maximum boundary vector of all the variables respectively, i.e.,

(

) (

d xi , x j = d xi , x j

)

a −b

(5)

2

Subsequently, the nearest individual from individual i, denoted as s(i), is defined as the individual that gives the smallest norm or mathematically,

{ (

)

s (i ) = j : d xi , x j < d (xi , xk ), j ≠ i, ∀k = 1, 2,..., N ’, k ≠ i & j

}

(6)

and the influence distance of individual i is given as,

(

λi = d xi , x s (i )

)

(7)

The larger the value to λi, the stronger the individual i to interfere its nearby individuals. With the information of influence distance, the territory of each individual can be defined as given in Definition 1. Definition 1: (Territory) The territory of individual i, denoted as Ti, is the area where any other individuals in within will be interfered and inhibited by individual i from getting the resource. The sufficiency condition for a given point xj to be within the territory Ti of individual i, or mathematically xj ∈ Ti provided that j ≠ i, is d x j , x s (i ) ≤ λi , where s(i) is the index of individual that is closest to

(

)

individual i as defined in eqn. 6 while the influence distance λi of the individual i is as defined in eqn. 7. After determining the territory for each individual, the severity or impact of being interfered and inhibited, or simply the interfered severity, denoted as Hs(j), of individual j can be measured by means of the number of times that it has been interfered and inhibited,

H s ( j) = where,

N

∑ I s (i, j )

i =1, i ≠ j

1, if x j ∈ Ti I s (i, j ) =  0, otherwise

(8a) (8b)

348


The proposed lateral interference differs to the sharing method in the sense that, instead of defining a fix sharing distance for the whole population, it applies the concept of territory where the area of territory is dependent to the influence distance which is adaptive and dynamic from one individual to the other. This eliminates the need of prefixing the sharing distance as required by the sharing method, where good setting of sharing distance estimated upon the trade-off surface is critical and is usually unknown in many optimization problems [4]. The lateral interference can be easily incorporated with Pareto’s dominance in the genetic selection process. After the cost evaluation process where every individual in a population has been evaluated based on the MO functions, these individuals will be ranked according to the Pareto’s dominance and ranking scheme [9], with smaller rank representing fitter individual. The individuals are then fed to the lateral interference, in which the rank values will be interfered/modified according to the territory of each individual. As mentioned, the aim of the interference competition is to further differentiate those individuals with same rank value after the exploitation competition in order to distribute the individuals uniformly. Before the lateral interference, the non-dominated individuals in the population are classified into one category, with similar dummy cost value. To maintain the diversity of the population, these classified individuals are undergone lateral interference and the resulted severity (Hs) of being interfered for each classified individual is added to its dummy cost. This group of individuals is then ignored and another layer of non-dominated individuals (ignoring the previously classified ones) is considered, where the assigned dummy cost is set higher than the highest interfered cost of the previously classified individuals. This process continues until all individuals in the individual list have been classified. The final resulted individuals' dummy cost value after the lateral interference is referred here as interfered cost. The smaller value of the interfered cost, the better is the individual. 2.2 Tabu-Based Individual Examination Scheme This section presents an individual examination scheme that incorporates the feature of TS (tabu search) [13] in evolutionary algorithm to avoid repetition of previous move for MO optimization. Besides maintaining the stability of evolution towards the global and uniform Pareto-front, such scheme integrates the knowledge of tabu list to enhance the MO search performance by avoiding repeats of any paths to previously discovered peaks as well as encouraging long distance exploration to discover other possible peaks. Fig. 1 depicts the heuristic reasoning for individual examination scheme. Given a tabu list and individual list, every individual is being examined with reference to the tabu list whether to accept or reject the individual from the individual list while at the same time, the tabu list is updated whenever an individual dominates any member of tabu list. Starting from the first individual in the reproduced individual list, if the examined individual dominate any member in the tabu list, the individual will replace the dominated member(s) in the tabu list. Otherwise, if the individual is dominated by any member in the tabu list, it will be kept in the individual list if any of its objective component is better than the best objective component value found in the tabu list or the individual is not a tabu. For the former case, considering a


349

minimization problem, an individual x, represented by vector Fx(i) ∀ i ∈ {1, 2,…, m} in m-dimensional objective domain, is said to have any of its objective component value better than the best objective component value in tabu list if and only if ∃ i s.t. Fx(i) < min({Fl(i)}) ∀ l = ∈ {1, 2,…, Nt} where Nt is the size of tabu list. This criterion of acceptance is used to diversify the individuals in objective domain in order to provide a wider range of choices and better information exchange while undergoes the genetic crossover operation. If both the conditions are not satisfied, the individual will be rejected from the individual list and prohibited from surviving in the next generation. In case that the individual is not dominated by any member in the tabu list and if the tabu list is not full i.e., its size does not achieve the maximum limit, the individual will be added to the tabu list. Otherwise, if the individual is able to interfere more than one member in the tabu list within its territory, it will be allowed to replace the tabu member that has the shortest distance from the individual in the space concerned. This reasoning is to promote the uniform distribution of the tabu list. If the condition is not met, the individual will be examined with the objective domain diversification test and tabu test as explained above. This process of examination is then repeated for the next individual in the individual list until all the individuals are tested. Note that although all the members in tabu list are non-dominated, not all the non-dominated individuals in the individual list are added to the tabu list when they are tabu. This is to count on the computation effort of keeping all the non-dominated individuals in tabu as well as to avoid the danger of too much emphasis on the good individuals, which may lead to premature-convergence in the evolution. 2.3 Flow Chart of EMOEA The overall program flowchart of the proposed EMOEA algorithm, which integrates both the lateral interference for population diversity as well as the individual examination scheme with tabu list for examining evolved individuals in the individual list, is shown in Fig. 2. In general, EMOEA involves two different lists, the individual list and the tabu list, that are interacting and influencing with each other along the evolution. Solutions in individual list play the part of inductive learning on the basis of genetic evolution while the solutions in tabu list play the role of controlling the evolution through heuristic reasoning approach (deductive). At the initial stage of evolution, a list of Nc(0) number of individuals is initialized randomly or biased with a-priori knowledge, where Nc(0) is the size of individual list in the evolution. The individual list is then decoded to parameter vectors for cost evaluation. Subsequently, all the evaluated individuals are ranked according to the specifications assigned. All the non-dominated individuals (those with rank = 1) are copied to the empty tabu list while the rest of the individual list are fed to lateral interference to compute for interfered cost as described in Section 2.1. If the stopping criterion is not met, genetic operations will be applied to the evaluated individuals. Here, simple genetic operations consist of tournament selection based on interfered cost, standard crossover and mutation are performed to reproduce offspring for the next generation. Note that the use of tournament selection avoids the need of chromosome sorting, interpolating and fitness averaging at every generation as required by the ranking algorithm [2], which consequently reduces the overhead

350


computation time. After the process of genetic operations, the resulted reproduced individual list with size Nc will be evaluated and examined by the tabu-based individual examination scheme. This scheme is equipped with knowledge of and tabu list to further enhance the search performance by avoiding repeats of previous exploration path to the found peaks. Besides encouraging long distance exploration to provide better exploration for other possible peaks in the solution space, it is also capable of maintaining stability of evolution towards the global and uniform Paretofront. Subsequently the resulted new individual list as well as the updated tabu list are fed into the MO genetic evolution to form the combined individual list, which has the size of Nc = Nc + Nt, where Nt is the size of tabu list. This combined individual list is fed to the next generation of evolution and this process is repeated until the stopping criteria is met.

3. Experimental Results In order to validate the capability of EMOEA in escaping from harmful local optima, the benchmark problem originated from Deb [14] is used as a test-bed here. It is a two-objective minimization problem containing local optima that could easily be trapped by the optimization algorithms. In this paper, the original test problem is modified and expanded such that the global optimum is farther away from the local optimum and higher dimensionality of the search space is considered. The purpose of these modifications is to achieve higher degree of optimization difficulties in the sense that it provides more tendencies for the search algorithms to pre-maturely converge to local optimum, and has less possibility to discover the global optimum while the population is converging to the local optimum. The modified two-objective functions to be minimized are:

f1 = x1 , f2 =

1 3

∏ gi , x1 i =1

  x − 0 .1  2    x − 0 .9  2      i +1 where, g i = 2.0 − exp −    − 0.8 exp −  i +1  , ∀i = 1,2,3   0.4     0.004     where, 0.1 ≤ x1 ≤ 1, and,

0 ≤ x j ≤ 1, ∀j = 2,3,4

(9a) (9b)

(9c) (9d) (9e)

Fig. 3 depicts the function of gi for 0 ≤ xi+1 ≤ 1. As can be seen that gi is a bimodal function with xi+1 = 0.1 as the global minimum and xi+1 = 0.9 as the local minimum solutions, where their distance of 0.8 has been increased by 100% from the original problem with a distance of 0.4 [14]. Fig. 4 shows the f1-f2 plot, with local and global Pareto-optimal curve represented by dashed and solid line, respectively. Note that the shaded region represents the unfeasible area.


,QLWLDOL]HL

LQFUHPHQWL

351

L

([DPLQHLQGLYLGXDOLIURPLQGLYLGXDOOLVW

'RHVLQGLYLGXDO

θS (we use θS = 0.6) then fuzzy sets A and B are merged in a new fuzzy set C as follows: aC = min{aA , aB } bC = αbA + (1 − α)bB cC = αcA + (1 − α)cB dC = max{dA , dB }

(6)

where α ∈ [0, 1] determine the influence of A and B on the new fuzzy set C.

3

Criteria for Fuzzy Modeling

We consider three main criteria to search for an acceptable fuzzy model: (i) accuracy, (ii) transparency, and (iii) compactness. It is necessary to define quantitative measures for these criteria by means of appropriate objective functions which define the complete fuzzy model identification. The accuracy of a model can be measured with the mean squared error: M SE =

K 1 X (yk − yˆk )2 K

(7)

k=1

where yk is the true output and yˆk is the model output for the kth input vector, respectively, and K is the number of data samples.

Accurate, Transparent, and Compact Fuzzy Models

657

Many measures are possible for the second criterion, transparency. Nevertheless, in this paper we only consider one of most significant, similarity, as a first starting point. The similarity S among distinct fuzzy sets in each variable of the fuzzy model can be expressed as follows: S=

max

i, j, k Aij 6= Bik

S(Aij , Bik ), i = 1, . . . , n, j = 1, . . . , M, k = 1, . . . , M

(8)

This is an aggregated similarity measure for the fuzzy rule-based model with the objective to minimize the maximum similarity between the fuzzy sets in each input domain. Finally, measures for the third criterion, the compactness, are the number of rules M and the number of different fuzzy sets L of the fuzzy model. We assume that models with a small number of rules and fuzzy sets are compact. In summary, we have considered three criteria for fuzzy modeling, and we have defined the following measures for these criteria: Criteria Measures Accuracy M SE Transparency S Compactness M , L

4

Multi-objective Evolutionary Algorithm

The main characteristics of the Multi-Objective Evolutionary Algorithm are the following: 1. The proposed algorithm is a Pareto-based multi-objective EA for fuzzy modeling, i.e., it has been designed to find, in a single run, multiple nondominated solutions according to the Pareto decision strategy. There is no dependence between the objective functions and the design of the EA, thus, any objective function can easily be incorporated. Without loss of generality, the EA minimizes all objective functions. 2. Constraints with respect to the fuzzy model structure are satisfied by incorporating specific knowledge about the problem. The initialization procedure and variation operators always generate individuals that satisfy these constraints. 3. The EA has a variable-length, real-coded representation. Each individual of a population contains a variable number of rules between 1 and max, where max is defined by a decision maker. Fuzzy numbers in the antecedents and the parameters in the consequent are coded by floating-point numbers. 4. The initial population is generated randomly with a uniform distribution within the boundaries of the search space, defined by the learning data and model constraints.

658

F. Jiménez et al.

5. The EA search for among simplified rule sets, i.e, all individuals in the population has been previously simplified (after initialization and variation), which is an added ad hoc technique for transparency and compactness. So, all individuals in the population have a similarity S between 0 and 0.6. 6. Chromosome selection and replacement are achieved by means of a variant of the preselection scheme. This technique is, implicitly, a niche formation technique and an elitist strategy. Moreover, an explicit niche formation technique has been added to maintain diversity respect to the number of rules of the individuals. Survival of individuals is always based on the Pareto concept. 7. The EAs variation operators affect at the individuals at different levels: (i) the rule set level, (ii) the rule level, and (iii) the parameter level. 4.1

Representation of Solutions and Constraint Satisfaction

An individual I for this problem is a rule set of M rules as follows: R1 : A11 . . . A1n ζ11 . . . ζ1n ζ1(n+1) ... RM : AM 1 . . . AM n ζM 1 . . . ζM n ζM (n+1) The constraints on the domain of the variables for a fuzzy model come given by the semantic of a fuzzy number. Thus, a fuzzy number Aij (i = 1, . . . , M , j = 1, . . . , n) can be represented by means of four real values aij , bij , cij , dij ∈ [lj , uj ], with aij ≤ bij ≤ cij ≤ dij . The consequent parameters are also real values constrained by a domain, i.e. ζij ∈ [l, u] (i = 1, . . . , M , j = 1, . . . , n + 1). Other constraint are related with the number of rules M of the model, which can be defined between a lower number 1 and a upper number max fixed by the decision maker. In the following sections we describe easy initialization and variation procedures to generate random individuals which satisfy these constraints. 4.2

Initial Population

Initial population is completely random, except that the number of individuals with M rules, for all M ∈ [1, max], should be between minN S and maxN S to ensure diversity respect to the number of rules, where minN S and maxN S, PS with 0 ≤ minN S ≤ max ≤ maxN S ≤ P S (P S is the population size), are the minimum and maximum niche size respectively (see next subsection). To generate an individual with M rules, the procedure is as follows: for each trapezoidal fuzzy number Aij (i = 1, . . . , M , j = 1, . . . , n), four random real values from [lj , uj ] are generated and sorted to satisfy the constraints aij ≤ bij ≤ cij ≤ dij . Parameters ζij (i = 1, . . . , M , j = 1, . . . , n + 1) are real values generated at random from [l, u]. After, the individual is simplified according to the procedure described in a previous section.


4.3

659

Selection and Generational Replacement

We use a variant of the preselection scheme [8] which has been one of the results of previous works for general constrained multi-objective optimization problems by EA [23]. In each iteration of the EA, two individuals are picked at random from the population. These individuals are crossed nChildren times and children mutated producing 2 · nChildren offspring. After, the best of the first offspring replaces the first parent, and the best of the second offspring replaces to the second parent only if: - the offspring is better than the parent, and - the number of rules of the offspring is equal to the number of rules of the parent, or the niche count of the parent is greater than minN S and the niche count of the offspring is smaller than maxN S An individual I is better than another individual J if I dominates J. The best individual of a collection is any individual I such that there is no other individual J which dominates I. The niche count of an individual I is the number of individuals in the population with the same number of rules as I. Note that the preselection scheme is an implicit niche formation technique to maintain diversity in the populations because an offspring replaces an individual similar to itself (one of their parents). Implicit niche formation techniques are more appropriate for fuzzy modeling than explicit techniques, such as sharing function, which can provoke an excessive computational time. However, we need an additional mechanism for diversity with respect to the number of rules of the individuals in the population. One of the reasons is that the number of rules is an integer parameter and the variation operators can generate individuals with quite different numbers of rules of the parents. The preselection scheme is not effective in such a case. The added explicit niche formation technique ensures that the number of individuals with M rules, for all M ∈ [1, max], is greater or equal to minN S and smaller or equal to maxN S. Moreover, the preselection scheme is also an elitist strategy because the best individual in the population is replaced only by a better one. 4.4

Variation Operators

As already said, an individual is a set of M rules. A rule is a collection of n fuzzy numbers (antecedent) plus n + 1 real parameters (consequent), and a fuzzy number is composed of four real numbers. In order to achieve an appropriate exploitation and exploration of the potential solutions in the search space, variation operators working in the different levels of the individuals are necessary. In this way, we consider three levels of variation operators: rule set level, rule level, and parameter level. After a sequence of crossovers and mutations, the offspring are simplified according to the rule set simplication procedure as described previously. Five crossover and four mutation operators are used in the EA. In the following, α ∈ [0, 1] is a random number from a uniform distribution.

660

F. Jiménez et al.

Rule Set Level Variation Operators 1 2 – Crossover 1: Given two parents I1 = (R11 . . . RM ) and I2 = (R12 . . . RM ), 1 2 this operator exchanges information about the number of rules of the parents and information about the rules of the parents, but no rule is internally crossed. Two children are produced: I3 = (R11 . . . Ra1 R12 . . . Rb2 ) and I4 = 1 1 2 2 (Ra+1 . . . RM Rb+1 . . . RM ), where a = round(α · M1 + (1 − α) · M2 ) and 1 2 b = round((1 − α) · M1 + α · M2 ). The number of rules of the children is between M1 and M2 . – Crossover 2: This operator increases the number of rules of the two children as follows: the first child contains all M1 rules of the first parent and min{max −M1 , M2 } rules of the second parent; the second child contains all M2 rules of the second parent and min{max −M2 , M1 } rules of the first parent. – Mutation 1: This operator deletes or adds, both with equal probability, one rule in the rule set. For deletion, one rule is randomly deleted from the rule set. For rule-addition, one rule is randomly generated, according to the initialization procedure described, and added to the rule set.

Rule Level Variation Operators 1 – Crossover 3: Given two parents I1 = (R11 . . . Ri1 . . . RM ) and I2 = (R12 1 2 2 1 . . . Rj . . . RM2 ), this operator produces two children I3 = (R11 . . . Ri3 . . . RM ) 1 2 4 2 3 1 2 4 and I4 = (R1 . . . Rj . . . RM2 ), with Ri = αRi + (1 − α)Rj and Rj = αRj2 + (1−α)Ri1 , where i, j are random indexes from [1, M1 ] and [1, M2 ] respectively. 1 ) and I2 = (R12 – Crossover 4: Given two parents I1 = (R11 . . . Ri1 . . . RM 1 2 2 1 . . . Rj . . . RM2 ), this operator produce two children I3 = (R11 . . . Ri3 . . . RM ) 1 2 4 2 3 4 and I4 = (R1 . . . Rj . . . RM2 ), where Ri and Rj are obtained with the uniform crossover. – Mutation 2: This operator removes a randomly chosen rule and inserts a new one which is randomly generated by the rule-initialization procedure.

Parameter Level Variation Operators – Crossover 5: Given two parents, and one rule of each parent randomly chosen, this operator crosses the fuzzy numbers corresponding to a random input variable or the consequent parameters. The crossover is arithmetic. – Mutation 3: This operator mutates a random fuzzy number or the consequent of a random rule. The new fuzzy number or consequent is generated at random. – Mutation 4: This operator changes the value of one of the antecedent fuzzy sets a, b, c or d of a random fuzzy number, or a parameter of the consequent ζ, of a randomly chosen rule. The new value of the parameter is generated at random within the constraints by a non-uniform mutation.


5

661

Optimization Models and Decision Making

After preliminary experiments in which we have checked different optimization models, the following remarks can be maded: 1. The minimization of the number of rules M of the individuals has negative influence on the evolution of the algorithm. The reason is than this parameter is not an independent variable to optimize, as the amount of information in the population decreases when the average number of rules is low, which is not good for exploration. Then, we do not minimize the number of rules during the optimization, but we will take it into account at the end of the run, in a posteriori articulation of preferences applied to the last population. 2. It is very important to note that a very transparent model will be not accepted by a decision maker if the model is not accurate. In most fuzzy modeling problems, excessively low values for similarity hamper accuracy, for which these models are normally rejected. Alternative decision strategies, as goal programming, enable us to reduce the domain of the objective functions according to the preferences of a decision maker. Then, we can impose a goal gS for similarity, which stop minimization of the similarity in solutions for which goal gS has been reached. 3. The measure L (number of different fuzzy sets) is considerably reduced by the rule set simplification technique. So, we do not define an explicit objective function to minimize L. According to the previous remarks, we finally consider the two following optimization models: Optimization Model 1: M inimize f1 = M SE M inimize f2 = S

(9)

Optimization Model 2: M inimize f1 = M SE M inimize f2 = max{gS , S}

(10)

At the end of the run, we consider the following a posteriori articulation of preferences applied to the last population to obtain the final compromise solution: 1. Identify the set X ∗ = {x∗1 , . . . , x∗p } of non-dominated solutions according to: M inimize f1 = M SE M inimize f2 = S M inimize f3 = M

(11)

2. Choose from X ∗ the most accurate solution x∗i ; remove x∗i from X ∗ ; 3. If solution x∗i is not accurate enough or there is no solution in the set X ∗ then STOP (no solution satisfies);

662

F. Jiménez et al.

4. If solution x∗i is not transparent or compact enough then go to step 2; 5. Show the solution x∗i as output. Computer aided inspection shown in Figure 3 can help in decisions for steps 2 and 3.

6

Experiments and Results

Consider the 2nd order nonlinear plant studied by Wang and Yen in [24,25]: y(k) = g(y(k − 1), y(k − 2)) + u(k) with g(y(k − 1), y(k − 2)) =

(12)

y(k − 1)y(k − 2)(y(k − 1) − 0.5) 1 + y 2 (k − 1)y 2 (k − 2)

(13)

The goal is to approximate the nonlinear component g(y(k − 1), y(k − 2)) of the plant with a fuzzy model. As in [24], 400 simulated data points were generated from the plant model (12). Starting from the equilibrium state (0, 0), 200 samples of identification data were obtained with a random input signal u(k) uniformly distributed in [−1.5, 1.5], followed by 200 samples of evaluation data obtained using a sinusoidal input signal u(k) = sin(2πk/25). The resulting signals and the real surface are shown in Figure 1.

0

g(k)

−2 0 1

100

150

200

250

300

350

1

400

0.5

0 −1 0 2

y(k)

50

g(k)

u(k)

2

0 -0.5

50

100

150

200

250

300

350

400

-1

2

0

2

1 1

0

−2 0

50

100

150

200 k

250

300

350

0

-1

400 y(k-2)

-1 -2

-2

y(k-1)

Fig. 1. Left: Input u(k), unforced system g(k), and output y(k) of the plant in (12). Right: Real surface.

The following values for the parameters of the EA were used in the simulations: population size 100, crossover probability 0.8, mutation probability 0.4, number of children for the preselection scheme 10, minimum number of individuals for each number of rules 5, and maximum number of individuals for each


663

number of rules 20. All crossover and mutation operators are applied with the same probability. The EA stops when the solutions satisfy the decisor maker. We show results obtained with the EA by using the optimization models (9) (max = 5) and (10) (max = 5, gS = 0.25). Figure 2 shows the non-dominated solutions in the last population according to (11) for both optimization models (9) and (10). One can appreciate the effectiveness of the preselection technique and the added explicit niche formation technique to maintain diversity in the populations. The main differences between the optimization models (9) and (10) are that with (9) the EA obtains more diversity but the fuzzy models are less accurate. Goal-based model have the disadvantage that it is necessary to choose, a priori, a good goal for the problem, although this value is representative of the maximum degree of overlapping of the fuzzy sets allowed by a decisor. According to the described decision process, we finally choose a compromise solution showed in Figure 3 by means of different graphics for the obtained model. Figure 3(a) shows the local model. The surface generated by the model is shown in Figure 3(b), fuzzy sets for each variable are showed in Figure 3(c), and finally, the identification and validation results as well as the prediction error are shown in Figure 3(d). We compared our results, with those obtained by the four different approaches proposed in [25] and [26]. The best results obtained for in each case are summarized in Table 1, with an indication of the number of rules, number of different fuzzy sets, consequent type, and obtained M SE for training and evaluation data. In [25], the low M SE on the training data is in contrast with the M SE for the evaluation data which indicates overtraining. The solution in [26] is similar to the solutions in this paper with respect to the accuracy, transparency and compactness, but hybrid techniques (initial fuzzy clustering and a sequence of specific genetic algorithms) were required in [26]. Solutions in this paper are obtained with a single EA and they have been chosen among different alternatives, which is an advantage for an appropriate decision process.

Table 1. Fuzzy models for the dynamic plant. All models are of the Takagi-Sugeno type. Ref. [25]

No. of rules No. of sets Consequent MSE train MSE eval 36 rules (initial) 12 (B-splines) Linear 1.9 · 10−6 2.9 · 10−3 24 rules (optimized) Linear 2.0 · 10−6 6.4 · 10−4 [26] 7 rules (initial) 14 (triangular) Linear 1.8 · 10−3 1.0 · 10−3 5 rules (optimized) 5 (triangular) Linear 5.0 · 10−4 4.2 · 10−4 This paper1 5 rules 5 (trapezoidal) Linear 2.0 · 10−3 1.3 · 10−3 2 This paper 5 rules 6 (trapezoidal) Linear 5.9 · 10−4 8.8 · 10−4 1 Solution corresponds to the solution marked with * in Figure 2(left), and Figure 3(left) 2 Solution corresponds to the solution marked with * in Figure 2(right), and Figure 3(right)

F. Jiménez et al. 0.4

0.3

0.3

Similarity (S)

0.4

0.2 0.1

Number of rules (M)

0

5

0.01 0.02 Mean squared error (MSE)

3 2 0

5

0.1

0.2 Similarity (S)

0.3

0.4

4 3 2 1

0

0.03

4

1

0.1

Number of rules (M)

Number of rules (M)

0

0.2

Number of rules (M)

Similarity (S)

664

0


0.03

0

5


0.03

4 3 2 1

0

5

0.05

0.1 0.15 Similarity (S)

0.2

0.25

4 3 2 1

0


0.03

Fig. 2. Left: Non-dominated solutions according to (11) obtained with the Paretobased multi-objective EA by using the optimization model (9). Right: Non-dominated solutions according to (11) obtained with the Pareto-based multi-objective EA by using the optimization model (10). Solution marked with * is the final compromise solution.

7

Conclusions and Future Research

This paper remarks some initial results in the combination of Pareto-based multiobjective evolutionary algorithms and fuzzy modeling. Criteria such as accuracy, transparency and compactness have been taken into account in the optimization process. Some of these criteria have been partially incorporated into the EA by means of ad hoc techniques, such as rule set simplification techniques. An implicit niche formation technique (preselection) in combination with other explicit techniques with low computational costs have been used to maintain diversity. These niche formation techniques are appropriate in fuzzy modeling if excessive amount of data are required. Excessive computational times would result if sharing function were used. Elitism is also implemented by means of the preselection technique. A goal based approach has been proposed to help to obtain more accurate fuzzy models. Results obtained are good in comparison with other more complex techniques reported in literature, with the advantage that the proposed


1

1

0.5

0.5 0

g(k)

g(k)

0

665

-0.5

-0.5

-1

-1

2

2 2

1

2

1

1

0

1

0

0

-1 -2

y(k-2)

-2

0

-1

-1

-1 -2

y(k-2)

y(k-1)

-2

y(k-1)

(a) Local model

1

1

0.5

0.5 0

g(k)

g(k)

0 -0.5

-0.5

-1

-1

2

2 2

1

2

1

1

0

1

0

0

-1

-1 -2

y(k-2)

-2

0

-1

-1 -2

y(k-2)

y(k-1)

-2

y(k-1)

(b) Surface 1

1

0.8

0.8

0.6

0.6

0.4

0.4

0.2

0.2

0 -2

-1.5

-1

-0.5

0

0.5

1

1.5

0 -2

2

1

1

0.8

0.8

0.6

0.6

0.4

0.4

0.2

-1.5

-1

-0.5

0

0.5

1

1.5

2

-1.5

-1

-0.5

0

0.5

1

1.5

2

0.2

0 -2

-1.5

-1

-0.5

0

0.5

1

1.5

0 -2

2

1

1

0.5

0.5 m

g(k),g (k)

m

g(k),g (k)

(c) Fuzzy sets 0

-0.5 -1

-1 0

50

100

150

200 k

250

300

350

400

0.2

0.2

0.1

0.1 m

g(k)-g (k)

m

g(k)-g (k)

0

-0.5

0

-0.1

-0.2

-0.2 50

100

150

200 k

250

300

350

400

50

100

150

200 k

250

300

350

400

0

50

100

150

200 k

250

300

350

400

0

-0.1

0

0

(d) Identification and validation, and error prediction Fig. 3. Accurate, transparent and compact fuzzy models for the plant model (12). Left: Final compromise solution obtained with the Pareto-based multi-objective EA by using the optimization model (9) and a posteriori decision process. Right: Final compromise solution obtained with the Pareto-based multi-objective EA by using the optimization model (10) and a posteriori decision process.

666

F. Jiménez et al.

technique identifies a set of alternative solutions. We also proposed an easy decision process with a posteriori articulation of preferences to choose finally a compromise solution. One of the main differences between the proposed EA and other approaches for fuzzy modeling is the reduced complexity because we use a single EA for generating, tuning and simplification processes. Moreover, human intervention is only required at the end of the run to choose one of the multiple non-dominated solutions found by the EA. In our future works we will consider other and more complex fuzzy modeling test problems in order to check the robustness of the EA, other measures to optimize transparency, e.g., similarity in the consequent domain instead or together with of the antecedent domain, scalability of the algorithm, and applications in the real word by means of research projects.

References 1. J. Valente de Oliveira. Semantic constraints for membership function optimization. IEEE Transactions on Fuzzy Systems, 19(1):128–138, 1999. 2. M. Setnes, R. Babuˇska, and H. B. Verbruggen. Rule-based modeling: Precision and transparency. IEEE Transactions on Systems, Man and Cybernetics, Part C: Applications & Reviews, 28:165–169, 1998. 3. H. Pomares, I. Rojas, J. Ortega, J. Gonzalez, and A. Prieto. A systematic approach to a self-generating fuzzy rule-table for function approximation. IEEE Transactions on Systems, Man, and Cybernetics – Part B: Cybernetics, 30(3):431–447, 2000. 4. Y. Jin. Fuzzy modeling of high-dimensional systems. IEEE Transactions on Fuzzy Systems: Complexity Reduction and Interpretability Improvement., 8:212– 221, 2000. 5. O. Cord´ on and F. Herrera. A proposal for improving the accuracy of linguistic modeling. IEEE Transactions on Fuzzy Systems, 8(3):335–344, 2000. 6. T.A. Johansen, R. Shorten, and R. Murray-Smith. On the interpretation and identification of dynamic Takagi-Sugeno fuzzy models. IEEE Transactions on Fuzzy Systems, 8(3):297–313, 2000. 7. J. Biethahn and V. Nissen (eds). Evolutionary Algorithms in Management Applications. Springer-Verlag Berlin Heidelberg, 1995. 8. D.E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, 1989. 9. C.M. Fonseca and P.J. Fleming. An overview of evolutionary algorithms in multiobjective optimization. Evolutionary Computation, 3(1):1–16, 1995. 10. J. Horn and N. Nafpliotis. Multiobjective optimization using the niched pareto genetic algorithm. IlliEAL Report No. 93005, July 1993. 11. N. Srinivas and K. Deb. Multiobjective optimization using nondominated sorting in genetic algorithms. Evolutionary Computation, 2(3):221–248, 1995. 12. C.-H. Wang, T.-P. Hong, and S.-S. Tseng. Integrating fuzzy knowledge by genetic algorithms. Fuzzy Sets and Systems, 2(4):138–149, 1998. 13. H. Ishibuchi, T. Nakashima, and T. Murata. Performance evaluation of fuzzy classifier systems for multidimensional pattern classification problems. IEEE Transactions on Systems, Man, and Cybernetics – Part B: Cybernetics, 29(5):601–618, 1999.


667

¨ 14. L.O. Hall, I.B. Ozyurt, and J.C. Bezdek. Clustering with genetically optimized approach. IEEE Transactions on Evolutionary Computing, 3(2):103–112, 1999. 15. H.-S. Hwang. Control strategy for optimal compromise between trip time and energy consumption in a high-speed railway. IEEE Transactions on Systems, Man and Cybernetics, Part A: Systems and Humans, 28(6):791–802, 1998. 16. A.F. G´ omez-Skarmeta and F. Jiménez. Fuzzy modeling with hibrid systems. Fuzzy Sets and Systems, 104:199–208, 1999. 17. I. Jagielska, C. Matthews, and T. Whitfort. An investigation into the application of neural networks, fuzzy logic, genetic algorithms, and rough sets to automated knowledge acquisition for classification problems. Neurocomputing, 24:37–54, 1999. 18. M. Russo. FuGeNeSys – a fuzzy genetic neural system for fuzzy modeling. IEEE Transactions on Fuzzy Systems, 6(3):373–388, 1998. 19. S. Mitra and Y. Hayashi. Neuro-fuzzy rule generation: Survey in soft computing framework. IEEE Transactions on Neural Networks, 11(3):748–768, 2000. 20. A.F. G´ omez-Skarmeta, F. Jiménez, and J. Ib´ anez. Pareto-optimality in fuzzy modelling. In EUFIT’98, pages 694–700, Aachen, Alemania, 1998. 21. T. Takagi and M. Sugeno. Fuzzy identification of systems and its application to modeling and control. IEEE Transactions on Systems, Man and Cybernetics, 15:116–132, 1985. 22. M. Setnes, R. Babuˇska, U. Kaymak, and H.R. van Nauta Lemke. Simlilarity measures in fuzzy rule simplification. IEEE Transaction on Systems, Man and Cybernetics, Part B: Cybernetics, 28(3):376–386, 1999. 23. F. Jiménez, J.L. Verdegay, and A.F. G´ omez-Skarmeta. Evolutionary techniques for constrained multiobjective optimization problems. In Genetic and Evolutionary Computation Conference (GECCO-99), Workshop on Multi-Criterion Optimization Using Evolutionary Methods, pages 115–116, Orlando, Florida, USA, 1999. 24. L. Wang and J. Yen. Extracting fuzzy rules for system modeling using a hybrid of genetic algorithms and Kalman filter. Fuzzy Sets and Systems, 101:353–362, 1999. 25. J. Yen and L. Wang. Application of statistical information criteria for optimal fuzzy model construction. IEEE Transactions on Fuzzy Systems, 6(3):362–371, 1998. 26. H. Roubos and M. Setnes. Compact fuzzy models through complexity reduction and evolutionary optimization. In proceedings 9th IEEE Conference on Fuzzy System, pages 762–767, San Antonio, USA, May 7-10, 2000.

Multi-objective Evolutionary Design of Fuzzy Autopilot Controller Anna L. Blumel, Evan J. Hughes, and Brian A. White Department of Aerospace, Power, and Sensors, Cranfield University, Royal Military College of Science, Shrivenham, Swindon, SN6 8LA, UK, [email protected], http://www.rmcs.cranfield.ac.uk/departments/daps/

Abstract. A multi-objective evolutionary algorithm is used to determine the membership function distribution within the outer loop control system of a non-linear missile autopilot using lateral acceleration control. This produces a design that meets objectives related to closed loop performance such as: steady state error, overshoot, settling and rising time. The evolutionary algorithm uses non-dominated sorting for forming a Pareto front of possible solutions. This paper shows that fuzzy controllers can be produced for engineering problems, with the multiobjective algorithm allowing the designer the freedom to choose solutions and investigate the properties of very complex systems.

1

Introduction

One of the main requirements for an autopilot design is to yield as fast as possible response with the minimum of overshoot so that any command is attained quickly and is of the required magnitude. For low g demands only a slight overshoot of short duration is usually acceptable, since it can compensate for loss of acceleration during the initial transient. For high g demands, overshoot is usually unacceptable since the airframe structural load limit may be exceeded. In order that the autopilot yields an accurate and instantaneous reaction, it is very important to assess the quality of the lateral acceleration response which is quantified in terms of rise time, settling time, maximum percentage overshoot with almost no steady state error. This means that while tuning the trajectory control parameters, the optimisation process should consider those four criteria simultaneously. Hence the single optimisation problem has become multi-objective, being able to provide the designer with multiple solutions. The four criteria are conflicting in their nature and a compromise solution may well be taken. The aim of this paper is to track the missile lateral acceleration demand in the presence of uncertainties introduced through the aerodynamic coefficients. The g demands are considered for both pitch and yaw planes, using the missile rudder and elevator as control surfaces hence yielding a system with 2 inputs and 2 controlled outputs. E. Zitzler et al. (Eds.): EMO 2001, LNCS 1993, pp. 668–680, 2001. c Springer-Verlag Berlin Heidelberg 2001

Multi-objective Evolutionary Design of Fuzzy Autopilot Controller

669

Feedback linearisation of the autopilot is combined with a fuzzy logic trajectory controller to provide control of the missile lateral acceleration. A multiobjective evolutionary algorithm based on non-dominated sorting is used to evolve the fuzzy controllers. In previous research [1,2] a combination of an input/output linearisation technique (nonlinear control law) and a fuzzy logic trajectory controller have been considered for velocity control. This paper extends the techniques to direct control of acceleration.

2

Fuzzy Trajectory Controller

The autopilot design system shown in Fig. 1 consists of the missile model and autopilot simulation feeding the performance analysis and objective generation functions, allowing the evolutionary algorithm to optimise the fuzzy control surfaces.

v vd

wd w

V CHANEL FLC1

W CHANEL FLC2

+ ∆ f(x) +∆ g(x)u

Σ

ν

ν−α β

ACTUATOR

x

PERFORMANCE ANALYSIS

f(x)+g(x)u

x x

GA Fig. 1. Trajectory control design

The missile model is surrounded by an inner feed-back linearisation loop, with outer loops containing the fuzzy trajectory controllers for the pitch and yaw channels. The fuzzy controllers for pitch and yaw are identical as the system is symmetrical, therefore only one fuzzy surface needs to be evolved. The missile dynamics are presented by x˙ = f (x) + 4f (x) + (g(x) + 4g(x))u

(1)

y = h(x) which presents the multi-modelling frame. A fast 250[rads/sec] second order linear actuator is included within the missile dynamics. Fin angles and fin rates are states of the system. The non-linear control law is ν−α β , derived by the feedback linearisation technique, which decouples the system.

670

A.L. Blumel, E.J. Hughes, and B.A. White

The trajectory controller has been designed, based on a fuzzy inference engine, as a two input - one output system with five membership functions for each variable. The membership functions’ positions and the rules are generated using an evolutionary algorithm.

3

Missile Model

The missile model used in this study derives from a non-linear model produced by Horton of Matra-British Aerospace [3]. It describes a 5 DOF model in parametric format with severe cross-coupling and non-linear behaviour. This study has considered the reduced problem of a 4 DOF controller for the pitch and yaw planes without roll coupling. The angular and translational equations of motion of the missile airframe are given by: 1 −1 1 I ρVo Sd( dCnr r + Cnv v + Vo Cnζ ζ) 2 yz 2 1 v˙ = ρVo S(Cyv v + Vo Cyζ ζ) − U r 2m 1 −1 1 q˙ = Iyz ρVo Sd( dCmq q + Cmw w + Vo Cmη η) 2 2 1 w˙ = ρVo S(Czw w + Vo Czη η) + U q 2m r˙ =

(2)

(3)

where the axes(x, y, z), rates(r, q) and velocities (v, w) are defined in Fig. 2. p u x

v w

q

r z

y

Fig. 2. Airframe axes

Equations 2 & 3 describe the dynamics of the body rates and velocities under the influence of external forces (e.g. Czw ) and moments (e.g. Cmq ), acting on the


671

frame. These forces and moments, derived from wind tunnel measurements, are non-linear functions of Mach number longitudinal and lateral velocities, control surface deflection, aerodynamic roll angle and body rates. The description of the model is obtained from data supplied by Matra-BAE and detailed in the Horton report [4]. As both horizontal and vertical lateral motion is symmetric in format, both will be dealt with together, taking into account the appropriate sign changes in derivatives for each lateral direction. It has been shown [5] that the desired tracking performance for lateral acceleration can be obtained by assuming an exact knowledge of aerodynamic coefficients and missile configuration parameters (i.e., reference area, Mach number, mass, moment of inertia). In practice however, this assumption is not valid and also, if there are parameter variations or external disturbances, feedbacklinearisation can no longer guarantee the desired performance or neither is robustness guaranteed. For these reasons, a combination of an input/output linearisation technique (nonlinear control law) and a fuzzy logic controller(trajectory controller) have been chosen to be considered here.

4

Evolutionary Algorithm Structure

The proposed framework maintains a population of fuzzy rule sets with their membership functions and uses the evolutionary algorithm to automatically derive the resulting fuzzy knowledge base. A hybrid real valued/binary chromosome has been used to define each individual fuzzy system. Figure 3 shows the chromosome structure for a five membership function system. The real valued parameters are defined as being the [δa δb δc δd] and lie in the range (0, 1]. The binary component encodes the set of rules used in the system. Each rule is either on or off (0/1) and corresponds to the form: if Ai AND Bj then Ok (4) where Ai denotes membership function i of input A, Bj denotes membership function j of input b, and Ok denotes membership function k of the output O. This process allows a full set of rules to be developed for the fuzzy system, but maintains a fixed length chromosome. The five membership function structure leads to a chromosome with 12 real valued genes and 125 binary genes. The fuzzy system used product for the member function ‘AND’. The ‘OR’ function was not required as the rules were all expressed as ‘AND’ terms. The implication method was to choose the minimum value and crop the output member functions. The aggregation method was to choose the maximum values of the set of member functions. A centroid approach was used to defuzzify the output. The evolutionary algorithm[6] follows the usual format of ranking, selection, crossover, mutation and evaluation but with the real and binary parts of the chromosomes being processed separately. A multi-objective approach was used to identify good solutions. A method known as non-dominated ranking was used in the evolutionary algorithm to allow the multi-objective problem to be handled

672


.

e 1 2 e 1 10101 00101 2 3 4 5

... ... ... ... ... ... ... ...

12 Real Genes

.

e

ν

e

10101 00101

3

... ... ... ... ...

4

... ... ... ...

11101

5

... ... ... ... 00101

... ... 00101

125 Binary Genes 1

2

a

3

b

c

4

5

1

2

3

4

5

d

Fig. 3. FLC chromosome structure

easily. A detailed description of the NSGA non-dominated ranking process may be found in [7], and is based on several layers of classifications of the individuals. To classify the individuals, the population is ranked on the basis of nondomination. With a single objective it is simple to distinguish between two solutions as one will have a better objective value than the other. If we have multiple objectives, solution A may be better on objective 1 but worse on all other objectives. We can no longer say which solution is best and so we say they are non-diminated. In the NSGA algorithm, all non dominated individuals are classified into one category (with a dummy fitness value, which is proportional to the population size, to provide an equal reproductive potential for these individuals). To maintain the diversity of the population, these classified individuals are shared using their dummy fitness values. Then this group of classified individuals is ignored and another layer of non dominated individuals is considered. The process continues until all individuals in the population are classified. The NSGA algorithm has been used instead of other algorithms such as MOGA [8] as when the work was started, there were no indications from the problem as to which algorithms may be better. Work has since shown that in this context, the performance of NSGA and MOGA is very similar. A population of 100 individuals was maintained by the algorithm. Each generation, 20 individuals were selected using stochastic universal sampling for breeding. The choice of using 20 individuals per generation is a compromise between processing costs and adequate sampling of the search space. By maintaining a larger population of 100, some of the benefits of a larger population are maintained. Crossover was performed at a rate of 0.9, with intermediate crossover being used for the real values and uniform multi-point crossover for the binary

Multi-objective Evolutionary Design of Fuzzy Autopilot Controller Initial Population

100 individuals

673

Population

100 individuals

100 nondominated of ranking individuals & sort best offsprings

select

20 offsprings

20 apply Crossover & Mutation 20 offsprings

Fig. 4. Genetic algorithm structure

part. A mutation rate of 2/137 was used to give on average two mutations per chromosome. Selective pressure (SP) of 1.7. The high crossover rate and low selective pressure is to slow convergence to help prevent local optimum being exploited. The twenty new individuals were evaluated and then concatenated to the old population, forming a set of 120 individuals. Non-dominated ranking was then applied to this set and the best 100 were taken for the next generation. In this application much of the feasible space of the controller is little used (see the results section). The genes responsible for these areas will settle to some semi-random state. That is why sometimes having a very similar used control surfaces may have very different chromosomes. This feature upsets the sharing process. A token value of σshare = 0.5 was used, because in this problem, varying σshare has little effect.

5

Objectives

The closed loop performance criteria are chosen as follows: 1. Side-slip velocity steady state error: η1 (x) =

Er? − Er(x) Ermax − Ermin

(5)

η2 (x) =

Os? − Os(x) Osmax − Osmin

(6)

η3 (x) =

T r? − T r(x) T rmax − T rmin

(7)

2. Overshoot:

3. Rise time:

674


4. Settling time: η4 (x) =

T s? − T s(x) . T smax − T smin

(8)

Table 1 shows the reference points used in the objective calculations. Table 1. Closed loop performance criteria Steady State Error(%) Settling time(sec) Rising time(sec) Overshoot(%) Er? = 0.0 Ermax = 2.0 Ermin = 0.0

6 6.1

T s? = 0.15 T smax =0.25 T smin = 0.1

T r? = 0.08 Os? = 4.5 T rmax = 0.14 Osmax = 25.0 T rmin = 0.07 Osmin = 2.0

Results Lateral Acceleration Control

In the previous work [2] velocity was controlled. In this paper, the technique has been applied to lateral acceleration control. As a result of the multi-objective optimisation multiple solutions were obtained from which the designer can choose one which satisfies the requirements and is preferred. In Fig. 5 we have shown a set of lateral acceleration responses from different fuzzy controllers. Some are bad with high overshoot values, very slow on rise time or settling time, but some are very good with almost no steady state error and no overshoot. In Figs. 6 to 11 we have shown three of the fuzzy gain surfaces and their corresponding acceleration responses. Figure 7 which is best on steady state error, Fig. 9 which is within 6% error from the demand and probably not acceptable, although is with no overshoot and with satisfactory rise time and finally Fig. 11 which has been too slow on rise time and settling time but within 3% on steady state error and may not be considered as an acceptable one by the designer. The dashed line is for the augmented acceleration which possesses almost identical closed loop performance criteria with the lateral acceleration. The only difference is in the non-minimum phase effect which can be seen in the solid line for the lateral acceleration. Just to remind, here the augmented acceleration has been used to design the nonlinear control law, but the actual lateral acceleration has been used as the controlled output. The fuzzy surface has been developed with the model exercising the nominal aerodynamic coefficients. Figure 6 shows the fuzzy surface of a trajectory controller generated by the evolutionary algorithm with the paths taken for the nominal (circles) case. This is the controller that delivers the smallest steady state


Lateral acceleration 2g demand

25

20

[m/sec2]

15

10

5

0

-5

0

0.05

0.1

0.15

0.2 Time in [sec]

0.25

0.3

0.35

0.4

Fig. 5. A set of lateral acceleration responses

Fuzzy control surface

4

x 10 3 2.5

controller output

2 1.5 1 0.5 0 -0.5 -1 -1.5 100 0 -100 -200 -300 -400 derivative of error

-500

-5

0

5

10

error

Fig. 6. Fuzzy control surface (a)

15

20

25

675



25

20

[m/sec2]

15

10

5

0

-5

0

0.05

0.1

0.15

0.2 Time in [sec]

0.25

0.3

0.35

0.4

Fig. 7. Acceleration Response (a), best on steady state error


4

x 10 3 2.5 2 controller output

676

1.5 1 0.5 0 -0.5 -1 -1.5 100 0

25

-100

20

-200

15

-300

10

-400 derivative of error

5 -500

0

error

Fig. 8. Fuzzy control surface (b)



20

15

[m/sec2]

10

5

0

-5

0

0.05

0.1

0.15

0.2 Time in [sec]

0.25

0.3

0.35

0.4

Fig. 9. Acceleration Response (b), < 6% steady state error


4

x 10 1

controller output

0.5

0

-0.5

-1

-1.5 50 0 -50 -100 -150 derivative of error

-200

-5

0

5

10

error

Fig. 10. Fuzzy control surface (c)

15

20

25

677

678

A.L. Blumel, E.J. Hughes, and B.A. White Lateral acceleration 2g demand

25

20

[m/sec2]

15

10

5

0

-5

0

0.05

0.1

0.15

0.2 Time in [sec]

0.25

0.3

0.35

0.4

Fig. 11. Acceleration Response (c), slow rise time

error. The fuzzy logic controller has been tuned for a demand of 20[m/sec2 ] corresponding to 2g pull lateral acceleration and is plotted on the graphs. In a typical run, about 80% of the solutions in the final population are non-dominated. A detailed trade off surface for the individuals in a population has been illustrated in Fig. 12 and 13. The intention here is to show how solutions evolve within generations, so trade off dynamics can also be seen. Each point in each plot is a non-dominated solution. As there are four objectives, there are six possible combinations plotted. Before the convergence is achieved there are some bad and unwanted solutions clustered along the high scale of each objective shown in Fig. 12 that die out as the evolution progresses. After convergence (approximately after 50 generations) most of the objective values are within the specified required range, which is an indication that solutions have converged towards the desired feasible area - see the scale in Fig. 13. There are few solutions strongly dominated on one objective which obviously will not been considered further by the decision maker. The final choice of solutions by the decision maker will be by applying subjective preferences for some of the objectives over others. For example, the steady state error is the primary objective to be minimised. Up to ten percent overshoot could be acceptable etc. This allows the designer to narrow down the set of solutions that need to be further analysed in detail.


Gen = 50

20 10 0

0

5

10 15 Rise time

20

10

0

10

20

30

40

0

50

Rise time

10

0

200

400 600 Overshoot

200

400 600 Overshoot

800

1000

0

10

20

30

40

50

30

40

50

Error

30

20

0

0

500

Error

30

10

1000

20

0

20

0

25

Overshoot

Settling time

30

Settling time

30 Rise time

Settling time

30

800

1000

20 10 0

0

10

20 Error

Fig. 12. Trade-off between each objective at generation 50

Fig. 13. Trade-off between each objectives at last generation 250

679

680

7


Conclusions

For the control of a non-linear missile’s lateral acceleration, we have shown that the evolutionary algorithms can produce a good set of results that populate the Pareto solution set, allowing the system designer the flexibility of trading one solution against others to achieve a desired performance. As Fig. 7 demonstrates, by monitoring the usage of the controller surface, combined with the fuzzy control approach, an insight can be gained into the operation of robust controllers that are created using the evolutionary process. Acknowledgements. The authors would like to thank Matra-BAE for providing the data for the missile model.

References 1. H. E. Blumel A.L. and W. B.A., “Design of robust fuzzy controllers for aerospace applications,” in Proceedings of the 18 NAFIPS Conference, vol. 1, pp. 438–442, 1998. 2. B. A. Hughes E.J. and W. B.A., “Fuzzy autopilot design using a multiobjective evolutionary algorithm,” in Congress on evolutionary computations, vol. 1, pp. 4–5, 2000. 3. M. Horton, “A study of autopilots for the adaptive control of tactical guided missiles,” Master’s thesis, Univ. of Bath, 1992. 4. T. A. Blumel A.L. and B. White, “Non-linear horton missile model,” tech. rep., The Royal Military College of Science,Cranfield University, D.A.P.S., R.M.C.S.,C.U., Shrivenham, Wilts, SN6 8LA, September 16 1997. 5. T. A. White, B.A. and B. A.L., “Lateral acceleration control design of a nonlinear homing missile,” in Proc. of the 4th IFAC Nonlinear Control Systems Design Symposium, 708-713 1998. The Netherlands. 6. A. Zalzala and P. J. Fleming, eds., Genetic algorithms in engineering systems. The Institution of Electrical Engineers, 1997. 7. N. Srinivas and K. Deb, “Multiobjective optimization using nondominated sorting in genetic algorithms,” Evolutionary Computation, vol. 2, no. 3, pp. 221–248, 1995. 8. C. M. Fonseca and P. J. Flemming, “Multiobjective genetic algorithms made easy: Selection, sharin g and mating restriction,” in GALESIA 95, pp. 45–52, 12-14 September 1995. IEE Conf. Pub. No. 414.

The Niched Pareto Genetic Algorithm 2 Applied to the Design of Groundwater Remediation Systems Mark Erickson1, Alex Mayer1, and Jeffrey Horn2 1

Department of Geological Engineering and Sciences, Michigan Technological University, Houghton, Michigan USA {msericks, asmayer}@mtu.edu 2

Department of Mathematics and Computer Science, Northern Michigan University, Marquette, Michigan USA [email protected] http://cs.nmu.edu/~jeffhorn

Abstract. We present an evolutionary approach to a difficult, multiobjective problem in groundwater quality management: how to pump-and-treat (PAT) contaminated groundwater to remove the most contaminant at the least cost. Although evolutionary multiobjective (EMO) techniques have been applied successfully to monitoring of groundwater quality and to containment of contaminated groundwater, our work is a first attempt to apply EMO to the long-term (ten year) remediation of contaminated water. We apply an improved version of the Niched Pareto GA (NPGA 2) to determine the pumping rates for up to fifteen fixed-location wells. The NPGA2 uses Pareto-rank-based tournament selection and criteria-space niching to find nondominated frontiers. With 15 well locations, the niched Pareto genetic algorithm is demonstrated to outperform both a single objective genetic algorithm (SGA) and enumerated random search (ERS) by generating a better tradeoff curve.

1 Introduction Groundwater cleanup is one of the major technical and environmental challenges facing us at the start of the new millennium. This problem domain has vast, non-linear search spaces, appropriate for evolutionary optimization. And because of the large and diverse groups of people, animals, plants, and industries affected, the criteria for groundwater decision making are inherently multiple and conflicting. When faced with subsurface remediation management problems, decision makers must frequently weigh several conflicting objectives such as minimizing cost, minimizing health risk, minimizing cleanup time, and maximizing reliability (amount of contaminant captured). It would thus be of value to the decision makers to view the best tradeoffs between the conflicting objectives.

E. Zitzler et al. (Eds.): EMO 2001, LNCS 1993, pp. 681-695, 2001. © Springer-Verlag Berlin Heidelberg 2001

682

1.1

M. Erickson, A. Mayer, and J. Horn

Previous Approaches

The majority of applications of optimization tools to subsurface remediation problems have been based on single objective optimization methods. [1], and more recently [2], provide extensive reviews on the applications of optimization to groundwater remediation design, while [3] actually apply a single objective GA to the optimal remediation design problem. To date, however, we can find no application of an evolutionary multiobjective (EMO) algorithm to the remediation problem. But several recent successful applications of EMO approaches to related groundwater problems, namely containment and monitoring, suggest to us that EMO might be effective in the remediation domain. For example, [4] applied two variations of the genetic algorithm (GA), a Pareto GA and a vector-evaluated genetic algorithm (VEGA), to a multiobjective groundwater pollution containment problem. The multiobjective problem was formulated to minimize the design cost while maximizing the mass contained. The Pareto GA relied on a ranking scheme that ordered the population according to each containment design’s degree of domination. [4] concluded that the Pareto GA was superior to VEGA in finding the largest portion of the Pareto optimal solutions. The authors of [5] investigated the performance of four GA formulations in solving a multiobjective groundwater monitoring problem where they simultaneously maximized reliability of a monitoring system and minimized the contaminant plume size at time of first detection. They found that a VEGA/Pareto GA combination was more computationally efficient and more successful at generating the greatest portion of the tradeoff curve than other GA formulations. They recommended that a form of fitness sharing [6] be used to enhance the tradeoff curve coverage of the Pareto GA. 1.2

Purpose and Scope

In this work, we present an improved version of the niched Pareto genetic algorithm (NPGA2), a multiobjective technique originally developed by [7], and apply it to a hypothetical contaminated groundwater remediation scenario. The original, 1994 version of the NPGA was successfully applied to a version of the groundwater monitoring problem in [5], to detect contaminant plumes. Here we use a new NPGA2 for treatment of the plume. The objectives of this work are to (a) develop a EMO approach for optimal groundwater remediation design using the NPGA2, (b) test the NPGA2 for efficacy by comparing its performance to those of two other optimization approaches: singleobjective genetic algorithm (SGA) and an enumerated random search (ERS), and (c) begin exploring the ability of this approach to scale up to larger versions of the problem.

The Niched Pareto Genetic Algorithm 2

683

2 The Niched Pareto Genetic Algorithm Since 1993, a number of researchers have implemented Goldberg’s 1989 [6] general suggestion of combining a Pareto-based selection with some form of fitness sharing to achieve a selective pressure toward the non-dominated front while maintaining diversity along that front. [7] developed the NPGA which implements the basic suggestion of Goldberg [6] by using Pareto domination tournaments for selection, and fitness sharing in objective space to introduce speciation in a partially ordered search space. [8]’s Multiobjective GA (MOGA) used a similar strategy, with Pareto rank-based selection and objective space fitness sharing, while the non-dominated sorting GA (NSGA) [9] used Goldberg’s [6] suggested ranking method and then used fitness sharing in the genotypic and phenotypic spaces (rather than in the objective space). Since then, other researchers have implemented their own variations on these similar strategies, all with relative success. Below we describe the NPGA2 and compare and contrast it with the original 1994 version, as well as with MOGA and with NSGA.

2.1

The Original NPGA

The extension of the traditional GA to the 1994 NPGA involved the addition of two specialized genetic operators: (1) Pareto domination tournaments and (2) continuously updated fitness sharing. These operators alter the traditional mechanism of selection by partially ordering the population and by maintaining diversity in the population through successive generations, respectively. In the 1994 NPGA, tournament selection was used because of its simplicity, wellknown effectiveness, and the ability to adjust selection pressure by changing the tournament size. Tournaments were modified to handle the Pareto criterion in the following manner. k competitors were chosen at random from the current generation’s population. A set of tdom individuals was also chosen at random as the Pareto sample set P. Each of the k competitors was compared to each member of P. If a competitor was dominated by a member of P it lost the competition. If all of the k competitors lost, then fitness sharing was used to break the “tie”. Each competitor’s niche count (see below) was calculated in the objective space (i.e., using its evaluated objective values, such as cost and reliability, as coordinates). The competitor with lowest niche count (i.e., the “least crowded”) won the tournament. As with normal tournament selection, enough tournaments were held to fill the next generation’s population with “winners”. Crossover and mutation could then be applied to the new population.

2.2

The NPGA2

Although the original NPGA was successfully applied to several test problems, including a groundwater detection problem, we felt that the Pareto domination

684


sampling used in the tournaments could be made less noisy. Indeed, the sampling can be seen as an approximation of Fonseca and Fleming’s [8] Pareto ranking scheme, in which the rank of an individual is determined by the number of current population members that dominate the individual. In the NPGA, the more members that dominate a solution, the more likely it is that a random sample of the population will include a dominating member. To make such Pareto ranking deterministic in the new NPGA2, we use the degree of domination of an individual as its rank, as [8] and as used by others since. But unlike [8] we maintain the use of tournament selection, simply using Pareto rank to determine tournament winners. As in the original NPGA, tournament ties are resolved by fitness sharing, using niche counts as calculated in the objective space. A more detailed discussion of the new NPGA2 selection and niching mechanisms follows. To initiate selection each individual in the population of designs is assigned a rank equal to the degree of Pareto domination experienced by that design. The degree of domination, or rank, of an individual design is the total number of designs in the population that dominate that design. A design is said to (Pareto) dominate another individual in the population if it is at least equal in all objectives to that individual and better in at least one. Non-dominated designs, or those that are not dominated by any individuals in the population, are assigned a rank of zero. In Fig. 1, where the objectives are to minimize both cost and mass remaining, an example of a Pareto domination ranked population of ten designs is shown. Designs of equal rank are designated by the same symbol. ● rank = 0 ▲

▲ rank = 1

total cost

●

■ rank = 2

◆

●

n

◆ rank = 5

● ▲

n

● ●

contaminant mass remaining Fig. 1. Ranking by degree of Pareto domination

Once the entire population has been ranked according to the Pareto domination rank, candidate designs are chosen for reproduction via deterministic tournament selection [6]. The controlling variable in tournament selection competitions is the tournament size k. A group of k competitors is randomly selected from the population of ranked designs. If there is a single candidate with the lowest rank (i.e. less dominated), this candidate is the “clear winner” of the tournament and is selected for reproduction. If there is no clear winner, none of the candidates are preferred and the tournament selection ends in a tie.


685

In the case of a tie, the population density around each competitor is calculated within a specified Cartesian distance (in objective function-space), called the niche radius (see Figure 5). A niche count is calculated by summing the number of designs within the niche radius of each competitor, weighted by the radial distance between the competitor and the other designs. The niche count for competitor i is given by:  dij    if dij < σ share  ∑ 1 − mi =  j∈ pop  σ share  0 if dij ≥ σ share 

(1)

where dij is the distance between competitor i and other population member j and sshare is the niche radius. The winner of the tied tournament is the competitor with the lowest niche count. As in the original NPGA, niche counts are calculated using individuals in the partially filled next generation population, rather than from the current generation population. The use of this continuously updated fitness sharing was suggested by [10]. They showed that the naïve combination of tournament selection and fitness sharing would lead to chaotic perturbations of the population composition. Note that the values of the objective functions should be scaled to equal ranges in order to determine the niche count, as in:

Oi′ =

Oi − Oi , min Oi , max − Oi , min

( 2)

where O’i , O’i,min , and O’i,max are the scaled, minimum, and maximum values of objective Oi, respectively.

2.3

Comparison to Non-dominated Sorting

NPGA2 uses tournament selection based on the ranking given by [8]’s degree-ofdomination measure, which has been implemented in a number of other EMO algorithms. Goldberg, in [6], suggested a different ranking scheme. Srinivas and Deb [9] have named this non-dominated sorting, and it has also been implemented in a number of other EMO algorithms. In a non-dominated sort of the population, the current non-dominated subset of the population is assigned rank 0 and is then temporarily removed from consideration. The remaining population is then evaluated to determine another non-dominated subset, which is then given rank 1 and removed from consideration. This process continues until the entire population has been ranked [6]. As with the degree-of-domination ranking, the non-dominated ranks can then be used for selection in a number of ways, such as tournaments. In the case of the NSGA, Srinivas and Deb use proportionate selection with fitness sharing. How does the ranking generated by a non-domination sort compare to the ranking generated by the degree-of-domination? First, it is clear that both rankings treat the on-line Pareto optimal set (i.e., the non-dominated set from the current generation

686


population) the same: every member of the Pareto set gets a rank of zero. As for the rest of the population, it can be shown that both types of ranking respect the Pareto ordering. That is, if an individual A Pareto dominates an individual B, then both types of ranking will rank A better (lower) than B. In the case of non-dominated sorting, this is quite clear, as A must be removed from consideration before B can be considered non-dominated, and therefore A must be ranked before B. In the case of degree-of-domination ranking, B must have a greater degree of domination than A because every individual that dominates A must also dominate B (by the transitive property of the Pareto domination relation), and by assumption A dominates B as well. Thus B’s degree of domination must be greater than that of A. Non-dominated ranking can differ from degree-of-domination ranking however, when comparing individuals that are not ordered by the Pareto domination relation. Thus an individual A might be ranked better (lower) than an individual B by nondominated ranking, because it is “closer” to the Pareto front, while being ranked worse (higher) by degree-of-domination ranking, because A is more “crowded” by solutions that dominate it1.

3 The Groundwater Remediation Problem We apply the NPGA2 to a new problem domain: cleanup of a hypothetical contaminated groundwater site. The site is given an initial contaminant plume, after which active remediation, in the form of pump-and-treat (PAT) technology, is applied. A fixed number of wells in fixed locations are used to pump out contaminated water to be treated on the surface. The goal of the NPGA2 is to find the optimal pumping rates for the wells such that total cost (e.g., power to the pumps, volume of water treated, etc.) is minimized while also minimizing the amount of contaminant remaining after the treatment period (ten years). For each set of decoded pumping rates generated by the NPGA2, we run a computer simulation of the resulting groundwater and contaminant flow over the ten year remediation horizon, to determine a total cost of treatment and total contaminant mass remaining. Although our specific test cases are artificial and somewhat idealized, the overall approach is realistic. In real-world situations, contamination is detected, an initial contaminant plume is estimated (based on known mass of missing contaminant and/or sampling of concentrations from test wells), the hydrology flow field is modeled (again based on known and sampled geological conditions), and various pumping strategies (e.g., locations, depths, and pumping rates) are simulated. Remediation strategies exhibiting the best tradeoffs between total cost and contaminant mass remaining, under simulation, are chosen for implementation. The rest of this section provides details of the simulation model. 1

But this can only be true if both individuals are not Pareto optimal, i.e., of rank 0.


3.1

687

Description of the Contaminated Site

The site is modeled as a confined homogeneous aquifer 1000 by 1010 meters in area and 30 meters in thickness (see Fig. 2). The model is discretized in two dimensions using 10-m square grid blocks. Constant-head boundaries are imposed on the east and west sides of the domain while no-flow boundaries are imposed on the north and south. (Thus the “background flow” of groundwater is a constant and uniform eastwest flow.) The aquifer is modeled as having a homogeneous, isotropic hydraulic conductivity (i.e., uniform porosity, etc.). Extraction wells are modeled as being open over the entire thickness of the confined aquifer. Removal of contaminant by the treatment system is simulated as equilibrium, nonlinear adsorption. The adsorbent 1

concentration, q, is given by the Freundlich isotherm equation: q = K AB Ci , jn . For a hypothetical contaminant, we chose Trichloroethlyene (TCE), a commonly observed and studied groundwater contaminant. TCE is treated as a conservative, dissolved species. To generate the initial plume of contaminant shown in Fig. 2, a constant source of approximately 750 ppm is applied until a plume of approximately 1,000 kg of TCE is released into the confined aquifer. At that point, the source is removed and active remediation begins, continuing for a ten year period. The ex-situ treatment technology is granular activated carbon (GAC).

no flow boundary scale

11 6

1

12

13

7

8

2

3

14

15

9

10

4

5

contam inant source

direction of flow (w ithout pum ping)

no flow boundary 1000 m eters

Fig. 2. The initial contaminant plume to be remediated

1010 meters

100 m

constant head boundary h = h2

Evolutionary Multi-Criterion Optimization: First International Conference, EMO 2001, Zurich, Switzerland, March 7-9, 2001 Proceedings

Evolutionary Multi-Criterion Optimization: Third International Conference, EMO 2005, Guanajuato, Mexico, March 9-11, 2005, Proceedings

Advanced Information Systems Engineering: 13th International Conference, CAiSE 2001, Interlaken, Switzerland, June 4-8, 2001. Proceedings

Digital Earth Moving: First International Symposium, DEM 2001, Manno, Switzerland, September 5-7, 2001. Proceedings

Automated Reasoning: First International Joint Conference, IJCAR 2001 Siena, Italy, June 18-23, 2001 Proceedings

Interoperating Geographic Information Systems: Second International Conference, INTEROP'99, Zurich, Switzerland, March 10-12, 1999 Proceedings

Programming Languages and System Architectures: International Conference, Zurich, Switzerland, March 2 - 4, 1994. Proceedings

Evolutionary Multi-Criterion Optimization: Second International Conference, EMO 2003, Faro, Portugal, April 8-11, 2003, Proceedings

Evolutionary Multi-Criterion Optimization - EMO 2011

The Economist - 10 March 2001

Advances in Pattern Recognition - ICAPR 2001: Second International Conference Rio de Janeiro, Brazil, March 11-14, 2001 Proceedings

The Economist - 31 March 2001

Artificial Neural Networks - ICANN 2001: International Conference Vienna, Austria, August 21-25, 2001 Proceedings

Computational Science - ICCS 2001: International Conference San Francisco, CA, USA, May 28-30, 2001 Proceedings

Information and Communications Security: Third International Conference, ICICS 2001, Xian, China, November 13-16, 2001. Proceedings

High Performance Computing - HiPC 2001: 8th International Conference, Hyderabad, India, December, 17-20, 2001. Proceedings

Information Security and Cryptology - ICISC 2001: 4th International Conference Seoul, Korea, December 6-7, 2001 Proceedings

Inductive Logic Programming: 11th International Conference, ILP 2001, Strasbourg, France, September 9-11, 2001. Proceedings

Cooperative Information Systems: 9th International Conference, CoopIS 2001, Trento, Italy, September 5-7, 2001. Proceedings

Parallel Computing Technologies: 6th International Conference, PaCT 2001, Novosibirsk, Russia, September 3-7, 2001 Proceedings

Mobile Data Management: Second International Conference, MDM 2001 Hong Kong, China, January 8-10, 2001 Proceedings

Artificial Neural Networks - ICANN 2001: International Conference Vienna, Austria, August 21-25, 2001 Proceedings

Information Security: 4th International Conference, ISC 2001 Malaga, Spain, October 1-3, 2001 Proceedings

Database Theory - ICDT 2001: 8th International Conference London, UK, January 4-6, 2001 Proceedings

The Economist - 24 March 2001

The Economist - 03 March 2001

Embedded Software: First International Workshop, EMSOFT 2001, Tahoe City, CA, USA, October 8-10, 2001. Proceedings

Algorithms in Bioinformatics: First International Workshop, WABI 2001, Aarhus, Denmark, August 28-31, 2001, Proceedings

The Economist - 17 March 2001

Discovery Science: 4th International Conference, DS 2001, Washington, DC, USA, November 25-28, 2001 Proceedings

Logic Programming: 17th International Conference, ICLP 2001, Paphos, Cyprus, November 26 - December 1, 2001. Proceedings

Evolutionary Multi-Criterion Optimization: First International Conference, EMO 2001, Zurich, Switzerland, March 7-9, 2001 Proceedings

Evolutionary Multi-Criterion Optimization: Third International Conference, EMO 2005, Guanajuato, Mexico, March 9-11, 2005, Proceedings

Advanced Information Systems Engineering: 13th International Conference, CAiSE 2001, Interlaken, Switzerland, June 4-8, 2001. Proceedings

Digital Earth Moving: First International Symposium, DEM 2001, Manno, Switzerland, September 5-7, 2001. Proceedings

Automated Reasoning: First International Joint Conference, IJCAR 2001 Siena, Italy, June 18-23, 2001 Proceedings

Interoperating Geographic Information Systems: Second International Conference, INTEROP'99, Zurich, Switzerland, March 10-12, 1999 Proceedings

Programming Languages and System Architectures: International Conference, Zurich, Switzerland, March 2 - 4, 1994. Proceedings

Evolutionary Multi-Criterion Optimization: Second International Conference, EMO 2003, Faro, Portugal, April 8-11, 2003, Proceedings

Evolutionary Multi-Criterion Optimization - EMO 2011

The Economist - 10 March 2001

Advances in Pattern Recognition - ICAPR 2001: Second International Conference Rio de Janeiro, Brazil, March 11-14, 2001 Proceedings

The Economist - 31 March 2001

Artificial Neural Networks - ICANN 2001: International Conference Vienna, Austria, August 21-25, 2001 Proceedings

Computational Science - ICCS 2001: International Conference San Francisco, CA, USA, May 28-30, 2001 Proceedings

Information and Communications Security: Third International Conference, ICICS 2001, Xian, China, November 13-16, 2001. Proceedings

High Performance Computing - HiPC 2001: 8th International Conference, Hyderabad, India, December, 17-20, 2001. Proceedings

Information Security and Cryptology - ICISC 2001: 4th International Conference Seoul, Korea, December 6-7, 2001 Proceedings

Inductive Logic Programming: 11th International Conference, ILP 2001, Strasbourg, France, September 9-11, 2001. Proceedings

Cooperative Information Systems: 9th International Conference, CoopIS 2001, Trento, Italy, September 5-7, 2001. Proceedings

Parallel Computing Technologies: 6th International Conference, PaCT 2001, Novosibirsk, Russia, September 3-7, 2001 Proceedings

Mobile Data Management: Second International Conference, MDM 2001 Hong Kong, China, January 8-10, 2001 Proceedings

Artificial Neural Networks - ICANN 2001: International Conference Vienna, Austria, August 21-25, 2001 Proceedings

Information Security: 4th International Conference, ISC 2001 Malaga, Spain, October 1-3, 2001 Proceedings

Database Theory - ICDT 2001: 8th International Conference London, UK, January 4-6, 2001 Proceedings

The Economist - 24 March 2001

The Economist - 03 March 2001

Embedded Software: First International Workshop, EMSOFT 2001, Tahoe City, CA, USA, October 8-10, 2001. Proceedings

Algorithms in Bioinformatics: First International Workshop, WABI 2001, Aarhus, Denmark, August 28-31, 2001, Proceedings

The Economist - 17 March 2001

Discovery Science: 4th International Conference, DS 2001, Washington, DC, USA, November 25-28, 2001 Proceedings

Logic Programming: 17th International Conference, ICLP 2001, Paphos, Cyprus, November 26 - December 1, 2001. Proceedings

Recommend Documents