Show simple item record

dc.contributor.authorXu, Y.G.
dc.contributor.authorLiu, Guirong
dc.date.accessioned2003-12-23T03:00:41Z
dc.date.available2003-12-23T03:00:41Z
dc.date.issued2002-01
dc.identifier.urihttp://hdl.handle.net/1721.1/4012
dc.description.abstractA simple but effective evolutionary algorithm is proposed in this paper for solving complicated optimization problems. The new algorithm presents two hybridization operations incorporated with the conventional genetic algorithm. It takes only 4.1% ~ 4.7% number of function evaluations required by the conventional genetic algorithm to obtain global optima for the benchmark functions tested. Application example is also provided to demonstrate its effectiveness.en
dc.description.sponsorshipSingapore-MIT Alliance (SMA)en
dc.format.extent65862 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.relation.ispartofseriesHigh Performance Computation for Engineered Systems (HPCES);
dc.subjectevolutionary algorithmen
dc.subjectoptimizationen
dc.titleA Simple But Effective Evolutionary Algorithm for Complicated Optimization Problemsen
dc.typeArticleen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record