A genetic algorithm to optimise the component placement process in the PCB assembly

William Ho, Ping Ji

Research output: Contribution to journalArticlepeer-review


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.
Original languageEnglish
Pages (from-to)1397-1401
Number of pages5
JournalInternational Journal of Advanced Manufacturing Technology
Issue number11-12
Publication statusPublished - Nov 2005


  • component retrieval
  • component placement sequencing
  • feeder arrangement
  • genetic algorithm
  • PCB assembly


Dive into the research topics of 'A genetic algorithm to optimise the component placement process in the PCB assembly'. Together they form a unique fingerprint.

Cite this