Printed circuit board assembly time minimisation using a novel bees algorithm

Research output: Contribution to journalArticlepeer-review

Authors

Colleges, School and Institutes

Abstract

This paper presents a novel version of the Bees Algorithm customised to solve combinatorial optimisation problems. This version was created to minimise assembly time in the manufacturing of printed circuit boards using a machine of the moving-board-with-time-delay type, and optimising the feeder arrangement and machine component placement sequence. The local search procedure of the standard Bees Algorithm was modified to include five new operators for combinatorial optimisation. The customised Bees Algorithm was first tested on the related travelling salesman problem, where it excelled in terms of performance and efficiency compared to three state-of-the-art optimisation methods. It was then applied to a well-known moving-board-with-time-delay benchmark problem, where it performed favourably in comparison to the state-of-the-art in the literature, achieving fast and consistent solutions.

Details

Original languageEnglish
Pages (from-to)186-194
Number of pages9
JournalComputers & Industrial Engineering
Volume133
Early online date11 May 2019
Publication statusPublished - Jul 2019

Keywords

  • combinatorial optimisation, bees algorithm, Manufacturing, Printed Circuit Board Assembly