{"id":"https://openalex.org/W2587296203","doi":"https://doi.org/10.1145/3010089.3010119","title":"Degree Constrained Spanning Tree Problem Solving using Hybrid Modified Genetic Algorithm","display_name":"Degree Constrained Spanning Tree Problem Solving using Hybrid Modified Genetic Algorithm","publication_year":2016,"publication_date":"2016-11-10","ids":{"openalex":"https://openalex.org/W2587296203","doi":"https://doi.org/10.1145/3010089.3010119","mag":"2587296203"},"language":"en","primary_location":{"id":"doi:10.1145/3010089.3010119","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3010089.3010119","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference on Big Data and Advanced Wireless Technologies","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/A5013031413","display_name":"Amine Amarir","orcid":null},"institutions":[{"id":"https://openalex.org/I126477371","display_name":"Mohammed V University","ror":"https://ror.org/00r8w8f84","country_code":"MA","type":"education","lineage":["https://openalex.org/I126477371"]},{"id":"https://openalex.org/I4210156583","display_name":"Laboratoire d'Informatique de Paris-Nord","ror":"https://ror.org/05g1zjw44","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210091279","https://openalex.org/I4210156583","https://openalex.org/I4210159245"]}],"countries":["FR","MA"],"is_corresponding":true,"raw_author_name":"Amine Amarir","raw_affiliation_strings":["Computer Science Laboratory (LRI), Computer Science Department, Mohammed V University in Rabat"],"affiliations":[{"raw_affiliation_string":"Computer Science Laboratory (LRI), Computer Science Department, Mohammed V University in Rabat","institution_ids":["https://openalex.org/I126477371","https://openalex.org/I4210156583"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047779103","display_name":"Faouzia Zegrari","orcid":null},"institutions":[{"id":"https://openalex.org/I4210156583","display_name":"Laboratoire d'Informatique de Paris-Nord","ror":"https://ror.org/05g1zjw44","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210091279","https://openalex.org/I4210156583","https://openalex.org/I4210159245"]},{"id":"https://openalex.org/I126477371","display_name":"Mohammed V University","ror":"https://ror.org/00r8w8f84","country_code":"MA","type":"education","lineage":["https://openalex.org/I126477371"]}],"countries":["FR","MA"],"is_corresponding":false,"raw_author_name":"Faouzia Zegrari","raw_affiliation_strings":["Computer Science Laboratory (LRI), Computer Science Department, Mohammed V University in Rabat"],"affiliations":[{"raw_affiliation_string":"Computer Science Laboratory (LRI), Computer Science Department, Mohammed V University in Rabat","institution_ids":["https://openalex.org/I126477371","https://openalex.org/I4210156583"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066056412","display_name":"Abdellah Idrissi","orcid":"https://orcid.org/0000-0001-5696-3007"},"institutions":[{"id":"https://openalex.org/I126477371","display_name":"Mohammed V University","ror":"https://ror.org/00r8w8f84","country_code":"MA","type":"education","lineage":["https://openalex.org/I126477371"]},{"id":"https://openalex.org/I4210156583","display_name":"Laboratoire d'Informatique de Paris-Nord","ror":"https://ror.org/05g1zjw44","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210091279","https://openalex.org/I4210156583","https://openalex.org/I4210159245"]}],"countries":["FR","MA"],"is_corresponding":false,"raw_author_name":"Abdellah Idrissi","raw_affiliation_strings":["Computer Science Laboratory (LRI), Computer Science Department, Mohammed V University in Rabat"],"affiliations":[{"raw_affiliation_string":"Computer Science Laboratory (LRI), Computer Science Department, Mohammed V University in Rabat","institution_ids":["https://openalex.org/I126477371","https://openalex.org/I4210156583"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5013031413"],"corresponding_institution_ids":["https://openalex.org/I126477371","https://openalex.org/I4210156583"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.23342294,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9979000091552734,"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.9979000091552734,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9965999722480774,"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/T11106","display_name":"Data Management and Algorithms","score":0.9896000027656555,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.8645325899124146},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7718767523765564},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.7643213868141174},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.7585520148277283},{"id":"https://openalex.org/keywords/reverse-delete-algorithm","display_name":"Reverse-delete algorithm","score":0.6755760908126831},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6189894080162048},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5975354313850403},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4976237118244171},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.4884287416934967},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48806917667388916},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.48395922780036926},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.47450894117355347},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.459349662065506},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4530380368232727},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.429470032453537},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29206383228302},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.23865118622779846},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.12736913561820984}],"concepts":[{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.8645325899124146},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7718767523765564},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.7643213868141174},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.7585520148277283},{"id":"https://openalex.org/C199346575","wikidata":"https://www.wikidata.org/wiki/Q4925151","display_name":"Reverse-delete algorithm","level":4,"score":0.6755760908126831},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6189894080162048},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5975354313850403},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4976237118244171},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.4884287416934967},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48806917667388916},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.48395922780036926},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.47450894117355347},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.459349662065506},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4530380368232727},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.429470032453537},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29206383228302},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.23865118622779846},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.12736913561820984},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3010089.3010119","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3010089.3010119","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference on Big Data and Advanced Wireless Technologies","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4099999964237213,"id":"https://metadata.un.org/sdg/12","display_name":"Responsible consumption and production"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W75076678","https://openalex.org/W144958425","https://openalex.org/W600661589","https://openalex.org/W996649144","https://openalex.org/W1532720721","https://openalex.org/W1995670816","https://openalex.org/W1997919376","https://openalex.org/W2007478346","https://openalex.org/W2018122504","https://openalex.org/W2047519889","https://openalex.org/W2086180032","https://openalex.org/W2151610140","https://openalex.org/W2162974503","https://openalex.org/W2169348841","https://openalex.org/W2257424867","https://openalex.org/W2294771658","https://openalex.org/W2332703972","https://openalex.org/W2338867054","https://openalex.org/W2349932203","https://openalex.org/W2476096155","https://openalex.org/W4254608120"],"related_works":["https://openalex.org/W2381121915","https://openalex.org/W4380840098","https://openalex.org/W2390742649","https://openalex.org/W2589768050","https://openalex.org/W2899787781","https://openalex.org/W2384589661","https://openalex.org/W2418231958","https://openalex.org/W2387385213","https://openalex.org/W3016811403","https://openalex.org/W2943635264"],"abstract_inverted_index":{"In":[0],"real":[1,75],"life,":[2],"we":[3,62],"always":[4],"want":[5],"to":[6,45],"reach":[7],"our":[8],"goal":[9],"in":[10,26,38,74,85],"minimum":[11,17,35,66,78],"effort,":[12],"it":[13],"should":[14],"have":[15,63,90],"a":[16,50,54,65,92],"constrained":[18],"path.":[19],"The":[20,42,82],"path":[21,37],"may":[22],"be":[23,72],"shortest":[24],"route":[25],"practical,":[27],"either":[28],"physical":[29],"or":[30,33],"electronic":[31],"medium,":[32],"the":[34,47,112,116,121],"costing":[36],"term":[39],"of":[40,104,108],"resources.":[41],"idea":[43],"is":[44,87],"represent":[46],"problem":[48],"as":[49],"graph":[51],"and":[52,120],"finding":[53],"spanning":[55,68],"tree":[56],"with":[57,77,101,115],"specific":[58],"design":[59],"criteria.":[60],"Here,":[61],"chosen":[64],"degree":[67],"tree,":[69],"which":[70],"can":[71],"generated":[73],"time":[76,80],"turnaround":[79],"[11].":[81],"solution":[83],"approach,":[84,94],"general,":[86],"approximate.":[88],"We":[89,110],"used":[91],"heuristic":[93],"namely":[95],"hybrid":[96],"modified":[97],"genetic":[98],"algorithm":[99],"(HMGA),":[100],"motivated":[102],"criteria":[103],"encoded":[105],"data":[106],"structures":[107],"graph.":[109],"compare":[111],"experimental":[113],"result":[114],"existing":[117],"approximate":[118],"algorithms":[119],"results":[122],"are":[123],"very":[124],"promising.":[125]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}