A novel tabu search approach to find the best placement sequence and magazine assignment in dynamic robotics assembly

Notes that, until now, to route robotics travel, most investigations have utilized the fixed coordinate of placement points and magazine of the traveling salesman problem (TSP) method to sequence the placement points after the magazine has been arbitrarily assigned. Points out that, in fact, robotics travel routing should be based on a relative coordinate because the robotics, board and magazine simultaneously move at different speeds during assembly. Consequently, the coordinates of placement point and magazine are constantly changing. In this study, a novel tabu search (TS) based approach is presented. The proposed approach can arrange the placement sequence and assign the magazine slots to yield a performance better than the conventional one. Results presented herein also demonstrate that the larger the number of placement points and/or part numbers, the better the performance.