{"action":"created","issue":{"url":"https://api.github.com/repos/Shark-ML/Shark/issues/65","repository_url":"https://api.github.com/repos/Shark-ML/Shark","labels_url":"https://api.github.com/repos/Shark-ML/Shark/issues/65/labels{/name}","comments_url":"https://api.github.com/repos/Shark-ML/Shark/issues/65/comments","events_url":"https://api.github.com/repos/Shark-ML/Shark/issues/65/events","html_url":"https://github.com/Shark-ML/Shark/pull/65","id":144514918,"number":65,"title":"Non dominated sorting","user":{"login":"TGlas","id":4291427,"avatar_url":"https://avatars.githubusercontent.com/u/4291427?v=3","gravatar_id":"","url":"https://api.github.com/users/TGlas","html_url":"https://github.com/TGlas","followers_url":"https://api.github.com/users/TGlas/followers","following_url":"https://api.github.com/users/TGlas/following{/other_user}","gists_url":"https://api.github.com/users/TGlas/gists{/gist_id}","starred_url":"https://api.github.com/users/TGlas/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/TGlas/subscriptions","organizations_url":"https://api.github.com/users/TGlas/orgs","repos_url":"https://api.github.com/users/TGlas/repos","events_url":"https://api.github.com/users/TGlas/events{/privacy}","received_events_url":"https://api.github.com/users/TGlas/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"milestone":null,"comments":6,"created_at":"2016-03-30T09:18:28Z","updated_at":"2016-03-31T10:51:49Z","closed_at":null,"pull_request":{"url":"https://api.github.com/repos/Shark-ML/Shark/pulls/65","html_url":"https://github.com/Shark-ML/Shark/pull/65","diff_url":"https://github.com/Shark-ML/Shark/pull/65.diff","patch_url":"https://github.com/Shark-ML/Shark/pull/65.patch"},"body":"* simplified the Pareto dominance relation\r\n* implemented an alternative non-dominated sorting algorithm, suitable for large populations and for low dimensions (few objectives)\r\n* added an abstraction for switching between non-dominated sorting algorithms\r\n* improved the non-dominated sorting unit test\r\n"},"comment":{"url":"https://api.github.com/repos/Shark-ML/Shark/issues/comments/203876481","html_url":"https://github.com/Shark-ML/Shark/pull/65#issuecomment-203876481","issue_url":"https://api.github.com/repos/Shark-ML/Shark/issues/65","id":203876481,"user":{"login":"Ulfgard","id":15045382,"avatar_url":"https://avatars.githubusercontent.com/u/15045382?v=3","gravatar_id":"","url":"https://api.github.com/users/Ulfgard","html_url":"https://github.com/Ulfgard","followers_url":"https://api.github.com/users/Ulfgard/followers","following_url":"https://api.github.com/users/Ulfgard/following{/other_user}","gists_url":"https://api.github.com/users/Ulfgard/gists{/gist_id}","starred_url":"https://api.github.com/users/Ulfgard/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/Ulfgard/subscriptions","organizations_url":"https://api.github.com/users/Ulfgard/orgs","repos_url":"https://api.github.com/users/Ulfgard/repos","events_url":"https://api.github.com/users/Ulfgard/events{/privacy}","received_events_url":"https://api.github.com/users/Ulfgard/received_events","type":"User","site_admin":false},"created_at":"2016-03-31T10:51:49Z","updated_at":"2016-03-31T10:51:49Z","body":"Hi,\r\n\r\nThinking about it, I also do not like that the concept of pareto fronts is tied to individuals. Maybe we should change this as well. The easiest solution would be to take the range of ranks as a second argument.\r\n\r\nThen calling it could be something like:\r\n\r\nsorter(penalizedFitness(pop), ranks(pop));\r\n"}}