{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:14:16Z","timestamp":1758269656552,"version":"3.37.3"},"reference-count":83,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2020,4,14]],"date-time":"2020-04-14T00:00:00Z","timestamp":1586822400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,4,14]],"date-time":"2020-04-14T00:00:00Z","timestamp":1586822400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"OsloMet - Oslo Metropolitan University"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2020,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Learning Automata (LA) is a popular decision-making mechanism to \u201cdetermine the optimal action out of a set of allowable actions\u201d [1]. The distinguishing characteristic of automata-based learning is that the search for an optimal parameter (or decision) is conducted in the space of probability distributions defined over the parameter space, rather than in the parameter space itself [2]. In this paper, we propose a novel LA paradigm that can solve a large class of deterministic optimization problems. Although many LA algorithms have been devised in the literature, those LA schemes are not able to solve deterministic optimization problems as they suppose that the environment is stochastic. In this paper, our proposed scheme can be seen as the counterpart of the family of pursuit LA developed for stochastic environments [3]. While classical pursuit LAs can pursue the action with the highest reward estimate, our pursuit LA rather pursues the collection of actions that yield the highest performance by invoking a team of LA. The theoretical analysis of the pursuit scheme does not follow classical LA proofs, and can pave the way towards more schemes where LA can be applied to solve deterministic optimization problems. Furthermore, we analyze the scheme under both a constant learning parameter and a time-decaying learning parameter. We provide some experimental results that show how our Pursuit-LA scheme can be used to solve the Maximum Satisfiability (Max-SAT) problem. To avoid premature convergence and better explore the search space, we enhance our scheme with the concept of artificial barriers recently introduced in [4]. Interestingly, although our scheme is simple by design, we observe that it performs well compared to sophisticated state-of-the-art approaches.<\/jats:p>","DOI":"10.1007\/s10489-020-01657-9","type":"journal-article","created":{"date-parts":[[2020,4,14]],"date-time":"2020-04-14T06:02:31Z","timestamp":1586844151000},"page":"2916-2931","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A team of pursuit learning automata for solving deterministic optimization problems"],"prefix":"10.1007","volume":"50","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7591-1659","authenticated-orcid":false,"given":"Anis","family":"Yazidi","sequence":"first","affiliation":[]},{"given":"Nourredine","family":"Bouhmala","sequence":"additional","affiliation":[]},{"given":"Morten","family":"Goodwin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,14]]},"reference":[{"issue":"6","key":"1657_CR1","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1109\/TSMCB.2002.1049608","volume":"32","author":"M Agache","year":"2002","unstructured":"Agache M, Oommen BJ (2002) Generalized pursuit learning schemes: new families of continuous and discretized learning automata. IEEE Transactions on Systems, Man, and Cybernetics-Part B: Cybernetics 32(6):738\u2013749","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics-Part B: Cybernetics"},{"issue":"6","key":"1657_CR2","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1109\/TSMCB.2002.1049606","volume":"32","author":"MAL Thathachar","year":"2002","unstructured":"Thathachar MAL, Sastry PS (2002) Varieties of learning automata: an overview. IEEE Transactions on Systems, Man, and Cybernetics-Part B: Cybernetics 32(6):711\u2013722","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics-Part B: Cybernetics"},{"issue":"6","key":"1657_CR3","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1109\/TSMCB.2002.1049608","volume":"32","author":"M Agache","year":"2002","unstructured":"Agache M, Oommen BJ (2002) Generalized pursuit learning schemes: new families of continuous and discretized learning automata, IEEE transactions on systems, man, and cybernetics. Part B (Cybernetics) 32(6):738\u2013749","journal-title":"Part B (Cybernetics)"},{"issue":"11","key":"1657_CR4","doi-asserted-by":"crossref","first-page":"4392","DOI":"10.1007\/s10489-018-1201-7","volume":"48","author":"A Yazidi","year":"2018","unstructured":"Yazidi A, Hammer HL (2018) Solving stochastic nonlinear resource allocation problems using continuous learning automata. Appl Intell 48(11):4392\u20134411","journal-title":"Appl Intell"},{"key":"1657_CR5","doi-asserted-by":"crossref","unstructured":"Lakshmivarahan S (1981) Learning Algorithms Theory and Applications, Springer-Verlag","DOI":"10.1007\/978-1-4612-5975-6"},{"key":"1657_CR6","volume-title":"Learning automata: theory and applications","author":"K Najim","year":"1994","unstructured":"Najim K, Poznyak AS (1994) Learning automata: theory and applications. Pergamon Press, Oxford"},{"key":"1657_CR7","volume-title":"Learning automata: an introduction","author":"KS Narendra","year":"1989","unstructured":"Narendra KS, Thathachar MAL (1989) Learning automata: an introduction. Prentice-Hall, Inc."},{"issue":"6","key":"1657_CR8","doi-asserted-by":"crossref","first-page":"706","DOI":"10.1109\/TSMCB.2002.1049604","volume":"32","author":"MS Obaidat","year":"2002","unstructured":"Obaidat MS, Papadimitriou GI, Pomportsis AS (2002) Learning automata: theory, paradigms, and applications. IEEE Transactions on Systems, Man, and Cybernetics-Part B: Cybernetics 32(6):706\u2013709","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics-Part B: Cybernetics"},{"key":"1657_CR9","volume-title":"Learning automata and stochastic optimization","author":"AS Poznyak","year":"1997","unstructured":"Poznyak AS, Najim K (1997) Learning automata and stochastic optimization. Springer-Verlag, Berlin"},{"key":"1657_CR10","volume-title":"Networks of learning automata: techniques for online stochastic optimization","author":"MAL Thathachar","year":"2003","unstructured":"Thathachar MAL, Sastry PS (2003) Networks of learning automata: techniques for online stochastic optimization. Kluwer Academic, Boston"},{"issue":"2","key":"1657_CR11","doi-asserted-by":"crossref","first-page":"1008","DOI":"10.1109\/TASE.2015.2450535","volume":"13","author":"J Zhang","year":"2016","unstructured":"Zhang J, Wang C, Zang D, Zhou M (2016) Incorporation of optimal computing budget allocation for ordinal optimization into learning automata. IEEE Trans Autom Sci Eng 13(2):1008\u20131017","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"1657_CR12","volume-title":"Automaton theory and the modeling of biological systems","author":"ML Tsetlin","year":"1973","unstructured":"Tsetlin ML (1973) Automaton theory and the modeling of biological systems. Academic Press, New York"},{"key":"1657_CR13","doi-asserted-by":"crossref","first-page":"963","DOI":"10.1002\/dac.684","volume":"17","author":"S Misra","year":"2004","unstructured":"Misra S, Oommen BJ (2004) GPSPA: a new adaptive algorithm for maintaining shortest path routing trees in stochastic networks. Int J Commun Syst 17:963\u2013984","journal-title":"Int J Commun Syst"},{"key":"1657_CR14","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1109\/TSMCB.2002.1049615","volume":"32","author":"MS Obaidat","year":"2002","unstructured":"Obaidat MS, Papadimitriou GI, Pomportsis AS, Laskaridis HS (2002) Learning automata-based bus arbitration for shared-edium ATM switches. IEEE Trans Syst Man Cybern B 32:815\u2013820","journal-title":"IEEE Trans Syst Man Cybern B"},{"key":"1657_CR15","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1109\/12.862220","volume":"C-49","author":"BJ Oommen","year":"2000","unstructured":"Oommen BJ, Roberts TD (2000) Continuous learning automata solutions to the capacity assignment problem. IEEE Trans Comput C-49:608\u2013620","journal-title":"IEEE Trans Comput"},{"key":"1657_CR16","unstructured":"Papadimitriou GI, Pomportsis AS (2000) Learning-automata-based TDMA protocols for broadcast communication systems with bursty traffic. IEEE Communication Letters:107\u2013109"},{"key":"1657_CR17","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/S1389-1286(00)00090-6","volume":"34","author":"AF Atlassis","year":"2000","unstructured":"Atlassis AF, Loukas NH, Vasilakos AV (2000) The use of learning algorithms in ATM networks call admission control problem: a methodology. Comput Netw 34:341\u2013353","journal-title":"Comput Netw"},{"key":"1657_CR18","doi-asserted-by":"crossref","unstructured":"Atlassis AF, Vasilakos AV (2002) The use of reinforcement learning algorithms in traffic control of high speed networks, Advances in Computational Intelligence and Learning 353\u2013369","DOI":"10.1007\/978-94-010-0324-7_25"},{"key":"1657_CR19","first-page":"297","volume":"33","author":"AV Vasilakos","year":"2003","unstructured":"Vasilakos AV, Saltouros MP, Atlassis AF, Pedrycz W (2003) Optimizing QoS routing in hierarchical ATM networks using computational intelligence techniques, IEEE transactions on systems. Man and Cybernetics: Part C 33:297\u2013312","journal-title":"Man and Cybernetics: Part C"},{"key":"1657_CR20","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/S0377-2217(97)00342-1","volume":"107","author":"F Seredynski","year":"1998","unstructured":"Seredynski F (1998) Distributed scheduling using simple learning machines. Eur J Oper Res 107:401\u2013413","journal-title":"Eur J Oper Res"},{"key":"1657_CR21","unstructured":"Kabudian J, Meybodi MR, Homayounpour MM (2004) Applying continuous action reinforcement learning automata (CARLA) to global training of hidden markov models, in: Proceedings of the International Conference on Information Technology: Coding and Computing , ITCC\u201904, Las Vegas, Nevada, pp. 638\u2013642"},{"key":"1657_CR22","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1142\/S012906570200090X","volume":"12","author":"MR Meybodi","year":"2002","unstructured":"Meybodi MR, Beigy H (2002) New learning automata based algorithms for adaptation of backpropagation algorithm pararmeters. Int J Neural Syst 12:45\u201367","journal-title":"Int J Neural Syst"},{"key":"1657_CR23","first-page":"193","volume":"14","author":"C Unsal","year":"1997","unstructured":"Unsal C, Kachroo P, Bay JS (1997) Simulation study of multiple intelligent vehicle control using stochastic learning automata. Transactions of the Society for Computer Simulation International 14:193\u2013210","journal-title":"Transactions of the Society for Computer Simulation International"},{"key":"1657_CR24","first-page":"195","volume":"C-45","author":"BJ Oommen","year":"1995","unstructured":"Oommen BJ, Croix E d S (1995) Graph partitioning using learning automata. IEEE Trans Comput C-45:195\u2013208","journal-title":"IEEE Trans Comput"},{"key":"1657_CR25","doi-asserted-by":"crossref","first-page":"R3321","DOI":"10.1103\/PhysRevE.52.R3321","volume":"52","author":"JJ Collins","year":"1995","unstructured":"Collins JJ, Chow CC, Imhoff TT (1995) Aperiodic stochastic resonance in excitable systems. Phys Rev E 52:R3321\u2013R3324","journal-title":"Phys Rev E"},{"key":"1657_CR26","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/7529.8927","volume":"5","author":"RL Cook","year":"1986","unstructured":"Cook RL (1986) Stochastic sampling in computer graphics. ACM Trans Graph 5:51\u201372","journal-title":"ACM Trans Graph"},{"key":"1657_CR27","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1109\/34.506793","volume":"7","author":"M Barzohar","year":"1996","unstructured":"Barzohar M, Cooper DB (1996) Automatic finding of main roads in aerial images by using geometric-stochastic models and estimation. IEEE Trans Pattern Anal Mach Intell 7:707\u2013722","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1657_CR28","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1287\/mnsc.35.6.645","volume":"35","author":"ML Brandeau","year":"1989","unstructured":"Brandeau ML, Chiu SS (1989) An overview of representative problems in location research. Manag Sci 35:645\u2013674","journal-title":"Manag Sci"},{"key":"1657_CR29","doi-asserted-by":"crossref","unstructured":"C. Bettstetter, H. Hartenstein, Xavier P\u00e9rez-Costa, Stochastic properties of the random waypoint mobility model, Journal Wireless Networks 10 (2004) 555\u2013567","DOI":"10.1023\/B:WINE.0000036458.88990.e5"},{"key":"1657_CR30","unstructured":"B. S. Rowlingson, P. J. Diggle, SPLANCS: Spatial Point Pattern Analysis Code in S-Plus, University of Lancaster, North West Regional Research Laboratory, 1991"},{"key":"1657_CR31","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0167-6105(98)00008-7","volume":"74-76","author":"M Paola","year":"1998","unstructured":"Paola M (1998) Digital simulation of wind field velocity. J Wind Eng Ind Aerodyn 74-76:91\u2013109","journal-title":"J Wind Eng Ind Aerodyn"},{"key":"1657_CR32","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/BF00045775","volume":"8","author":"JP Cusumano","year":"1995","unstructured":"Cusumano JP, Kimble BW (1995) A stochastic interrogation method for experimental measurements of global dynamics and basin evolution: application to a two-well oscillator. Nonlinear Dynamics 8:213\u2013235","journal-title":"Nonlinear Dynamics"},{"key":"1657_CR33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.18637\/jss.v012.i06","volume":"12","author":"A Baddeley","year":"2005","unstructured":"Baddeley A, Turner R (2005) Spatstat: an R package for analyzing spatial point patterns. J Stat Softw 12:1\u201342","journal-title":"J Stat Softw"},{"issue":"1","key":"1657_CR34","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1109\/TSMCB.2009.2032155","volume":"40","author":"P Sastry","year":"2010","unstructured":"Sastry P, Nagendra G, Manwani N (2010) A team of continuous-action learning automata for noise-tolerant learning of half-spaces. IEEE Transactions on Systems, Man, and Cybernetics 40(1):19\u201328","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"issue":"1","key":"1657_CR35","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1109\/TSMCB.2006.879012","volume":"37","author":"O Granmo","year":"2007","unstructured":"Granmo O, Oommen B, Myrer S, Olsen M (2007) Learning automata-based solutions to the nonlinear fractional knapsack problem with applications to optimal resource allocation. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics 37(1):166\u2013175","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics"},{"key":"1657_CR36","unstructured":"Tilak O, Mukhopadhyay S, Tuceryan M, Raje R (2010) A novel reinforcement learning framework for sensor subset selection, in: 2010 International Conference on Networking, Sensing and Control (ICNSC), IEEE, pp. 95\u2013100"},{"key":"1657_CR37","doi-asserted-by":"crossref","unstructured":"M. Goodwin, A. Yazidi, T. M. Jonassen, Distributed learning automata-based s-learning scheme for classification, Pattern Analysis and Applications (2019) 1\u201316","DOI":"10.1007\/s10044-019-00848-6"},{"issue":"4","key":"1657_CR38","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1007\/s10489-013-0424-x","volume":"39","author":"X Zhang","year":"2013","unstructured":"Zhang X, Granmo O-C, Oommen BJ (2013) On incorporating the paradigms of discretization and bayesian estimation to create a new family of pursuit learning automata. Appl Intell 39(4):782\u2013792","journal-title":"Appl Intell"},{"issue":"4","key":"1657_CR39","doi-asserted-by":"crossref","first-page":"931","DOI":"10.1109\/21.105092","volume":"SMC-20","author":"BJ Oommen","year":"1990","unstructured":"Oommen BJ, Lanct\u00f4t JK (1990) Discretized pursuit learning automata. IEEE Transactions on Systems, Man, and Cybernetics SMC-20(4):931\u2013938","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"1657_CR40","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1109\/3477.931507","volume":"31","author":"BJ Oommen","year":"2001","unstructured":"Oommen BJ, Agache M (2001) Continuous and discretized pursuit learning schemes: various algorithms and their comparison. IEEE Transactions on Systems, Man, and Cybernetics-Part B: Cybernetics 31:277\u2013287","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics-Part B: Cybernetics"},{"issue":"1","key":"1657_CR41","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1109\/TSMC.1987.289334","volume":"17","author":"MA Thathachar","year":"1987","unstructured":"Thathachar MA, Sastry PS (1987) Learning optimal discriminant functions through a cooperative game of automata. IEEE Transactions on Systems, Man and Cybernetics 17(1):73\u201385","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"issue":"5","key":"1657_CR42","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1016\/0016-0032(94)90039-6","volume":"331","author":"G Santharam","year":"1994","unstructured":"Santharam G, Sastry P, Thathachar M (1994) Continuous action set learning automata for stochastic optimization. Journal of the Franklin Institute 331(5):607\u2013628","journal-title":"Journal of the Franklin Institute"},{"issue":"4","key":"1657_CR43","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02823144","volume":"24","author":"P Sastry","year":"1999","unstructured":"Sastry P, Thathachar M (1999) Learning automata algorithms for pattern classification. Sadhana 24(4):261\u2013292","journal-title":"Sadhana"},{"issue":"1","key":"1657_CR44","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.patrec.2007.08.011","volume":"29","author":"S Zahiri","year":"2008","unstructured":"Zahiri S (2008) Learning automata based classifier. Pattern Recogn Lett 29(1):40\u201348","journal-title":"Pattern Recogn Lett"},{"issue":"3","key":"1657_CR45","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/j.ins.2004.09.004","volume":"174","author":"X Zeng","year":"2005","unstructured":"Zeng X, Liu Z (2005) A learning automata based algorithm for optimization of continuous complex functions. Inf Sci 174(3):165\u2013175","journal-title":"Inf Sci"},{"issue":"6","key":"1657_CR46","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1109\/TSMCB.2002.1049614","volume":"32","author":"M Howell","year":"2002","unstructured":"Howell M, Gordon T, Brandao F (2002) Genetic learning automata for function optimization. IEEE Transactions on Systems, Man, and Cybernetics 32(6):804\u2013815","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"issue":"8","key":"1657_CR47","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1016\/0167-8655(95)00052-I","volume":"16","author":"S Bandyopadhyay","year":"1995","unstructured":"Bandyopadhyay S, Murthy CA, Pal SK (1995) Pattern classification with genetic algorithms. Pattern Recogn Lett 16(8):801\u2013808","journal-title":"Pattern Recogn Lett"},{"issue":"6","key":"1657_CR48","doi-asserted-by":"crossref","first-page":"1179","DOI":"10.1109\/TSMCB.2005.850180","volume":"35","author":"S Misra","year":"2005","unstructured":"Misra S, Oommen BJ (2005) Dynamic algorithms for the shortest path routing problem: learning automata-based solutions. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics 35(6):1179\u20131192","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics"},{"issue":"6","key":"1657_CR49","doi-asserted-by":"crossref","first-page":"686","DOI":"10.1109\/TC.2006.83","volume":"55","author":"S Misra","year":"2006","unstructured":"Misra S, Oommen BJ (2006) An efficient dynamic algorithm for maintaining all-pairs shortest paths in stochastic networks. IEEE Trans Comput 55(6):686\u2013702","journal-title":"IEEE Trans Comput"},{"issue":"3","key":"1657_CR50","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1109\/TNSM.2009.03.090304","volume":"6","author":"H Li","year":"2009","unstructured":"Li H, Mason L, Rabbat M (2009) Distributed adaptive diverse routing for voice-over-ip in service overlay networks. IEEE Trans Netw Serv Manag 6(3):175\u2013189","journal-title":"IEEE Trans Netw Serv Manag"},{"issue":"5","key":"1657_CR51","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1109\/TAC.1973.1100406","volume":"18","author":"L Mason","year":"1973","unstructured":"Mason L (1973) An optimal learning algorithm for s-model environments. IEEE Trans Autom Control 18(5):493\u2013496","journal-title":"IEEE Trans Autom Control"},{"issue":"05","key":"1657_CR52","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1142\/S0218488506004217","volume":"14","author":"H Beigy","year":"2006","unstructured":"Beigy H, Meybodi MR (2006) Utilizing distributed learning automata to solve stochastic shortest path problems. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 14(05):591\u2013615","journal-title":"International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems"},{"issue":"5","key":"1657_CR53","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1016\/j.comnet.2009.10.007","volume":"54","author":"JA Torkestani","year":"2010","unstructured":"Torkestani JA, Meybodi MR (2010) An intelligent backbone formation algorithm for wireless ad hoc networks based on distributed learning automata. Comput Netw 54(5):826\u2013843","journal-title":"Comput Netw"},{"key":"1657_CR54","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.ins.2012.02.057","volume":"200","author":"JA Torkestani","year":"2012","unstructured":"Torkestani JA, Meybodi MR (2012) Finding minimum weight connected dominating set in stochastic graph based on learning automata. Inf Sci 200:57\u201377","journal-title":"Inf Sci"},{"issue":"2","key":"1657_CR55","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1007\/s11227-010-0484-1","volume":"59","author":"JA Torkestani","year":"2012","unstructured":"Torkestani JA, Meybodi MR (2012) A learning automata-based heuristic algorithm for solving the minimum spanning tree problem in stochastic graphs. J Supercomput 59(2):1035\u20131054","journal-title":"J Supercomput"},{"issue":"8","key":"1657_CR56","doi-asserted-by":"crossref","first-page":"2063","DOI":"10.1016\/j.asoc.2012.01.013","volume":"12","author":"Z L\u00fc","year":"2012","unstructured":"L\u00fc Z, Hao J-K (2012) Adaptive memory-based local search for max-sat. Appl Soft Comput 12(8):2063\u20132071","journal-title":"Appl Soft Comput"},{"key":"1657_CR57","unstructured":"Bouhmala N, Groesland MS, Volden-Freberg V (2016) Enhanced metaheuristics with the multilevel paradigm for max-csps, in: International Conference on Computational Science and Its Applications, Springer, pp. 543\u2013553"},{"issue":"4","key":"1657_CR58","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1162\/EVCO_a_00078","volume":"20","author":"N Bouhmala","year":"2012","unstructured":"Bouhmala N (2012) A multilevel memetic algorithm for large sat-encoded problems. Evol Comput 20(4):641\u2013664","journal-title":"Evol Comput"},{"key":"1657_CR59","unstructured":"Selman B, Levesque HJ, Mitchell DG et al. (1992) A new method for solving hard satisfiability problems., in: AAAI, Vol. 92, pp. 440\u2013446"},{"key":"1657_CR60","unstructured":"Selman B, Kautz HA, Cohen B (1994) Noise strategies for improving local search, in: AAAI, Vol. 94, pp. 337\u2013343"},{"key":"1657_CR61","unstructured":"McAllester D, Selman B, Kautz H (1997) Evidence for invariants in local search, in: AAAI\/IAAI, Rhode Island, USA, pp. 321\u2013326"},{"issue":"3","key":"1657_CR62","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F (1989) Tabu search\u201cpart i\u201d. ORSA J Comput 1(3):190\u2013206","journal-title":"ORSA J Comput"},{"issue":"4","key":"1657_CR63","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF02241270","volume":"44","author":"P Hansen","year":"1990","unstructured":"Hansen P, Jaumard B (1990) Algorithms for the maximum satisfiability problem. Computing 44(4):279\u2013303","journal-title":"Computing"},{"key":"1657_CR64","unstructured":"Gent IP, Walsh T (1995) Unsatisfied variables in local search, Hybrid problems, hybrid solutions 73\u201385"},{"key":"1657_CR65","unstructured":"Gent IP, Walsh T (1993) Towards an understanding of hill-climbing procedures for sat, in: AAAI, Vol. 93, pp. 28\u201333"},{"key":"1657_CR66","unstructured":"Cha B, Iwama K (1995) Performance test of local search algorithms using new types of random cnf formulas, in: IJCAI, Vol. 95, pp. 304\u2013310"},{"key":"1657_CR67","unstructured":"Frank J (1997) Learning short-term weights for gsat, in: IJCAI (1), pp. 384\u2013391"},{"key":"1657_CR68","unstructured":"Spears WM (1993) Simulated annealing for hard satisfiability problems., in: Cliques, Coloring, and Satisfiability, Citeseer, pp. 533\u2013558"},{"issue":"1","key":"1657_CR69","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s10732-018-9386-9","volume":"25","author":"N Bouhmala","year":"2019","unstructured":"Bouhmala N (2019) Combining simulated annealing with local search heuristic for max-sat. J Heuristics 25(1):47\u201369","journal-title":"J Heuristics"},{"key":"1657_CR70","unstructured":"Eiben A, Van der Hauw J (1997) Solving 3-sat with adaptive genetic algorithms, in: Proceedings of the 4th IEEE Conference on Evolutionary Computation, Vol. 81, IEEE Press, p. 86"},{"key":"1657_CR71","doi-asserted-by":"crossref","unstructured":"Johnson DS, Trick MA (1996) Cliques, coloring, and satisfiability: second DIMACS implementation challenge, October 11\u201313, 1993, Vol. 26, American Mathematical Soc","DOI":"10.1090\/dimacs\/026"},{"key":"1657_CR72","unstructured":"Hao J-K, Lardeux F, Saubion F (2003) Evolutionary computing for the satisfiability problem, in: Workshops on Applications of Evolutionary Computation, Springer, pp. 258\u2013267"},{"key":"1657_CR73","unstructured":"Smyth K, Hoos HH, St\u00fctzle T (2003) Iterated robust tabu search for max-sat, in: Conference of the Canadian Society for Computational Studies of Intelligence, Springer, pp. 129\u2013144"},{"key":"1657_CR74","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.eswa.2016.04.018","volume":"59","author":"AK Kar","year":"2016","unstructured":"Kar AK (2016) Bio inspired computing\u2013a review of algorithms and scope of applications. Expert Syst Appl 59:20\u201332","journal-title":"Expert Syst Appl"},{"key":"1657_CR75","doi-asserted-by":"crossref","unstructured":"Thathachar MAL, Sastry PS, A new approach to designing reinforcement schemes for learning automata, IEEE Transactions on Systems, Man, and Cybernetics SMC-15","DOI":"10.1109\/TSMC.1985.6313407"},{"issue":"3","key":"1657_CR76","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0020-0190(01)00258-7","volume":"82","author":"WJ Gutjahr","year":"2002","unstructured":"Gutjahr WJ (2002) Aco algorithms with guaranteed convergence to the optimal solution. Inf Process Lett 82(3):145\u2013153","journal-title":"Inf Process Lett"},{"key":"1657_CR77","unstructured":"Hoos HH (2002) An adaptive noise mechanism for walksat, in: Eighteenth national conference on Artificial intelligence, American Association for Artificial Intelligence, pp. 655\u2013660"},{"issue":"4\u20135","key":"1657_CR78","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"\u00c9 Taillard","year":"1991","unstructured":"Taillard \u00c9 (1991) Robust taboo search for the quadratic assignment problem. Parallel Comput 17(4\u20135):443\u2013455","journal-title":"Parallel Comput"},{"key":"1657_CR79","unstructured":"Li CM, Wei W, Zhang H (2007) Combining adaptive noise and look-ahead in local search for sat, in: International Conference on Theory and Applications of Satisfiability Testing, Springer, pp. 121\u2013133"},{"key":"1657_CR80","unstructured":"Tompkins DA, Hoos HH (2004) Ubcsat: An implementation and experimentation environment for sls algorithms for sat and max-sat, in: International conference on theory and applications of satisfiability testing, Springer, pp. 306\u2013320"},{"key":"1657_CR81","unstructured":"Wauters T, Verbeeck K, De Causmaecker P, Berghe GV (2013) Boosting metaheuristic search using reinforcement learning, in: Hybrid Metaheuristics, Springer, pp. 433\u2013452"},{"volume-title":"Survey in combinatorial optimization","year":"1985","key":"1657_CR82","unstructured":"Martello S (ed) (1985) Survey in combinatorial optimization. Elsevier North-Holland, Inc., New York"},{"key":"1657_CR83","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1016\/0016-0032(94)90039-6","volume":"331B5","author":"G Santharam","year":"1994","unstructured":"Santharam G, Sastry PS, Thathachar MAL (1994) Continuous action set learning automata for stochastic optimization. Journal of the Franklin Institute 331B5:607\u2013628","journal-title":"Journal of the Franklin Institute"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-020-01657-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-020-01657-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-020-01657-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,14]],"date-time":"2021-04-14T00:20:20Z","timestamp":1618359620000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-020-01657-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,14]]},"references-count":83,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["1657"],"URL":"https:\/\/doi.org\/10.1007\/s10489-020-01657-9","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2020,4,14]]},"assertion":[{"value":"14 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}