{"id":"https://openalex.org/W1987219796","doi":"https://doi.org/10.1109/cec.2007.4425051","title":"Solving the minimum-cost constrained multipath routing with load balancing in MPLS networks using an evolutionary method","display_name":"Solving the minimum-cost constrained multipath routing with load balancing in MPLS networks using an evolutionary method","publication_year":2007,"publication_date":"2007-09-01","ids":{"openalex":"https://openalex.org/W1987219796","doi":"https://doi.org/10.1109/cec.2007.4425051","mag":"1987219796"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2007.4425051","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2007.4425051","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE Congress on Evolutionary Computation","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/A5057893924","display_name":"El-Sayed M. El-Alfy","orcid":"https://orcid.org/0000-0001-6279-9776"},"institutions":[{"id":"https://openalex.org/I134085113","display_name":"King Fahd University of Petroleum and Minerals","ror":"https://ror.org/03yez3163","country_code":"SA","type":"education","lineage":["https://openalex.org/I134085113"]}],"countries":["SA"],"is_corresponding":true,"raw_author_name":"El-Sayed M. El-Alfy","raw_affiliation_strings":["College of Computer Sciences and Engineering King Fahd University of Petroleum and Minerals Dhahran 31261, Saudi Arabia","King Fahd Univ. of Pet. and Miner., Dhahran"],"affiliations":[{"raw_affiliation_string":"College of Computer Sciences and Engineering King Fahd University of Petroleum and Minerals Dhahran 31261, Saudi Arabia","institution_ids":["https://openalex.org/I134085113"]},{"raw_affiliation_string":"King Fahd Univ. of Pet. and Miner., Dhahran","institution_ids":["https://openalex.org/I134085113"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058646758","display_name":"Shokri Z. Selim","orcid":"https://orcid.org/0000-0002-1239-5471"},"institutions":[{"id":"https://openalex.org/I134085113","display_name":"King Fahd University of Petroleum and Minerals","ror":"https://ror.org/03yez3163","country_code":"SA","type":"education","lineage":["https://openalex.org/I134085113"]}],"countries":["SA"],"is_corresponding":false,"raw_author_name":"Shokri Z. Selim","raw_affiliation_strings":["College of Computer Sciences and Engineering King Fahd University of Petroleum and Minerals Dhahran 31261, Saudi Arabia","King Fahd Univ. of Pet. and Miner., Dhahran"],"affiliations":[{"raw_affiliation_string":"College of Computer Sciences and Engineering King Fahd University of Petroleum and Minerals Dhahran 31261, Saudi Arabia","institution_ids":["https://openalex.org/I134085113"]},{"raw_affiliation_string":"King Fahd Univ. of Pet. and Miner., Dhahran","institution_ids":["https://openalex.org/I134085113"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022451865","display_name":"Mujahid N. Syed","orcid":"https://orcid.org/0000-0002-3862-2935"},"institutions":[{"id":"https://openalex.org/I134085113","display_name":"King Fahd University of Petroleum and Minerals","ror":"https://ror.org/03yez3163","country_code":"SA","type":"education","lineage":["https://openalex.org/I134085113"]}],"countries":["SA"],"is_corresponding":false,"raw_author_name":"Syed N. Mujahid","raw_affiliation_strings":["College of Computer Sciences and Engineering King Fahd University of Petroleum and Minerals Dhahran 31261, Saudi Arabia","King Fahd Univ. of Pet. and Miner., Dhahran"],"affiliations":[{"raw_affiliation_string":"College of Computer Sciences and Engineering King Fahd University of Petroleum and Minerals Dhahran 31261, Saudi Arabia","institution_ids":["https://openalex.org/I134085113"]},{"raw_affiliation_string":"King Fahd Univ. of Pet. and Miner., Dhahran","institution_ids":["https://openalex.org/I134085113"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5057893924"],"corresponding_institution_ids":["https://openalex.org/I134085113"],"apc_list":null,"apc_paid":null,"fwci":0.30962134,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.61231889,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"4433","last_page":"4438"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9980999827384949,"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.9980999827384949,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9715999960899353,"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"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9674000144004822,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.7801980376243591},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6729733943939209},{"id":"https://openalex.org/keywords/multiprotocol-label-switching","display_name":"Multiprotocol Label Switching","score":0.6239545941352844},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.6187955141067505},{"id":"https://openalex.org/keywords/load-balancing","display_name":"Load balancing (electrical power)","score":0.5729561448097229},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5276297926902771},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.4779265522956848},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.46270278096199036},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4550108313560486},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.4514457583427429},{"id":"https://openalex.org/keywords/multipath-propagation","display_name":"Multipath propagation","score":0.4494752287864685},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.28517264127731323},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21795913577079773},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.14811721444129944},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.14621791243553162},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.07102781534194946},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.06695175170898438}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7801980376243591},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6729733943939209},{"id":"https://openalex.org/C129880937","wikidata":"https://www.wikidata.org/wiki/Q677023","display_name":"Multiprotocol Label Switching","level":3,"score":0.6239545941352844},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.6187955141067505},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.5729561448097229},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5276297926902771},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.4779265522956848},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.46270278096199036},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4550108313560486},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.4514457583427429},{"id":"https://openalex.org/C161218011","wikidata":"https://www.wikidata.org/wiki/Q11827794","display_name":"Multipath propagation","level":3,"score":0.4494752287864685},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.28517264127731323},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21795913577079773},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.14811721444129944},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.14621791243553162},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.07102781534194946},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.06695175170898438},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2007.4425051","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2007.4425051","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE Congress on Evolutionary Computation","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":14,"referenced_works":["https://openalex.org/W1504943474","https://openalex.org/W1603421663","https://openalex.org/W1612056114","https://openalex.org/W1651117873","https://openalex.org/W1965068506","https://openalex.org/W2021925979","https://openalex.org/W2024965364","https://openalex.org/W2047553334","https://openalex.org/W2061475578","https://openalex.org/W2120925618","https://openalex.org/W2125392637","https://openalex.org/W2210571283","https://openalex.org/W4322358105","https://openalex.org/W6677941154"],"related_works":["https://openalex.org/W2918996422","https://openalex.org/W2906115061","https://openalex.org/W2977596624","https://openalex.org/W2145877535","https://openalex.org/W2744730182","https://openalex.org/W3134440233","https://openalex.org/W2751605210","https://openalex.org/W3151104768","https://openalex.org/W2419109832","https://openalex.org/W2068949283"],"abstract_inverted_index":{"This":[0,86],"paper":[1],"presents":[2],"a":[3,49,89,107],"flexible":[4],"evolutionary":[5],"method":[6],"for":[7,94],"minimum-cost":[8],"multipath":[9],"constrained":[10,91],"routing":[11,57],"with":[12,26,103,120,143],"load":[13],"balancing":[14,60],"problem":[15,87],"in":[16],"MPLS":[17],"networks.":[18],"The":[19,38,65],"proposed":[20,114,130],"solution":[21,36],"approach":[22,115,131],"combines":[23],"genetic":[24,123],"algorithms":[25],"linear":[27],"multi-commodity":[28],"flow":[29],"to":[30,41,54,101,135],"enhance":[31],"the":[32,35,43,56,72,76,83,111,113,121,129,144],"efficiency":[33],"of":[34,45,79],"attained.":[37],"goal":[39],"is":[40,88,116],"determine":[42,136],"distribution":[44],"traffic":[46],"demands":[47],"over":[48],"given":[50],"capacitated":[51],"network":[52],"topology":[53],"minimize":[55],"cost":[58],"while":[59],"loads":[61],"on":[62],"various":[63],"links.":[64],"constraints":[66],"that":[67],"should":[68],"be":[69,133],"satisfied":[70],"are":[71],"maximum":[73],"hop":[74],"count,":[75],"total":[77],"number":[78],"virtual":[80],"paths":[81],"and":[82,118,140],"link":[84],"capacities.":[85],"highly":[90],"multiobjective":[92],"optimization":[93,97],"which":[95],"exact":[96,145],"methods":[98],"become":[99],"helpless":[100],"deal":[102],"such":[104],"complexity.":[105],"Using":[106],"case":[108],"study":[109],"from":[110],"literature,":[112],"evaluated":[117],"compared":[119],"standard":[122],"algorithm.":[124],"We":[125],"also":[126],"show":[127],"how":[128],"can":[132],"used":[134],"approximate":[137],"Pareto":[138,146],"points":[139],"compare":[141],"them":[142],"front.":[147]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-01-21T23:30:37.877113","created_date":"2025-10-10T00:00:00"}