Abstract
This paper presents a hybrid genetic algorithm to optimize the sequence of component placements on a printed circuit board and the arrangement of component types to feeders simultaneously for a pick-and-place machine with multiple stationary feeders, a fixed board table and a movable placement head. The objective of the problem is to minimize the total traveling distance, or the traveling time, of the placement head. The genetic algorithm developed in the paper hybridizes different search heuristics including the nearest neighbor heuristic, the 2-opt heuristic, and an iterated swap procedure, which is a new improving heuristic. Compared with the results obtained by other researchers, the performance of the hybrid genetic algorithm is superior to others in terms of the distance traveled by the placement head.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Altinkemer, K., Kazaz, B., Köksalan, M. and Moskowitz, H. (2000) Optimization of printed circuit board manufacturing: Integrated modeling and algorithms. European Journal of Operational Research, 124, 409–421.
Ball, M. O. and Magazine, M. J. (1988) Sequencing of insertions in printed circuit board assembly. Operations Research, 36(2), 192–201.
Broad, K., Mason, A., Rönnqvist, M. and Frater, M. (1996) Optimal robotic component placement. Journal of Operational Research Society, 47, 1343–1354.
Chambers, L. (1995) Practical Handbook of Genetic Algorithms, Volume II, CRC press, Boca Raton, Florida.
Chan, D. and Mercier, D. (1989) IC insertion: An application of the travelling salesman problem. International Journal of Production Research, 27(10), 1837–1841.
Davis, L. (1991) Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York.
Foulds, L. R. and Hamacher, H. W. (1993) Optimal bin location and sequencing in printed circuit board assembly. European Journal of Operational Research, 66, 279–290.
Francis, R. L., Hamacher, H. W., Lee, C. Y. and Yeralan, S. (1994) Finding placement sequences and bin locations for cartesian robots. IIE Transactions, 26(1), 47–59.
Gen, M. and Cheng, R. (1997) Genetic Algorithms and Engineering Design, John Wiley & Sons, New York.
Ji, Z., Leu, M. C. and Wong, H. (1992) Application of linear assignment model for planning of robotic printed circuit board assembly. Journal of Electronic Packaging, 114, 455–460.
Kumar, R. and Li, H. (1995) Integer programming approach to printed circuit board assembly time optimization. IEEE Transactions on Components, Packaging, and Manufacturing Technology–Part B, 18(4), 720–727.
Leu, M. C., Wong, H. and Ji, Z. (1993) Planning of component placement/insertion sequence and feeder setup in PCB assembly using genetic algorithm. Journal of Electronic Packaging, 115, 424–432.
Magyar, G., Johnsson, M. and Nevalainen, O. (1999) On solving single machine optimization problems in electronics assembly. Journal of Electronics Manufacturing, 9(4), 249–267.
Mitchell, M. (1996) Introduction to Genetic Algorithms, The MIT Press, Cambridge, Massachusetts.
Ong, N. S. and Khoo, L. P. (1999) Genetic algorithm approach in PCB assembly. Integrated Manufacturing Systems, 10, 256–265.
Reinelt, G. (1994) The Traveling Salesman: Computational Solutions for TSP Applications, Springer-Verlag, Berlin, New York.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ho, W., Ji, P. A hybrid genetic algorithm for component sequencing and feeder arrangement. Journal of Intelligent Manufacturing 15, 307–315 (2004). https://doi.org/10.1023/B:JIMS.0000026569.88191.46
Issue Date:
DOI: https://doi.org/10.1023/B:JIMS.0000026569.88191.46