World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

EVALUATING EVOLUTIONARY MULTI-OBJECTIVE OPTIMIZATION ALGORITHMS USING RUNNING PERFORMANCE METRICS

    https://doi.org/10.1142/9789812561794_0017Cited by:8 (Source: Crossref)
    Abstract:

    With the popularity of evolutionary multi-objective optimization (EMO) methods among researchers and practitioners, an increasing interest has grown in developing new and computationally efficient algorithms and in comparing them with existing methods. Unlike in single-objective optimization in which often the goal is to find a single optimal solution, an EMO method attempts to find a set of well-converged and well-distributed set of trade-off solutions. In comparing two or more EMO methods, it is intuitive that more than one performance metrics are necessary. Although there exist a number of performance metrics in the EMO literature, they are usually applied to the final non-dominated set obtained by an EMO algorithm to evaluate its performance. In this chapter, we emphasize the need of running performance metrics, which will provide the dynamics of the working of an EMO algorithm. Either using a known Pareto-optimal front or an agglomeration of generation-wise populations, two suggested metrics reveal important insights and interesting dynamics of the working of an EMO and help provide a comparative evaluation of two or more EMO methods.