{"id":"https://openalex.org/W4414768618","doi":"https://doi.org/10.3390/computers14100422","title":"Hybrid MOCPO\u2013AGE-MOEA for Efficient Bi-Objective Constrained Minimum Spanning Trees","display_name":"Hybrid MOCPO\u2013AGE-MOEA for Efficient Bi-Objective Constrained Minimum Spanning Trees","publication_year":2025,"publication_date":"2025-10-02","ids":{"openalex":"https://openalex.org/W4414768618","doi":"https://doi.org/10.3390/computers14100422"},"language":"en","primary_location":{"id":"doi:10.3390/computers14100422","is_oa":true,"landing_page_url":"https://doi.org/10.3390/computers14100422","pdf_url":null,"source":{"id":"https://openalex.org/S4210228075","display_name":"Computers","issn_l":"2073-431X","issn":["2073-431X"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.3390/computers14100422","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5018808805","display_name":"Dana Faiq","orcid":"https://orcid.org/0000-0001-5961-0303"},"institutions":[{"id":"https://openalex.org/I1337553409","display_name":"American University of Iraq Sulaimani","ror":"https://ror.org/02azpgf48","country_code":"IQ","type":"education","lineage":["https://openalex.org/I1337553409"]}],"countries":["IQ"],"is_corresponding":true,"raw_author_name":"Dana Faiq Abd","raw_affiliation_strings":["Department of Computer Science, College of Science, Charmo University, Chamchamal 46023, Sulaymaniyah, Iraq"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, College of Science, Charmo University, Chamchamal 46023, Sulaymaniyah, Iraq","institution_ids":["https://openalex.org/I1337553409"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088667565","display_name":"Haval Mohammed Sidqi","orcid":null},"institutions":[{"id":"https://openalex.org/I3133014862","display_name":"Sulaimani Polytechnic University","ror":"https://ror.org/05v9vy052","country_code":"IQ","type":"education","lineage":["https://openalex.org/I3133014862"]}],"countries":["IQ"],"is_corresponding":false,"raw_author_name":"Haval Mohammed Sidqi","raw_affiliation_strings":["Technical College of Informatics, Sulaimani Polytechnic University, Sulaimaniyah 70236, Iraq"],"affiliations":[{"raw_affiliation_string":"Technical College of Informatics, Sulaimani Polytechnic University, Sulaimaniyah 70236, Iraq","institution_ids":["https://openalex.org/I3133014862"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086849769","display_name":"Omed Hassan Ahmed","orcid":"https://orcid.org/0000-0002-3804-6237"},"institutions":[{"id":"https://openalex.org/I4210118815","display_name":"University of Human Development","ror":"https://ror.org/02jz38b76","country_code":"IQ","type":"education","lineage":["https://openalex.org/I4210118815"]}],"countries":["IQ"],"is_corresponding":false,"raw_author_name":"Omed Hasan Ahmed","raw_affiliation_strings":["Department of Information Technology, University of Human Development, Sulaymaniyah 07786, Iraq"],"affiliations":[{"raw_affiliation_string":"Department of Information Technology, University of Human Development, Sulaymaniyah 07786, Iraq","institution_ids":["https://openalex.org/I4210118815"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5018808805"],"corresponding_institution_ids":["https://openalex.org/I1337553409"],"apc_list":{"value":1600,"currency":"CHF","value_usd":1732},"apc_paid":{"value":1600,"currency":"CHF","value_usd":1732},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.40356969,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"14","issue":"10","first_page":"422","last_page":"422"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9958999752998352,"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/scalability","display_name":"Scalability","score":0.6207000017166138},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5471000075340271},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5281999707221985},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.42660000920295715},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.4120999872684479},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.38580000400543213},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.3749000132083893},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.3727000057697296}],"concepts":[{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6207000017166138},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6158999800682068},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5764999985694885},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5471000075340271},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5281999707221985},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.42660000920295715},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.4120999872684479},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.38580000400543213},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.3749000132083893},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.3727000057697296},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.35679998993873596},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3310000002384186},{"id":"https://openalex.org/C24590314","wikidata":"https://www.wikidata.org/wiki/Q336038","display_name":"Wireless sensor network","level":2,"score":0.3287999927997589},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.3285999894142151},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.32850000262260437},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31929999589920044},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.31690001487731934},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3027999997138977},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.30000001192092896},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.28369998931884766},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2824999988079071},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.2815999984741211},{"id":"https://openalex.org/C2986314615","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto optimal","level":3,"score":0.28119999170303345},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.25529998540878296},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.2531999945640564}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3390/computers14100422","is_oa":true,"landing_page_url":"https://doi.org/10.3390/computers14100422","pdf_url":null,"source":{"id":"https://openalex.org/S4210228075","display_name":"Computers","issn_l":"2073-431X","issn":["2073-431X"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:81ac418e81334100aa01c21670e8d902","is_oa":true,"landing_page_url":"https://doaj.org/article/81ac418e81334100aa01c21670e8d902","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computers, Vol 14, Iss 10, p 422 (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.3390/computers14100422","is_oa":true,"landing_page_url":"https://doi.org/10.3390/computers14100422","pdf_url":null,"source":{"id":"https://openalex.org/S4210228075","display_name":"Computers","issn_l":"2073-431X","issn":["2073-431X"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W2100344930","https://openalex.org/W2807637204","https://openalex.org/W2903788160","https://openalex.org/W2946338515","https://openalex.org/W2953831633","https://openalex.org/W2976170045","https://openalex.org/W2984307052","https://openalex.org/W3000061618","https://openalex.org/W3014401826","https://openalex.org/W3035970582","https://openalex.org/W3046886974","https://openalex.org/W3104175966","https://openalex.org/W3125154412","https://openalex.org/W3177843672","https://openalex.org/W3196685769","https://openalex.org/W4210881681","https://openalex.org/W4214601389","https://openalex.org/W4226182452","https://openalex.org/W4226425610","https://openalex.org/W4290517311","https://openalex.org/W4308416203","https://openalex.org/W4313204941","https://openalex.org/W4378227366","https://openalex.org/W4389296312","https://openalex.org/W4390749375","https://openalex.org/W4390880703","https://openalex.org/W4400412365","https://openalex.org/W4402700757","https://openalex.org/W4409737194","https://openalex.org/W4412536619","https://openalex.org/W4413279958"],"related_works":[],"abstract_inverted_index":{"The":[0],"constrained":[1,188],"bi-objective":[2],"Minimum":[3],"Spanning":[4],"Tree":[5],"(MST)":[6],"problem":[7],"is":[8,96],"a":[9,64,92,196],"fundamental":[10],"challenge":[11],"in":[12,45,142,187],"network":[13],"design,":[14],"as":[15,128,195,207],"it":[16,129],"simultaneously":[17],"requires":[18],"minimizing":[19],"both":[20,217],"total":[21],"edge":[22],"weight":[23],"and":[24,102,145,164,176,198,213,220],"maximum":[25],"hop":[26,143],"distance":[27],"under":[28],"strict":[29],"feasibility":[30,101],"limits;":[31],"however,":[32],"most":[33],"existing":[34],"algorithms":[35],"tend":[36],"to":[37,98,134,161,166,204],"emphasize":[38],"one":[39],"objective":[40],"over":[41],"the":[42,71,81,85,117,170,179],"other,":[43],"resulting":[44],"imbalanced":[46],"solutions,":[47],"limited":[48],"Pareto":[49,131],"fronts,":[50],"or":[51],"poor":[52],"scalability":[53],"on":[54,111],"larger":[55],"instances.":[56],"To":[57],"overcome":[58],"these":[59],"shortcomings,":[60],"this":[61],"study":[62],"introduces":[63],"Hybrid":[65,180],"MOCPO\u2013AGE-MOEA":[66,181],"algorithm":[67],"that":[68,156],"strategically":[69],"combines":[70],"exploratory":[72],"strength":[73],"of":[74,84,159],"Multi-Objective":[75],"Crested":[76],"Porcupines":[77],"Optimization":[78],"(MOCPO)":[79],"with":[80,114,124,150,201],"exploitative":[82],"refinement":[83],"Adaptive":[86],"Geometry-based":[87],"Evolutionary":[88],"Algorithm":[89],"(AGE-MOEA),":[90],"while":[91],"Kruskal-based":[93],"repair":[94],"operator":[95],"integrated":[97],"strictly":[99],"enforce":[100],"preserve":[103],"solution":[104,200,221],"diversity.":[105],"Moreover,":[106],"through":[107],"extensive":[108],"experiments":[109],"conducted":[110],"Euclidean":[112],"graphs":[113],"11\u2013100":[115],"nodes,":[116],"hybrid":[118],"consistently":[119],"demonstrates":[120],"superior":[121],"performance":[122],"compared":[123],"five":[125],"state-of-the-art":[126],"baselines,":[127],"generates":[130],"fronts":[132],"up":[133],"four":[135],"times":[136],"larger,":[137],"achieves":[138],"nearly":[139],"20%":[140],"reductions":[141],"counts,":[144],"delivers":[146],"order-of-magnitude":[147],"runtime":[148],"improvements":[149],"near-linear":[151],"scalability.":[152],"Importantly,":[153],"results":[154],"reveal":[155],"allocating":[157],"85%":[158],"offspring":[160],"MOCPO":[162],"exploration":[163],"15%":[165],"AGE-MOEA":[167],"exploitation":[168],"yields":[169],"best":[171],"balance":[172],"between":[173],"diversity,":[174],"efficiency,":[175],"feasibility.":[177],"Therefore,":[178],"not":[182],"only":[183],"addresses":[184],"critical":[185],"gaps":[186],"MST":[189],"optimization":[190],"but":[191],"also":[192],"establishes":[193],"itself":[194],"practical":[197],"scalable":[199],"strong":[202],"applicability":[203],"domains":[205],"such":[206],"software-defined":[208],"networking,":[209],"wireless":[210],"mesh":[211],"systems,":[212],"adaptive":[214],"routing,":[215],"where":[216],"computational":[218],"efficiency":[219],"diversity":[222],"are":[223],"paramount":[224]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-10T00:00:00"}