Simulated Manufacturing Process Improvement via Particle Swarm Optimisation and Firefly Algorithms

Related information of optimal cutting parameters for machining and spring force operations is required for process planning. Numerous nonlinear constrained machining models have been developed with the objective of determining optimal operating conditions. The purpose of this article includes studying two algorithms to test their efficiency in solving several benchmark machining models. Two promising meta- heuristic algorithms for the numerical process improvement are particle swarm optimisation (PSO) and firefly (FFA) algorithms. A brief description of each algorithm is presented along with its pseudocode to facilitate the implementation and use of such algorithms by researchers and practitioners. Benchmark comparisons between the algorithms are presented in terms of processing time, convergence speed, and quality of the results. The experimental results show that FFA is clearly and consistently superior compared to the PSO both with respect to precision as well as robustness of the results including design points to achieve the final solution. Only for simple data sets, the PSO and FFA can obtain the same quality of performance measures. Apart from higher levels of performance measures, FFA is easy to implement and requires hardly any parameter tuning compared to substantial tuning for the PSO.

[1]  Franci Cus,et al.  Optimization of cutting process by GA approach , 2003 .

[2]  Kurt Jörnsten,et al.  Tabu search within a pivot and complement framework , 1994 .

[3]  Timothy J. Lowe,et al.  Tool selection for optimal part production: a Lagrangian relaxation approach , 1995 .

[4]  Peter Müller,et al.  Issues in Bayesian Analysis of Neural Network Models , 1998, Neural Computation.

[5]  Mirko Krivánek,et al.  Simulated Annealing: A Proof of Convergence , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  Kevin Hapeshi,et al.  A Review of Nature-Inspired Algorithms , 2010 .

[7]  Benjamin Yen,et al.  Just-in-time scheduling with machining economics for single-machine turning process , 2000 .

[8]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[9]  M. Sayadi,et al.  A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems , 2010 .

[10]  Bruce Hajek,et al.  A tutorial survey of theory and applications of simulated annealing , 1985, 1985 24th IEEE Conference on Decision and Control.

[11]  Yung-ming Cheng,et al.  Performance studies on six heuristic global optimization methods in the location of critical slip surface , 2007 .

[12]  Jong-Hwan Kim,et al.  Experimental evolutionary programming-based high-precision control , 1997, IEEE Control Systems.

[13]  Rainer Storn,et al.  System design by constraint adaptation and differential evolution , 1999, IEEE Trans. Evol. Comput..

[14]  K. Lee,et al.  A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice , 2005 .