{"id":"https://openalex.org/W2014278403","doi":"https://doi.org/10.1109/sis.2013.6615155","title":"A MapReduce based glowworm swarm optimization approach for multimodal functions","display_name":"A MapReduce based glowworm swarm optimization approach for multimodal functions","publication_year":2013,"publication_date":"2013-04-01","ids":{"openalex":"https://openalex.org/W2014278403","doi":"https://doi.org/10.1109/sis.2013.6615155","mag":"2014278403"},"language":"en","primary_location":{"id":"doi:10.1109/sis.2013.6615155","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sis.2013.6615155","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Symposium on Swarm Intelligence (SIS)","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/A5023882029","display_name":"Ibrahim Aljarah","orcid":"https://orcid.org/0000-0002-9265-9819"},"institutions":[{"id":"https://openalex.org/I57328836","display_name":"North Dakota State University","ror":"https://ror.org/05h1bnb22","country_code":"US","type":"education","lineage":["https://openalex.org/I57328836"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ibrahim Aljarah","raw_affiliation_strings":["Department of Computer Science, North Dakota State University, Fargo, ND, USA","Department of Computer Science, North Dakota State University, Fargo , ND, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, North Dakota State University, Fargo, ND, USA","institution_ids":["https://openalex.org/I57328836"]},{"raw_affiliation_string":"Department of Computer Science, North Dakota State University, Fargo , ND, USA","institution_ids":["https://openalex.org/I57328836"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015130765","display_name":"Simone A. Ludwig","orcid":"https://orcid.org/0000-0002-8419-0192"},"institutions":[{"id":"https://openalex.org/I57328836","display_name":"North Dakota State University","ror":"https://ror.org/05h1bnb22","country_code":"US","type":"education","lineage":["https://openalex.org/I57328836"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Simone A. Ludwig","raw_affiliation_strings":["Department of Computer Science, North Dakota State University, Fargo, ND, USA","Department of Computer Science, North Dakota State University, Fargo , ND, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, North Dakota State University, Fargo, ND, USA","institution_ids":["https://openalex.org/I57328836"]},{"raw_affiliation_string":"Department of Computer Science, North Dakota State University, Fargo , ND, USA","institution_ids":["https://openalex.org/I57328836"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5023882029"],"corresponding_institution_ids":["https://openalex.org/I57328836"],"apc_list":null,"apc_paid":null,"fwci":1.4427,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.85340758,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"22","last_page":"31"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9962999820709229,"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.9962999820709229,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T11478","display_name":"Caching and Content Delivery","score":0.98580002784729,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.8082976341247559},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6923606991767883},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4822012186050415},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.41374731063842773},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3390469253063202},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33228734135627747},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09402510523796082}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8082976341247559},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6923606991767883},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4822012186050415},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.41374731063842773},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3390469253063202},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33228734135627747},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09402510523796082},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/sis.2013.6615155","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sis.2013.6615155","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Symposium on Swarm Intelligence (SIS)","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":21,"referenced_works":["https://openalex.org/W1526455201","https://openalex.org/W1568886866","https://openalex.org/W1589918049","https://openalex.org/W1813030236","https://openalex.org/W1845345803","https://openalex.org/W1984560443","https://openalex.org/W2030640142","https://openalex.org/W2046397053","https://openalex.org/W2084078358","https://openalex.org/W2096442669","https://openalex.org/W2121858643","https://openalex.org/W2128877032","https://openalex.org/W2131186568","https://openalex.org/W2134693673","https://openalex.org/W2154950655","https://openalex.org/W2163194931","https://openalex.org/W2173213060","https://openalex.org/W2332013262","https://openalex.org/W3175596131","https://openalex.org/W4246729886","https://openalex.org/W6657928315"],"related_works":["https://openalex.org/W2378211422","https://openalex.org/W2745001401","https://openalex.org/W4321353415","https://openalex.org/W2130974462","https://openalex.org/W972276598","https://openalex.org/W4246352526","https://openalex.org/W2028665553","https://openalex.org/W4230315250","https://openalex.org/W2086519370","https://openalex.org/W2087343574"],"abstract_inverted_index":{"In":[0,62],"optimization":[1],"problems,":[2],"such":[3,25,56],"as":[4,57],"highly":[5,103],"multimodal":[6,104],"functions,":[7,123],"many":[8],"iterations":[9],"involving":[10],"complex":[11],"function":[12,33,128],"evaluations":[13],"are":[14,35,132],"required.":[15],"Glowworm":[16],"Swarm":[17],"Optimization":[18],"(GSO)":[19],"has":[20],"to":[21,95,145,152],"be":[22,70,87],"parallelized":[23],"for":[24,107,119],"functions":[26,106],"when":[27],"large":[28],"populations":[29],"capturing":[30],"the":[31,58,74,98,137,153],"complete":[32],"space,":[34],"used.":[36],"However,":[37],"large-scale":[38],"parallel":[39,76],"algorithms":[40],"must":[41],"communicate":[42],"efficiently,":[43],"involve":[44],"load":[45],"balancing":[46],"across":[47],"all":[48],"available":[49],"computer":[50],"nodes,":[51],"and":[52,82,124],"resolve":[53],"parallelization":[54,99],"problems":[55,148],"failure":[59],"of":[60],"nodes.":[61],"this":[63,91],"paper,":[64],"we":[65,113],"outline":[66],"how":[67,84],"GSO":[68,85],"can":[69,86],"modeled":[71],"based":[72],"on":[73],"MapReduce":[75,81],"programming":[77],"model.":[78],"We":[79,101,134],"describe":[80],"present":[83],"naturally":[88],"expressed":[89],"in":[90],"model,":[92],"without":[93,149],"having":[94],"explicitly":[96],"handle":[97],"details.":[100],"use":[102],"benchmark":[105],"evaluating":[108],"our":[109],"MR-GSO":[110,116],"algorithm.":[111],"Furthermore,":[112],"demonstrate":[114],"that":[115,126,139],"is":[117],"appropriate":[118],"optimizing":[120],"difficult":[121],"evaluation":[122],"show":[125,135],"high":[127],"peak":[129],"capture":[130],"rates":[131],"achieved.":[133],"with":[136],"experiments":[138],"adding":[140],"more":[141],"nodes":[142],"would":[143],"help":[144],"solve":[146],"larger":[147],"any":[150],"modifications":[151],"algorithm":[154],"structure.":[155]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}