A hybrid genetic algorithm for sequencing PCB component placement

William Ho, Ping Ji

Research output: Contribution to journalArticle

Abstract

A chip shooter machine for electronic components assembly has a movable feeder carrier holding components, a movable X-Y table carrying a printed circuit board (PCB), and a rotary turret having multiple assembly heads. This paper presents a hybrid genetic algorithm to optimize the sequence of component placements for a chip shooter machine. The objective of the problem is to minimize the total traveling distance of the X-Y table or the board. The genetic algorithm developed in the paper hybridizes the nearest neighbor heuristic, and an iterated swap procedure, which is a new improved heuristic. We have compared the performance of the hybrid genetic algorithm with that of the approach proposed by other researchers and have demonstrated our algorithm is superior in terms of the distance traveled by the X-Y table or the board.
Original languageEnglish
Pages (from-to)129-136
Number of pages8
JournalInternational Journal of Knowledge
Volume9
Issue number2
DOIs
Publication statusPublished - 2005

Fingerprint

Printed circuit boards
Genetic algorithms

Keywords

  • printed circuit board assembly
  • component placement sequencing
  • chip shooter machines
  • heuristics
  • genetic algorithms

Cite this

Ho, William ; Ji, Ping. / A hybrid genetic algorithm for sequencing PCB component placement. In: International Journal of Knowledge. 2005 ; Vol. 9, No. 2. pp. 129-136.
@article{93d0e8c8ba88427390d96630aa3b51f5,
title = "A hybrid genetic algorithm for sequencing PCB component placement",
abstract = "A chip shooter machine for electronic components assembly has a movable feeder carrier holding components, a movable X-Y table carrying a printed circuit board (PCB), and a rotary turret having multiple assembly heads. This paper presents a hybrid genetic algorithm to optimize the sequence of component placements for a chip shooter machine. The objective of the problem is to minimize the total traveling distance of the X-Y table or the board. The genetic algorithm developed in the paper hybridizes the nearest neighbor heuristic, and an iterated swap procedure, which is a new improved heuristic. We have compared the performance of the hybrid genetic algorithm with that of the approach proposed by other researchers and have demonstrated our algorithm is superior in terms of the distance traveled by the X-Y table or the board.",
keywords = "printed circuit board assembly, component placement sequencing, chip shooter machines, heuristics, genetic algorithms",
author = "William Ho and Ping Ji",
year = "2005",
doi = "10.3233/KES-2005-9207",
language = "English",
volume = "9",
pages = "129--136",
journal = "International Journal of Knowledge",
issn = "1327-2314",
publisher = "IOS",
number = "2",

}

A hybrid genetic algorithm for sequencing PCB component placement. / Ho, William; Ji, Ping.

In: International Journal of Knowledge, Vol. 9, No. 2, 2005, p. 129-136.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A hybrid genetic algorithm for sequencing PCB component placement

AU - Ho, William

AU - Ji, Ping

PY - 2005

Y1 - 2005

N2 - A chip shooter machine for electronic components assembly has a movable feeder carrier holding components, a movable X-Y table carrying a printed circuit board (PCB), and a rotary turret having multiple assembly heads. This paper presents a hybrid genetic algorithm to optimize the sequence of component placements for a chip shooter machine. The objective of the problem is to minimize the total traveling distance of the X-Y table or the board. The genetic algorithm developed in the paper hybridizes the nearest neighbor heuristic, and an iterated swap procedure, which is a new improved heuristic. We have compared the performance of the hybrid genetic algorithm with that of the approach proposed by other researchers and have demonstrated our algorithm is superior in terms of the distance traveled by the X-Y table or the board.

AB - A chip shooter machine for electronic components assembly has a movable feeder carrier holding components, a movable X-Y table carrying a printed circuit board (PCB), and a rotary turret having multiple assembly heads. This paper presents a hybrid genetic algorithm to optimize the sequence of component placements for a chip shooter machine. The objective of the problem is to minimize the total traveling distance of the X-Y table or the board. The genetic algorithm developed in the paper hybridizes the nearest neighbor heuristic, and an iterated swap procedure, which is a new improved heuristic. We have compared the performance of the hybrid genetic algorithm with that of the approach proposed by other researchers and have demonstrated our algorithm is superior in terms of the distance traveled by the X-Y table or the board.

KW - printed circuit board assembly

KW - component placement sequencing

KW - chip shooter machines

KW - heuristics

KW - genetic algorithms

UR - https://content.iospress.com/articles/international-journal-of-knowledge-based-and-intelligent-engineering-systems/kes00035

U2 - 10.3233/KES-2005-9207

DO - 10.3233/KES-2005-9207

M3 - Article

VL - 9

SP - 129

EP - 136

JO - International Journal of Knowledge

JF - International Journal of Knowledge

SN - 1327-2314

IS - 2

ER -