A comparison of numerical iteration based algorithms in blank optimization

Different approaches for blank shape optimization are reported in the literature. These include numerical iteration based algorithms, slip line field and inverse approach methods and so on. Some iteration based algorithms are reported in the literature. However a comparison of these methods can provide a useful guide regarding their efficiency. In this paper, a new iteration based method for blank shape optimization is presented. Also two other iteration based algorithms reported in the literature are described briefly. The optimum blank shapes for some case studies are obtained using each algorithm and the results are compared. The results indicate that the algorithm developed in the current work is more efficient.