DC Field | Value | Language |
---|---|---|
dc.contributor.author | Myung, Hyun | ko |
dc.contributor.author | Kim, Jong-Hwan | ko |
dc.date.accessioned | 2013-02-28T05:36:21Z | - |
dc.date.available | 2013-02-28T05:36:21Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1996 | - |
dc.identifier.citation | BIOSYSTEMS, v.38, no.1, pp.29 - 43 | - |
dc.identifier.issn | 0303-2647 | - |
dc.identifier.uri | http://hdl.handle.net/10203/73038 | - |
dc.description.abstract | A hybrid of evolutionary programming (EP) and a deterministic optimization procedure is applied to a series of nonlinear and quadratic optimization problems. The hybrid scheme is compared with other existing schemes such as EP alone, two-phase (TP) optimization, and EP with a non-stationary penalty function (NS-EP). The results indicate that the hybrid method can outperform the other methods when addressing heavily constrained optimization problems in terms of computational efficiency and solution accuracy. | - |
dc.language | English | - |
dc.publisher | ELSEVIER SCI IRELAND LTD | - |
dc.title | Hybrid evolutionary programming for heavily constrained problems | - |
dc.type | Article | - |
dc.identifier.wosid | A1996TY94400003 | - |
dc.identifier.scopusid | 2-s2.0-0030063679 | - |
dc.type.rims | ART | - |
dc.citation.volume | 38 | - |
dc.citation.issue | 1 | - |
dc.citation.beginningpage | 29 | - |
dc.citation.endingpage | 43 | - |
dc.citation.publicationname | BIOSYSTEMS | - |
dc.contributor.localauthor | Myung, Hyun | - |
dc.contributor.localauthor | Kim, Jong-Hwan | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | hybrid evolutionary programming | - |
dc.subject.keywordAuthor | deterministic optimization | - |
dc.subject.keywordAuthor | computational efficiency | - |
dc.subject.keywordAuthor | solution accuracy | - |
dc.subject.keywordPlus | NEURAL NETWORKS | - |
dc.subject.keywordPlus | OPTIMIZATION | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.