A partitioning column approach for solving LED sorter manipulator path planning problems

Sheng-I Chen*, Yen Che Tseng

*此作品的通信作者

研究成果: Article同行評審

摘要

This study considers the path planning problem of picking lightemitting diodes on a silicon wafer. The ob jective is to find the shortest walk for the sorter manipulator covering all nodes in a fully connected graph. We propose a partitioning column approach to reduce the original graph's size, where adjacent nodes at the same column are seen as a required edge, and the connection of vertices at different required edges is viewed as a non-required edge. The path planning problem turns to find the shortest closed walk to traverse required edges and is modeled as a rural postman problem with a solvable problem size. We formulate a mixed-integer program to obtain the exact solution for the transformed graph. We compare the proposed method with a TSP solver, Concorde. The result shows that our approach significantly reduces the problem size and obtains a near-optimal solution. For large problem instances, the proposed method can obtain a feasible solution in time, but not for the benchmarking solver.

原文English
頁(從 - 到)2033-2047
頁數15
期刊Journal of Industrial and Management Optimization
18
發行號3
DOIs
出版狀態Published - 5月 2022

指紋

深入研究「A partitioning column approach for solving LED sorter manipulator path planning problems」主題。共同形成了獨特的指紋。

引用此