Lagrangian-Based Evolutionary Programming for Constrained Optimization

Cited 0 time in webofscience Cited 3 time in scopus
  • Hit : 531
  • Download : 26
DC FieldValueLanguage
dc.contributor.authorMyung, Hyun-
dc.contributor.authorKim, Jong-Hwan-
dc.date.accessioned2009-10-15T02:19:35Z-
dc.date.available2009-10-15T02:19:35Z-
dc.date.issued1997-04-
dc.identifier.citationLecture Notes in Computer Science, pp. 35-44en
dc.identifier.isbn978-3-540-63399-0-
dc.identifier.issn0302-9743-
dc.identifier.urihttp://hdl.handle.net/10203/11785-
dc.description.abstractIn this paper, Lagrangian-based evolutionary programming, Evolian is proposed for the general constrained optimization problem, which incorporates the concept of (1) multi-phase optimization process and (2) constraint scaling techniques to resolve the ill-conditioning problem. In each phase of Evolian, the typical EP is performed using augmented Lagrangian objective function with a penalty parameter fixed. If there is no improvement in the best objective function in one phase, another phase is performed after scaling the constraints, and updating the Lagrange multipliers and penalty parameter. Simulation results indicate that Evolian gives outperforming or at least reasonable solutions for multivariable heavily constrained optimization problem compared to other several evolutionary computation based methods.en
dc.language.isoen_USen
dc.publisherSpringer Verlag (Germany)en
dc.titleLagrangian-Based Evolutionary Programming for Constrained Optimizationen
dc.typeArticleen
dc.identifier.doi10.1007/BFb0028519-
Appears in Collection
EE-Journal Papers(저널논문)

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0