{"id":"https://openalex.org/W2750754474","doi":"https://doi.org/10.1515/jaiscr-2016-0017","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":2016,"publication_date":"2016-08-10","ids":{"openalex":"https://openalex.org/W2750754474","doi":"https://doi.org/10.1515/jaiscr-2016-0017","mag":"2750754474"},"language":"en","primary_location":{"id":"doi:10.1515/jaiscr-2016-0017","is_oa":true,"landing_page_url":"https://doi.org/10.1515/jaiscr-2016-0017","pdf_url":"https://sciendo.com/pdf/10.1515/jaiscr-2016-0017","source":{"id":"https://openalex.org/S4210223945","display_name":"Journal of Artificial Intelligence and Soft Computing Research","issn_l":"2083-2567","issn":["2083-2567","2449-6499"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310317241","host_organization_name":"Polish Neural Network Society, the University of Social Sciences in Lodz & Czestochowa University of Technology","host_organization_lineage":["https://openalex.org/P4310317241"],"host_organization_lineage_names":["Polish Neural Network Society, the University of Social Sciences in Lodz & Czestochowa University of Technology"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Artificial Intelligence and Soft Computing Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://sciendo.com/pdf/10.1515/jaiscr-2016-0017","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":"\u00cdtalo Brasileiro","raw_affiliation_strings":["Computing Department, Federal University of Piau\u00ed, Terezina, Piaui, Brazil"],"affiliations":[{"raw_affiliation_string":"Computing Department, Federal University of Piau\u00ed, Terezina, Piaui, 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/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":"Iallen Santos","raw_affiliation_strings":["Computing Department, Federal University of Piau\u00ed, Terezina, Piaui, Brazil"],"affiliations":[{"raw_affiliation_string":"Computing Department, Federal University of Piau\u00ed, Terezina, Piaui, 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":"Andr\u00e9 Soares","raw_affiliation_strings":["Computing Department, Federal University of Piau\u00ed, Terezina, Piaui, Brazil"],"affiliations":[{"raw_affiliation_string":"Computing Department, Federal University of Piau\u00ed, Terezina, Piaui, 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 Rab\u00ealo","raw_affiliation_strings":["Computing Department, Federal University of Piau\u00ed, Terezina, Piaui, Brazil"],"affiliations":[{"raw_affiliation_string":"Computing Department, Federal University of Piau\u00ed, Terezina, Piaui, 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":["School of Systems and Information Engineering, University of Tsukuba, Tsukuba, Ibaraki, Japan"],"affiliations":[{"raw_affiliation_string":"School of Systems and Information Engineering, University of Tsukuba, 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":1.1176,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.81610739,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"6","issue":"4","first_page":"231","last_page":"242"},"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.9958999752998352,"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.7981996536254883},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.784325122833252},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6334651708602905},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6246435046195984},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.58675616979599},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5846980214118958},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.5445261001586914},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.49794769287109375},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4865116477012634},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.4802004098892212},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.45395252108573914},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.42931652069091797},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4240201711654663},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.4143671691417694},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34346216917037964},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2604501247406006},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.2418288290500641},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.15492668747901917},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10610058903694153},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.0861453115940094}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7981996536254883},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.784325122833252},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6334651708602905},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6246435046195984},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.58675616979599},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5846980214118958},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5445261001586914},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49794769287109375},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4865116477012634},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.4802004098892212},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.45395252108573914},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.42931652069091797},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4240201711654663},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.4143671691417694},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34346216917037964},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2604501247406006},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.2418288290500641},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.15492668747901917},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10610058903694153},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0861453115940094},{"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/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"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.1515/jaiscr-2016-0017","is_oa":true,"landing_page_url":"https://doi.org/10.1515/jaiscr-2016-0017","pdf_url":"https://sciendo.com/pdf/10.1515/jaiscr-2016-0017","source":{"id":"https://openalex.org/S4210223945","display_name":"Journal of Artificial Intelligence and Soft Computing Research","issn_l":"2083-2567","issn":["2083-2567","2449-6499"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310317241","host_organization_name":"Polish Neural Network Society, the University of Social Sciences in Lodz & Czestochowa University of Technology","host_organization_lineage":["https://openalex.org/P4310317241"],"host_organization_lineage_names":["Polish Neural Network Society, the University of Social Sciences in Lodz & Czestochowa University of Technology"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Artificial Intelligence and Soft Computing Research","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1515/jaiscr-2016-0017","is_oa":true,"landing_page_url":"https://doi.org/10.1515/jaiscr-2016-0017","pdf_url":"https://sciendo.com/pdf/10.1515/jaiscr-2016-0017","source":{"id":"https://openalex.org/S4210223945","display_name":"Journal of Artificial Intelligence and Soft Computing Research","issn_l":"2083-2567","issn":["2083-2567","2449-6499"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310317241","host_organization_name":"Polish Neural Network Society, the University of Social Sciences in Lodz & Czestochowa University of Technology","host_organization_lineage":["https://openalex.org/P4310317241"],"host_organization_lineage_names":["Polish Neural Network Society, the University of Social Sciences in Lodz & Czestochowa University of Technology"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Artificial Intelligence and Soft Computing Research","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.8199999928474426,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2750754474.pdf","grobid_xml":"https://content.openalex.org/works/W2750754474.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W1488964931","https://openalex.org/W1526455201","https://openalex.org/W1573676079","https://openalex.org/W1576426930","https://openalex.org/W1845345803","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/W4285092328","https://openalex.org/W4292083457"],"related_works":["https://openalex.org/W2375775343","https://openalex.org/W2198982833","https://openalex.org/W4293054712","https://openalex.org/W2523719706","https://openalex.org/W2368964068","https://openalex.org/W2161960576","https://openalex.org/W2030169809","https://openalex.org/W4307561361","https://openalex.org/W2360981904","https://openalex.org/W2366342492"],"abstract_inverted_index":{"Abstract":[0],"This":[1],"paper":[2,68],"presents":[3],"an":[4,70,89],"attempt":[5,79],"to":[6,33,44,80],"solve":[7],"the":[8,12,16,50,54,60,82,92,120,127],"problem":[9,51],"of":[10,19,36,40,47,52,72,84,99],"choosing":[11],"best":[13],"combination":[14],"among":[15],"M":[17],"combinations":[18],"shortest":[20,42,55],"paths":[21,43],"in":[22,66,88,96,106,114],"optical":[23],"translucent":[24],"networks.":[25],"Fixed":[26],"routing":[27],"algorithms":[28],"demands":[29],"a":[30],"single":[31],"route":[32,107],"each":[34],"pair":[35],"nodes.":[37],"The":[38,63],"existence":[39],"multiple":[41],"some":[45],"pairs":[46],"nodes":[48],"originates":[49],"choose":[53],"path":[56],"which":[57],"fits":[58,87],"better":[59,103,124],"network":[61,93],"requests.":[62],"algorithm":[64,122],"proposed":[65,121],"this":[67],"is":[69,112],"adaptation":[71],"Ant":[73],"Colony":[74],"Optimization":[75],"(ACO)":[76],"metaheuristic":[77],"and":[78,102,119],"define":[81],"set":[83],"routes":[85],"that":[86],"optimized":[90],"way":[91],"conditions,":[94],"resulting":[95],"reduced":[97],"number":[98],"blocked":[100],"requests":[101],"adjusted":[104],"justice":[105],"distribution.":[108],"A":[109],"performance":[110,125],"evaluation":[111],"conducted":[113],"real":[115],"topologies":[116],"by":[117],"simulations,":[118],"shows":[123],"between":[126],"compared":[128],"algorithms.":[129]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":5}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}