How to solve a constrained binary multi-objective optimization problem through genetic algorithm?
4 ビュー (過去 30 日間)
古いコメントを表示
Dear All,
I would like to solve a multi-objective problem that has both equality and inequality constraints and where the decision variables are binary. I would like to find the Pareto front with the help of a genetic algorithm.
The solver gamultiobj handles such binary multi-objective problems but ignores the constraints. Alternatively, I tried defining the variables' bounds to [0,1] and set all variables as integers but failed in that.
Does anybody know how to deal with this issue? Any other toolbox for MATLAB that is capable is also highly appreciated. Thank you!
1 件のコメント
Laila Qaisi
2017 年 3 月 19 日
If you have written the code would you please share it as iam trying to find the same. Thanks!
採用された回答
Walter Roberson
2016 年 12 月 28 日
You need to not tell it that you want integer constraints. Instead, you need to supply your own custom mutation and crossover and population files that happen to never generate non-binary values for those positions.
2 件のコメント
Walter Roberson
2017 年 1 月 31 日
Just pass A, b, Aeq, beq matrices as usual. Those are evaluated by plain multiplication, which does not need to know that the x values are restricted to integer since it is just multiplication and comparison.
その他の回答 (1 件)
Laila Qaisi
2017 年 3 月 19 日
If you have written the code would you please share it as iam trying to find the same. Thanks!
参考
カテゴリ
Help Center および File Exchange で Multiobjective Optimization についてさらに検索
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!