Sequential graph-based routing algorithm for electrical harnesses, tubes, and hoses in a commercial vehicle
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Saekyeol | - |
dc.contributor.author | Choi, Taehyeok | - |
dc.contributor.author | Kim, Shinyu | - |
dc.contributor.author | Kwon, Taejoon | - |
dc.contributor.author | Lee, Tae Hee | - |
dc.contributor.author | Lee, Kwangrae | - |
dc.date.accessioned | 2021-07-30T04:50:10Z | - |
dc.date.available | 2021-07-30T04:50:10Z | - |
dc.date.created | 2021-05-11 | - |
dc.date.issued | 2021-04 | - |
dc.identifier.issn | 0956-5515 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/1484 | - |
dc.description.abstract | The routing design of the various electrical wires, tubes, and hoses of a commercial vehicle requires a significant number of man-hours because of the variety of the commercial vehicles, frequent design changes of other vehicular components and the manual trial-and-error approaches. This study proposes a new graph-based routing algorithm to find the collision-free routing path in the constrained space of a commercial vehicle. Minimal spanning tree is adopted to connect multi-terminal points in a graph and Dijkstra's algorithm is used to find the shortest route among the candidate paths; the design domain is divided into several sub-domains to simplify the graph and the proposed algorithm solves the routing problems in a sequential manner to deal intermediate points. Then, the proposed method was applied to the design of the routes for four different routing components of a commercial truck. The results indicate that the developed methodology can provide a satisfactory routing design satisfying all the requirements of the design experts in the automotive industry. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | SPRINGER | - |
dc.title | Sequential graph-based routing algorithm for electrical harnesses, tubes, and hoses in a commercial vehicle | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Lee, Tae Hee | - |
dc.identifier.doi | 10.1007/s10845-020-01596-9 | - |
dc.identifier.scopusid | 2-s2.0-85085519553 | - |
dc.identifier.wosid | 000553970500002 | - |
dc.identifier.bibliographicCitation | JOURNAL OF INTELLIGENT MANUFACTURING, v.32, no.4, pp.917 - 933 | - |
dc.relation.isPartOf | JOURNAL OF INTELLIGENT MANUFACTURING | - |
dc.citation.title | JOURNAL OF INTELLIGENT MANUFACTURING | - |
dc.citation.volume | 32 | - |
dc.citation.number | 4 | - |
dc.citation.startPage | 917 | - |
dc.citation.endPage | 933 | - |
dc.type.rims | ART | - |
dc.type.docType | Article; Early Access | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Artificial Intelligence | - |
dc.relation.journalWebOfScienceCategory | Engineering, Manufacturing | - |
dc.subject.keywordPlus | ANT COLONY OPTIMIZATION | - |
dc.subject.keywordPlus | GENETIC ALGORITHM | - |
dc.subject.keywordPlus | PIPE | - |
dc.subject.keywordPlus | SYSTEM | - |
dc.subject.keywordPlus | MODEL | - |
dc.subject.keywordPlus | NETWORKS | - |
dc.subject.keywordPlus | LAYOUT | - |
dc.subject.keywordAuthor | Commercial vehicle | - |
dc.subject.keywordAuthor | Dijkstra&apos | - |
dc.subject.keywordAuthor | s algorithm | - |
dc.subject.keywordAuthor | Minimal spanning tree | - |
dc.subject.keywordAuthor | Pipe routing algorithm | - |
dc.subject.keywordAuthor | Routing design methodology | - |
dc.identifier.url | https://link.springer.com/article/10.1007/s10845-020-01596-9 | - |
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.