SAAD, S., KHALIL, E., FOWKES, C., BASARAB-HORWATH, I. and PERERA, T. (2006). Taboo search vs genetic algorithms in solving and optimising PCB problems. Journal of manufacturing technology management, 17 (4), 521-536.
Full text not available from this repository.Abstract
Purpose – To highlight the differences and common features of taboo search (TS) and genetic algorithms (GA) in solving the problem of board-type sequencing on the assembly line simultaneously with the combined problem of feeder assignment and component placement sequencing in the printed circuit board (PCB) industry. Design/methodology/approach – Two metaheuristics (search techniques) are used to solve three problems associated with the PCB assembly line: TS and GA. The implemented approach is used to solve the three problems on a single pick-and-place sequential machine with a stationary board table and stationary feeders, and with the use of the Euclidean metric. Findings – The achieved results show a satisfactory reduction in assembly time, when TS and GA are compared with a random solution, with a slight superiority of TS over GA. However, the program running time is longer for TS.
Item Type: | Article |
---|---|
Research Institute, Centre or Group - Does NOT include content added after October 2018: | Materials and Engineering Research Institute > Centre for Automation and Robotics Research > Systems Modelling and Integration Group |
Identification Number: | https://doi.org/10.1108/17410380610662988 |
Page Range: | 521-536 |
Depositing User: | Ann Betterton |
Date Deposited: | 09 Jun 2008 |
Last Modified: | 18 Mar 2021 21:45 |
URI: | https://shura.shu.ac.uk/id/eprint/753 |
Actions (login required)
View Item |
Downloads
Downloads per month over past year