Constrained Multiple TSP in the context of Printed Circuit Board Assembly
One of the major problems in printed circuit board (PCB) assembly optimization is finding the optimal placement sequence of electronic components. Depending on the architecture of the component placement machine used and properties of the feeder mechanism, more complex placement sequencing problems should be analyzed. In this study, we analyze a case where the placement of the components on the PCB can be completed in four steps due to the polarity and orientation of the components on the board. This is accomplished by rotation of the PCB at 90 degrees steps. We show that the placement sequencing problem can be modelled as a Constrained Multiple Traveling Salesman Problem (CMTSP), which is constrained in the sense that, some components should take place at some specific TSP routes. We propose an algorithm to solve the CMTSP and test the algorithm using real data obtained from a PCB manufacturing facility.
Combinatorial optimization printed circuit board assembly placement sequence multiple traveling salesman problem
Ekrem DUMAN
Dogus University,Istanbul
国际会议
北京
英文
2007-05-30（万方平台首次上网日期，不代表论文的发表时间）