A Comparative Study of Firefly Algorithm and Shuffled Frog-leaping Algorithm for Constrained Free and Manufacturing Optimization Problems

摘要

Manufacturing process problems in industrial systems are currently large and complicated. The effective methods for solving these problems using a finite sequence of instructions can be classified into two groups; optimization and meta-heuristic algorithms. In this paper, a well-known meta-heuristic approach called Firefly Algorithm was used to compare with Shuffled Frog-leaping Algorithm. All algorithms were implemented and analyzed with manufacturing process problems under different conditions, which consist of single, multi-peak and curved ridge optimization. The results from both methods revealed that Firefly Algorithm seemed to be better in terms of the mean and variance of process yields including design points to achieve the final solution.