A Note on Evolutionary Algorithms and Its Applications - Paper - multi-objective optimization

Oct 15, 2026

Uploaded by Rizky

This paper introduces evolutionary algorithms and their applications in multi-objective optimization. Elitist and non-elitist multiobjective evolutionary algorithms are examined in terms of their advantages and disadvantages, including constrained variants and their use cases. The study also discusses why evolutionary algorithms are especially suited for capturing multiple Pareto-optimal solutions in a single run and highlights key concerns such as selection-stage focus and performance evaluation challenges.

LanguageEnglish

CategoryResearch & Report

FormatPDF

Pages15

Reading Time38 min

AccessFree to download

Abstract

Key focus areas

Introduction

Evolutionary algorithms fundamentals

Multi-objective optimization background and research needs

Research goals

Bhargava, S. (2013). A Note on Evolutionary Algorithms and Its Applications. Adults Learning Mathematics: An International Journal, 8(1), 31-45 A Note on Evolutionary Algorithms and Its Applications Shifali Bhargava Dept. of Mathematics, B.S.A. College, Mathura (U.P) -India. <[shifalibhargava@gmail.com](shifalibhargava@gmail.com)> Abstract This paper introduces evolutionary algorithms with its applications in multi-objective optimization. Here elitist and non-elitist multiobjective evolutionary algorithms are discussed with their advantages and disadvantages. We also discuss constrained multiobjective evolutionary algorithms and their applications in various areas. Key words: evolutionary algorithms, multi-objective optimization, pareto-optimality, elitist. Introduction The term evolutionary algorithm (EA) stands for a class of stochastic optimization methods that simulate the process of natural evolution. The origins of EAs can be traced back to the late 1950s, and since the 1970’s several evolutionary methodologies have been proposed, mainly genetic algorithms, evolutionary programming, and evolution strategies. All of these approaches operate on a set of candidate solutions. Using strong simplifications, this set is subsequently modified by the two basic principles of evolution: selection and variation. Selection represents the competition for resources among living beings. Some are better than others and more likely to survive and to reproduce their genetic information. In evolutionary algorithms, natural selection is simulated by a stochastic selection process. Each solution is given a chance to reproduce a certain number of times, dependent on their quality. Thereby, quality is assessed by evaluating the individuals and assigning them scalar fitness values. The other principle, variation, imitates natural capability of creating “new” living beings by means of recombination and mutation. Although the underlying principles are simple, these algorithms have proven themselves as a general, robust and powerful search mechanism. Moreover, EAs seem to be especially suited to multi-objective optimization because they are able to capture multiple pareto-optimal solutions in a single simulation run and may exploit similarities of solutions by recombination. The application of evolutionary algorithms (EAs) in multi-objective optimization is currently receiving growing interest from researchers with various backgrounds. Most research in this Volume 8(1)– April 2013 31 area has understandably concentrated on the selection stage of EAs, due to the need to integrate vectorial performance measures with the inherently scalar way in which EAs reward individual performance, i.e., number of offspring. The first pioneering studies on evolutionary multiobjective optimization appeared in the mid-1980s (Fourman, 1985; Schaffer, 1984; Schaffer, 1985) . After that a few different MOEA implementations were proposed in the years 1991–1994 (Fonseca & Fleming, 1993; Hajela & Lin, 1992 ; Horn et al., 1994; Srinivas & Deb, 1994; Kursawe, 1990) . Later, these approaches (and variations of them) were successfully applied to various multiobjective optimization problems (Cunha et al., 1999; Fonseca & Fleming, 1998; Ishibuchi & Murata, 1997; Parks & Miller, 1998) . The question is which EA implementations are suited to which sort of problem and what are the specific advantages and drawbacks, respectively, of different techniques. • In contrast to SOPs, there is no single criterion to assess the quality of a trade-off front; quality measures are difficult to define. This might be the reason for the lack of studies in that area. Up to now, there has been no sufficient, commonly accepted definition of quantitative performance metrics for multiobjective optimizers. • There is no accepted set of well-defined test problems in the community. This makes it difficult to evaluate new algorithms in comparison with existing ones. • The

FAQs

What do evolutionary algorithms simulate according to the paper?

They simulate the process of natural evolution using two main principles: selection and variation, where selection is modeled as stochastic selection and variation uses recombination and mutation.

Why are evolutionary algorithms considered suitable for multi-objective optimization?

They can capture multiple Pareto-optimal solutions in a single simulation run and can exploit similarities of solutions through recombination.

What limitations and open issues does the paper highlight for multiobjective evolutionary algorithms?

It notes the lack of a single quality criterion for trade-off fronts, insufficient commonly accepted quantitative performance metrics, and an absence of well-defined test problem sets, along with unclear benefits of concepts like elitism.

Oct 15, 2026

Uploaded by Rizky