Author
Alkaya, A. F., Duman, Ekrem
Publication Date
2015-09-10
Publication Place
-
Elsevier
Subject
PCB assembly, Sequence dependent TSP, Metaheuristics, Artificial bee colony, Simulated annealing
Type
Periodical
Language
English
Digital
Yes
Manuscript
No
Library
Özyeğin University
Library Asset ID
1872-6771
Record ID
d7122b01-066b-4496-b3aa-3e99447745ba
Library Location
Industrial Engineering
Date
2015-09-10
Notes
Due to copyright restrictions, the access to the full text of this article is only available via subscription.
Sample Text
In this study we undertake the optimization of chip shooter component placement machines which became popular in assembling printed circuit boards (PCB) in recent years. A PCB is usually a rectangular plastic board on which the electrical circuit to be used in a particular electronic equipment is printed. The overall optimization of the chip shooter placement machines leads to a very complicated optimization problem which we formulate here for the first time (without any simplifying assumptions). However, it is possible to decompose the problem into placement sequencing problem and feeder configuration problem which turn out to be sequence dependent traveling salesman problem (SDTSP) and Quadratic Assignment Problem (QAP), respectively. We use simulated annealing metaheuristic approach and the heuristics developed for the SDTSP in an earlier study to solve these two problems in an iterative manner. We also attempt to solve the combined overall optimization problem by simulated annealing and artificial bee colony metaheuristics and compare their performances with the iterative approach. The results are in favor of iterative approach.
DOI
10.1016/j.dam.2015.03.009
Cilt
192
