Numerical hybrid Taguchi-random coordinate search algorithm for path synthesis
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Jong-Won | - |
dc.contributor.author | Jeong, SeungMin | - |
dc.contributor.author | Kim, Jongwon | - |
dc.contributor.author | Seo, TaeWon | - |
dc.date.accessioned | 2021-07-30T05:08:45Z | - |
dc.date.available | 2021-07-30T05:08:45Z | - |
dc.date.created | 2021-05-14 | - |
dc.date.issued | 2016-08 | - |
dc.identifier.issn | 0094-114X | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/3229 | - |
dc.description.abstract | We present a new algorithm for application to path synthesis of a four-bar linkage with continuous variables called the Hybrid Taguchi random coordinate search algorithm (HTRCA). The HTRCA combines two algorithms of the Taguchi method (TM) and the random coordinate search algorithm (RCA). The RCA adjusts one variable simultaneously with two directions and various step sizes in random order to escape a local minimum. Since the RCA modifies one variable at a time according to the random order, the result of the RCA is sensitive to an initial condition of variables. The TM was adopted to generate nearly optimal initial conditions. Using the TM, the approximate optimal value can be found in even multi-modal functions. Also, the TM is used with different setting values to escape a local minimum point by changing two or more variables in one step. By combining the two methods, a global optimal value can be found efficiently. Seven test functions were optimized and the robust and efficient performance was verified by comparison with other hybrid optimization algorithms. Finally, path synthesis of four-bar linkage is done by the developed optimization algorithm, and the result is compared to previous works on the same problem with evolutionary algorithm. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | PERGAMON-ELSEVIER SCIENCE LTD | - |
dc.title | Numerical hybrid Taguchi-random coordinate search algorithm for path synthesis | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Seo, TaeWon | - |
dc.identifier.doi | 10.1016/j.mechmachtheory.2016.04.001 | - |
dc.identifier.scopusid | 2-s2.0-84964425556 | - |
dc.identifier.wosid | 000381697300008 | - |
dc.identifier.bibliographicCitation | MECHANISM AND MACHINE THEORY, v.102, pp.203 - 216 | - |
dc.relation.isPartOf | MECHANISM AND MACHINE THEORY | - |
dc.citation.title | MECHANISM AND MACHINE THEORY | - |
dc.citation.volume | 102 | - |
dc.citation.startPage | 203 | - |
dc.citation.endPage | 216 | - |
dc.type.rims | ART | - |
dc.type.docType | 정기학술지(Article(Perspective Article포함)) | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Engineering, Mechanical | - |
dc.subject.keywordPlus | GLOBAL OPTIMIZATION | - |
dc.subject.keywordPlus | GENETIC ALGORITHM | - |
dc.subject.keywordPlus | MECHANISMS | - |
dc.subject.keywordPlus | ERROR | - |
dc.subject.keywordAuthor | Global optimization | - |
dc.subject.keywordAuthor | Derivative-free optimization | - |
dc.subject.keywordAuthor | Hybrid optimization method | - |
dc.subject.keywordAuthor | Path synthesis | - |
dc.identifier.url | https://www.sciencedirect.com/science/article/pii/S0094114X16300271?via%3Dihub | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.