Skip to main content

Improved Genetic Programming for Process Planning

  • Chapter
  • First Online:
  • 661 Accesses

Part of the book series: Engineering Applications of Computational Methods ((EACM,volume 2))

Abstract

The traditional manufacturing system research literature generally assumed that there was only one feasible process plan for each job. This implied that there was no flexibility considered in the process plan. But, in the modern manufacturing system, most jobs may have a large number of flexible process plans. So, flexible process plans selection in a manufacturing environment has become a crucial problem. In this chapter, a new method using an evolutionary algorithm, called Genetic Programming (GP), is presented to optimize flexible process planning. The flexible process plans and the mathematical model of flexible process planning have been described, and a network representation is adopted to describe the flexibility of process plans. To satisfy GP, it is very important to convert the network to a tree. The efficient genetic representations and operator schemes also have been considered. Case studies have been used to test the algorithm, and the comparison has been made for this approach and Genetic Algorithm (GA), which is another popular evolutionary approach to indicate the adaptability and superiority of the GP-based approach. The experimental results show that the proposed method is promising and very effective in the optimization research of flexible process planning.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Sormaz D, Khoshnevis B (2003) Generation of alternative process plans in integrated manufacturing systems. J Intell Manuf 14:509–526

    Article  Google Scholar 

  2. Kusiak A, Finke G (1988) Selection of process plans in automated manufacturing systems. IEEE J Robot Autom 4(4):397–402

    Article  Google Scholar 

  3. Bhaskaran K (1990) Process plan selection. Int J Prod Res 28(8):1527–1539

    Article  Google Scholar 

  4. Lee KH, Junq MY (1994) Petri net application in flexible process planning. Comput Ind Eng 27:505–508

    Article  Google Scholar 

  5. Kamal R, Jagath S (2003) Processing plan selection algorithms for a cooperative intelligent image analysis system. In: Proceedings of the International Conference on Imaging Science, Systems and Technology, pp 576–582

    Google Scholar 

  6. Seo Y, Egbelu PJ (1996) Process plan selection based on product mix and production volume. Int J Prod Res 34(9):2369–2655

    Article  Google Scholar 

  7. Usher JM, Bowden RO (1996) Application of genetic algorithms to operation sequencing for use in computer-aided process planning. Comput Ind Eng 30(4):999–1013

    Article  Google Scholar 

  8. Tiwari MK, Tiwari SK, Roy D, Vidyarthi NK, Kameshewaran S (1999) A genetic algorithm based approach to solve process plan selection problems. IEEE Proc Sec Int Conf Intell Proc Manufac Mat 1:281–284

    Google Scholar 

  9. Rocha J, Ramos C, Vale Z (1999) Process planning using a genetic algorithm approach. In: IEEE Proceeding of International Symposium on Assembly and Task Planning, pp 338–343

    Google Scholar 

  10. Dereli T, Filiz HI (1999) Optimisation of process planning functions by genetic algorithms. Comput Ind Eng 36:281–308

    Article  Google Scholar 

  11. Moriarty DE, Miikkulainen R (1997) Forming neural networks through efficient and adaptive coevolution. Evol Comput 5:372–399

    Article  Google Scholar 

  12. Kramer MD, Zhang D (2000) GAPS: a Genetic Programming System. In: Proceedings of the 24th Annual International Computer Software and Application Conference (IEEE COMP-SAC), pp 614–619

    Google Scholar 

  13. Koza JR (1992) Genetic programming: on the programming of computers by means of natural selection and genetics. MIT Press, Cambridge MA

    MATH  Google Scholar 

  14. Dimopoulos C, Zalzala AMS (2001) Investigating the use of genetic programming for a classic one-machine scheduling problem. Adv Eng Softw 32:489–498

    Article  Google Scholar 

  15. Garces PJ, Schoenefeld DA, Wainwright RL (1996) Solving facility layout problems using genetic programming. Proceed-ings of the 1st Annual Conference on Genetic Programming 11 (4):182–190

    Google Scholar 

  16. McKay BM, Willis MJ, Hiden HG, Montague GA, Barton GW (1996) Identification of industrial processes using genetic programming. Procee Confer Ident Eng Sys 1996 11 (5):510–519

    Google Scholar 

  17. Hutchinson GK, Flughoeft KAP (1994) Flexible process plans: their value in flexible automation systems. Int J Prod Res 32(3):707–719

    Article  Google Scholar 

  18. Saygin C, Kilic SE (1999) Integrating flexible process plans with scheduling in flexible manufacturing systems. Int J Adv Manuf Technol 15:268–280

    Article  Google Scholar 

  19. Benjaafar S, Ramakrishnan R (1996) Modeling, measurement and evaluation of sequencing flexibility in manufacturing systems. Int J Prod Res 34:1195–1220

    Article  Google Scholar 

  20. Kim YK, Park K, Ko J (2003) A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling. Comput Oper Res 30:1151–1171

    Article  MathSciNet  Google Scholar 

  21. Lin YJ, Solberg JJ (1991) Effectiveness of flexible routing control. Int J Flex Manuf Syst 3:189–211

    Article  Google Scholar 

  22. Catron AB, Ray SR (1991) ALPS-A language for process specification. Int J Comput Integr Manuf 4:105–113

    Article  Google Scholar 

  23. Ho YC, Moodie CL (1996) Solving cell formation problems in a manufacturing environment with flexible processing and routing capabilities. Int J Prod Res 34:2901–2923

    Article  Google Scholar 

  24. Koza JR (1990) Genetic programming: a paradigm for genetically breeding populations of computer programs to solve problems. Tech Rep STAN-CS-90–1314 Stanford University Computer Science Department

    Google Scholar 

  25. Langdon WB, Qureshi A (1995) Genetic programming—computers using “Natural Selection” to generate programs. Tech Rep RN/95/76, Gower Street, London WCIE 6BT, UK

    Google Scholar 

  26. Banzhaf W, Nordin P (1998) Genetic programming: an introduction. Morgan Kaufmann Publishers Inc, San Francisco CA

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xinyu Li .

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer-Verlag GmbH Germany, part of Springer Nature and Science Press, Beijing

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Li, X., Gao, L. (2020). Improved Genetic Programming for Process Planning. In: Effective Methods for Integrated Process Planning and Scheduling. Engineering Applications of Computational Methods, vol 2. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-55305-3_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-55305-3_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-55303-9

  • Online ISBN: 978-3-662-55305-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics