An Algorithm of the Optimal Order of Component Mounting on an Electronic Circuit Board

摘要

Among the most important and difficult parts of automatic component mounting on an electronic circuit board is the problem of determining the optimal mounting order. In the present paper we formulate the problem as the 3 dimensional traveling salesperson problem and solve by a simplified chained Lin-Kernighan algorithm. We also show how the mounting time depends on the arrangement of the component feeders. We show how our approach gives satisfactory results.