How to solve a constrained binary multi-objective optimization problem through genetic algorithm?
조회 수: 9 (최근 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!