Abstract
Optimization of cutting parameters in machining operations is a complex task requiring extensive knowledge and experience to reach the maximum potential for cost reductions in manufacturing. Through the work presented in this paper a cutting parameters optimization algorithm for roughing and finishing turning has been realized. The proposed optimization algorithm is based on a combination of linear search and binary search methods, heaving as objective criterion the minimization of the machining time. Examples for roughing and finishing turning have been presented to illustrate the application of the proposed algorithm and analyse the results.
Highlights
Realizing a product with the required shape, size and properties depends on design and on the choice of an appropriate machining process
Optimization of cutting parameters in machining operations has been an area of high interest for many researchers in the frame of Computer Aided Process Planning (CAPP) development which presented several approaches based on traditional and non-traditional optimization algorithms [5,6,7,8,9,10]
The selected parameter will be reduced according to a linear variation, the constrains will be checked again and the algorithm will continue until the constrains are satisfied
Summary
Realizing a product with the required shape, size and properties depends on design and on the choice of an appropriate machining process. Even though the selection of cutting tools and the calculation of cutting parameters is only a sub-function of the manufacturing process planning, it is a complex task requiring extensive knowledge and considerable experience affecting many other production parameters [1,2,3,4]. Due to CAPP importance in manufacturing a large amount of research in this area have been conducted for actual implementations in industry. Optimization of cutting parameters in machining operations has been an area of high interest for many researchers in the frame of CAPP development which presented several approaches based on traditional and non-traditional optimization algorithms [5,6,7,8,9,10]
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have