Abstract
This paper presents two hybrid genetic algorithms (HGAs) to optimize the component placement operation for the collect-and-place machines in printed circuit board (PCB) assembly. The component placement problem is to optimize (i) the assignment of components to a movable revolver head or assembly tour, (ii) the sequence of component placements on a stationary PCB in each tour, and (iii) the arrangement of component types to stationary feeders simultaneously. The objective of the problem is to minimize the total traveling time spent by the revolver head for assembling all components on the PCB. The major difference between the HGAs is that the initial solutions are generated randomly in HGA1. The Clarke and Wright saving method, the nearest neighbor heuristic, and the neighborhood frequency heuristic are incorporated into HGA2 for the initialization procedure. A computational study is carried out to compare the algorithms with different population sizes. It is proved that the performance of HGA2 is superior to HGA1 in terms of the total assembly time.
Similar content being viewed by others
References
Altinkemer K, Kazaz B, Köksalan M, Moskowitz H (2000) Optimization of printed circuit board manufacturing: integrated modeling and algorithms. Eur J Oper Res 124:409–421
Ball MO, Magazine MJ (1988) Sequencing of insertions in printed circuit board assembly. Oper Res 36:192–201
Bard JF, Clayton RW, Feo TA (1994) Machine setup and component placement in printed circuit board assembly. Int J Flex Manuf Syst 6:5–31
Broad K, Mason A, Rönnqvist M, Frater M (1996) Optimal robotic component placement. J Oper Res Soc 47:1343–1354
Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12:568–581
Crama Y, Flippo OE, Klundert JVD, Spieksma FCR (1997) The assembly of printed circuit boards: a case with multiple machines and multiple board types. Eur J Oper Res 98:457–472
Csaszar P, Tirpak, TM, Nelson PC (2000) Optimization of a high-speed placement machine using tabu search algorithms. Ann Oper Res 96:125–147
Dikos A, Nelson PC, Tirpak TM, Wang W (1997) Optimization of high-mix printed circuit card assembly using genetic algorithms. Ann Oper Res 75:303–324
Ellis KP, Vittes FJ, Kobza JE (2001) Optimizing the performance of a surface mount placement machine. IEEE Trans Electron Packag Manuf 24:160–170
Foulds LR, Hamacher HW (1993) Optimal bin location and sequencing in printed circuit board assembly. Eur J Oper Res 66:279–290
Francis RL, Hamacher HW, Lee CY, Yeralan S (1994) Finding placement sequences and bin locations for cartesian robots. IIE Trans 26:47–59
Gen M, Cheng R (1997) Genetic algorithms and engineering design. Wiley, New York
Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley, New York
Grunow M, Günther HO, Schleusener M, Yilmaz IO (2004) Operations planning for collect-and-place machines in PCB assembly. Comput Ind Eng 47:409–429
Ho W, Ji P (2003) Component scheduling for chip shooter machines: a hybrid genetic algorithm approach. Comput Oper Res 30:2175–2189
Ho W, Ji P (2004) A hybrid genetic algorithm for component sequencing and feeder arrangement. J Intell Manuf 15:307–315
Ho W, Ji P (2005) A genetic algorithm to optimise the component placement process in PCB assembly. Int J Adv Manuf Technol 26:1397–1401
Ho W, Ji P (2006) A genetic algorithm approach to optimising component placement and retrieval sequence for chip shooter machines. Int J Adv Manuf Technol 28:556–560
Ji Z, Leu MC, Wong H (1992) Application of linear assignment model for planning of robotic printed circuit board assembly. J Electron Packag 114:455–460
Kazaz B, Altinkemer K (2003) Optimization of multi-feeder (depot) printed circuit board manufacturing with error guarantees. Eur J Oper Res 150:370–394
Klomp C, Klundert JVD, Spieksma FCR, Voogt S (2000) The feeder rack assignment problem in PCB assembly: a case study. Int J Prod Econ 64:399–407
Kumar R, Li H (1995) Integer programming approach to printed circuit board assembly time optimization. IEEE Trans Compon Packag Manuf Technol - Part B 18:720–727
Leu MC, Wong H, Ji Z (1993) Planning of component placement/insertion sequence and feeder setup in PCB assembly using genetic algorithm. J Electron Packag 115:424–432
Magyar G, Johnsson M, Nevalainen O (1999) On solving single machine optimization problems in electronics assembly. J Electron Manuf 9:249–267
Moyer LK, Gupta SM (1996) SMT feeder slot assignment for predetermined component placement paths. J Electron Manuf 6:173–192
Moyer LK, Gupta SM (1996) Simultaneous component sequencing and feeder assignment for high speed chip shooter machines. J Electron Manuf 6:271–305
Moyer LK, Gupta SM (1997) An efficient assembly sequencing heuristic for printed circuit board configurations. J Electron Manuf 7:143–160
Ong NS, Khoo LP (1999) Genetic algorithm approach in PCB assembly. Integr Manuf Syst 10:256–265
Ong NS, Tan WC (2002) Sequence placement planning for high-speed PCB assembly machine. Integr Manuf Syst 13:35–46
Osman IH, Kelly JP (1996) Meta-heuristics: theory & applications. Kluwer Academic Publishers, Boston
Reinelt G (1994) The traveling salesman: computational solutions for TSP applications. Springer, Berlin Heidelberg New York
SIEMENS (2005) http://www.siplace.com.
Sohn J, Park S (1996) Efficient operation of a surface mounting machine with a multihead turret. Int J Prod Res 34:1131–1143
Souza RD, Wu LJ (1995) Intelligent optimization of component onsertion in multi-head concurrent operation PCBA machines. J Intell Manuf 6:235–243
Wilhelm WE, Tarmy PK (2003) Circuit card assembly on tandem turret-type placement machines. IIE Trans 35:627–645
Yeo SH, Low CW, Yong KH (1996) A rule-based frame system for concurrent assembly machines. Int J Adv Manuf Technol 12:370–376
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ho, W., Ji, P. & Dey, P.K. Optimization of PCB component placements for the collect-and-place machines. Int J Adv Manuf Technol 37, 828–836 (2008). https://doi.org/10.1007/s00170-007-1014-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-007-1014-z