Dependency of Order of Objective Functions in Multiobjective GA
조회 수: 3 (최근 30일)
이전 댓글 표시
Hello, I wonder why the Pareto optimal solutions change with the order of non-linear objective functions. Because, I actually anticipated to reach the same optimal solutions. e.g. fitnessfcn=@(x)[x(1)^2/4+x(2)^2/4,(x(1)*(1-x(2))+10)]; One of them objective is nonlinear and the other one is linear; if I try to solve fitnessfcn=@(x)[x(1)^2/4+x(2)^2/4,10^6*(x(1)*(1-x(2))+10)];I found same optimal points. However, if I solved fitnessfcn=@(x)[10^6*(x(1)^2/4+x(2)^2/4),(x(1)*(1-x(2))+10)]; the pareto optimal solutions are changed and I have different optimal points. What is the reason of this situation? Thank you for your attention.
댓글 수: 0
답변 (1개)
Mario CASTRO GAMA
2018년 1월 18일
I do not understand the question.
1. If you divide by 10^6 the criteria (rescaling) it will handle the optimization in a much more efficient way.
2. Probably if you increase the decimal format (long g) it will be easier to see on screen.
3. Now, if you run GA two different times, the random seed will be different and the results will be different. In theory, after a large number of generations, the Pareto front will converge to a similar shape, but this depends on the problem.
Hope this helps
참고 항목
카테고리
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!