{"id":"https://openalex.org/W2896150848","doi":"https://doi.org/10.1109/cec.2018.8477958","title":"MACO/NDS: Many-objective Ant Colony Optimization based on Non-Dominated Sets","display_name":"MACO/NDS: Many-objective Ant Colony Optimization based on Non-Dominated Sets","publication_year":2018,"publication_date":"2018-07-01","ids":{"openalex":"https://openalex.org/W2896150848","doi":"https://doi.org/10.1109/cec.2018.8477958","mag":"2896150848"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2018.8477958","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2018.8477958","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5059182034","display_name":"Tiago P. Franca","orcid":null},"institutions":[{"id":"https://openalex.org/I80850581","display_name":"Universidade Federal de Uberl\u00e2ndia","ror":"https://ror.org/04x3wvr31","country_code":"BR","type":"education","lineage":["https://openalex.org/I80850581"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Tiago P. Franca","raw_affiliation_strings":["Faculty of Computing, Universidade Federal of Uberl\u00e2ndia, Uberl\u00e2ndia, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Computing, Universidade Federal of Uberl\u00e2ndia, Uberl\u00e2ndia, Brazil","institution_ids":["https://openalex.org/I80850581"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050683191","display_name":"Luiz G. A. Martins","orcid":"https://orcid.org/0000-0003-0168-1293"},"institutions":[{"id":"https://openalex.org/I80850581","display_name":"Universidade Federal de Uberl\u00e2ndia","ror":"https://ror.org/04x3wvr31","country_code":"BR","type":"education","lineage":["https://openalex.org/I80850581"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Luiz G. A. Martins","raw_affiliation_strings":["Faculty of Computing, Universidade Federal of Uberl\u00e2ndia, Uberl\u00e2ndia, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Computing, Universidade Federal of Uberl\u00e2ndia, Uberl\u00e2ndia, Brazil","institution_ids":["https://openalex.org/I80850581"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072385058","display_name":"Gina M. B. Oliveira","orcid":"https://orcid.org/0000-0003-0384-1879"},"institutions":[{"id":"https://openalex.org/I80850581","display_name":"Universidade Federal de Uberl\u00e2ndia","ror":"https://ror.org/04x3wvr31","country_code":"BR","type":"education","lineage":["https://openalex.org/I80850581"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Gina M. B. Oliveira","raw_affiliation_strings":["Faculty of Computing, Universidade Federal of Uberl\u00e2ndia, Uberl\u00e2ndia, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Computing, Universidade Federal of Uberl\u00e2ndia, Uberl\u00e2ndia, Brazil","institution_ids":["https://openalex.org/I80850581"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I80850581"],"apc_list":null,"apc_paid":null,"fwci":2.2235,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.88774573,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":1.0,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9994000196456909,"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"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9617999792098999,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/knapsack-problem","display_name":"Knapsack problem","score":0.8339637517929077},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.7762941718101501},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6689581871032715},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5815541744232178},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.5464296936988831},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5126906633377075},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.48006996512413025},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.47099488973617554},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4305207133293152},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.41927337646484375},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.41577261686325073},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2791369557380676}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8339637517929077},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.7762941718101501},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6689581871032715},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5815541744232178},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.5464296936988831},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5126906633377075},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.48006996512413025},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.47099488973617554},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4305207133293152},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.41927337646484375},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.41577261686325073},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2791369557380676},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2018.8477958","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2018.8477958","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W1542338970","https://openalex.org/W1557288165","https://openalex.org/W1566652554","https://openalex.org/W1801849579","https://openalex.org/W1971968148","https://openalex.org/W1986948093","https://openalex.org/W1988739252","https://openalex.org/W2022485595","https://openalex.org/W2049236369","https://openalex.org/W2049464771","https://openalex.org/W2073478661","https://openalex.org/W2085606854","https://openalex.org/W2106334424","https://openalex.org/W2107941094","https://openalex.org/W2126105956","https://openalex.org/W2127459836","https://openalex.org/W2134509774","https://openalex.org/W2142978187","https://openalex.org/W2143381319","https://openalex.org/W2144984342","https://openalex.org/W2165613966","https://openalex.org/W2169999261","https://openalex.org/W2586638091","https://openalex.org/W2747181174","https://openalex.org/W2755902504","https://openalex.org/W2782676112","https://openalex.org/W2994964425","https://openalex.org/W3016885447","https://openalex.org/W4285719527","https://openalex.org/W4288280365","https://openalex.org/W4299796063","https://openalex.org/W6633364091","https://openalex.org/W6662792722","https://openalex.org/W6671902217","https://openalex.org/W6684567676","https://openalex.org/W6743016112","https://openalex.org/W6771627385"],"related_works":["https://openalex.org/W1992758684","https://openalex.org/W1611875833","https://openalex.org/W1607218372","https://openalex.org/W1547053391","https://openalex.org/W1521781013","https://openalex.org/W1975009952","https://openalex.org/W2462483068","https://openalex.org/W1588949866","https://openalex.org/W46882622","https://openalex.org/W4375949242"],"abstract_inverted_index":{"A":[0],"new":[1,61,98],"model":[2,76,99],"for":[3,44,121],"many-objective":[4,106],"optimization":[5,123],"based":[6,69],"on":[7,70],"ant":[8,36],"colony":[9],"is":[10,140],"presented.":[11],"It":[12],"decomposes":[13],"a":[14,150],"domain":[15],"with":[16,21,102,144,153],"several":[17],"objectives":[18],"into":[19],"subdomains":[20],"pairs,":[22],"triples":[23],"and":[24,88,109,118,132],"n-tuples":[25],"of":[26,41,56,96],"objectives.":[27],"Pheromone":[28],"structures":[29],"related":[30],"to":[31,52,113,148],"each":[32],"subdomain":[33],"guide":[34],"the":[35,39,45,50,53,57,83,89,97,103,114,138],"population":[37],"in":[38,79,111,130,156],"construction":[40],"non-dominated":[42],"solutions":[43],"different":[46],"multiobjective":[47,84],"subproblems,":[48],"increasing":[49],"convergence":[51],"Pareto":[54],"Optimal":[55],"original":[58],"problem.":[59],"The":[60,74,94,134],"algorithm":[62,152],"was":[63,77,100],"called":[64],"Many-objective":[65],"Ant":[66],"Colony":[67],"Optimization":[68],"Non-Dominated":[71],"Sets":[72],"(MACO/NDS).":[73],"proposed":[75,120],"evaluated":[78,129],"two":[80],"discrete":[81,122],"challenges:":[82],"knapsack":[85],"problem":[86,92],"(MKP)":[87],"multicast":[90],"routing":[91],"(MRP).":[93],"performance":[95],"confronted":[101],"widely":[104],"known":[105],"algorithms":[107],"MOEA/D":[108],"NSGA-III,":[110],"addition":[112],"evolutionary":[115],"models":[116],"MEAMT":[117],"MEANDS":[119],"problems":[124],"that":[125,137],"have":[126],"also":[127],"been":[128],"MKP":[131],"MRP.":[133],"results":[135,155],"show":[136],"MACO/NDS":[139],"competitive":[141],"using":[142],"instances":[143],"4-6":[145],"objectives,":[146],"proving":[147],"be":[149],"stable":[151],"good":[154],"both":[157],"problems.":[158]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}