{"id":"https://openalex.org/W2006350502","doi":"https://doi.org/10.1109/clei.2013.6670659","title":"Robust network design under uncertain taffic an approach based on Genetic Algorithm","display_name":"Robust network design under uncertain taffic an approach based on Genetic Algorithm","publication_year":2013,"publication_date":"2013-10-01","ids":{"openalex":"https://openalex.org/W2006350502","doi":"https://doi.org/10.1109/clei.2013.6670659","mag":"2006350502"},"language":"en","primary_location":{"id":"doi:10.1109/clei.2013.6670659","is_oa":false,"landing_page_url":"https://doi.org/10.1109/clei.2013.6670659","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 XXXIX Latin American Computing Conference (CLEI)","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/A5016765659","display_name":"Brenda Diaz-B\u00e1ez","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Brenda Diaz-Baez","raw_affiliation_strings":["Facultad Polit\u00e9cnica, UNA, Paraguay","Fac. Politec., UNA, Paraguay"],"affiliations":[{"raw_affiliation_string":"Facultad Polit\u00e9cnica, UNA, Paraguay","institution_ids":[]},{"raw_affiliation_string":"Fac. Politec., UNA, Paraguay","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027987805","display_name":"Diego P. Pinto-Roa","orcid":"https://orcid.org/0000-0003-2479-9876"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Diego P. Pinto-Roa","raw_affiliation_strings":["Facultad Polit\u00e9cnica, UNA, Paraguay","Fac. Politec., UNA, Paraguay"],"affiliations":[{"raw_affiliation_string":"Facultad Polit\u00e9cnica, UNA, Paraguay","institution_ids":[]},{"raw_affiliation_string":"Fac. Politec., UNA, Paraguay","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083033584","display_name":"Christian von L\u00fccken","orcid":"https://orcid.org/0000-0002-2198-1237"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Christian von Lucken","raw_affiliation_strings":["Facultad Polit\u00e9cnica, UNA, Paraguay","Fac. Politec., UNA, Paraguay"],"affiliations":[{"raw_affiliation_string":"Facultad Polit\u00e9cnica, UNA, Paraguay","institution_ids":[]},{"raw_affiliation_string":"Fac. Politec., UNA, Paraguay","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5016765659"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0134876,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.82946605,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"4","issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9907000064849854,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9907000064849854,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10050","display_name":"Multi-Criteria Decision Making","score":0.9829000234603882,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10780","display_name":"Reliability and Maintenance Optimization","score":0.974399983882904,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"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.6958370208740234},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6309061050415039},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5606961846351624},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.5540902018547058},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.5450087785720825},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5404961109161377},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5335375070571899},{"id":"https://openalex.org/keywords/network-routing","display_name":"Network routing","score":0.5275577902793884},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5111232399940491},{"id":"https://openalex.org/keywords/traffic-generation-model","display_name":"Traffic generation model","score":0.43473827838897705},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4214558005332947},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2597712278366089},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20230931043624878},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.12809836864471436},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.10919320583343506}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6958370208740234},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6309061050415039},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5606961846351624},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.5540902018547058},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.5450087785720825},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5404961109161377},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5335375070571899},{"id":"https://openalex.org/C2983435990","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Network routing","level":3,"score":0.5275577902793884},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5111232399940491},{"id":"https://openalex.org/C176715033","wikidata":"https://www.wikidata.org/wiki/Q2080768","display_name":"Traffic generation model","level":2,"score":0.43473827838897705},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4214558005332947},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2597712278366089},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20230931043624878},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.12809836864471436},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.10919320583343506},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","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.1109/clei.2013.6670659","is_oa":false,"landing_page_url":"https://doi.org/10.1109/clei.2013.6670659","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 XXXIX Latin American Computing Conference (CLEI)","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":18,"referenced_works":["https://openalex.org/W1993074785","https://openalex.org/W2007092769","https://openalex.org/W2043644965","https://openalex.org/W2047204731","https://openalex.org/W2076704288","https://openalex.org/W2079003301","https://openalex.org/W2088005539","https://openalex.org/W2103491696","https://openalex.org/W2105291450","https://openalex.org/W2118578357","https://openalex.org/W2123138012","https://openalex.org/W2136173851","https://openalex.org/W2505968561","https://openalex.org/W2788302603","https://openalex.org/W3023540311","https://openalex.org/W4245494618","https://openalex.org/W4301173492","https://openalex.org/W6680214690"],"related_works":["https://openalex.org/W2075067217","https://openalex.org/W4254709952","https://openalex.org/W2026034687","https://openalex.org/W2132320513","https://openalex.org/W1687060458","https://openalex.org/W1976154696","https://openalex.org/W2353466952","https://openalex.org/W2609535666","https://openalex.org/W4256116802","https://openalex.org/W4235738893"],"abstract_inverted_index":{"A":[0],"network":[1,20,24,45,94],"design":[2,25,54],"is":[3,7,26,79],"robust":[4,23,55],"if":[5],"it":[6],"able":[8],"to":[9,53],"deal":[10],"with":[11,57,66,103],"any":[12],"traffic":[13,41,68,78,91],"requirement":[14],"under":[15],"certain":[16],"bounds":[17,42],"and":[18,144],"physical":[19],"conditions.":[21],"The":[22,76],"a":[27,50,63,88,99,112,116,139],"complex":[28],"problem":[29],"of":[30,43,60,101,106,111,125,132,135,147],"growing":[31],"importance":[32],"where,":[33],"in":[34,73],"general,":[35],"the":[36,44,83,109,126,133,145,151],"only":[37],"information":[38],"available":[39],"are":[40],"links.":[46],"This":[47],"work":[48],"proposes":[49],"Genetic":[51],"Algorithm":[52],"networks":[56],"optimal":[58],"capacity":[59],"links":[61],"considering":[62],"stable":[64,113],"routing":[65,114,118],"uncertain":[67,77],"that":[69],"can":[70],"be":[71],"divided":[72],"k":[74,127,143],"sub-routes.":[75],"handled":[80],"by":[81,150],"usign":[82],"hose":[84],"model":[85],"which":[86],"imposes":[87],"maximum":[89],"input/output":[90],"for":[92,98],"each":[93],"node.":[95],"Experimental":[96],"results":[97],"set":[100],"instances":[102],"different":[104],"number":[105,134],"routes":[107],"show":[108],"convenience":[110],"against":[115],"non-divisible":[117],"(k":[119],"=":[120],"1).":[121],"However,":[122],"an":[123,130],"increasing":[124,131],"value":[128],"implies":[129],"viable":[136],"solutions,":[137],"thus,":[138],"trade-off":[140],"relation":[141],"between":[142],"quality":[146],"solutions":[148],"obtained":[149],"proposed":[152],"algorithm":[153],"was":[154],"detected.":[155]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}