Skip to main content

An Efficient Hybrid Approach of Finite Element Method, Artificial Neural Network-Based Multiobjective Genetic Algorithm for Computational Optimization of a Linear Compliant Mechanism of Nanoindentation Tester


Ngoc Le Chau, Thanh-Phong Dao*, and Van Thanh Tien Nguyen

Source title: 
Mathematical Problems in Engineering, Article ID 7070868, 19 pages, 2018 (ISI)
Academic year of acceptance: 

This paper proposes a new evolutionary multiobjective optimization technique for a linear compliant mechanism of nanoindentation tester. The mechanism design is inspired by the elastic deformation of flexure hinge. To improve overall static performances, a multiobjective optimization design was carried out. An efficient hybrid optimization approach of central composite design (CDD), finite element method (FEM), artificial neural network (ANN), and multiobjective genetic algorithm (MOGA) is developed to solve the optimization problem. In this procedure, the CDD is used to lay out the experimental data. The FEM is developed to retrieve the quality performances. And then, the ANN is developed as black box to call the pseudo-objective functions. Unlike previous studies on multiobjective evolutionary algorithms, most of which generating only one Pareto-optimal solution, this proposed approach can generate more than three Pareto-optimal solutions. Based on the user’s real-work problem, one of the best optimal solutions is chosen. The results showed that the optimal results were found at the displacement of 330.68 μm, stress of 140.65 MPa, and safety factor of 3.6. The statistical analysis is conducted to investigate the behavior of the MOGA. The sensitivity analysis was carried out to determine the significant contribution of each factor. The results revealed that the lengths and thickness almost significantly affect both responses. It confirms that the proposed hybrid optimization approach gains high robustness and effectiveness with flexible decision maker rules to solve complex optimization engineering problems.