{"id":"https://openalex.org/W7151438848","doi":"https://doi.org/10.48550/arxiv.2604.04724","title":"Ranking Constraints via Topological Dual-Directional Search in Evolutionary Multi-Objective Optimization","display_name":"Ranking Constraints via Topological Dual-Directional Search in Evolutionary Multi-Objective Optimization","publication_year":2026,"publication_date":"2026-04-06","ids":{"openalex":"https://openalex.org/W7151438848","doi":"https://doi.org/10.48550/arxiv.2604.04724"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.04724","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.04724","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.04724","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033222509","display_name":"Ruiqing Sun","orcid":"https://orcid.org/0000-0003-4863-6529"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sun, Ruiqing","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5121763389","display_name":"Dawei Feng","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Feng, Dawei","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004053524","display_name":"Sheng Qi","orcid":"https://orcid.org/0000-0002-0610-4746"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Qi, Sheng","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133095988","display_name":"Xing Zhou","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhou, Xing","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082840055","display_name":"Lianghao Li","orcid":"https://orcid.org/0000-0002-5810-8749"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Lianghao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133127348","display_name":"Bo Ding","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ding, Bo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133134883","display_name":"Yijie Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Yijie","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133104669","display_name":"Rui Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Rui","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5133071700","display_name":"Huaimin Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Huaimin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9848999977111816,"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.9848999977111816,"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.0038999998942017555,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.0027000000700354576,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.621399998664856},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5468000173568726},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.542900025844574},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5281999707221985},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5038999915122986},{"id":"https://openalex.org/keywords/ranking","display_name":"Ranking (information retrieval)","score":0.47530001401901245},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.47049999237060547},{"id":"https://openalex.org/keywords/core","display_name":"Core (optical fiber)","score":0.4327999949455261},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.42179998755455017}],"concepts":[{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.621399998664856},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6148999929428101},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5468000173568726},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.542900025844574},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5367000102996826},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5281999707221985},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5038999915122986},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.47530001401901245},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.47049999237060547},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.4327999949455261},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.42179998755455017},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.34709998965263367},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.34540000557899475},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.34209999442100525},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.33239999413490295},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.33219999074935913},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3231000006198883},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.30489999055862427},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.3009999990463257},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.29750001430511475},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.2921999990940094},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2847000062465668},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2827000021934509},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2782999873161316},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25920000672340393},{"id":"https://openalex.org/C2986314615","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto optimal","level":3,"score":0.25859999656677246},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.2581999897956848},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.2581999897956848},{"id":"https://openalex.org/C128942645","wikidata":"https://www.wikidata.org/wiki/Q1568346","display_name":"Test case","level":3,"score":0.25380000472068787}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.04724","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.04724","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.04724","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.04724","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"score":0.4436952471733093,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Existing":[0],"evolutionary":[1,105],"algorithms":[2],"for":[3,119],"Constrained":[4,22],"Multi-objective":[5],"Optimization":[6],"Problems":[7],"(CMOPs)":[8],"typically":[9],"treat":[10],"all":[11],"constraints":[12,28,95,120,139,149,158],"uniformly,":[13],"overlooking":[14],"their":[15],"distinct":[16],"geometric":[17,81],"relationships":[18],"with":[19,85,141],"the":[20,35,98,104,111,124,130,134,142,153,172],"true":[21],"Pareto":[23],"Front":[24],"(CPF).":[25],"In":[26],"reality,":[27],"play":[29],"different":[30],"roles:":[31],"some":[32,38],"directly":[33,113],"shape":[34],"final":[36,99,154],"CPF,":[37,100],"create":[39],"infeasible":[40,135],"obstacles,":[41],"while":[42],"others":[43],"are":[44,159,168],"irrelevant.":[45],"To":[46],"exploit":[47],"this":[48],"insight,":[49],"we":[50],"propose":[51],"a":[52,74,86,163],"novel":[53],"algorithm":[54],"named":[55],"RCCMO,":[56],"which":[57],"sequentially":[58],"performs":[59],"unconstrained":[60],"exploration,":[61],"single-constraint":[62,116],"exploitation,":[63],"and":[64,151,178,193],"full-constraint":[65],"refinement.":[66],"The":[67],"core":[68],"innovation":[69],"of":[70,165],"RCCMO":[71,92,127,199],"lies":[72],"in":[73,183],"constraint":[75],"prioritization":[76],"method":[77],"derived":[78],"from":[79,103,129],"these":[80,148],"insights,":[82],"seamlessly":[83],"coupled":[84],"unique":[87],"dual-directional":[88],"search":[89,181],"mechanism.":[90],"Specifically,":[91],"first":[93],"prioritizes":[94],"that":[96,121,198],"constitute":[97],"approaching":[101],"them":[102],"direction":[106,132],"(optimizing":[107],"objectives)":[108],"to":[109,144,170],"locate":[110],"CPF":[112],"shaped":[114],"by":[115],"boundaries.":[117],"Subsequently,":[118],"merely":[122],"hinder":[123],"population's":[125],"progress,":[126],"searches":[128],"anti-evolutionary":[131],"(targeting":[133],"boundaries":[136],"where":[137],"hindering":[138],"intersect":[140],"CPF)":[143],"effectively":[145],"discover":[146],"how":[147],"obstruct":[150],"form":[152],"CPF.":[155],"Meanwhile,":[156],"irrelevant":[157],"intentionally":[160],"bypassed.":[161],"Furthermore,":[162],"series":[164],"specialized":[166],"mechanisms":[167],"proposed":[169],"accelerate":[171],"algorithm's":[173],"execution,":[174],"reduce":[175],"heuristic":[176],"misjudgments,":[177],"dynamically":[179],"adjust":[180],"directions":[182],"real":[184],"time.":[185],"Extensive":[186],"experiments":[187],"on":[188],"5":[189],"benchmark":[190],"test":[191],"suites":[192],"29":[194],"real-world":[195],"CMOPs":[196],"demonstrate":[197],"significantly":[200],"outperforms":[201],"seven":[202],"state-of-the-art":[203],"algorithms.":[204]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-04-08T00:00:00"}