Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
