Biologically Inspired Optimization Algorithms for Flexible Process Planning

Conference paper
Part of the Lecture Notes in Mechanical Engineering book series (LNME)

Abstract

Flexible process planning belongs to one of the most essential functions of the modern manufacturing system. The aim of this function is to define detailed methods for manufacturing of a part in an economic and competitive manner starting from the initial phase (drawing of the target part) up to the final one (the desired shape of the target part). A variety of alternative manufacturing resources (machine tools, cutting tools, tool access directions, etc.) causes flexible process planning problem to be strongly NP-hard (non deterministic polynomial) in terms of combinatorial optimization. This paper presents a comparative analysis of biologically inspired optimization algorithms which are used to solve this problem. Four different optimization algorithms, namely genetic algorithms (GA), simulated annealing (SA), chaotic particle swarm optimization algorithm (cPSO), and ant lion optimization algorithm (ALO) are proposed and implemented in Matlab environment. Optimal process plans are obtained by multi-objective optimization of production time and production cost. The experimental verification is carried out by using real-world examples. The experimental results indicate that all aforementioned algorithms can be successfully used for optimization of flexible process plans, while the best performance shows ALO algorithm.

Keywords

Flexible process planning Genetic algorithms Simulated annealing Chaotic particle swarm optimization algorithm Ant lion optimization algorithm 

Notes

Acknowledgements

This paper is part of the project “An innovative, ecologically based approach to the implementation of intelligent manufacturing systems for the production of sheet metal parts”. The research in this paper was supported by the Ministry of Education, Science and Technological Development of the Serbian Government, Grant TR-35004 (2011–2017).

References

  1. 1.
    Guo YW, Mileham AR, Owen GW, Li WD (2006) Operation sequencing optimization using a particle swarm optimization approach. Proc Inst Mech Eng Part B J Eng Manuf 220(12):1945–1958CrossRefGoogle Scholar
  2. 2.
    Huang W, Hu Y, Cai L (2012) An effective hybrid graph and genetic algorithm approach to process planning optimization for prismatic parts. Int J Adv Manuf Technol 62(9–12):1219–1232CrossRefGoogle Scholar
  3. 3.
    Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proceedings of the IEEE international conference on neural network, vol 4. Perth, pp 1942–1948Google Scholar
  4. 4.
    Li XY, Shao XY, Gao L (2008) Optimization of flexible process planning by genetic programming. Int J Adv Manuf Technol 38(1–2):143–153CrossRefGoogle Scholar
  5. 5.
    Liu XJ, Yi H, Ni ZH (2013) Application of ant colony optimization algorithm in process planning optimization. J Intell Manuf 24(1):1–3CrossRefGoogle Scholar
  6. 6.
    Lv S, Qiao L (2013) A cross-entropy-based approach for the optimization of flexible process planning. Int J Adv Manuf Technol 68(9–12):2099–2110CrossRefGoogle Scholar
  7. 7.
    Mirjalili S (2015) The ant lion optimizer. Adv Eng Softw 83:80–98CrossRefGoogle Scholar
  8. 8.
    Nallakumarasamy G, Srinivasan PS, Raja KV, Malayalamurthi R (2011) Optimization of operation sequencing in CAPP using simulated annealing technique (SAT). Int J Adv Manuf Technol 54(5–8):721–728CrossRefGoogle Scholar
  9. 9.
    Petrović M (2016) Design of intelligent manufacturing systems by using artificial intelligence. University of Belgrade—Faculty of Mechanical Engineering (Doctoral Dissertation), Serbian, pp 1–319Google Scholar
  10. 10.
    Petrović M, Mitić M, Vuković N, Miljković Z (2016) Chaotic particle swarm optimization algorithm for flexible process planning. Int J Adv Manuf Technol 85(9–12):2535–2555CrossRefGoogle Scholar
  11. 11.
    Petrović M, Vuković N, Mitić M, Miljković Z (2016) Integration of process planning and scheduling using chaotic particle swarm optimization algorithm. Expert Syst Appl 64:569–588CrossRefGoogle Scholar
  12. 12.
    Shao X, Li X, Gao L, Zhang C (2009) Integration of process planning and scheduling—a modified genetic algorithm-based approach. Comput Oper Res 36(6):2082–2096CrossRefMATHGoogle Scholar
  13. 13.
    Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1(1):67–82CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Faculty of Mechanical Engineering, Production Engineering DepartmentUniversity of BelgradeBelgrade 35Serbia

Personalised recommendations