{"id":"https://openalex.org/W3136502809","doi":"https://doi.org/10.1109/ccwc51732.2021.9376177","title":"Exploring Trade-offs in Parallel Beam-ACO","display_name":"Exploring Trade-offs in Parallel Beam-ACO","publication_year":2021,"publication_date":"2021-01-27","ids":{"openalex":"https://openalex.org/W3136502809","doi":"https://doi.org/10.1109/ccwc51732.2021.9376177","mag":"3136502809"},"language":"en","primary_location":{"id":"doi:10.1109/ccwc51732.2021.9376177","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccwc51732.2021.9376177","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE 11th Annual Computing and Communication Workshop and Conference (CCWC)","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/A5045581483","display_name":"Jeff Hajewski","orcid":null},"institutions":[{"id":"https://openalex.org/I4210155268","display_name":"Salesforce (United States)","ror":"https://ror.org/057315g56","country_code":"US","type":"company","lineage":["https://openalex.org/I4210155268"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jeff Hajewski","raw_affiliation_strings":["Salesforce"],"affiliations":[{"raw_affiliation_string":"Salesforce","institution_ids":["https://openalex.org/I4210155268"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090034482","display_name":"Suely Oliveira","orcid":"https://orcid.org/0000-0003-4987-5353"},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Suely Oliveira","raw_affiliation_strings":["Department of Computer Science, University of Iowa"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Iowa","institution_ids":["https://openalex.org/I126307644"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012054089","display_name":"David E. Stewart","orcid":"https://orcid.org/0000-0002-7453-6268"},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David E. Stewart","raw_affiliation_strings":["Department of Mathematics, University of Iowa"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Iowa","institution_ids":["https://openalex.org/I126307644"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031188254","display_name":"Laura Weiler","orcid":"https://orcid.org/0000-0003-0208-452X"},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Laura Weiler","raw_affiliation_strings":["Department of Computer Science, University of Iowa"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Iowa","institution_ids":["https://openalex.org/I126307644"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5045581483"],"corresponding_institution_ids":["https://openalex.org/I4210155268"],"apc_list":null,"apc_paid":null,"fwci":0.2965,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.61968282,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1525","last_page":"1534"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9995999932289124,"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/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.9921000003814697,"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8138455748558044},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.7438963651657104},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.6401585936546326},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.629932701587677},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.615863561630249},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.6110778450965881},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5313359498977661},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.511258602142334},{"id":"https://openalex.org/keywords/parallel-metaheuristic","display_name":"Parallel metaheuristic","score":0.49073469638824463},{"id":"https://openalex.org/keywords/beam","display_name":"Beam (structure)","score":0.47858619689941406},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40350741147994995},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.33832496404647827},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2485974133014679},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.24473091959953308},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.08803042769432068},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07672891020774841},{"id":"https://openalex.org/keywords/optics","display_name":"Optics","score":0.072996586561203}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8138455748558044},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.7438963651657104},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.6401585936546326},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.629932701587677},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.615863561630249},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.6110778450965881},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5313359498977661},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.511258602142334},{"id":"https://openalex.org/C28767586","wikidata":"https://www.wikidata.org/wiki/Q7135006","display_name":"Parallel metaheuristic","level":4,"score":0.49073469638824463},{"id":"https://openalex.org/C168834538","wikidata":"https://www.wikidata.org/wiki/Q3705329","display_name":"Beam (structure)","level":2,"score":0.47858619689941406},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40350741147994995},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.33832496404647827},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2485974133014679},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.24473091959953308},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.08803042769432068},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07672891020774841},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.072996586561203},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ccwc51732.2021.9376177","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccwc51732.2021.9376177","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE 11th Annual Computing and Communication Workshop and Conference (CCWC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.6299999952316284,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1492640216","https://openalex.org/W1521114792","https://openalex.org/W1558817001","https://openalex.org/W1571087346","https://openalex.org/W1591000087","https://openalex.org/W1717440967","https://openalex.org/W1979144412","https://openalex.org/W1988888548","https://openalex.org/W1997585121","https://openalex.org/W2016559894","https://openalex.org/W2021066071","https://openalex.org/W2029319864","https://openalex.org/W2029681015","https://openalex.org/W2063769328","https://openalex.org/W2071828883","https://openalex.org/W2097377813","https://openalex.org/W2154815356","https://openalex.org/W2163428398","https://openalex.org/W2182388272","https://openalex.org/W2345839474","https://openalex.org/W2533998425","https://openalex.org/W2569538334","https://openalex.org/W2591732941","https://openalex.org/W3046898490"],"related_works":["https://openalex.org/W4385871958","https://openalex.org/W1611875833","https://openalex.org/W4236055036","https://openalex.org/W4245157707","https://openalex.org/W1997193297","https://openalex.org/W1547053391","https://openalex.org/W1521781013","https://openalex.org/W1588949866","https://openalex.org/W1975009952","https://openalex.org/W46882622"],"abstract_inverted_index":{"The":[0],"Traveling":[1],"Salesman":[2],"Problem":[3],"is":[4,10,30,44,55,100,114],"a":[5,70],"conceptually":[6],"simple":[7],"problem":[8],"that":[9,36,98,110],"computationally":[11,57],"difficult":[12],"due":[13],"to":[14],"the":[15,18,25,60,84,104],"size":[16],"of":[17,27,73,103],"search":[19,86],"space,":[20],"which":[21],"grows":[22],"factorially":[23],"with":[24,40],"number":[26],"cities.":[28],"Beam-ACO":[29,43,74,80,99,113],"an":[31],"Ant":[32],"Colony":[33],"Optimization":[34],"heuristic":[35],"combines":[37],"classical":[38,62],"ACO":[39,63,107],"beam":[41,88],"search.":[42],"quite":[45],"effective":[46,106],"at":[47],"finding":[48],"high":[49],"quality":[50],"approximate":[51],"solutions":[52],"but":[53],"it":[54],"more":[56,61,117],"demanding":[58],"than":[59,116],"algorithms.":[64],"In":[65],"this":[66],"work":[67],"we":[68],"propose":[69],"parallel":[71,79,112],"version":[72],"based":[75],"on":[76],"work-stealing.":[77],"Our":[78,94],"algorithm":[81],"runs":[82],"both":[83,97],"ant":[85,125],"and":[87,90,109],"evaluation":[89],"pruning":[91],"in":[92],"parallel.":[93,126],"experiments":[95],"verify":[96],"indeed":[101],"one":[102],"most":[105],"metaheuristics":[108],"our":[111],"faster":[115],"traditional":[118],"parallelization":[119],"schemes":[120],"such":[121],"as":[122],"multi-colony":[123],"or":[124]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}