By Topic

Optimization of high-speed multistation SMT placement machines using evolutionary algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Weihsin Wang ; Dept. of Electr. Eng. & Comput. Sci., Illinois Univ., Chicago, IL, USA ; P. C. Nelson ; T. M. Tirpak

Surface mount technology (SMT) is a robust methodology that has been widely used in the past decade to produce circuit boards. Analyses of the SMT assembly line have shown that the automated placement machine is often the bottleneck, regardless of the arrangement of these machines (parallel or sequential) in the assembly line. Improving and automating the placement machine is a key issue for increasing SMT production line throughput. This paper presents experimental results using genetic algorithms to optimize the feeder slot assignment problem for a high-speed parallel, multistation SMT placement machine. Four crossover operators, four selection methods, and two probability settings are used in our experiments. A penalty function is used to handle constraints. A comparison of genetic algorithms with several other optimization methods (human experts, vendor supplied software, expert systems, and local search) is presented, which supports the use of genetic algorithms for this problem

Published in:

IEEE Transactions on Electronics Packaging Manufacturing  (Volume:22 ,  Issue: 2 )