{"id":"https://openalex.org/W2148888221","doi":"https://doi.org/10.1109/ispdc.2004.37","title":"Parallel Framework for Ant-Like Algorithms","display_name":"Parallel Framework for Ant-Like Algorithms","publication_year":2005,"publication_date":"2005-04-05","ids":{"openalex":"https://openalex.org/W2148888221","doi":"https://doi.org/10.1109/ispdc.2004.37","mag":"2148888221"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/ispdc.2004.37","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5035941718","display_name":"Mitic\u0103 Craus","orcid":"https://orcid.org/0000-0002-4136-9387"},"institutions":[{"id":"https://openalex.org/I4210108695","display_name":"Gheorghe Asachi Technical University of Ia\u0219i","ror":"https://ror.org/014zxnz40","country_code":"RO","type":"education","lineage":["https://openalex.org/I4210108695"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"M. Craus","raw_affiliation_strings":["Department of Computer Engineering, Gheorghe Asachi Technical University of Iasi, Iasi, Romania"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Gheorghe Asachi Technical University of Iasi, Iasi, Romania","institution_ids":["https://openalex.org/I4210108695"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071496915","display_name":"Lauren\u0163iu Rudeanu","orcid":null},"institutions":[{"id":"https://openalex.org/I4210108695","display_name":"Gheorghe Asachi Technical University of Ia\u0219i","ror":"https://ror.org/014zxnz40","country_code":"RO","type":"education","lineage":["https://openalex.org/I4210108695"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"L. Rudeanu","raw_affiliation_strings":["Department of Computer Engineering, Gheorghe Asachi Technical University of Iasi, Iasi, Romania"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Gheorghe Asachi Technical University of Iasi, Iasi, Romania","institution_ids":["https://openalex.org/I4210108695"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":12,"citation_normalized_percentile":{"value":0.753218,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":83,"max":84},"biblio":{"volume":null,"issue":null,"first_page":"36","last_page":"41"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998,"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.9998,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9983,"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"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9975,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.7373285},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.5345117},{"id":"https://openalex.org/keywords/parallel-metaheuristic","display_name":"Parallel metaheuristic","score":0.4709008},{"id":"https://openalex.org/keywords/parallel-processing","display_name":"Parallel processing","score":0.45296788}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.82864237},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.77543783},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.7373285},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6282047},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5857254},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.56763005},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.5345117},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.53138536},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48754498},{"id":"https://openalex.org/C28767586","wikidata":"https://www.wikidata.org/wiki/Q7135006","display_name":"Parallel metaheuristic","level":4,"score":0.4709008},{"id":"https://openalex.org/C106515295","wikidata":"https://www.wikidata.org/wiki/Q26806595","display_name":"Parallel processing","level":2,"score":0.45296788},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.42709404},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.36184603},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.26196176},{"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/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/ispdc.2004.37","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":9,"referenced_works":["https://openalex.org/W117128401","https://openalex.org/W1486125668","https://openalex.org/W1504935863","https://openalex.org/W1545046546","https://openalex.org/W1607240485","https://openalex.org/W1941416453","https://openalex.org/W2118051273","https://openalex.org/W2154929945","https://openalex.org/W2297395784"],"related_works":["https://openalex.org/W68587524","https://openalex.org/W49536250","https://openalex.org/W2900531744","https://openalex.org/W2585645223","https://openalex.org/W2462483068","https://openalex.org/W2394153495","https://openalex.org/W2357113990","https://openalex.org/W2139419501","https://openalex.org/W2070079705","https://openalex.org/W1868850794"],"abstract_inverted_index":{"This":[0],"paper":[1],"describes":[2],"the":[3,14,34,44,67,85,101,120],"work":[4,86],"of":[5,16,19,119],"an":[6],"objective":[7],"framework":[8,54,68,99,122],"designed":[9],"to":[10,50,80,90,124],"be":[11,70,88,91],"used":[12,71],"in":[13,60,76,82],"parallelization":[15],"a":[17,23,26,52,61,109],"set":[18],"related":[20],"algorithms.":[21],"As":[22],"concrete":[24],"application":[25],"parallel":[27,62,98,121],"ant":[28],"colony":[29],"optimization":[30],"algorithm":[31],"(ACO)":[32],"for":[33,55,114],"travelling":[35],"salesman":[36],"problem":[37],"(TSP)":[38],"is":[39,49,106],"presented.":[40],"The":[41,64,97,112],"idea":[42],"behind":[43],"system":[45],"we":[46],"are":[47],"describing":[48],"have":[51,73,79,125],"reusable":[53],"running":[56],"several":[57,74,94],"sequential":[58],"algorithms":[59,65],"environment.":[63],"that":[66],"can":[69],"with":[72],"things":[75],"common:":[77],"they":[78],"run":[81],"cycles":[83],"and":[84,105,131],"should":[87],"possible":[89],"split":[92],"between":[93],"\"processing":[95],"units\".":[96],"uses":[100],"message-passing":[102],"communication":[103,133],"paradigm":[104],"organized":[107],"as":[108],"master-slave":[110],"system.":[111],"ACO":[113],"TSP":[115],"implemented":[116],"by":[117],"means":[118],"proves":[123],"good":[126],"performances:":[127],"approximately":[128],"linear":[129],"speedup":[130],"low":[132],"cost.":[134]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2148888221","counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2024-12-07T16:48:19.874620","created_date":"2016-06-24"}
