Characterization of geometrical parameters of plastic bottle shredder blade utilizing a two-step optimization method

In this paper, a numerical and experimental investigation of geometrical parameters of the blade for plastic bottle shredder was performed based on the Taguchi method in combination with a response surface method (RSM). Nowadays, plastic waste has become a major threat to the environment. Shredding,...

Full description

Bibliographic Details
Main Authors: Trieu Khoa Nguyen, Minh Quang Chau, The-Can Do, Anh-Duc Pham
Format: Article
Language:English
Published: Polish Academy of Sciences 2021-08-01
Series:Archive of Mechanical Engineering
Subjects:
Online Access:https://journals.pan.pl/Content/120532/PDF/AME_2021_138392.pdf
Description
Summary:In this paper, a numerical and experimental investigation of geometrical parameters of the blade for plastic bottle shredder was performed based on the Taguchi method in combination with a response surface method (RSM). Nowadays, plastic waste has become a major threat to the environment. Shredding, in which plastic waste is shredded into small bits, ready for transportation and further processing, is a crucial step in plastic recycling. Although many studies on plastic shredders were performed, there was still a need for more researches on the optimization of shredder blades. Hence, a numerical analysis was carried out to study the influences of the relevant geometrical parameters. Next, a two-step optimization process combining the Taguchi method and the RSM was utilized to define optimal parameters. The simulation results clearly confirmed that the current technique can triumph over the limitation of the Taguchi method, originated from a discrete optimization nature. The optimal blade was then fabricated and experimented, showing lower wear via measurement by an ICamScope® microscope. Hence, it can be clearly inferred from this investigation that the current optimization method is a simple, sufficient tool to be applied in such a traditional process without using any complicated algorithms or expensive software.
ISSN:2300-1895