Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/111407
DC FieldValue
dc.titleGolinski's speed reducer problem revisited
dc.contributor.authorRay, T.
dc.date.accessioned2014-11-28T01:51:51Z
dc.date.available2014-11-28T01:51:51Z
dc.date.issued2003-03
dc.identifier.citationRay, T. (2003-03). Golinski's speed reducer problem revisited. AIAA Journal 41 (3) : 556-558. ScholarBank@NUS Repository.
dc.identifier.issn00011452
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/111407
dc.description.abstractThe article provides a comparison between the results reported by various sources to Golinski's speed reducer problem. A swarm algorithm has been used to solve the nonlinear constrained minimization problem and arrive at the best known feasible solution. A swarm size of 70 has been used and the results are after 70,000 function evaluations.
dc.sourceScopus
dc.typeArticle
dc.contributor.departmentTEMASEK LABORATORIES
dc.description.sourcetitleAIAA Journal
dc.description.volume41
dc.description.issue3
dc.description.page556-558
dc.description.codenAIAJA
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.