{"id":"https://openalex.org/W2095663226","doi":"https://doi.org/10.1080/00207169908804885","title":"Fine-grained parallel genetic algorithm:a global convergence criterion","display_name":"Fine-grained parallel genetic algorithm:a global convergence criterion","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2095663226","doi":"https://doi.org/10.1080/00207169908804885","mag":"2095663226"},"language":"en","primary_location":{"id":"doi:10.1080/00207169908804885","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169908804885","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"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 Computer Mathematics","raw_type":"journal-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/A5007677816","display_name":"Abubakr Muhammad","orcid":"https://orcid.org/0000-0002-9160-6707"},"institutions":[{"id":"https://openalex.org/I70844379","display_name":"Wessex Institute of Technology","ror":"https://ror.org/01thz0w07","country_code":"GB","type":"education","lineage":["https://openalex.org/I70844379"]},{"id":"https://openalex.org/I43439940","display_name":"University of Southampton","ror":"https://ror.org/01ryk1543","country_code":"GB","type":"education","lineage":["https://openalex.org/I43439940"]},{"id":"https://openalex.org/I4210151058","display_name":"Southampton City Council","ror":"https://ror.org/05ftj4678","country_code":"GB","type":"government","lineage":["https://openalex.org/I4210151058"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"A. Muhammad","raw_affiliation_strings":["\n                   \n               Southampton Institute, Southampton, UK","Southampton Institute , Southampton, UK"],"affiliations":[{"raw_affiliation_string":"\n                   \n               Southampton Institute, Southampton, UK","institution_ids":["https://openalex.org/I70844379","https://openalex.org/I4210151058","https://openalex.org/I43439940"]},{"raw_affiliation_string":"Southampton Institute , Southampton, UK","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111690299","display_name":"A Bargiela","orcid":null},"institutions":[{"id":"https://openalex.org/I52590639","display_name":"Nottingham Trent University","ror":"https://ror.org/04xyxjd90","country_code":"GB","type":"education","lineage":["https://openalex.org/I52590639"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"A. Bargiela","raw_affiliation_strings":["\n                   \n               Department of Computing, The Nottingham Trent University, Burton Street, Nottingham, UK, NG1 4BU","Department of Computing , The Nottingham Trent University , Burton Street, Nottingham, UK , NG1 4BU"],"affiliations":[{"raw_affiliation_string":"\n                   \n               Department of Computing, The Nottingham Trent University, Burton Street, Nottingham, UK, NG1 4BU","institution_ids":["https://openalex.org/I52590639"]},{"raw_affiliation_string":"Department of Computing , The Nottingham Trent University , Burton Street, Nottingham, UK , NG1 4BU","institution_ids":["https://openalex.org/I52590639"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000728450","display_name":"G. R. Gnana King","orcid":"https://orcid.org/0000-0002-1350-852X"},"institutions":[{"id":"https://openalex.org/I70844379","display_name":"Wessex Institute of Technology","ror":"https://ror.org/01thz0w07","country_code":"GB","type":"education","lineage":["https://openalex.org/I70844379"]},{"id":"https://openalex.org/I4210151058","display_name":"Southampton City Council","ror":"https://ror.org/05ftj4678","country_code":"GB","type":"government","lineage":["https://openalex.org/I4210151058"]},{"id":"https://openalex.org/I43439940","display_name":"University of Southampton","ror":"https://ror.org/01ryk1543","country_code":"GB","type":"education","lineage":["https://openalex.org/I43439940"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"G. King","raw_affiliation_strings":["\n                   \n               Southampton Institute, Southampton, UK","Southampton Institute , Southampton, UK"],"affiliations":[{"raw_affiliation_string":"\n                   \n               Southampton Institute, Southampton, UK","institution_ids":["https://openalex.org/I70844379","https://openalex.org/I4210151058","https://openalex.org/I43439940"]},{"raw_affiliation_string":"Southampton Institute , Southampton, UK","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5111690299"],"corresponding_institution_ids":["https://openalex.org/I52590639"],"apc_list":null,"apc_paid":null,"fwci":1.0195,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.81821987,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"73","issue":"2","first_page":"139","last_page":"155"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9961000084877014,"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.9961000084877014,"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/T10320","display_name":"Neural Networks and Applications","score":0.9761999845504761,"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/T11106","display_name":"Data Management and Algorithms","score":0.9510999917984009,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/markov-chain","display_name":"Markov chain","score":0.6229813694953918},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5807865262031555},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.562903106212616},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.5588690042495728},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.533621072769165},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.5179926156997681},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5064328908920288},{"id":"https://openalex.org/keywords/ergodic-theory","display_name":"Ergodic theory","score":0.49570930004119873},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4756588339805603},{"id":"https://openalex.org/keywords/adaptive-simulated-annealing","display_name":"Adaptive simulated annealing","score":0.44440770149230957},{"id":"https://openalex.org/keywords/mutation","display_name":"Mutation","score":0.4437950849533081},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4352082312107086},{"id":"https://openalex.org/keywords/population-based-incremental-learning","display_name":"Population-based incremental learning","score":0.4163219928741455},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.06958457827568054}],"concepts":[{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.6229813694953918},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5807865262031555},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.562903106212616},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.5588690042495728},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.533621072769165},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.5179926156997681},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5064328908920288},{"id":"https://openalex.org/C122044880","wikidata":"https://www.wikidata.org/wiki/Q5498822","display_name":"Ergodic theory","level":2,"score":0.49570930004119873},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4756588339805603},{"id":"https://openalex.org/C46714192","wikidata":"https://www.wikidata.org/wiki/Q4680763","display_name":"Adaptive simulated annealing","level":3,"score":0.44440770149230957},{"id":"https://openalex.org/C501734568","wikidata":"https://www.wikidata.org/wiki/Q42918","display_name":"Mutation","level":3,"score":0.4437950849533081},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4352082312107086},{"id":"https://openalex.org/C184497298","wikidata":"https://www.wikidata.org/wiki/Q7229773","display_name":"Population-based incremental learning","level":3,"score":0.4163219928741455},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.06958457827568054},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"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.1080/00207169908804885","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169908804885","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"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 Computer Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W22811240","https://openalex.org/W64859905","https://openalex.org/W1485961250","https://openalex.org/W1517222029","https://openalex.org/W1540072641","https://openalex.org/W1560376585","https://openalex.org/W1692367225","https://openalex.org/W2047422346","https://openalex.org/W2049822318","https://openalex.org/W2075379212","https://openalex.org/W2133906815","https://openalex.org/W2162232298","https://openalex.org/W2323009482"],"related_works":["https://openalex.org/W2373401521","https://openalex.org/W2148280713","https://openalex.org/W2117854949","https://openalex.org/W2120069041","https://openalex.org/W2378207389","https://openalex.org/W1965693408","https://openalex.org/W2390975623","https://openalex.org/W2182912710","https://openalex.org/W2373057837","https://openalex.org/W2362504681"],"abstract_inverted_index":{"Abstract":[0],"This":[1],"paper":[2],"presents":[3],"a":[4,13,41,59,82,86,102,146],"fine-grained":[5,47,116],"parallel":[6,48,96,117],"genetic":[7,49,65,92,97,118],"algorithm":[8,98,119],"with":[9,63],"mutation":[10,20],"rate":[11,21],"as":[12,67],"control":[14],"parameter.":[15],"The":[16,33,95,133],"function":[17,148],"of":[18,76,89,143,145,149],"the":[19,25,29,46,53,64,130,141],"is":[22,38,58,101,120],"similar":[23],"to":[24,39,129,139],"temperature":[26],"parameter":[27],"in":[28,140],"simulated":[30,54],"annealing":[31,55],"[3,8,10].":[32],"motivation":[34],"behind":[35],"this":[36],"research":[37],"develop":[40],"global":[42],"convergence":[43],"theory":[44],"for":[45],"algorithms":[50,66,93],"based":[51,105],"on":[52,106],"model":[56,110],"There":[57],"mathematical":[60],"difficulty":[61],"associated":[62],"they":[68],"do":[69],"not":[70],"strictly":[71],"come":[72],"under":[73],"die":[74],"definition":[75],"an":[77,121],"algorithm.":[78],"Algorithms":[79],"normally":[80],"have":[81],"starting":[83],"point":[84,88],"and":[85,125],"defined":[87],"termination":[90],"which":[91],"lack.":[94],"presented":[99],"here":[100],"stochastic":[103],"process":[104],"Markov":[107,123],"chain":[108,124],"[2]":[109],"It":[111],"has":[112,136],"been":[113,137],"proven":[114],"that":[115,126],"ergodic":[122],"it":[127],"converges":[128],"stationary":[131],"distribution.":[132],"theoretical":[134],"result":[135],"applied":[138],"context":[142],"optimisation":[144],"deceptive":[147],"4-th":[150],"order.":[151],"Keywords:":[152],"Stochastic":[153],"optimisationparallel":[154],"modelMarkov":[155],"chainglobal":[156],"convergenceC.R.":[157],"Categories:":[158],"I2.8G1.6G.3I6.4C1.2":[159]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}