Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Update NSGA II.py #5

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Update NSGA II.py #5

wants to merge 1 commit into from

Conversation

sasa1232
Copy link

@sasa1232 sasa1232 commented Oct 30, 2018

Hi!
Shouldn't it be like this in the lines 82 and 84:
values1[sorted1[k+1]] - values1[sorted1[k-1]]...
(values2[sorted2[k+1]] - values2[sorted2[k-1]])...
since the values of the same objectives should be used to calculate the difference in the function values of two adjacent solutions??
And thanks for sharing the algo !!

Hi!
Shouldn't it be in the lines 82 and 84:
 values1[sorted1[k+1]] - values1[sorted1[k-1]]...
(values2[sorted2[k+1]] - values2[sorted2[k-1]])...
since the values of the same objectives should be used to calculate the difference in the function values of two adjacent solutions
@pmramy
Copy link

pmramy commented Aug 26, 2019

Hi!
Shouldn't it be like this in the lines 82 and 84:
values1[sorted1[k+1]] - values1[sorted1[k-1]]...
(values2[sorted2[k+1]] - values2[sorted2[k-1]])...
since the values of the same objectives should be used to calculate the difference in the function values of two adjacent solutions??
And thanks for sharing the algo !!

can you write EMOCA ALgorithm ,
please contact me on pm.ramy@hotmail.com

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants