{"id":"https://openalex.org/W2912289852","doi":"https://doi.org/10.1007/s11047-021-09856-0","title":"Exact Markov chain-based runtime analysis of a discrete particle swarm optimization algorithm on sorting and OneMax","display_name":"Exact Markov chain-based runtime analysis of a discrete particle swarm optimization algorithm on sorting and OneMax","publication_year":2021,"publication_date":"2021-06-13","ids":{"openalex":"https://openalex.org/W2912289852","doi":"https://doi.org/10.1007/s11047-021-09856-0","mag":"2912289852"},"language":"en","primary_location":{"id":"doi:10.1007/s11047-021-09856-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11047-021-09856-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11047-021-09856-0.pdf","source":{"id":"https://openalex.org/S149828480","display_name":"Natural Computing","issn_l":"1567-7818","issn":["1567-7818","1572-9796"],"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":"Natural Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s11047-021-09856-0.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Moritz M\u00fchlenthaler","orcid":null},"institutions":[{"id":"https://openalex.org/I106785703","display_name":"Institut polytechnique de Grenoble","ror":"https://ror.org/05sbt2524","country_code":"FR","type":"education","lineage":["https://openalex.org/I106785703","https://openalex.org/I899635006"]},{"id":"https://openalex.org/I4210094718","display_name":"Laboratoire des Sciences pour la Conception, l'Optimisation et la Production","ror":"https://ror.org/00rv5x925","country_code":"FR","type":"facility","lineage":["https://openalex.org/I106785703","https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210094718","https://openalex.org/I4210159245","https://openalex.org/I899635006","https://openalex.org/I899635006"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Moritz M\u00fchlenthaler","raw_affiliation_strings":["Laboratoire G-SCOP, Grenoble INP, Grenoble, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire G-SCOP, Grenoble INP, Grenoble, France","institution_ids":["https://openalex.org/I106785703","https://openalex.org/I4210094718"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Alexander Ra\u00df","orcid":"https://orcid.org/0000-0003-1274-6398"},"institutions":[{"id":"https://openalex.org/I181369854","display_name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","ror":"https://ror.org/00f7hpc57","country_code":"DE","type":"education","lineage":["https://openalex.org/I181369854"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Alexander Ra\u00df","raw_affiliation_strings":["Department of Computer Science, Friedrich-Alexander University Erlangen-N\u00fcrnberg, Erlangen, Germany"],"raw_orcid":"https://orcid.org/0000-0003-1274-6398","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Friedrich-Alexander University Erlangen-N\u00fcrnberg, Erlangen, Germany","institution_ids":["https://openalex.org/I181369854"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Manuel Schmitt","orcid":null},"institutions":[{"id":"https://openalex.org/I181369854","display_name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","ror":"https://ror.org/00f7hpc57","country_code":"DE","type":"education","lineage":["https://openalex.org/I181369854"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Manuel Schmitt","raw_affiliation_strings":["Department of Computer Science, Friedrich-Alexander University Erlangen-N\u00fcrnberg, Erlangen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Friedrich-Alexander University Erlangen-N\u00fcrnberg, Erlangen, Germany","institution_ids":["https://openalex.org/I181369854"]}]},{"author_position":"last","author":{"id":null,"display_name":"Rolf Wanka","orcid":"https://orcid.org/0000-0002-5729-3727"},"institutions":[{"id":"https://openalex.org/I181369854","display_name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","ror":"https://ror.org/00f7hpc57","country_code":"DE","type":"education","lineage":["https://openalex.org/I181369854"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Rolf Wanka","raw_affiliation_strings":["Department of Computer Science, Friedrich-Alexander University Erlangen-N\u00fcrnberg, Erlangen, Germany"],"raw_orcid":"https://orcid.org/0000-0002-5729-3727","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Friedrich-Alexander University Erlangen-N\u00fcrnberg, Erlangen, Germany","institution_ids":["https://openalex.org/I181369854"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I181369854"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":{"value":2890,"currency":"USD","value_usd":2890},"fwci":0.9087,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.7528357,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"21","issue":"4","first_page":"651","last_page":"677"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.2775999903678894,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.2775999903678894,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.11879999935626984,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.10790000110864639,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.6858999729156494},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.6373999714851379},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.45969998836517334},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.45509999990463257},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.4242999851703644},{"id":"https://openalex.org/keywords/discrete-optimization","display_name":"Discrete optimization","score":0.3955000042915344},{"id":"https://openalex.org/keywords/discrete-time-and-continuous-time","display_name":"Discrete time and continuous time","score":0.3847000002861023},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.36910000443458557},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.3490999937057495}],"concepts":[{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6858999729156494},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.6373999714851379},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5706999897956848},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5450999736785889},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.492900013923645},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.45969998836517334},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.45509999990463257},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.4242999851703644},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4198000133037567},{"id":"https://openalex.org/C145671259","wikidata":"https://www.wikidata.org/wiki/Q1493786","display_name":"Discrete optimization","level":3,"score":0.3955000042915344},{"id":"https://openalex.org/C55689738","wikidata":"https://www.wikidata.org/wiki/Q15963867","display_name":"Discrete time and continuous time","level":2,"score":0.3847000002861023},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.36910000443458557},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.3490999937057495},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.34450000524520874},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.33660000562667847},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.33309999108314514},{"id":"https://openalex.org/C188919014","wikidata":"https://www.wikidata.org/wiki/Q5422296","display_name":"Extremal optimization","level":4,"score":0.33169999718666077},{"id":"https://openalex.org/C181335050","wikidata":"https://www.wikidata.org/wiki/Q14915018","display_name":"Swarm behaviour","level":2,"score":0.3249000012874603},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.3172000050544739},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.30730000138282776},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.3034000098705292},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.3034000098705292},{"id":"https://openalex.org/C92995354","wikidata":"https://www.wikidata.org/wiki/Q5165499","display_name":"Continuous optimization","level":4,"score":0.2994000017642975},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.27959999442100525},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.2759999930858612},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.25519999861717224},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.25290000438690186}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s11047-021-09856-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11047-021-09856-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11047-021-09856-0.pdf","source":{"id":"https://openalex.org/S149828480","display_name":"Natural Computing","issn_l":"1567-7818","issn":["1567-7818","1572-9796"],"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":"Natural Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1902.01810","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1902.01810","pdf_url":"https://arxiv.org/pdf/1902.01810","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:HAL:hal-04215550v1","is_oa":false,"landing_page_url":"https://hal.science/hal-04215550","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Natural Computing, 2022, 21 (4), pp.651-677. ⟨10.1007/s11047-021-09856-0⟩","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:ub.uni-erlangen.de-opus:22243","is_oa":true,"landing_page_url":"https://opus4.kobv.de/opus4-fau/files/22243/s11047-021-09856-0.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306401636","display_name":"OPUS Repository (Kooperativer Bibliotheksverbund Berlin-Brandenburg)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s11047-021-09856-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11047-021-09856-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11047-021-09856-0.pdf","source":{"id":"https://openalex.org/S149828480","display_name":"Natural Computing","issn_l":"1567-7818","issn":["1567-7818","1572-9796"],"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":"Natural Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320873","display_name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","ror":"https://ror.org/00f7hpc57"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2912289852.pdf","grobid_xml":"https://content.openalex.org/works/W2912289852.grobid-xml"},"referenced_works_count":38,"referenced_works":["https://openalex.org/W143120372","https://openalex.org/W1522890465","https://openalex.org/W1593495653","https://openalex.org/W1820801893","https://openalex.org/W1959962087","https://openalex.org/W1970025632","https://openalex.org/W1988155416","https://openalex.org/W2007253013","https://openalex.org/W2011904305","https://openalex.org/W2023749136","https://openalex.org/W2032411249","https://openalex.org/W2040194491","https://openalex.org/W2052176278","https://openalex.org/W2052328625","https://openalex.org/W2056760934","https://openalex.org/W2061092014","https://openalex.org/W2067302411","https://openalex.org/W2109364787","https://openalex.org/W2116114298","https://openalex.org/W2119371075","https://openalex.org/W2124391090","https://openalex.org/W2125213524","https://openalex.org/W2126442135","https://openalex.org/W2143945515","https://openalex.org/W2152195021","https://openalex.org/W2165220807","https://openalex.org/W2339422671","https://openalex.org/W2544853372","https://openalex.org/W2604246841","https://openalex.org/W2887810854","https://openalex.org/W2888160678","https://openalex.org/W2899702797","https://openalex.org/W2936813929","https://openalex.org/W2941999899","https://openalex.org/W4211192810","https://openalex.org/W4234274482","https://openalex.org/W4240139199","https://openalex.org/W4249315269"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"Meta-heuristics":[1],"are":[2,12,100],"powerful":[3],"tools":[4],"for":[5,24,112,132],"solving":[6],"optimization":[7,29,39,96,121,166],"problems":[8,30,58],"whose":[9],"structural":[10],"properties":[11],"unknown":[13],"or":[14],"cannot":[15],"be":[16,146],"exploited":[17],"algorithmically.":[18],"We":[19,42,109],"propose":[20],"such":[21],"a":[22,25,44,60,80,113,159,183,193],"meta-heuristic":[23],"large":[26],"class":[27],"of":[28,48,51,83,116,127,178,180,182,192],"over":[31],"discrete":[32],"domains":[33],"based":[34],"on":[35,54,93,162,189],"the":[36,49,64,68,84,106,119,136,163,176,190],"particle":[37],"swarm":[38],"(PSO)":[40],"paradigm.":[41],"provide":[43,187],"comprehensive":[45],"formal":[46],"analysis":[47,77,157],"performance":[50],"this":[52],"algorithm":[53,86,117,137],"certain":[55],"\u201ceasy\u201d":[56],"reference":[57],"in":[59,148,150],"black-box":[61],"setting,":[62],"namely":[63],"sorting":[65],"problem":[66,69],"and":[67,90,141,168,186],"O":[70],"ne":[71],"M":[72],"ax":[73],".":[74],"In":[75],"our":[76,172],"we":[78,174],"use":[79],"Markov":[81,107,184],"model":[82],"proposed":[85],"to":[87,105,125,152],"obtain":[88,171],"upper":[89],"lower":[91],"bounds":[92,99,188],"its":[94],"expected":[95,120],"time.":[97],"Our":[98,156],"essentially":[101],"tight":[102],"with":[103,196],"respect":[104],"model.":[108],"show":[110],"that":[111,126],"suitable":[114],"choice":[115],"parameters":[118],"time":[122,167],"is":[123],"comparable":[124],"known":[128],"algorithms":[129],"and,":[130],"furthermore,":[131],"other":[133],"parameter":[134],"regimes,":[135],"behaves":[138],"less":[139],"greedy":[140],"more":[142],"explorative,":[143],"which":[144],"can":[145],"desirable":[147],"practice":[149],"order":[151],"escape":[153],"local":[154],"optima.":[155],"provides":[158],"precise":[160],"insight":[161],"tradeoff":[164],"between":[165],"exploration.":[169],"To":[170],"results":[173],"introduce":[175],"notion":[177],"indistinguishability":[179],"states":[181],"chain":[185],"solution":[191],"recurrence":[194],"equation":[195],"non-constant":[197],"coefficients":[198],"by":[199],"integration.":[200]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2019-02-21T00:00:00"}