Browsing by Author "Fu, HP"

Now showing 1 - 2 of 2

A comparison of search techniques for minimizing assembly time in printed wiring assembly
(2000-01-05)
Fu, HP
;
Su, CT
;
工業工程與管理學系
;
Department of Industrial Engineering and Management
In the robotics assembly of DPP model, the coordinates of assembly point and magazine are dynamically changed during robotics assembly so that evaluation of the assembly efficiency is extremely complicated. To route the robotics travel, most related investigations have utilized the fixed coordinate of insertion points and magazine using the Traveling Salesman Problems (TSP) method to sequence the insertion points after arbitrarily assigning the magazine. However, robotics travel routing should be based on a relative coordinate to obtain a better solution because the robotics, board and magazine are simultaneously moved at different speeds during assembly. To resolve such a dynamically combinatorial problem, this study presents the Genetic Algorithm (GA), Simulated Annealing (SA), and Tabu Search (TS) based algorithms. These approaches can simultaneously arrange the insertion sequence and assign the magazine slots by the computer and yield a better performance compared to the conventional approach. Results presented herein also demonstrate that the larger the number of insertion points and/or part numbers the better the performance. These approaches are also compared. (C) 2000 Elsevier Science B.V. All rights reserved.
A simulated annealing heuristic for robotics assembly using the dynamic pick-and-place model
(1998-12-01)
Su, CT
;
Fu, HP
;
工業工程與管理學系
;
Department of Industrial Engineering and Management
Products assembled by robots are typical in present day manufacturing. The traditional type of automatic assembly is Fixed Picked and Place (FPP) mode. The development of the Dynamic Picked-and-Place (DPP) model is an important issue in robotics travel. Until now, to route robotics travel, the authors usually have utilized the fixed coordinate of insertion points and magazine of the Travelling Salesman Problems (TSP) method to sequence the insertion points. However, robotics travel routing should be based on a relative coordinate because the coordinates of insertion point and magazine are constantly changing. That is, the robotics, board and magazine are simultaneously moved at different speeds. This study presents a Simulated Annealing (SA)-based algorithm that can arrange the insertion sequence and assign the magazine slots to obtain a performance better than in the traditional approach.