標題: A comparison of search techniques for minimizing assembly time in printed wiring assembly
作者: Fu, HP
Su, CT
工業工程與管理學系
Department of Industrial Engineering and Management
關鍵字: genetic algorithm;simulated annealing;tabu search;robotics assembly;magazine assignment
公開日期: 5-Jan-2000
摘要: 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.
URI: http://dx.doi.org/10.1016/S0925-5273(99)00004-3
http://hdl.handle.net/11536/30808
ISSN: 0925-5273
DOI: 10.1016/S0925-5273(99)00004-3
期刊: INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
Volume: 63
Issue: 1
起始頁: 83
結束頁: 98
Appears in Collections:Articles


Files in This Item:

  1. 000084208200008.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.