Biologically Inspired Optimization Algorithms for Flexible Process Planning

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.