Dynamic balancing of the cleaning unit used in agricultural thresher using a non-dominated sorting Jaya algorithm. Issue 5 (3rd January 2020)

• Record Type: Journal Article
• Authors: Singh, Prem; Chaudhary, Himanshu
• Is Part Of: Engineering computations. Volume 37:Issue 5(2020)
• Page Start: 1849
• Page End: 1864
• Publication Date: 2020-01-03
• Subjects: Multi-objective optimisation -- Jaya algorithm -- Shaking force and shaking moment -- Thresher machine -- Pareto set; Computer-aided engineering -- Periodicals; Computer graphics -- Periodicals; 620.00285
• DOI: 10.1108/EC-03-2019-0087
• Languages: English
• ISSNs: 0264-4401

Abstract

Abstract : Purpose: This paper aims to propose a dynamically balanced mechanism for cleaning unit used in agricultural thresher machine using a dynamically equivalent system of point masses. Design/methodology/approach: The cleaning unit works on crank-rocker Grashof mechanism. This mechanism can be balanced by optimizing the inertial properties of each link. These properties are defined by the dynamic equivalent system of point masses. Parameters of these point masses define the shaking forces and moments. Hence, the multi-objective optimization problem with minimization of shaking forces and shaking moments is formulated by considering the point mass parameters as the design variables. The formulated optimization problem is solved using a posteriori approach-based algorithm i.e. the non-dominated sorting Jaya algorithm (NSJAYA) and a priori approach-based algorithms i.e. Jaya algorithm and genetic algorithm (GA) under suitable design constraints. Findings: The mass, center of mass and inertias of each link are calculated using optimum design variables. These optimum parameters improve the dynamic performance of the cleaning unit. The optimal Pareto set for the balancing problem is measured and outlined in this paper. The designer can choose any solution from the set and balance any real planar mechanism. Originality/value: The efficiency of the proposed approach is tested through the existing cleaning mechanism of the thresher machine. It is found that the NSJAYA is computationally more efficient than the GA and Jaya algorithm. ADAMS software is used for the simulation of the mechanism.