{"id":"https://openalex.org/W2480175533","doi":"https://doi.org/10.1145/2908812.2908955","title":"A Parallel Hybrid Genetic Algorithm for the k-Edge-Connected Hop-Constrained Network Design Problem","display_name":"A Parallel Hybrid Genetic Algorithm for the k-Edge-Connected Hop-Constrained Network Design Problem","publication_year":2016,"publication_date":"2016-07-20","ids":{"openalex":"https://openalex.org/W2480175533","doi":"https://doi.org/10.1145/2908812.2908955","mag":"2480175533"},"language":"en","primary_location":{"id":"doi:10.1145/2908812.2908955","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2908812.2908955","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference 2016","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/A5020715412","display_name":"Mohamed Labidi","orcid":"https://orcid.org/0000-0002-9585-1339"},"institutions":[{"id":"https://openalex.org/I56435720","display_name":"Universit\u00e9 Paris Dauphine-PSL","ror":"https://ror.org/052bz7812","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580","https://openalex.org/I56435720"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mohamed Khalil Labidi","raw_affiliation_strings":["Sciences of Tunis & Paris Dauphine University, Tunis, Tunisia & Paris, France, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sciences of Tunis & Paris Dauphine University, Tunis, Tunisia & Paris, France, France","institution_ids":["https://openalex.org/I56435720"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026008434","display_name":"Ibrahima Diarrassouba","orcid":"https://orcid.org/0000-0002-1924-0616"},"institutions":[{"id":"https://openalex.org/I141576021","display_name":"Universit\u00e9 Le Havre Normandie","ror":"https://ror.org/05v509s40","country_code":"FR","type":"education","lineage":["https://openalex.org/I141576021","https://openalex.org/I4210105918"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Ibrahima Diarrassouba","raw_affiliation_strings":["Le Havre University, Le Havre, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Le Havre University, Le Havre, France","institution_ids":["https://openalex.org/I141576021"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101855070","display_name":"A. Ridha Mahjoub","orcid":"https://orcid.org/0000-0002-1079-1892"},"institutions":[{"id":"https://openalex.org/I56435720","display_name":"Universit\u00e9 Paris Dauphine-PSL","ror":"https://ror.org/052bz7812","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580","https://openalex.org/I56435720"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Ali Ridha Mahjoub","raw_affiliation_strings":["Paris Dauphine University, Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Paris Dauphine University, Paris, France","institution_ids":["https://openalex.org/I56435720"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059411280","display_name":"Anissa Omrane","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Anissa Omrane","raw_affiliation_strings":["Sciences of Tunis, Tunis, Tunisia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sciences of Tunis, Tunis, Tunisia","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.05661514,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"685","last_page":"692"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T10374","display_name":"Advanced Graph Theory Research","score":0.9976000189781189,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9973999857902527,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6502040028572083},{"id":"https://openalex.org/keywords/hop","display_name":"Hop (telecommunications)","score":0.6143700480461121},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5788090229034424},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5413197875022888},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5225488543510437},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.5148931741714478},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.48051154613494873},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.47095543146133423},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45877277851104736},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.43160805106163025},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42381221055984497},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22230681777000427},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.12923189997673035},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.0960845947265625}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6502040028572083},{"id":"https://openalex.org/C25906391","wikidata":"https://www.wikidata.org/wiki/Q1432381","display_name":"Hop (telecommunications)","level":2,"score":0.6143700480461121},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5788090229034424},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5413197875022888},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5225488543510437},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.5148931741714478},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.48051154613494873},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.47095543146133423},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45877277851104736},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.43160805106163025},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42381221055984497},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22230681777000427},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.12923189997673035},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0960845947265625},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2908812.2908955","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2908812.2908955","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference 2016","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W46445897","https://openalex.org/W1036195498","https://openalex.org/W1505338788","https://openalex.org/W1559215823","https://openalex.org/W1559956479","https://openalex.org/W1572130003","https://openalex.org/W1659842140","https://openalex.org/W1964581121","https://openalex.org/W1989714486","https://openalex.org/W2002592134","https://openalex.org/W2006877095","https://openalex.org/W2016801268","https://openalex.org/W2017697298","https://openalex.org/W2022637272","https://openalex.org/W2030292445","https://openalex.org/W2052035035","https://openalex.org/W2053469491","https://openalex.org/W2056178482","https://openalex.org/W2058748455","https://openalex.org/W2061552894","https://openalex.org/W2072947773","https://openalex.org/W2101657530","https://openalex.org/W2102248717","https://openalex.org/W2132678463","https://openalex.org/W2145568361","https://openalex.org/W2147336456","https://openalex.org/W2150834164","https://openalex.org/W2163726045","https://openalex.org/W2203738488","https://openalex.org/W2338905098","https://openalex.org/W2912706550","https://openalex.org/W3142896545","https://openalex.org/W4211176206","https://openalex.org/W4232223209","https://openalex.org/W7038657113"],"related_works":["https://openalex.org/W3183948672","https://openalex.org/W2887687022","https://openalex.org/W2058535723","https://openalex.org/W2078181390","https://openalex.org/W2080781471","https://openalex.org/W2277088917","https://openalex.org/W2035405850","https://openalex.org/W2016240752","https://openalex.org/W2319333698","https://openalex.org/W2101527510"],"abstract_inverted_index":{"Network":[0],"design":[1,31],"problems":[2],"have":[3],"been":[4],"largely":[5],"studied":[6],"in":[7,18,24],"the":[8,13,27,51],"last":[9],"decades":[10],"due":[11],"to":[12,37],"ubiquity":[14],"of":[15],"IT":[16],"communication":[17],"our":[19,70],"daily":[20],"life.":[21],"We":[22],"address":[23],"this":[25,41],"paper":[26],"k-edge-connected":[28],"hop-constrained":[29],"network":[30],"problem":[32],"(kHNDP)":[33],"which":[34],"is":[35],"known":[36],"be":[38],"NP-hard.":[39],"In":[40],"paper,":[42],"we":[43],"present":[44],"a":[45,55,59,63],"hybrid":[46],"parallel":[47],"approach":[48],"for":[49],"solving":[50],"kHNDP":[52],"based":[53],"on":[54],"Lagrangian":[56],"relaxation":[57],"algorithm,":[58,61],"greedy":[60],"and":[62],"genetic":[64],"algorithm.":[65],"Computational":[66],"results":[67],"obtained":[68],"with":[69,74],"algorithms":[71],"are":[72],"compared":[73],"those":[75],"from":[76],"CPLEX.":[77]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}