{"id":42791692,"url":"https://github.com/mbuzdalov/orthant-search","last_synced_at":"2026-01-29T23:38:13.645Z","repository":{"id":32585773,"uuid":"117376181","full_name":"mbuzdalov/orthant-search","owner":"mbuzdalov","description":"Orthant search is \"one code to rule them all\" for many operations in multiobjective evolutionary algorithms.","archived":false,"fork":false,"pushed_at":"2025-02-05T16:40:12.000Z","size":174,"stargazers_count":2,"open_issues_count":0,"forks_count":1,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-02-05T17:39:54.923Z","etag":null,"topics":["evolutionary-computation","large-scale","multiobjective-optimization"],"latest_commit_sha":null,"homepage":null,"language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/mbuzdalov.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2018-01-13T20:33:53.000Z","updated_at":"2025-02-05T16:40:17.000Z","dependencies_parsed_at":"2023-01-14T21:39:51.785Z","dependency_job_id":"50cb086c-134a-4681-8459-0c264d608788","html_url":"https://github.com/mbuzdalov/orthant-search","commit_stats":null,"previous_names":[],"tags_count":1,"template":false,"template_full_name":null,"purl":"pkg:github/mbuzdalov/orthant-search","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mbuzdalov%2Forthant-search","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mbuzdalov%2Forthant-search/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mbuzdalov%2Forthant-search/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mbuzdalov%2Forthant-search/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/mbuzdalov","download_url":"https://codeload.github.com/mbuzdalov/orthant-search/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mbuzdalov%2Forthant-search/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28890640,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-29T21:06:44.224Z","status":"ssl_error","status_checked_at":"2026-01-29T21:06:42.160Z","response_time":59,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["evolutionary-computation","large-scale","multiobjective-optimization"],"created_at":"2026-01-29T23:38:13.586Z","updated_at":"2026-01-29T23:38:13.639Z","avatar_url":"https://github.com/mbuzdalov.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# orthant-search\nOrthant search is \"one code to rule them all\" for many operations in multiobjective evolutionary algorithms.\n\nThis repository accompanies the paper:\n\n*Buzdalov M.* Generalized Offline Orthant Search: One Code for Many Problems in Multiobjective Optimization \n// Proceedings of Genetic and Evolutionary Computation. - 2018. - P. 593-600.\n\nThe following reductions to orthant search are implemented and tested:\n\n* Domination count (the number of points which a given point dominates), used in SPEA and SPEA2.\n* Domination rank (the number of points that dominate a given point), used in MOGA and VEGA.\n* Non-dominated sorting (used in NSGA-II, NSGA-III and many other algorithms).\n* A \"buggy\" version of non-dominated sorting that assigns increasing ranks to several identical solutions.\n* The additive binary epsilon-indicator (used mainly in assessing the performance of multiobjective optimization algorithms).\n* Initial fitness assignment for the IBEA algorithm (the version that uses the additive binary epsilon-indicator).\n* NEW: the R2 indicator, including the very recent version with an arbitrary power (typically equal to the dimension) applied to the addends.\n\n## Acknowledgments\n\nThe following contributors would like to acknowledge the support of this research by the [Russian Scientific Foundation](http://рнф.рф/en),\nagreement [17-71-20178](http://рнф.рф/en/enprjcard/?rid=17-71-20178):\n\n* [Maxim Buzdalov](https://github.com/mbuzdalov)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmbuzdalov%2Forthant-search","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmbuzdalov%2Forthant-search","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmbuzdalov%2Forthant-search/lists"}