Structural shape optimization using evolution strategies

Papadrakakis, M; Tsompanakis, Y; Lagaros, ND

dc.contributor.author	Papadrakakis, M	en
dc.contributor.author	Tsompanakis, Y	en
dc.contributor.author	Lagaros, ND	en
dc.date.accessioned	2014-03-01T01:15:15Z
dc.date.available	2014-03-01T01:15:15Z
dc.date.issued	1999	en
dc.identifier.issn	0305-215X	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/13394
dc.subject	structural shape optimization	en
dc.subject	sequential quadratic programming	en
dc.subject	evolution strategies	en
dc.subject	parallel processing	en
dc.subject.classification	Engineering, Multidisciplinary	en
dc.subject.classification	Operations Research & Management Science	en
dc.subject.other	Combinatorial mathematics	en
dc.subject.other	Parallel algorithms	en
dc.subject.other	Parallel processing systems	en
dc.subject.other	Quadratic programming	en
dc.subject.other	Evolution strategy algorithms	en
dc.subject.other	Structural shape optimization	en
dc.subject.other	Structural analysis	en
dc.title	Structural shape optimization using evolution strategies	en
heal.type	journalArticle	en
heal.identifier.primary	10.1080/03052159908941385	en
heal.identifier.secondary	http://dx.doi.org/10.1080/03052159908941385	en
heal.language	English	en
heal.publicationDate	1999	en
heal.abstract	The objective of this paper is to investigate the efficiency of combinatorial optimization methods and in particular algorithms based on evolution strategies, when incorporated into shape optimization problems. Evolution strategy algorithms are used either on a stand-alone basis, or combined with a conventional mathematical programming technique. The numerical tests presented demonstrate the computational advantages of the proposed approach which become more pronounced in large-scale optimization problems and/or parallel computing environment.	en
heal.publisher	Gordon & Breach Science Publ Inc, Newark, NJ, United States	en
heal.journalName	Engineering Optimization	en
dc.identifier.doi	10.1080/03052159908941385	en
dc.identifier.isi	ISI:000082056300006	en
dc.identifier.volume	31	en
dc.identifier.issue	4	en
dc.identifier.spage	515	en
dc.identifier.epage	540	en