Optimal synthesis of four-bar linkage path generation through evolutionary computation with a novel constraint handling technique

Sleesongsom, Suwin; Bureerat, Sujin

doi:10.1155/2018/5462563

Optimal synthesis of four-bar linkage path generation through evolutionary computation with a novel constraint handling technique

Author(s)

Sleesongsom, Suwin

Bureerat, Sujin

Date Issued

January 1, 2018

Type

Article

DOI

10.1155/2018/5462563

Abstract

This paper presents a novel constraint handling technique for optimum path generation of four-bar linkages using evolutionary algorithms (EAs). Usually, the design problem is assigned to minimize the error between desired and obtained coupler curves with penalty constraints. It is found that the currently used constraint handling technique is rather inefficient. In this work, we propose a new technique, termed a path repairing technique, to deal with the constraints for both input crank rotation and Grashof criterion. Three traditional path generation test problems are used to test the proposed technique. Metaheuristic algorithms, namely, artificial bee colony optimization (ABC), adaptive differential evolution with optional external archive (JADE), population-based incremental learning (PBIL), teaching-learning-based optimization (TLBO), real-code ant colony optimization (ACOR), a grey wolf optimizer (GWO), and a sine cosine algorithm (SCA), are applied for finding the optimum solutions. The results show that new technique is a superior constraint handling technique while TLBO is the best method for synthesizing four-bar linkages.

Citation

Computational Intelligence and Neuroscience, 2018, 2018