{"id":"https://openalex.org/W3088480499","doi":"https://doi.org/10.1007/s10766-021-00714-1","title":"High-Level Parallel Ant Colony Optimization with Algorithmic Skeletons","display_name":"High-Level Parallel Ant Colony Optimization with Algorithmic Skeletons","publication_year":2021,"publication_date":"2021-04-29","ids":{"openalex":"https://openalex.org/W3088480499","doi":"https://doi.org/10.1007/s10766-021-00714-1","mag":"3088480499"},"language":"en","primary_location":{"id":"doi:10.1007/s10766-021-00714-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10766-021-00714-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10766-021-00714-1.pdf","source":{"id":"https://openalex.org/S148521650","display_name":"International Journal of Parallel Programming","issn_l":"0885-7458","issn":["0885-7458","1573-7640"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Parallel Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10766-021-00714-1.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5062336564","display_name":"Breno Augusto de Melo Menezes","orcid":"https://orcid.org/0000-0002-7010-7482"},"institutions":[{"id":"https://openalex.org/I22465464","display_name":"University of M\u00fcnster","ror":"https://ror.org/00pd74e08","country_code":"DE","type":"education","lineage":["https://openalex.org/I22465464"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Breno A. de Melo Menezes","raw_affiliation_strings":["University of M\u00fcnster, Leonardo-Campus 3, 48149, M\u00fcnster, Germany"],"raw_orcid":"https://orcid.org/0000-0002-7010-7482","affiliations":[{"raw_affiliation_string":"University of M\u00fcnster, Leonardo-Campus 3, 48149, M\u00fcnster, Germany","institution_ids":["https://openalex.org/I22465464"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039819967","display_name":"Nina Herrmann","orcid":null},"institutions":[{"id":"https://openalex.org/I22465464","display_name":"University of M\u00fcnster","ror":"https://ror.org/00pd74e08","country_code":"DE","type":"education","lineage":["https://openalex.org/I22465464"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Nina Herrmann","raw_affiliation_strings":["University of M\u00fcnster, Leonardo-Campus 3, 48149, M\u00fcnster, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of M\u00fcnster, Leonardo-Campus 3, 48149, M\u00fcnster, Germany","institution_ids":["https://openalex.org/I22465464"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048747275","display_name":"Herbert Kuchen","orcid":"https://orcid.org/0000-0002-6057-3551"},"institutions":[{"id":"https://openalex.org/I22465464","display_name":"University of M\u00fcnster","ror":"https://ror.org/00pd74e08","country_code":"DE","type":"education","lineage":["https://openalex.org/I22465464"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Herbert Kuchen","raw_affiliation_strings":["University of M\u00fcnster, Leonardo-Campus 3, 48149, M\u00fcnster, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of M\u00fcnster, Leonardo-Campus 3, 48149, M\u00fcnster, Germany","institution_ids":["https://openalex.org/I22465464"]}]},{"author_position":"last","author":{"id":null,"display_name":"Fernando Buarque de Lima Neto","orcid":null},"institutions":[{"id":"https://openalex.org/I71437568","display_name":"Universidade de Pernambuco","ror":"https://ror.org/00gtcbp88","country_code":"BR","type":"education","lineage":["https://openalex.org/I71437568"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Fernando Buarque de Lima Neto","raw_affiliation_strings":["University of Pernambuco, Rua Benfica ,455, 50720-001, Recife, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Pernambuco, Rua Benfica ,455, 50720-001, Recife, Brazil","institution_ids":["https://openalex.org/I71437568"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5062336564"],"corresponding_institution_ids":["https://openalex.org/I22465464"],"apc_list":{"value":2780,"currency":"USD","value_usd":2780},"apc_paid":{"value":2780,"currency":"USD","value_usd":2780},"fwci":1.2619,"has_fulltext":true,"cited_by_count":11,"citation_normalized_percentile":{"value":0.82819479,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"49","issue":"6","first_page":"776","last_page":"801"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9994999766349792,"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.9994999766349792,"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.993399977684021,"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"}},{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9894000291824341,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8920553922653198},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7139994502067566},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.6289724111557007},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.6146009564399719},{"id":"https://openalex.org/keywords/cuda","display_name":"CUDA","score":0.5830665826797485},{"id":"https://openalex.org/keywords/parallel-programming-model","display_name":"Parallel programming model","score":0.5717635750770569},{"id":"https://openalex.org/keywords/programmer","display_name":"Programmer","score":0.5659505724906921},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.49232733249664307},{"id":"https://openalex.org/keywords/parallel-metaheuristic","display_name":"Parallel metaheuristic","score":0.49196550250053406},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.49052757024765015},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4843205511569977},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4270240366458893},{"id":"https://openalex.org/keywords/programming-paradigm","display_name":"Programming paradigm","score":0.40978649258613586},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.2795447111129761},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2700645625591278},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24955689907073975},{"id":"https://openalex.org/keywords/multi-swarm-optimization","display_name":"Multi-swarm optimization","score":0.09147343039512634}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8920553922653198},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7139994502067566},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6289724111557007},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.6146009564399719},{"id":"https://openalex.org/C2778119891","wikidata":"https://www.wikidata.org/wiki/Q477690","display_name":"CUDA","level":2,"score":0.5830665826797485},{"id":"https://openalex.org/C137364921","wikidata":"https://www.wikidata.org/wiki/Q27929394","display_name":"Parallel programming model","level":3,"score":0.5717635750770569},{"id":"https://openalex.org/C2778514511","wikidata":"https://www.wikidata.org/wiki/Q1374194","display_name":"Programmer","level":2,"score":0.5659505724906921},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.49232733249664307},{"id":"https://openalex.org/C28767586","wikidata":"https://www.wikidata.org/wiki/Q7135006","display_name":"Parallel metaheuristic","level":4,"score":0.49196550250053406},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.49052757024765015},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4843205511569977},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4270240366458893},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.40978649258613586},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2795447111129761},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2700645625591278},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24955689907073975},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.09147343039512634},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"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/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10766-021-00714-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10766-021-00714-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10766-021-00714-1.pdf","source":{"id":"https://openalex.org/S148521650","display_name":"International Journal of Parallel Programming","issn_l":"0885-7458","issn":["0885-7458","1573-7640"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Parallel Programming","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s10766-021-00714-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10766-021-00714-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10766-021-00714-1.pdf","source":{"id":"https://openalex.org/S148521650","display_name":"International Journal of Parallel Programming","issn_l":"0885-7458","issn":["0885-7458","1573-7640"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Parallel Programming","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.550000011920929}],"awards":[],"funders":[{"id":"https://openalex.org/F4320322957","display_name":"Westf\u00e4lische Wilhelms-Universit\u00e4t M\u00fcnster","ror":"https://ror.org/00pd74e08"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3088480499.pdf","grobid_xml":"https://content.openalex.org/works/W3088480499.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W1489689515","https://openalex.org/W1530490667","https://openalex.org/W1573676079","https://openalex.org/W1964884078","https://openalex.org/W2006359141","https://openalex.org/W2013067314","https://openalex.org/W2030951884","https://openalex.org/W2049967755","https://openalex.org/W2071828883","https://openalex.org/W2072143783","https://openalex.org/W2079350534","https://openalex.org/W2109469182","https://openalex.org/W2111686839","https://openalex.org/W2171211995","https://openalex.org/W2314061666","https://openalex.org/W2336894004","https://openalex.org/W2342137734","https://openalex.org/W2893243391","https://openalex.org/W2915832966","https://openalex.org/W2925007552","https://openalex.org/W2969047065","https://openalex.org/W2977553930","https://openalex.org/W4246565613","https://openalex.org/W4292083457"],"related_works":["https://openalex.org/W2032508741","https://openalex.org/W2363538625","https://openalex.org/W1570785333","https://openalex.org/W1177194838","https://openalex.org/W4236300446","https://openalex.org/W4297775710","https://openalex.org/W1937514268","https://openalex.org/W68587524","https://openalex.org/W2357113990","https://openalex.org/W2810639508"],"abstract_inverted_index":{"Abstract":[0],"Parallel":[1],"implementations":[2],"of":[3,38,112,116,133],"swarm":[4],"intelligence":[5],"algorithms":[6,40],"such":[7,39],"as":[8],"the":[9,20,58,104,110,131,140,145],"ant":[10],"colony":[11],"optimization":[12,26],"(ACO)":[13],"have":[14],"been":[15],"widely":[16],"used":[17],"to":[18,90,122,142,157],"shorten":[19],"execution":[21,153],"time":[22],"when":[23,155],"solving":[24],"complex":[25],"problems.":[27],"When":[28],"aiming":[29],"for":[30,51,139],"a":[31,45,113,123],"GPU":[32],"environment,":[33],"developing":[34],"efficient":[35,91],"parallel":[36,59,64,92,114],"versions":[37],"using":[41],"CUDA":[42],"can":[43],"be":[44,88],"difficult":[46],"and":[47,82,118],"error-prone":[48],"task":[49],"even":[50],"experienced":[52],"programmers.":[53],"To":[54],"overcome":[55],"this":[56,95],"issue,":[57],"programming":[60,77],"model":[61],"ofAlgorithmic":[62],"Skeletonssimplifies":[63],"programs":[65],"by":[66,74],"abstracting":[67],"from":[68],"low-level":[69,124,158],"features.":[70],"This":[71],"is":[72],"realized":[73],"defining":[75],"common":[76],"patterns":[78],"(e.g.":[79],"map,":[80],"fold":[81],"zip)":[83],"that":[84,120],"later":[85],"on":[86],"will":[87],"converted":[89],"code.":[93],"In":[94],"paper,":[96],"we":[97],"show":[98,129],"how":[99,119],"algorithmic":[100],"skeletons":[101],"formulated":[102],"in":[103],"domain":[105],"specific":[106],"languageMusketcan":[107],"cope":[108],"with":[109,144,151],"development":[111,132],"implementation":[115],"ACO":[117],"compares":[121],"implementation.":[125],"Our":[126],"experimental":[127],"results":[128],"thatMusketsuits":[130],"ACO.":[134],"Besides":[135],"making":[136],"it":[137],"easier":[138],"programmer":[141],"deal":[143],"parallelization":[146],"aspects,Musketgenerates":[147],"high":[148],"performance":[149],"code":[150],"similar":[152],"times":[154],"compared":[156],"implementations.":[159]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":3}],"updated_date":"2026-08-28T12:50:07.497085","created_date":"2025-10-10T00:00:00"}