Skip to main content

Advertisement

SpringerLink
Log in

Developing a varietal GA with ESMA strategy for solving the pick and place problem in printed circuit board assembly line

  • Published:
Journal of Intelligent Manufacturing Aims and scope Submit manuscript

Abstract

The main issue for enhancing the productivity in Printed Circuit Board (PCB) is to reduce the cycle time for pick and place (PAP) operations; i.e., to minimize the time for the PAP operations. According to the characteristics of the PAP problems, the sequence for the placement of components can be mostly treated as the Travelling Salesman Problem (TSP). In this paper, a Genetic Algorithm (GA) with External Self-evolving Multiple Archives (ESMA) is developed for minimizing the PAP operations in PCB assembly line. ESMA focuses on the issue of improving the premature convergence time in GA by adopting efficient measures for population diversity, effective diversity control and mutation strategies to enhance the global searching ability. Three mechanisms for varietal GA such as Clustering Strategy, Switchable Mutation and Elitist Propagation have been designed based on the concept of increasing the dynamic diversity of the population. The experimental results in PCB and TSP instances show that the proposed approach is very promising and it contains the ability of local and global searching. The experimental results show ESMA can further improve the performance of GA by searching the solution space with more promising results.

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

  • Ahmadi J., Grotzinger S., Johnson D. (1988) Component allocation and partitioning for a dual delivery placement machine. Operations Research 36: 176–191

    Article  Google Scholar 

  • Ahmadi R. H., Mamer J. W. (1999) Routing heuristics for automated pick and place machines. European Journal of Operational Research 117: 533–552

    Article  Google Scholar 

  • Altinkemer K., Kazaz B., Koksalan M., Moskowitz H. (2000) Optimization of printed circuit board manufacturing: Integrated modeling and algorithms. European Journal of Operational Research 124: 409–421

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Bäck T., Fogel D. B., Michalewicz Z. (1997) Handbook of evolutionary computation. IOP Publishing Ltd and Oxford University Press, Oxford

    Book  Google Scholar 

  • Bossert W., Pattanaik P. K., Xu Y. (2003) Similarity of options and the measurement of diversity. Journal of Theoretical Politics 15: 405–421

    Google Scholar 

  • Chang D. S., Kuo Y. C., Chen T. Y. (2008) Productivity measurement of the manufacturing process for outsourcing decisions: The case of a Taiwanese printed circuit board manufacturer. International Journal of Production Research 46(24): 6981–6995

    Article  Google Scholar 

  • Chang, P. C., Huang, W. H., Liu, J. Y. C., Chen, C., & Ting, C. J. (2008a). Dynamic diversity control by injecting artificial chromosomes for solving TSP problems. In 2008 IEEE congress on evolutionary computation (CEC 2008), Hong Kong (pp. 542–549).

  • Chang, P. C., Huang, W. H., Ting, C. J., & Fan, C. Y. (2008b). Dynamic diversity control in genetic algorithm for extended exploration of solution space in multi-objective TSP. In Innovative computing information and control, 2008. ICICIC ‘08. 3rd International conference, Dalian (pp. 461–464).

  • Chang P. C., Hsieh J. C., Chen S. H., Lin J. L., Huang W. H. (2009) Artificial chromosomes embedded in genetic algorithm for a chip resistor scheduling problem in minimizing the makespan. Expert Systems with Applications 36((3)Part 2): 7135–7141

    Article  Google Scholar 

  • Chang P. C., Chen S. H. (2009) The development of a sub-population genetic algorithm II (SPGAII) for the multi-objective combinatorial problems. Applied Soft Computing Journal 9(1): 173–181

    Article  Google Scholar 

  • Chang P. C., Liu C. H., Lai Robert K. (2008) A fuzzy case-based reasoning model for sales forecasting in print circuit board industries. Expert Systems with Applications 34(3): 2049–2058

    Article  Google Scholar 

  • Chang P. C., Hsieh J. C., Wang C. Y. (2007) Adaptive multi-objective genetic algorithms for scheduling to drilling operation of printed circuit board industry. Applied Soft Computing Journal 7(3): 800–806

    Article  Google Scholar 

  • Chang Pei-Chann, Hsieh J. C., Liao T. Warren (2005) Evolving fuzzy rules for due-date assignment problem in semiconductor manufacturing factory. Journal of Intelligent Manufacturing 16(5): 549–557

    Article  Google Scholar 

  • Chun J. S., Jung H. K., Hahn S. Y. (1998) A study on comparison of optimization performances between immune algorithm and other heuristic algorithms. IEEE Transactions on Magnetics 34(5): 2972–2975

    Article  Google Scholar 

  • De Souza R., Lijun W. (1995) Intelligent optimization of component onsertion in multi-head concurrent operation PCB machines. Journal of Intelligent Manufacturing 6(4): 235–243

    Article  Google Scholar 

  • Duman E., Or I. (2004) Precedence constrained TSP arising in printed circuit board assembly. International Journal of Production Research 42(1): 67–78

    Article  Google Scholar 

  • Eshelman L. I. (1991) The CHC adaptive search algorithm: How to have safe search when engaging in nontraditional genetic recombination. In: Rawlins G. J. E. (ed.) Foundations of genetic algorithm l. Morgan Kanfmann, San Mateo, CA, pp 265–283

    Google Scholar 

  • Flood M. M. (1956) The traveling-salesman problem. Operations Research 4: 61–75

    Article  Google Scholar 

  • Fonseca, C. M., & Fleming, P. J. (1995). Multi-objective genetic algorithms made easy: Selection, sharing and mating restriction. In Proceedings of the first international conference on generic algorithms in engineering systems: Innovations and applications, Sheffield, UK (pp. 45–52).

  • Francis R. L., Hamacher H. W., Lee C. Y., Yeralan S. (1994) Finding placement sequences and bin locations for Cartesian robots. IIE Transactions 26: 47–59

    Article  Google Scholar 

  • Fu H. P., Su C. T. (2000) A comparison of search techniques for minimizing assembly time in Printed Wiring Assembly. International Journal of Production Economics 63: 83–98

    Article  Google Scholar 

  • Gen M., Cheng R. (1997) Genetic algorithms and engineering design. Wiley, New York

    Google Scholar 

  • Goldberg, D. E., & Richardson, J. (1987). Genetic algorithms with sharing for multimodal function optimization. In Genetic algorithms and their applications (ICGA’87) (pp. 41–49).

  • Grötschel, M. (2009). The travelling salesman problem and its applications. Institute of Mathematics, Technische Universität Berlin. Available from: http://www.zib.de/groetschel/index.html.

  • Gutin G., Punnen A. P. (2004) The traveling salesman problem and its variations (combinatorial optimization). Springer, New York

    Book  Google Scholar 

  • Ho W., Ji P. (2004) A hybrid genetic algorithm for component sequencing and feeder arrangement. Journal of Intelligent Manufacturing 15(3): 307–315

    Article  Google Scholar 

  • Ho W., Ji P. (2009) An integrated scheduling problem of PCB components on sequential pick-and-place machines: Mathematical models and heuristic solutions. Expert Systems with Applications 1(36): 7002–7010

    Article  Google Scholar 

  • Hop N. V. (2003) Board sequencing and component loading problem for a single machine in PCB assembly planning. International Journal of Production Research 41(18): 4299–4315

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Larrañaga P., Kuijpers C. M. H., Murga R. H., Inza I., Dizdarevic S. (1999) Genetic algorithms for the travelling salesman problem: A review of representations and operators. Artificial Intelligence Review 13(2): 129–170

    Article  Google Scholar 

  • Mori, N. Yoshida, J., Tamaki, H. Kita, H., & Nishikawa, Y. (1995). A thermo-dynamical selection rule for the genetic algorithm. In Proceedings of the second IEEE international conference on evolutionary computation, Perth, WA (pp. 188–192).

  • Sanchez J. M., Priest J. W. (1991) Optimal component-insertion sequenceplanning methodology for the semiautomatic assembly of printed circuit boards. Journal of Intelligent Manufacturing 2(3): 177–187

    Article  Google Scholar 

  • Shimodaira, H. (1996). A new genetic algorithm using large mutation rates and population-elitist selection (GALME). In Proceedings of the eighth IEEE international conference on tools with artificial intelligence, Toulouse, France (pp. 25–32).

  • Shimodaira, H. (1997). DCGA: A diversity control oriented genetic algorithm. In Proceedings of the second international conference on genetic algorithms in engineering systems: Innovations and applications, Glasgow, UK (pp. 444–449).

  • Shimodaira, H. (2001). A diversity-control-oriented genetic algorithm (DCGA): Performance in function optimization. In The 2001 congress on evolutionary computation, Seoul, Korea (vol. 1, pp. 44–51).

  • Tsai J. T., Ho W. H., Liu T. K., Chou J. H. (2007) Improved immune algorithm for global numerical optimization and job-shop scheduling problems. Applied Mathematics and Computation 194: 406–424

    Article  Google Scholar 

  • Tucker, A., & Flood, M. (1984). Seeley G. Mudd manuscript. Library web at the URL: http://www.princeton.edu/mudd/math, 11.

  • Turkcan A., Akturk M. S. (2003) A problem space genetic algorithm in multiobjective optimization. Journal of Intelligent Manufacturing 14(3–4): 363–378

    Article  Google Scholar 

  • Ursem, R. K., Angeline, P. J., Michalewicz, Z., Schoenauer, M., Yao, X., & Zalzala, A. (1999). Multinational evolutionary algorithms. In Proceedings of the congress of evolutionary computation (CEC-99) (vol. 3, pp. 1633–1640).

  • Wang W., Nelson P. C., Tirpak T. M. (1999) Optimization of high-speed multistation SMT placement machines using evolutionary algorithms. IEEE Transactions on Electronics Packaging Manufacturing 22(2): 137–146

    Article  Google Scholar 

  • Whitley, D. (1989). The GENITOR algorithm and selection pressure: Why rank-based allocation of reproduction trials is best. In Proceedings of the third international conference on genetic algorithms (pp. 116–121).

  • Yilmaz I. O., Grunow M., Gunther H. O. (2007) Development of group setup strategies for makespan minimisation in PCB assembly. International Journal of Production Research 45(4): 871–897

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Management, Yuan Ze University, Taoyuan, 32026, Taiwan, ROC

    Pei-Chann Chang

  2. Department of Industrial Engineering and Management, Yuan Ze University, Taoyuan, 32003, Taiwan, ROC

    Wei-Hsiu Huang & Ching-Jung Ting

Authors
  1. Pei-Chann Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wei-Hsiu Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ching-Jung Ting
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Pei-Chann Chang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chang, PC., Huang, WH. & Ting, CJ. Developing a varietal GA with ESMA strategy for solving the pick and place problem in printed circuit board assembly line. J Intell Manuf 23, 1589–1602 (2012). https://doi.org/10.1007/s10845-010-0461-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10845-010-0461-9

Keywords

Search

Navigation