Genetic Algorithm : Lower and Upper Bounds
23 次查看(过去 30 天)
显示 更早的评论
How to choose the VarMin (Lower Bound of decision Variables) and VarMax (Upper Bound of Variables) of any problem when using the genetic algorithm optimization ? What its effect on improvement ?
0 个评论
采纳的回答
Stephan
2018-7-20
编辑:Stephan
2018-7-20
Hi,
the handling of bounds in the case of the use of ga is very well described here:
Essentially, ga ensures that the initial population complies with the restrictions on bounds. Another point is compliance with the restrictions over the term of the algorithm, if certain conditions are met.
To define them use for example:
lb = [-1 0 0 -inf];
ub = [Inf 1 1 0];
In the example above you have 4 decision variables x1...x4 which solutions are in the defined ranges of lb (1)...ub (1) for x1 and so on.
Determining meaningful bounds depends on the problem and requires insight into the problem. Possible limitations may arise from physical or economic considerations. if you have normalized decision variables, they will be between 0...1. You can not produce -5 cars, the optimal power can not exceed the maximum power that is possible with the used drive...
So the effect on improvement by using bounds is getting feasible solutions to a problem on the one hand. On the other hand it is reducing the search space, which helps the solver finding good solutions faster.
Best regards
Stephan
0 个评论
更多回答(2 个)
Prathamesh
2023-11-17
perform inveres kinematics to formulate the equation oe x, y,z co ordinate of SCARA robot
l1=150mm, l2=225 mm,l3=175mm, l4=10mm
x=-25mm,y-270mm,z=150mm
bounds =-132<X1<132, -141<X2<141, 0<d<-50
0 个评论
另请参阅
类别
在 Help Center 和 File Exchange 中查找有关 Genetic Algorithm 的更多信息
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!