Are there any way to speed up the nonlcon satisfying for GA with intcon ? thanks
1 view (last 30 days)
Show older comments
Hello, I have an optimization problem with few hundreds of variables, half of them as integers, I have nonlinear constraints, but I couldn't use fmincon or patternsearch as I have intcon, so I stuck with GA,
the nonlinear constraints takes a lot of time and generations to be satisfied (200 to 300 generations, and increases as the population size increases) giving decreasing non realistic values for fitness function, and then the fitness function value jumps to the realistic range and the minimization process takes place,
my question is: Are there any way to speed up the nonlcon satisfying ? thanks
0 Comments
Accepted Answer
Matt J
on 19 Apr 2014
Edited: Matt J
on 19 Apr 2014
If you have a semi-accurate idea of where the solution is supposed to lie, you could set the Initial Population Range so that the initial population is bounded to some region that you think is a smart initial region to search,
If you are very confident in those bounds, you should, of course, add them as constraints using the LB,UB input arguments to ga().
More Answers (0)
See Also
Categories
Find more on Surrogate Optimization in Help Center and File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!