Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/111407
DC Field | Value | |
---|---|---|
dc.title | Golinski's speed reducer problem revisited | |
dc.contributor.author | Ray, T. | |
dc.date.accessioned | 2014-11-28T01:51:51Z | |
dc.date.available | 2014-11-28T01:51:51Z | |
dc.date.issued | 2003-03 | |
dc.identifier.citation | Ray, T. (2003-03). Golinski's speed reducer problem revisited. AIAA Journal 41 (3) : 556-558. ScholarBank@NUS Repository. | |
dc.identifier.issn | 00011452 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/111407 | |
dc.description.abstract | The 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.source | Scopus | |
dc.type | Article | |
dc.contributor.department | TEMASEK LABORATORIES | |
dc.description.sourcetitle | AIAA Journal | |
dc.description.volume | 41 | |
dc.description.issue | 3 | |
dc.description.page | 556-558 | |
dc.description.coden | AIAJA | |
dc.identifier.isiut | NOT_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.