Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/16075
Title: A genetic algorithm to optimise the component placement process in PCB assembly
Authors: Ho, W
Ji, P 
Keywords: Component placement sequencing
Component retrieval
Feeder arrangement
Genetic algorithm
PCB assembly
Issue Date: 2005
Publisher: Springer
Source: International journal of advanced manufacturing technology, 2005, v. 26, no. 11-12, p. 1397-1401 How to cite?
Journal: International journal of advanced manufacturing technology 
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.
URI: http://hdl.handle.net/10397/16075
ISSN: 0268-3768
EISSN: 1433-3015
DOI: 10.1007/s00170-004-2132-5
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

16
Last Week
0
Last month
1
Citations as of Aug 14, 2017

WEB OF SCIENCETM
Citations

10
Last Week
0
Last month
1
Citations as of Aug 13, 2017

Page view(s)

38
Last Week
0
Last month
Checked on Aug 20, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.