Abstract
In printed circuit board (PCB) assembly, the efficiency of the component placement process is dependent on two interrelated issues: the sequence of component placement, that is, the component sequencing problem, and the assignment of component types to feeders of the placement machine, that is, the feeder arrangement problem. In cases where some components with the same type are assigned to more than one feeder, the component retrieval problem should also be considered. Due to their inseparable relationship, a hybrid genetic algorithm is adopted to solve these three problems simultaneously for a type of PCB placement machines called the sequential pick-and-place (PAP) machine in this paper. The objective is to minimise the total distance travelled by the placement head for assembling all components on a PCB. Besides, the algorithm is compared with the methods proposed by other researchers in order to examine its effectiveness and efficiency.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Yeo SH, Low CW, Yong KH (1996) A rule-based frame system for concurrent assembly machines. Int J Adv Manuf Technol 12:370–376
Ball MO, Magazine MJ (1988) Sequencing of insertions in printed circuit board assembly. Oper Res 36(2):192–201
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
Foulds LR, Hamacher HW (1993) Optimal bin location and sequencing in printed circuit board assembly. Eur J Oper Re 66:279–290
Francis RL, Hamacher HW, Lee CY, Yeralan S (1994) Finding placement sequences and bin locations for cartesian robots. IIE Trans 26(1):47–59
Kumar R, Li H (1995) Integer programming approach to printed circuit board assembly time optimization. IEEE Trans Compon Packag Manuf Technol B 18(4):720–727
Broad K, Mason A, Rönnqvist M, Frater M (1996) Optimal robotic component placement. J Oper Res Soc 47:1343–1354
Magyar G, Johnsson M, Nevalainen O (1999) On solving single machine optimization problems in electronics assembly. J Electron Manuf 9(4):249–267
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
Ong NS, Khoo LP (1999) Genetic algorithm approach in PCB assembly. Integr Manuf Syst 10:256–265
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
Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley, New York
Gen M, Cheng R (1997) Genetic algorithms and engineering design. Wiley, New York
Khoo LP, Ong NS (1998) PCB assembly planning using genetic algorithms. Int J Adv Manuf Technol 14:363–368
Ho W, Ji P (2003) Component scheduling for chip shooter machines: a hybrid genetic algorithm approach. Comput Oper Res 30:2175–2189
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ho, W., Ji, P. A genetic algorithm to optimise the component placement process in PCB assembly. Int J Adv Manuf Technol 26, 1397–1401 (2005). https://doi.org/10.1007/s00170-004-2132-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-004-2132-5