Sequential graph-based routing algorithm for electrical harnesses, tubes, and hoses in a commercial vehicle
- Authors
- Kim, Saekyeol; Choi, Taehyeok; Kim, Shinyu; Kwon, Taejoon; Lee, Tae Hee; Lee, Kwangrae
- Issue Date
- Apr-2021
- Publisher
- SPRINGER
- Keywords
- Commercial vehicle; Dijkstra' s algorithm; Minimal spanning tree; Pipe routing algorithm; Routing design methodology
- Citation
- JOURNAL OF INTELLIGENT MANUFACTURING, v.32, no.4, pp.917 - 933
- Indexed
- SCIE
SCOPUS
- Journal Title
- JOURNAL OF INTELLIGENT MANUFACTURING
- Volume
- 32
- Number
- 4
- Start Page
- 917
- End Page
- 933
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/1484
- DOI
- 10.1007/s10845-020-01596-9
- ISSN
- 0956-5515
- 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.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 미래자동차공학과 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/1484)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.