自己組織化マップ(SOM)によるチップマウンタ上の部品配置の最適化

抄録

The Traveling Salesman Problem (TSP) is a problem of finding the shortest route back to the starting point after visiting each city only once. Referring previous Self-Organizing Maps (SOM) research, we have studied how to shorten the computation time for applying SOM to the TSP while keeping the original form. In this study, we applied SOM-TSP on the optimization of component placement in a chip mounter.