Skip to main content
SpringerLink
Log in

Optimization of a high-speed placement machine using tabu search algorithms

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

Combinatorial optimization represents a wide range of real-life manufacturing optimization problems. Due to the high computational complexity, and the usually high number of variables, the solution of these problems imposes considerable challenges.

This paper presents a tabu search approach to a combinatorial optimization problem, in which the objective is to maximize the production throughput of a high-speed automated placement machine. Tabu search is a modern heuristic technique widely employed to cope with large search spaces, for which classical search methods would not provide satisfactory solutions in a reasonable amount of time. The developed TS strategies are tailored to address the different issues caused by the modular structure of the machine.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J.C. Ammons, W.M. Carlyle, G.W. DePuy, K.P. Ellis, L.F. McGinnis, C.A. Tovey and H. Xu, Computer-aided process planning in printed circuit card assembly, IEEE Transactions on Components, Hybrids and Manufacturing Technology 16(4) (1993) 370–376.

    Article  Google Scholar 

  2. M.O. Ball and M.J. Magazine, Sequencing of insertions in printed circuit board assembly, Operations Research 36(2) (1988) 192–201.

    Article  Google Scholar 

  3. Committee on the next decade of operations research, Operations research: The next decade, Operations Research 36 (1988).

  4. Y. Crama, A.W.J. Kolen, A.G. Oerlemans and F.C.R. Spieksma, Throughput rate optimization in the automated assembly of printed circuit boards, Annals of Operations Research 26 (1990) 455–480.

    Google Scholar 

  5. P. Csaszar, Optimization of automated placement machines using tabu search algorithms, Ph.D. thesis, University of Illinois at Chicago (1999).

    Google Scholar 

  6. P. Csaszar, T.M. Tirpak and P.C. Nelson, Object-oriented simulator design for an automated highspeed modular placement machine family, Simulation 73(6) (1999) 341–351.

    Google Scholar 

  7. A. Dikos, P.C. Nelson, T.M. Tirpak and W. Wang, Optimization of high-mix printed circuit card assembly using genetic algorithms, Annals of Operation Research 75 (1997) 303–324.

    Article  Google Scholar 

  8. L.R. Foulds and H.W. Hamacher, Optimal bin location and sequencing in printed circuit board assembly, European Journal of Operational Research 66 (1993) 279–290.

    Article  Google Scholar 

  9. F. Glover, Tabu search-part i, ORSA Journal on Computing 1(3) (1989) 190–206.

    Google Scholar 

  10. F. Glover, Tabu search-part ii, ORSA Journal on Computing 1(4) (1990) 4–32.

    Google Scholar 

  11. F. Glover and M. Laguna, Tabu Search(Kluwer Academic, 1997).

  12. F. Glover and C. McMillan, The general employee scheduling problem: an integration of MS and AI, Computer and Operations Research 13(5) (1986) 563–573.

    Article  Google Scholar 

  13. F. Glover, É.D. Taillard and D. de Werra, A user's guide to tabu search, Annals of Operations Research 41 (1993) 3–28.

    Article  Google Scholar 

  14. S. Grotzinger, Feeder assignment models for concurrent placement machines, IIE Transactions 24(4) (1992) 31–44.

    Google Scholar 

  15. R. Kumar and H. Li, Integer programming approach to printed circuit board assembly time optimization, IEEE Transactions on Components, Packaging, and Manufacturing Technology, Part B: Advance Packaging 18(4) (1995) 720–727.

    Article  Google Scholar 

  16. T. Leipälä and O. Nevalainen, Optimization of the movements of a component placement machine, European Journal of Operational Research 38 (1989) 167–177.

    Article  Google Scholar 

  17. C. Mauckner, H. Noltmeier and S.O. Krumke, Finding placement sequences and bin locations for pick-and place robots, Studies in Locational Analysis (10) (1996) 67–89.

    Google Scholar 

  18. L.F. McGinnis, J.C. Ammons, M. Carlyle, L. Cranmer, G.W. DePuy, K.P. Ellis, C.A. Tovey and H. Xu, Automated process planning for printed circuit card assembly, IIE Transactions 24(4) (1992) 18–30.

    Google Scholar 

  19. P.K. Mohapatra, T.M. Tirpak, P.C. Nelson and P. Csaszar, A generic simulation and optimization system for chip placement machines, in: International Conference on Information Technology, Bhubaneswar, India (1990) pp. 3–17.

    Google Scholar 

  20. E. Nowicki and C. Smutnicki, A fast taboo search algorithm for the job shop problem, Technical Report 8/93, Institute of Engineering Cybernetics, Technical University of Wroclaw, Poland (1993).

    Google Scholar 

  21. C.R. Reeves, ed., Modern Heuristic Techniques for Combinatorial Problems(Wiley, New York, 1993).

    Google Scholar 

  22. J. Rubinovitz and D. Volovich, Task sequence and layout design in a robotic assembly cell, in: 15th ISPE/IEE International Conference on CAD/CAM, Robotics and Factories of the Future, Águas de Lind´oia, SP, Brazil (1999).

    Google Scholar 

  23. W. Shih, K. Srihari and J. Adriance, Expert system based placement sequence identification for surface mount PCB assembly, International Journal of Advanced Manufacturing Technology 11 (1996) 413–424.

    Article  Google Scholar 

  24. J. Sohn and S. Park, Efficient operation of a surface mounting machine with a multihead turret, International Journal of Production Research 34(4) (1996) 1131–1143.

    Google Scholar 

  25. Y.-Y. Su and K. Srihari, Placement sequence identification using artificial neural network in surface mount PCB assembly, International Journal of Advanced Manufacturing Technology 11 (1996) 285–299.

    Article  Google Scholar 

  26. T.M. Tirpak, Simulation software for surface mount assembly, in: Proceedings of the 1993 Winter Simulation Conference, Los Angeles, CA (1993) pp. 796–803.

  27. S. Voss, Solving quadratic assignment problems using the reverse elimination method, Technical report, Technische Hochschule Darmstadt, Germany (1993).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Motorola Advanced Technology Center, Motorola, Inc., Schaumburg, IL, 60196-1078, USA Email

    Peter Csaszar & Thomas M. Tirpak

  2. Artificial Intelligence Laboratory, Department of Electrical Engineering and Computer Science (M/C 154), University of Illinois at Chicago, 851 South Morgan Street, Chicago, IL, 60607-7053, USA

    Peter C. Nelson

Authors
  1. Peter Csaszar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas M. Tirpak
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Peter C. Nelson
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Csaszar, P., Tirpak, T.M. & Nelson, P.C. Optimization of a high-speed placement machine using tabu search algorithms. Annals of Operations Research 96, 125–147 (2000). https://doi.org/10.1023/A:1018911821102

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1018911821102

Search

Navigation