TITLE

A Multi-objective Evolutionary Algorithm with a Separate Archive

AUTHOR(S)
Borgulya, István
PUB. DATE
September 2005
SOURCE
Central European Journal of Operations Research;Sep2005, Vol. 13 Issue 3, p233
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
In this paper a new algorithm has been developed for solving constrained non-linear multi-objective optimization problems. This algorithm was acquired by the modification of an earlier algorithm, while we use other selection and recombination operators from the earlier algorithm, we extended the algorithm with a separate archive (population). The archive continuously stores the new potential Pareto optimal solutions, when it becomes full, the algorithm deletes a part of the archive. The new version gives results which show a substantial improvement in quality over the earlier version and performs slightly better then NSGA II on the chosen test problems.
ACCESSION #
18449401

 

Related Articles

  • Proximal Point Algorithms for Convex Multi-criteria Optimization with Applications to Supply Chain Risk Management. Qu, Shao-Jian; Goh, Mark; Souza, Robert; Wang, Tie-Nan // Journal of Optimization Theory & Applications;Dec2014, Vol. 163 Issue 3, p949 

    We study a class of convex multi-criteria optimization problems with convex objective functions under linear constraints. We use a non-scalarization method-namely, two implementable proximal point algorithms-to obtain the Pareto optimum under multi-criteria optimization. We show that the...

  • New solutions for disjoint paths in P systems. Nicolescu, Radu; Wu, Huiling // Natural Computing;Dec2012, Vol. 11 Issue 4, p637 

    We propose four fast synchronous distributed message-based algorithms, to identify maximum cardinality sets of edge- and node-disjoint paths, between a source node and a target node in a digraph. Previously, Dinneen et al. presented two algorithms, based on the classical distributed depth-first...

  • On the Expected Performance of Branch-and-Bound Algorithms. Lenstra, J. K.; Rinnooy Kan, A. H. G. // Operations Research;Mar/Apr78, Vol. 26 Issue 2, p347 

    For many combinatorial optimization problems, the use of enumerative solution methods exhibiting a superpolynomial worst-case behavior seems unavoidable. It is therefore of interest to investigate the expected behavior of such methods. Polynomial-bounded expected performance has been claimed by...

  • Sequential Semidefinite Program for Maximum Robustness Design of Structures under Load Uncertainty. KANNO, Y.; TAKEWAKI, I. // Journal of Optimization Theory & Applications;Aug2006, Vol. 130 Issue 2, p265 

    A robust structural optimization scheme as well as an optimization algorithm are presented based on the robustness function. Under the uncertainties of the external forces based on the info-gap model, the maximization of the robustness function is formulated as an optimization problem with...

  • Convergence and Computational Analyses for Some Variable Target Value and Subgradient Deflection Methods. Lim, Churlzu; Sherali, Hanif D. // Computational Optimization & Applications;Jul2006, Vol. 34 Issue 3, p409 

    We consider two variable target value frameworks for solving large-scale nondifferentiable optimization problems. We provide convergence analyses for various combinations of these variable target value frameworks with several direction-finding and step-length strategies including the pure...

  • A New Model for Transmission Network Expansion and Reactive Power Planning in a Deregulated Environment. Mahmoudabadi, Amin; Rashidinejad, Masoud; Zeinaddini-Maymand, Majid // Engineering;Feb2012, Vol. 4 Issue 2, p119 

    Transmission network expansion planning (TNEP) is a challenging issue especially in new restructured electricity markets environment. TNEP can be incorporated with reactive power planning in which the operating conditions will be satisfied. In this paper a combinatorial mathematical model has...

  • A hybrid method for solving multi-objective global optimization problems. C. Gil; A. Márquez; R. Baños; M. Montoya; J. Gómez // Journal of Global Optimization;Jun2007, Vol. 38 Issue 2, p265 

    Abstract  Real optimization problems often involve not one, but multiple objectives, usually in conflict. In single-objective optimization there exists a global optimum, while in the multi-objective case no optimal solution is clearly defined but rather a set of optimums, which constitute...

  • APPROXIMATION ALGORITHMS FOR DISJOINT PATHS AND RELATED ROUTING AND PACKING PROBLEMS. Baveja, Alok; Srinivasan, Aravind // Mathematics of Operations Research;May2000, Vol. 25 Issue 2, p255 

    Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths for these requests. We present improved approximation algorithms and or integrality gaps for all problems considered;...

  • A finite-time consensus protocol of the multi-agent systems. Xin-Lei Feng; Ting-Zhu Huang // International Journal of Engineering & Natural Sciences;Jul2011, Vol. 5 Issue 1, p24 

    According to conjugate gradient algorithm, a new consensus protocol algorithm of discrete-time multi-agent systems is presented, which can achieve finite-time consensus. Finally, a numerical example is given to illustrate our theoretical result.

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics