![Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5928/TOC-Subject-Sample-2021-Computer-Science.jpg"})
Abstract
This paper deals with the optimum two-plane balancing of the threshing drum using discrete parameters such as masses and corresponding angular locations on balance planes. To improve the dynamic performance characteristics of the thresher machine, the balancing of the threshing drum becomes an essential task for designers and engineers. Therefore, the optimization problem is formulated to minimize the reaction forces on bearings. The masses and corresponding angular locations on each balancing plane are treated as the design variables. Generally, continuous solutions of mass and corresponding angular position per plane are obtained by the continuous optimization algorithms for balancing. But these solutions are recalculated to the nearest discrete solutions due to a limited set of available standardized mass values and possible available locations. This process increases the balancing cost and time. Therefore, the modified Jaya algorithm is developed to find the optimum discrete parameters for balancing. The proposed approach is investigated through a model of the threshing drum supported on bearings. The computation efficiency of the algorithm is compared with the genetic algorithm (GA) and particle swarm optimization (PSO) algorithm with respect to the number of function evaluations. Adams software and experimental tests are used for validation of the proposed approach.