Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Lamarckism and mechanism synthesis: approaching constrained optimization with ideas from biology (1109.6717v1)

Published 30 Sep 2011 in math.OC and cs.NE

Abstract: Nonlinear constrained optimization problems are encountered in many scientific fields. To utilize the huge calculation power of current computers, many mathematic models are also rebuilt as optimization problems. Most of them have constrained conditions which need to be handled. Borrowing biological concepts, a study is accomplished for dealing with the constraints in the synthesis of a four-bar mechanism. Biologically regarding the constrained condition as a form of selection for characteristics of a population, four new algorithms are proposed, and a new explanation is given for the penalty method. Using these algorithms, three cases are tested in differential-evolution based programs. Better, or comparable, results show that the presented algorithms and methodology may become common means for constraint handling in optimization problems.

Summary

We haven't generated a summary for this paper yet.