Sequential graph-based routing algorithm for electrical harnesses, tubes, and hoses in a commercial vehicle
- Title
- Sequential graph-based routing algorithm for electrical harnesses, tubes, and hoses in a commercial vehicle
- Author
- 이태희
- Keywords
- Commercial vehicle; Dijkstra's algorithm; Minimal spanning tree; Pipe routing algorithm; Routing design methodology
- Issue Date
- 2021-05
- Publisher
- SPRINGER
- Citation
- JOURNAL OF INTELLIGENT MANUFACTURING, v. 32, NO. 4, Page. 917-933
- 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.
- URI
- https://link.springer.com/article/10.1007/s10845-020-01596-9https://repository.hanyang.ac.kr/handle/20.500.11754/177965
- ISSN
- 0956-5515;1572-8145
- DOI
- 10.1007/s10845-020-01596-9
- Appears in Collections:
- COLLEGE OF ENGINEERING[S](공과대학) > AUTOMOTIVE ENGINEERING(미래자동차공학과) > Articles
- Files in This Item:
There are no files associated with this item.
- Export
- RIS (EndNote)
- XLS (Excel)
- XML