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.

商用车的各种电线，管子和软管的布线设计需要大量的工时，因为商用车种类繁多，其他车辆部件的设计经常更改以及手动试错法。这项研究提出了一种新的基于图的路由算法，以在商用车的受限空间中找到无碰撞的路由路径。采用最小生成树连接图中的多个端点，并使用Dijkstra算法在候选路径中找到最短路径。设计域被分为几个子域以简化图，并且所提出的算法以顺序的方式解决了路由问题以处理中间点。然后，将该方法应用于商用卡车四个不同路径组件的路径设计。结果表明，所开发的方法可以提供令人满意的路线设计，以满足汽车行业设计专家的所有要求。