MINLP models for dimensional synthesis of planar four-bar linkages
by Andrea Piga Carboni; Laio Oriel Seman; Eduardo Camponogara
International Journal of Mathematical Modelling and Numerical Optimisation (IJMMNO), Vol. 10, No. 4, 2020

Abstract: Most works on mechanism synthesis consider models that employ trigonometric functions and rely on derivative-free optimisation, such as bio-inspired and hybrid heuristics. Derivative-free strategies have the advantage of being applied directly to explore the design space. However, such strategies require tuning to achieve satisfactory results and do not provide certificates of solution quality. To this end, this work presents two alternative models: the first one consists of a trigonometric function-based model; while the second relies solely on natural coordinates, in which the nonlinear terms are bilinear. Both models result in mixed-integer nonlinear programming (MINLP) formulations. Mechanism constraints are conveniently expressed in this formulation, including Grashof's condition, prescribed timing, and increasing and decreasing angle sequence. In standard numerical cases of four-bar linkage path synthesis, global and local MINLP solvers yielded provably optimal designs in some cases and in others they outperformed works from the literature.

Online publication date: Wed, 28-Oct-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematical Modelling and Numerical Optimisation (IJMMNO):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com