{"id":"https://openalex.org/W2772688874","doi":"https://doi.org/10.1080/17445760.2017.1416387","title":"An efficient multi-core implementation of the Jaya optimisation algorithm","display_name":"An efficient multi-core implementation of the Jaya optimisation algorithm","publication_year":2017,"publication_date":"2017-12-22","ids":{"openalex":"https://openalex.org/W2772688874","doi":"https://doi.org/10.1080/17445760.2017.1416387","mag":"2772688874"},"language":"en","primary_location":{"id":"doi:10.1080/17445760.2017.1416387","is_oa":false,"landing_page_url":"https://doi.org/10.1080/17445760.2017.1416387","pdf_url":null,"source":{"id":"https://openalex.org/S85375271","display_name":"International Journal of Parallel Emergent and Distributed Systems","issn_l":"1744-5760","issn":["1744-5760","1744-5779"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Parallel, Emergent and Distributed Systems","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1712.03366","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Panagiotis D. Michailidis","orcid":"https://orcid.org/0000-0003-3559-274X"},"institutions":[{"id":"https://openalex.org/I192756129","display_name":"University of Macedonia","ror":"https://ror.org/05fg6gr82","country_code":"GR","type":"education","lineage":["https://openalex.org/I192756129"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"Panagiotis D. Michailidis","raw_affiliation_strings":["Department of Balkan, Slavic and Oriental Studies, University of Macedonia , Thessaloniki, Greece"],"affiliations":[{"raw_affiliation_string":"Department of Balkan, Slavic and Oriental Studies, University of Macedonia , Thessaloniki, Greece","institution_ids":["https://openalex.org/I192756129"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I192756129"],"apc_list":null,"apc_paid":null,"fwci":1.2463,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.85676434,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":97},"biblio":{"volume":"34","issue":"3","first_page":"288","last_page":"320"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9107999801635742,"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.9107999801635742,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.03280000016093254,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.024299999698996544,"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/convergence","display_name":"Convergence (economics)","score":0.6506999731063843},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.6366999745368958},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.5825999975204468},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.574999988079071},{"id":"https://openalex.org/keywords/quality","display_name":"Quality (philosophy)","score":0.4602000117301941},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.39469999074935913}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7853999733924866},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6506999731063843},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.6366999745368958},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.5825999975204468},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.574999988079071},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5103999972343445},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.4602000117301941},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.39469999074935913},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.33550000190734863},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.31839999556541443},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3098999857902527},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.28760001063346863},{"id":"https://openalex.org/C169733012","wikidata":"https://www.wikidata.org/wiki/Q1613416","display_name":"Population size","level":3,"score":0.28600001335144043},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.26010000705718994},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.257099986076355},{"id":"https://openalex.org/C3017438360","wikidata":"https://www.wikidata.org/wiki/Q11188","display_name":"Global population","level":3,"score":0.2500999867916107}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/17445760.2017.1416387","is_oa":false,"landing_page_url":"https://doi.org/10.1080/17445760.2017.1416387","pdf_url":null,"source":{"id":"https://openalex.org/S85375271","display_name":"International Journal of Parallel Emergent and Distributed Systems","issn_l":"1744-5760","issn":["1744-5760","1744-5779"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Parallel, Emergent and Distributed Systems","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1712.03366","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1712.03366","pdf_url":"https://arxiv.org/pdf/1712.03366","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1712.03366","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1712.03366","pdf_url":"https://arxiv.org/pdf/1712.03366","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W73058690","https://openalex.org/W173938121","https://openalex.org/W1981957349","https://openalex.org/W1984486311","https://openalex.org/W1995600706","https://openalex.org/W1999284878","https://openalex.org/W2001422417","https://openalex.org/W2037917527","https://openalex.org/W2038456806","https://openalex.org/W2048071335","https://openalex.org/W2063303403","https://openalex.org/W2092747214","https://openalex.org/W2097377813","https://openalex.org/W2118044993","https://openalex.org/W2152195021","https://openalex.org/W2339349949","https://openalex.org/W2346700178","https://openalex.org/W2415222822","https://openalex.org/W2511569622","https://openalex.org/W2609047154","https://openalex.org/W2758626922","https://openalex.org/W4231671578","https://openalex.org/W4232872328","https://openalex.org/W4237344571","https://openalex.org/W4244913371","https://openalex.org/W4246565613","https://openalex.org/W4299796063"],"related_works":[],"abstract_inverted_index":{"In":[0,64],"this":[1,99],"work,":[2],"we":[3,68,117],"propose":[4],"a":[5,12,56,173],"hybrid":[6],"parallel":[7,150],"Jaya":[8],"optimisation":[9,22,185],"algorithm":[10,26,43,151],"for":[11],"multi-core":[13],"environment":[14],"with":[15,35,102,131],"the":[16,32,36,45,60,65,70,89,95,103,124,132,137,141,148,164,169],"aim":[17,133],"of":[18,52,59,94,134,143,163,166],"solving":[19],"large-scale":[20,184],"global":[21,111,129],"problems.":[23,186],"The":[24,41],"proposed":[25,149],"is":[27,178],"called":[28],"HHCPJaya,":[29],"and":[30,82,91,140,168,183],"combines":[31],"hyper-population":[33,66,100],"approach":[34,101],"hierarchical":[37,105],"cooperation":[38],"search":[39,107],"mechanism.":[40],"HHCPJaya":[42],"divides":[44],"population":[46,62],"into":[47],"many":[48],"small":[49,71,175],"subpopulations,":[50],"each":[51,80,83],"which":[53],"focuses":[54],"on":[55,123,128],"distinct":[57],"block":[58],"original":[61],"dimensions.":[63],"approach,":[67],"increase":[69],"subpopulations":[72,126],"by":[73],"assigning":[74],"more":[75],"than":[76],"one":[77],"subpopulation":[78,84],"to":[79,87,109,180],"core,":[81],"evolves":[85],"independently":[86],"enhance":[88],"explorative":[90],"exploitative":[92],"nature":[93],"population.":[96],"We":[97],"combine":[98],"two-level":[104],"cooperative":[106],"scheme":[108],"find":[110],"solutions":[112,167],"from":[113],"all":[114],"subpopulations.":[115],"Furthermore,":[116,172],"incorporate":[118],"an":[119],"additional":[120],"updating":[121],"phase":[122],"respective":[125],"based":[127],"solutions,":[130],"further":[135],"improving":[136],"convergence":[138,170],"rate":[139],"quality":[142,165],"solutions.":[144],"Several":[145],"experiments":[146],"applying":[147],"in":[152,161],"different":[153],"settings":[154],"prove":[155],"that":[156],"it":[157],"demonstrates":[158],"sufficient":[159],"promise":[160],"terms":[162],"rate.":[171],"relatively":[174],"computational":[176],"effort":[177],"required":[179],"solve":[181],"complex":[182]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2017-12-22T00:00:00"}