{"id":"https://openalex.org/W1553909454","doi":"https://doi.org/10.1109/cec.2015.7256900","title":"Ant colony optimization applied to the problem of choosing the best combination among M combinations of shortest paths in transparent optical networks","display_name":"Ant colony optimization applied to the problem of choosing the best combination among M combinations of shortest paths in transparent optical networks","publication_year":2015,"publication_date":"2015-05-01","ids":{"openalex":"https://openalex.org/W1553909454","doi":"https://doi.org/10.1109/cec.2015.7256900","mag":"1553909454"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2015.7256900","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2015.7256900","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Congress on Evolutionary Computation (CEC)","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/A5089533649","display_name":"\u00cdtalo Brasileiro","orcid":"https://orcid.org/0000-0002-4298-4920"},"institutions":[{"id":"https://openalex.org/I3121799822","display_name":"Universidade Federal do Piau\u00ed","ror":"https://ror.org/00kwnx126","country_code":"BR","type":"education","lineage":["https://openalex.org/I3121799822"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Italo Brasileiro","raw_affiliation_strings":["Computing Department, Federal University of Piau\u00ed, Terezina, Piau\u00ed","Computing Department, Federal University of Piau\u00ed, Terezina, Brazil"],"affiliations":[{"raw_affiliation_string":"Computing Department, Federal University of Piau\u00ed, Terezina, Piau\u00ed","institution_ids":["https://openalex.org/I3121799822"]},{"raw_affiliation_string":"Computing Department, Federal University of Piau\u00ed, Terezina, Brazil","institution_ids":["https://openalex.org/I3121799822"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012311973","display_name":"Iallen Santos","orcid":null},"institutions":[{"id":"https://openalex.org/I146399215","display_name":"University of Tsukuba","ror":"https://ror.org/02956yf07","country_code":"JP","type":"education","lineage":["https://openalex.org/I146399215"]},{"id":"https://openalex.org/I3121799822","display_name":"Universidade Federal do Piau\u00ed","ror":"https://ror.org/00kwnx126","country_code":"BR","type":"education","lineage":["https://openalex.org/I3121799822"]}],"countries":["BR","JP"],"is_corresponding":false,"raw_author_name":"Iallen Santos","raw_affiliation_strings":["School of Systems and Information Engineering, University of Tsukuba, Ibaraki, Japan","Computing Department, Federal University of Piau\u00ed, Terezina, Brazil"],"affiliations":[{"raw_affiliation_string":"School of Systems and Information Engineering, University of Tsukuba, Ibaraki, Japan","institution_ids":["https://openalex.org/I146399215"]},{"raw_affiliation_string":"Computing Department, Federal University of Piau\u00ed, Terezina, Brazil","institution_ids":["https://openalex.org/I3121799822"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088021525","display_name":"Andr\u00e9 Soares","orcid":"https://orcid.org/0000-0002-3909-8610"},"institutions":[{"id":"https://openalex.org/I3121799822","display_name":"Universidade Federal do Piau\u00ed","ror":"https://ror.org/00kwnx126","country_code":"BR","type":"education","lineage":["https://openalex.org/I3121799822"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Andre Soares","raw_affiliation_strings":["Universidade Federal do Piaui, Teresina, Piau\u00c3\u00ad, BR","Computing Department, Federal University of Piau\u00ed, Terezina, Brazil"],"affiliations":[{"raw_affiliation_string":"Universidade Federal do Piaui, Teresina, Piau\u00c3\u00ad, BR","institution_ids":["https://openalex.org/I3121799822"]},{"raw_affiliation_string":"Computing Department, Federal University of Piau\u00ed, Terezina, Brazil","institution_ids":["https://openalex.org/I3121799822"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061370797","display_name":"Ricardo A. L. Rab\u00ealo","orcid":"https://orcid.org/0000-0003-1482-6404"},"institutions":[{"id":"https://openalex.org/I3121799822","display_name":"Universidade Federal do Piau\u00ed","ror":"https://ror.org/00kwnx126","country_code":"BR","type":"education","lineage":["https://openalex.org/I3121799822"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Ricardo Rabelo","raw_affiliation_strings":["Universidade Federal do Piaui, Teresina, Piau\u00c3\u00ad, BR","Computing Department, Federal University of Piau\u00ed, Terezina, Brazil"],"affiliations":[{"raw_affiliation_string":"Universidade Federal do Piaui, Teresina, Piau\u00c3\u00ad, BR","institution_ids":["https://openalex.org/I3121799822"]},{"raw_affiliation_string":"Computing Department, Federal University of Piau\u00ed, Terezina, Brazil","institution_ids":["https://openalex.org/I3121799822"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020797842","display_name":"Felipe Mazullo","orcid":null},"institutions":[{"id":"https://openalex.org/I146399215","display_name":"University of Tsukuba","ror":"https://ror.org/02956yf07","country_code":"JP","type":"education","lineage":["https://openalex.org/I146399215"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Felipe Mazullo","raw_affiliation_strings":["Tsukuba Daigaku, Tsukuba, Ibaraki, JP","School of Systems and Information Engineering, University of Tsukuba, Ibaraki, Japan"],"affiliations":[{"raw_affiliation_string":"Tsukuba Daigaku, Tsukuba, Ibaraki, JP","institution_ids":["https://openalex.org/I146399215"]},{"raw_affiliation_string":"School of Systems and Information Engineering, University of Tsukuba, Ibaraki, Japan","institution_ids":["https://openalex.org/I146399215"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5089533649"],"corresponding_institution_ids":["https://openalex.org/I3121799822"],"apc_list":null,"apc_paid":null,"fwci":0.1973,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.55925028,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"2","issue":null,"first_page":"259","last_page":"266"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9998000264167786,"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.9998000264167786,"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/T10232","display_name":"Optical Network Technologies","score":0.9966999888420105,"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/T10767","display_name":"Advanced Photonic Communication Systems","score":0.9932000041007996,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7762370705604553},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.7588009834289551},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.662171483039856},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6055006384849548},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5798879265785217},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.568971574306488},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.5644063353538513},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.5592253804206848},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.517918050289154},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4751037359237671},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.46127769351005554},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4530600309371948},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3359220623970032},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23655688762664795},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.19119226932525635},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10846883058547974},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.07589197158813477}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7762370705604553},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.7588009834289551},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.662171483039856},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6055006384849548},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5798879265785217},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.568971574306488},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5644063353538513},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.5592253804206848},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.517918050289154},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4751037359237671},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.46127769351005554},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4530600309371948},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3359220623970032},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23655688762664795},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.19119226932525635},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10846883058547974},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07589197158813477},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2015.7256900","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2015.7256900","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.8199999928474426,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1488964931","https://openalex.org/W1526455201","https://openalex.org/W1573676079","https://openalex.org/W1576426930","https://openalex.org/W2018742695","https://openalex.org/W2075369222","https://openalex.org/W2082317504","https://openalex.org/W2084792824","https://openalex.org/W2089393533","https://openalex.org/W2097878406","https://openalex.org/W2145320868","https://openalex.org/W2151758915","https://openalex.org/W2162115763","https://openalex.org/W2166902804","https://openalex.org/W2169528473","https://openalex.org/W2545929163","https://openalex.org/W2798741797","https://openalex.org/W3147414854","https://openalex.org/W4230022635","https://openalex.org/W4292083457","https://openalex.org/W6684443640"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W2767202586","https://openalex.org/W2523719706","https://openalex.org/W1990043277","https://openalex.org/W2375775343","https://openalex.org/W2171039275","https://openalex.org/W2388654557","https://openalex.org/W2388051136","https://openalex.org/W2364137215","https://openalex.org/W2377010080"],"abstract_inverted_index":{"This":[0],"paper":[1,69],"presents":[2],"a":[3,31],"strategy":[4],"as":[5],"attempt":[6,80],"to":[7,34,45,81],"solve":[8],"the":[9,13,17,51,55,61,83,93,121,128],"problem":[10,52],"of":[11,20,37,41,48,53,73,85,100],"choosing":[12],"best":[14],"combination":[15],"among":[16],"M":[18],"combinations":[19],"shortest":[21,43,56],"paths":[22,44],"in":[23,67,89,97,107,115],"optical":[24],"translucent":[25],"networks.":[26],"Fixed":[27],"routing":[28],"algorithms":[29],"demands":[30],"single":[32],"route":[33,108],"each":[35],"pair":[36],"nodes.":[38],"The":[39,64],"existence":[40],"multiple":[42],"some":[46],"pairs":[47],"nodes":[49],"originates":[50],"choose":[54],"path":[57],"which":[58],"fits":[59,88],"better":[60,104,125],"network":[62,94],"requests.":[63],"algorithm":[65,123],"proposed":[66,122],"this":[68],"is":[70,113],"an":[71,90],"adaptation":[72],"Ant":[74],"Colony":[75],"Optimization":[76],"(ACO)":[77],"metaheuristic":[78],"and":[79,103,120],"define":[82],"set":[84],"routes":[86],"that":[87],"optimized":[91],"way":[92],"conditions,":[95],"resulting":[96],"reduced":[98],"number":[99],"blocked":[101],"requests":[102],"adjusted":[105],"justice":[106],"distribution.":[109],"A":[110],"performance":[111,126],"evaluation":[112],"conducted":[114],"real":[116],"topologies":[117],"by":[118],"simulations,":[119],"shows":[124],"between":[127],"compared":[129],"algorithms.":[130]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}