{"id":"https://openalex.org/W2896124306","doi":"https://doi.org/10.1109/cec.2018.8477804","title":"MBOS: Modified Best Order Sort Algorithm for Performing Non-Dominated Sorting","display_name":"MBOS: Modified Best Order Sort Algorithm for Performing Non-Dominated Sorting","publication_year":2018,"publication_date":"2018-07-01","ids":{"openalex":"https://openalex.org/W2896124306","doi":"https://doi.org/10.1109/cec.2018.8477804","mag":"2896124306"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2018.8477804","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2018.8477804","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021971352","display_name":"Sumit Mishra","orcid":"https://orcid.org/0000-0001-9333-2001"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Sumit Mishra","raw_affiliation_strings":["Departamento de Computacion, Mexico City, Mexico"],"affiliations":[{"raw_affiliation_string":"Departamento de Computacion, Mexico City, Mexico","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060797340","display_name":"Sriparna Saha","orcid":"https://orcid.org/0000-0001-5458-9381"},"institutions":[{"id":"https://openalex.org/I132153292","display_name":"Indian Institute of Technology Patna","ror":"https://ror.org/01ft5vz71","country_code":"IN","type":"education","lineage":["https://openalex.org/I132153292"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sriparna Saha","raw_affiliation_strings":["Department of computer Science & Engineering, Indian Institute of Technology Patna, Bihar, India"],"affiliations":[{"raw_affiliation_string":"Department of computer Science & Engineering, Indian Institute of Technology Patna, Bihar, India","institution_ids":["https://openalex.org/I132153292"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088675403","display_name":"Samrat Mondal","orcid":"https://orcid.org/0000-0002-2159-3410"},"institutions":[{"id":"https://openalex.org/I132153292","display_name":"Indian Institute of Technology Patna","ror":"https://ror.org/01ft5vz71","country_code":"IN","type":"education","lineage":["https://openalex.org/I132153292"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Samrat Mondal","raw_affiliation_strings":["Department of computer Science & Engineering, Indian Institute of Technology Patna, Bihar, India"],"affiliations":[{"raw_affiliation_string":"Department of computer Science & Engineering, Indian Institute of Technology Patna, Bihar, India","institution_ids":["https://openalex.org/I132153292"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5021971352"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4135,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.83969921,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9943000078201294,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.8614776134490967},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.8103569746017456},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.7813257575035095},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6568317413330078},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.5292871594429016},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5079613327980042},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4598044455051422},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2342211902141571}],"concepts":[{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.8614776134490967},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.8103569746017456},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.7813257575035095},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6568317413330078},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.5292871594429016},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5079613327980042},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4598044455051422},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2342211902141571},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2018.8477804","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2018.8477804","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1670300334","https://openalex.org/W1833634424","https://openalex.org/W2021418037","https://openalex.org/W2028772559","https://openalex.org/W2042011228","https://openalex.org/W2117852087","https://openalex.org/W2126105956","https://openalex.org/W2126997347","https://openalex.org/W2477866957","https://openalex.org/W2510493362","https://openalex.org/W2559305255","https://openalex.org/W2579525752","https://openalex.org/W2756677578","https://openalex.org/W6725370191","https://openalex.org/W6732248415"],"related_works":["https://openalex.org/W2809748609","https://openalex.org/W2095055219","https://openalex.org/W2482527088","https://openalex.org/W3033694952","https://openalex.org/W2908348257","https://openalex.org/W4392178020","https://openalex.org/W2994182992","https://openalex.org/W2085265870","https://openalex.org/W2362374543","https://openalex.org/W2348196682"],"abstract_inverted_index":{"The":[0,112],"current":[1],"paper":[2,84],"aims":[3],"to":[4,63,89,106],"improve":[5],"an":[6],"efficient":[7,60],"algorithm":[8,117],"for":[9,44],"solving":[10],"the":[11,20,45,64,77,91,108,140],"problem":[12,46],"of":[13,19,23,37,47,66,79],"non-dominated":[14,48],"sorting":[15],"which":[16,58],"is":[17,54,59],"one":[18],"dominant":[21],"steps":[22],"any":[24],"Pareto":[25],"based":[26],"multi/many":[27],"objective":[28],"optimization":[29],"algorithms.":[30],"Recent":[31],"years":[32],"witnessed":[33],"a":[34],"large":[35],"number":[36,65],"attempts":[38,85],"in":[39,76,122],"developing":[40],"some":[41],"solution":[42],"frameworks":[43],"sorting.":[49],"One":[50],"such":[51],"recent":[52],"approach":[53,71],"`Best":[55,92,129],"Order":[56,93,104,130],"Sort'":[57,94,105,131],"with":[61],"respect":[62],"dominance":[67],"comparisons.":[68],"However,":[69],"this":[70,83,98],"does":[72],"not":[73],"perform":[74],"well":[75],"presence":[78],"duplicate":[80],"solutions.":[81],"In":[82],"have":[86],"been":[87,119],"made":[88],"modify":[90],"and":[95,139],"we":[96],"call":[97],"modified":[99,113],"version":[100],"as":[101],"`Modified":[102],"Best":[103],"remove":[107],"above":[109],"mentioned":[110],"limitation.":[111],"best":[114,138],"order":[115],"sort":[116],"has":[118],"thoroughly":[120],"analyzed":[121],"different":[123],"scenarios.":[124],"Current":[125],"work":[126],"shows":[127],"that":[128],"can":[132],"be":[133],"generalized":[134],"without":[135],"affecting":[136],"its":[137],"worst":[141],"case":[142],"time":[143],"complexities.":[144]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}