{"id":"https://openalex.org/W2151944388","doi":"https://doi.org/10.1109/sccc.2005.1587873","title":"Parallel strategies for a multi-criteria GRASP algorithm","display_name":"Parallel strategies for a multi-criteria GRASP algorithm","publication_year":2006,"publication_date":"2006-02-06","ids":{"openalex":"https://openalex.org/W2151944388","doi":"https://doi.org/10.1109/sccc.2005.1587873","mag":"2151944388"},"language":"en","primary_location":{"id":"doi:10.1109/sccc.2005.1587873","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sccc.2005.1587873","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"XXV International Conference of the Chilean Computer Science Society (SCCC'05)","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/A5073182474","display_name":"Dalessandro Soares Vianna","orcid":"https://orcid.org/0000-0003-0388-4131"},"institutions":[{"id":"https://openalex.org/I47548798","display_name":"Universidade Candido Mendes","ror":"https://ror.org/011tj4033","country_code":"BR","type":"education","lineage":["https://openalex.org/I47548798"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"D.S. Vianna","raw_affiliation_strings":["Nucleo de Pesquisa e Desenvolvimento em Inform\u00e1tica-NPDI, Universidade Candido Mendes-UCAM-Campos, Campos Dos Goytacazes, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nucleo de Pesquisa e Desenvolvimento em Inform\u00e1tica-NPDI, Universidade Candido Mendes-UCAM-Campos, Campos Dos Goytacazes, Brazil","institution_ids":["https://openalex.org/I47548798"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048750231","display_name":"Jos\u00e9 Elias Claudio Arroyo","orcid":"https://orcid.org/0000-0003-3403-4770"},"institutions":[{"id":"https://openalex.org/I47548798","display_name":"Universidade Candido Mendes","ror":"https://ror.org/011tj4033","country_code":"BR","type":"education","lineage":["https://openalex.org/I47548798"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"J.E.C. Arroyo","raw_affiliation_strings":["Nucleo de Pesquisa e Desenvolvimento em Inform\u00e1tica-NPDI, Universidade Candido Mendes-UCAM-Campos, Campos Dos Goytacazes, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nucleo de Pesquisa e Desenvolvimento em Inform\u00e1tica-NPDI, Universidade Candido Mendes-UCAM-Campos, Campos Dos Goytacazes, Brazil","institution_ids":["https://openalex.org/I47548798"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043633312","display_name":"Pedro Sampaio Vieira","orcid":null},"institutions":[{"id":"https://openalex.org/I47548798","display_name":"Universidade Candido Mendes","ror":"https://ror.org/011tj4033","country_code":"BR","type":"education","lineage":["https://openalex.org/I47548798"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"P.S. Vieira","raw_affiliation_strings":["Nucleo de Pesquisa e Desenvolvimento em Inform\u00e1tica-NPDI, Universidade Candido Mendes-UCAM-Campos, Campos Dos Goytacazes, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nucleo de Pesquisa e Desenvolvimento em Inform\u00e1tica-NPDI, Universidade Candido Mendes-UCAM-Campos, Campos Dos Goytacazes, Brazil","institution_ids":["https://openalex.org/I47548798"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030917128","display_name":"Thiago Ribeiro de Azeredo","orcid":null},"institutions":[{"id":"https://openalex.org/I47548798","display_name":"Universidade Candido Mendes","ror":"https://ror.org/011tj4033","country_code":"BR","type":"education","lineage":["https://openalex.org/I47548798"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"T.R. de Azeredo","raw_affiliation_strings":["Nucleo de Pesquisa e Desenvolvimento em Inform\u00e1tica-NPDI, Universidade Candido Mendes-UCAM-Campos, Campos Dos Goytacazes, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nucleo de Pesquisa e Desenvolvimento em Inform\u00e1tica-NPDI, Universidade Candido Mendes-UCAM-Campos, Campos Dos Goytacazes, Brazil","institution_ids":["https://openalex.org/I47548798"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I47548798"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.14023137,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"1993","issue":null,"first_page":"116","last_page":"122"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9997000098228455,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9973000288009644,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/grasp","display_name":"GRASP","score":0.9020978212356567},{"id":"https://openalex.org/keywords/greedy-randomized-adaptive-search-procedure","display_name":"Greedy randomized adaptive search procedure","score":0.7301235795021057},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.709561824798584},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5612605810165405},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.548895001411438},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.5446840524673462},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5256881713867188},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4869004786014557},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.45840197801589966},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.42235758900642395},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3534519672393799},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21244433522224426},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.08146288990974426}],"concepts":[{"id":"https://openalex.org/C171268870","wikidata":"https://www.wikidata.org/wiki/Q1486676","display_name":"GRASP","level":2,"score":0.9020978212356567},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.7301235795021057},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.709561824798584},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5612605810165405},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.548895001411438},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.5446840524673462},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5256881713867188},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4869004786014557},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.45840197801589966},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.42235758900642395},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3534519672393799},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21244433522224426},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.08146288990974426},{"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/sccc.2005.1587873","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sccc.2005.1587873","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"XXV International Conference of the Chilean Computer Science Society (SCCC'05)","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":23,"referenced_works":["https://openalex.org/W90390084","https://openalex.org/W1497256448","https://openalex.org/W1498176410","https://openalex.org/W1500096139","https://openalex.org/W1528711985","https://openalex.org/W1948148225","https://openalex.org/W1965680834","https://openalex.org/W1981456160","https://openalex.org/W1985130949","https://openalex.org/W1991632843","https://openalex.org/W2008581797","https://openalex.org/W2009883530","https://openalex.org/W2024060531","https://openalex.org/W2077823485","https://openalex.org/W2083743691","https://openalex.org/W2090275183","https://openalex.org/W2130651948","https://openalex.org/W2131069987","https://openalex.org/W2339500526","https://openalex.org/W2997776631","https://openalex.org/W4212899374","https://openalex.org/W4255306344","https://openalex.org/W6630030232"],"related_works":["https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W2381121915","https://openalex.org/W2099915933","https://openalex.org/W2390742649","https://openalex.org/W2387385213","https://openalex.org/W1703428550","https://openalex.org/W3116169590","https://openalex.org/W2360026231","https://openalex.org/W2353822696"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"different":[3,75,91],"strategies":[4,76,93],"of":[5,37,44,67,82],"parallelizing":[6],"a":[7,35,65],"multi-criteria":[8,24,86],"GRASP":[9,18,87],"(greedy":[10],"randomized":[11],"adaptive":[12],"search":[13],"problem)":[14],"algorithm.":[15],"The":[16,85,114],"parallel":[17,92,121],"algorithm":[19,88],"is":[20,30,39,50],"applied":[21],"to":[22,51,77],"the":[23,45,48,54,79,90,119,124,128,132],"minimum":[25],"spanning":[26,59],"tree":[27],"problem,":[28,34],"which":[29],"NP-hard.":[31],"In":[32],"this":[33],"vector":[36],"costs":[38],"defined":[40],"for":[41],"each":[42],"edge":[43],"graph":[46],"and":[47,104,107,111,127],"goal":[49],"find":[52],"all":[53],"efficient":[55,68,83],"or":[56],"Pareto":[57],"optimal":[58],"trees":[60],"(solutions).":[61],"Each":[62],"process":[63],"finds":[64],"subset":[66],"solutions.":[69,84],"These":[70],"subsets":[71],"are":[72,94],"joined":[73],"using":[74],"obtain":[78],"final":[80],"set":[81],"with":[89,99],"tested":[95],"on":[96],"complete":[97],"graphs":[98],"n":[100],"=":[101,109],"20,":[102],"30":[103],"50":[105],"nodes":[106],"r":[108],"2":[110],"3":[112],"criteria.":[113],"computational":[115],"results":[116,129],"show":[117],"that":[118],"proposed":[120],"algorithms":[122],"reduce":[123],"execution":[125],"time":[126],"obtained":[130],"by":[131],"sequential":[133],"version":[134],"were":[135],"improved.":[136]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}