{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T03:22:07Z","timestamp":1776828127814,"version":"3.51.2"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2019,1,13]],"date-time":"2019-01-13T00:00:00Z","timestamp":1547337600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s00521-019-04008-z","type":"journal-article","created":{"date-parts":[[2019,1,13]],"date-time":"2019-01-13T15:37:01Z","timestamp":1547393821000},"page":"5147-5161","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":47,"title":["Q-learning-based simulated annealing algorithm for constrained engineering design problems"],"prefix":"10.1007","volume":"32","author":[{"given":"Hussein","family":"Samma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junita","family":"Mohamad-Saleh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shahrel Azmin","family":"Suandi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Badr","family":"Lahasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,13]]},"reference":[{"key":"4008_CR1","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/j.eswa.2017.08.050","volume":"91","author":"M Alswaitti","year":"2018","unstructured":"Alswaitti M, Albughdadi M, Isa NAM (2018) Density-based particle swarm optimization algorithm for data clustering. Expert Syst Appl 91:170\u2013186","journal-title":"Expert Syst Appl"},{"key":"4008_CR2","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/j.eswa.2018.08.007","volume":"115","author":"FB Ozsoydan","year":"2019","unstructured":"Ozsoydan FB, Baykaso\u011flu A (2019) Quantum firefly swarms for multimodal dynamic optimization problems. Expert Syst Appl 115:189\u2013199","journal-title":"Expert Syst Appl"},{"key":"4008_CR3","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.cie.2017.10.025","volume":"115","author":"D Zouache","year":"2018","unstructured":"Zouache D, Abdelaziz FB (2018) A cooperative swarm intelligence algorithm based on quantum-inspired and rough sets for feature selection. Comput Ind Eng 115:26\u201336","journal-title":"Comput Ind Eng"},{"key":"4008_CR4","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1007\/s00521-016-2507-1","volume":"29","author":"J Xiao","year":"2018","unstructured":"Xiao J, Li W, Liu B, Ni P (2018) A novel multi-population coevolution strategy for single objective immune optimization algorithm. Neural Comput Appl 29:1115\u20131128","journal-title":"Neural Comput Appl"},{"key":"4008_CR5","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/j.matcom.2018.04.013","volume":"155","author":"Z-X Zheng","year":"2018","unstructured":"Zheng Z-X, Li J-Q, Duan P-Y (2018) Optimal chiller loading by improved artificial fish swarm algorithm for energy saving. Math Comput Simul 155:227\u2013243","journal-title":"Math Comput Simul"},{"key":"4008_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-018-3638-3","author":"A Prakasam","year":"2018","unstructured":"Prakasam A, Savarimuthu N (2018) Novel local restart strategies with hyper-populated ant colonies for dynamic optimization problems. Neural Comput Appl. https:\/\/doi.org\/10.1007\/s00521-018-3638-3","journal-title":"Neural Comput Appl"},{"issue":"1","key":"4008_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00500-018-3530-1","volume":"23","author":"S Mahdavi","year":"2019","unstructured":"Mahdavi S, Rahnamayan S, Mahdavi A (2019) Majority voting for discrete population-based optimization algorithms. Soft Comput 23(1):1\u201318","journal-title":"Soft Comput"},{"key":"4008_CR8","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/j.eswa.2018.08.051","volume":"116","author":"S Arora","year":"2019","unstructured":"Arora S, Anand P (2019) Binary butterfly optimization approaches for feature selection. Expert Syst Appl 116:147\u2013160","journal-title":"Expert Syst Appl"},{"key":"4008_CR9","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.swevo.2017.10.004","volume":"39","author":"Y Chen","year":"2018","unstructured":"Chen Y, Li L, Peng H, Xiao J, Wu Q (2018) Dynamic multi-swarm differential learning particle swarm optimizer. Swarm Evol Comput 39:209\u2013221","journal-title":"Swarm Evol Comput"},{"key":"4008_CR10","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/j.eswa.2018.09.015","volume":"117","author":"M Mafarja","year":"2018","unstructured":"Mafarja M, Aljarah I, Faris H, Hammouri AI, Ala\u2019M A-Z, Mirjalili S (2018) Binary grasshopper optimisation algorithm approaches for feature selection problems. Expert Syst Appl 117:267\u2013286","journal-title":"Expert Syst Appl"},{"key":"4008_CR11","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1007\/s00521-016-2599-7","volume":"29","author":"Y Wang","year":"2018","unstructured":"Wang Y, Ouyang D, Yin M, Zhang L, Zhang Y (2018) A restart local search algorithm for solving maximum set k-covering problem. Neural Comput Appl 29:755\u2013765","journal-title":"Neural Comput Appl"},{"key":"4008_CR12","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s10732-017-9344-y","volume":"23","author":"H Zhang","year":"2017","unstructured":"Zhang H, Cai S, Luo C, Yin M (2017) An efficient local search algorithm for the winner determination problem. J Heuristics 23:367\u2013396","journal-title":"J Heuristics"},{"key":"4008_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00521-016-2518-y","volume":"30","author":"Y Zhou","year":"2018","unstructured":"Zhou Y, Wang Y, Gao J, Luo N, Wang J (2018) An efficient local search for partial vertex cover problem. Neural Comput Appl 30:1\u201312","journal-title":"Neural Comput Appl"},{"key":"4008_CR14","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.cor.2018.04.004","volume":"96","author":"X Li","year":"2018","unstructured":"Li X, Zhu L, Baki F, Chaouch A (2018) Tabu search and iterated local search for the cyclic bottleneck assignment problem. Comput Oper Res 96:120\u2013130","journal-title":"Comput Oper Res"},{"key":"4008_CR15","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.ins.2018.08.052","volume":"471","author":"S Cai","year":"2019","unstructured":"Cai S, Li Y, Hou W, Wang H (2019) Towards faster local search for minimum weight vertex cover on massive graphs. Inf Sci 471:64\u201379","journal-title":"Inf Sci"},{"key":"4008_CR16","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1016\/j.asoc.2016.01.006","volume":"43","author":"H Samma","year":"2016","unstructured":"Samma H, Lim CP, Saleh JM (2016) A new reinforcement learning-based memetic particle swarm optimizer. Appl Soft Comput 43:276\u2013297","journal-title":"Appl Soft Comput"},{"key":"4008_CR17","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1007\/978-3-642-29694-9_29","volume-title":"Artificial intelligence, evolutionary computing and metaheuristics","author":"D Boughaci","year":"2013","unstructured":"Boughaci D (2013) Metaheuristic approaches for the winner determination problem in combinatorial auction. In: Artificial intelligence, evolutionary computing and metaheuristics. Springer, Berlin, Heidelberg, pp 775\u2013791"},{"issue":"1","key":"4008_CR18","doi-asserted-by":"crossref","first-page":"439","DOI":"10.4007\/annals.2005.162.439","volume":"162","author":"I Dinur","year":"2005","unstructured":"Dinur I, Safra S (2005) On the hardness of approximating minimum vertex cover. Ann Math 162(1):439\u2013485","journal-title":"Ann Math"},{"key":"4008_CR19","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671\u2013680","journal-title":"Science"},{"key":"4008_CR20","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.asoc.2016.12.027","volume":"53","author":"FY Vincent","year":"2017","unstructured":"Vincent FY, Redi AP, Hidayat YA, Wibowo OJ (2017) A simulated annealing heuristic for the hybrid vehicle routing problem. Appl Soft Comput 53:119\u2013132","journal-title":"Appl Soft Comput"},{"key":"4008_CR21","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1016\/j.asoc.2016.08.037","volume":"49","author":"K Akram","year":"2016","unstructured":"Akram K, Kamal K, Zeb A (2016) Fast simulated annealing hybridized with quenching for solving job shop scheduling problem. Appl Soft Comput 49:510\u2013523","journal-title":"Appl Soft Comput"},{"key":"4008_CR22","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/j.asoc.2017.12.005","volume":"64","author":"Z Liu","year":"2018","unstructured":"Liu Z, Liu Z, Zhu Z, Shen Y, Dong J (2018) Simulated annealing for a multi-level nurse rostering problem in hemodialysis service. Appl Soft Comput 64:148\u2013160","journal-title":"Appl Soft Comput"},{"key":"4008_CR23","doi-asserted-by":"crossref","first-page":"1827","DOI":"10.1016\/j.asoc.2010.05.029","volume":"11","author":"Z Xinchao","year":"2011","unstructured":"Xinchao Z (2011) Simulated annealing algorithm with adaptive neighborhood. Appl Soft Comput 11:1827\u20131836","journal-title":"Appl Soft Comput"},{"key":"4008_CR24","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/j.eswa.2017.01.053","volume":"77","author":"AE-S Ezugwu","year":"2017","unstructured":"Ezugwu AE-S, Adewumi AO, Fr\u00eencu ME (2017) Simulated annealing based symbiotic organisms search optimization algorithm for traveling salesman problem. Expert Syst Appl 77:189\u2013210","journal-title":"Expert Syst Appl"},{"key":"4008_CR25","doi-asserted-by":"crossref","first-page":"1085","DOI":"10.1016\/j.asoc.2017.10.019","volume":"71","author":"S Torkaman","year":"2017","unstructured":"Torkaman S, Ghomi SF, Karimi B (2017) Hybrid simulated annealing and genetic approach for solving a multi-stage production planning with sequence-dependent setups in a closed-loop supply chain. Appl Soft Comput 71:1085\u20131104","journal-title":"Appl Soft Comput"},{"key":"4008_CR26","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/j.ins.2018.03.042","volume":"450","author":"A Assad","year":"2018","unstructured":"Assad A, Deep K (2018) A hybrid harmony search and simulated annealing algorithm for continuous optimization. Inf Sci 450:246\u2013266","journal-title":"Inf Sci"},{"key":"4008_CR27","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1016\/j.asoc.2017.07.023","volume":"60","author":"F Javidrad","year":"2017","unstructured":"Javidrad F, Nazari M (2017) A new hybrid particle swarm and simulated annealing stochastic optimization method. Appl Soft Comput 60:634\u2013654","journal-title":"Appl Soft Comput"},{"key":"4008_CR28","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1016\/j.eswa.2018.09.002","volume":"116","author":"K Fardi","year":"2018","unstructured":"Fardi K, Jafarzadeh_Ghoushchi S, Hafezalkotob A (2018) An extended robust approach for a cooperative inventory routing problem. Expert Syst Appl 116:310\u2013327","journal-title":"Expert Syst Appl"},{"key":"4008_CR29","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/j.eswa.2018.09.047","volume":"118","author":"R Kempen","year":"2018","unstructured":"Kempen R, Meier A, Hasche J, Mueller K (2018) Optimized multi-algorithm voting: increasing objectivity in clustering. Expert Syst Appl 118:217\u2013230","journal-title":"Expert Syst Appl"},{"key":"4008_CR30","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/978-1-4939-1384-8_10","volume-title":"Handbook of simulation optimization","author":"S Andrad\u00f3ttir","year":"2015","unstructured":"Andrad\u00f3ttir S (2015) A review of random search methods. In: Handbook of simulation optimization. Springer, New York, pp 277\u2013292"},{"key":"4008_CR31","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0004-3702(99)00052-1","volume":"112","author":"RS Sutton","year":"1999","unstructured":"Sutton RS, Precup D, Singh S (1999) Between MDPs and semi-MDPs: A framework for temporal abstraction in reinforcement learning. Artif Intell 112:181\u2013211","journal-title":"Artif Intell"},{"key":"4008_CR32","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1016\/j.ejor.2017.08.035","volume":"265","author":"L Wei","year":"2018","unstructured":"Wei L, Zhang Z, Zhang D, Leung SC (2018) A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints. Eur J Oper Res 265:843\u2013859","journal-title":"Eur J Oper Res"},{"key":"4008_CR33","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.engappai.2006.03.003","volume":"20","author":"Q He","year":"2007","unstructured":"He Q, Wang L (2007) An effective co-evolutionary particle swarm optimization for constrained engineering design problems. Eng Appl Artif Intell 20:89\u201399","journal-title":"Eng Appl Artif Intell"},{"key":"4008_CR34","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.eswa.2018.05.027","volume":"110","author":"MP Ferreira","year":"2018","unstructured":"Ferreira MP, Rocha ML, Neto AJS, Sacco WF (2018) A constrained ITGO heuristic applied to engineering optimization. Expert Syst Appl 110:106\u2013124","journal-title":"Expert Syst Appl"},{"key":"4008_CR35","doi-asserted-by":"crossref","first-page":"3880","DOI":"10.1016\/j.eswa.2008.02.039","volume":"36","author":"E Zahara","year":"2009","unstructured":"Zahara E, Kao Y-T (2009) Hybrid Nelder-Mead simplex search and particle swarm optimization for constrained engineering design problems. Expert Syst Appl 36:3880\u20133886","journal-title":"Expert Syst Appl"},{"key":"4008_CR36","first-page":"249","volume":"5","author":"RM Rizk-Allah","year":"2017","unstructured":"Rizk-Allah RM (2017) Hybridizing sine cosine algorithm with multi-orthogonal search strategy for engineering design problems. J Comput Des Eng 5:249\u2013273","journal-title":"J Comput Des Eng"},{"key":"4008_CR37","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1109\/TCIAIG.2010.2100395","volume":"3","author":"M McPartland","year":"2011","unstructured":"McPartland M, Gallagher M (2011) Reinforcement learning in first person shooter games. IEEE Trans Comput Intell AI Games 3:43\u201356","journal-title":"IEEE Trans Comput Intell AI Games"},{"key":"4008_CR38","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1109\/TCIAIG.2012.2212279","volume":"4","author":"R Sharma","year":"2012","unstructured":"Sharma R, Spaan MTJ (2012) Bayesian-game-based fuzzy reinforcement learning control for decentralized POMDPs. IEEE Trans Comput Intell AI Games 4:309\u2013328","journal-title":"IEEE Trans Comput Intell AI Games"},{"key":"4008_CR39","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1109\/TSMCA.2012.2226024","volume":"43","author":"P Rakshit","year":"2013","unstructured":"Rakshit P, Konar A, Bhowmik P, Goswami I, Das S, Jain LC, Nagar AK (2013) Realization of an adaptive memetic algorithm using differential evolution and Q-learning: a case study in multirobot path planning. IEEE Trans Syst Man Cybern Syst 43:814\u2013831","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"4008_CR40","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1061\/(ASCE)0733-9445(1995)121:2(301)","volume":"121","author":"P Thanedar","year":"1995","unstructured":"Thanedar P, Vanderplaats G (1995) Survey of discrete variable optimization for structural design. J Struct Eng 121:301\u2013306","journal-title":"J Struct Eng"},{"key":"4008_CR41","first-page":"327","volume-title":"Optimization in pre-contract ship design","author":"H Nowacki","year":"1973","unstructured":"Nowacki H (1973) Optimization in pre-contract ship design, vol 2. Elsevier, New York, pp 327\u2013338"},{"key":"4008_CR42","doi-asserted-by":"crossref","unstructured":"Deb K, Pratap A, Moitra S (2000) Mechanical component design for multiple objectives using elitist non-dominated sorting ga. In: International conference on parallel problem solving from nature, Springer, pp 859\u2013868","DOI":"10.1007\/3-540-45356-3_84"},{"key":"4008_CR43","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1115\/1.2912596","volume":"112","author":"E Sandgren","year":"1990","unstructured":"Sandgren E (1990) Nonlinear integer and discrete programming in mechanical design optimization. J Mech Des 112:223\u2013229","journal-title":"J Mech Des"},{"key":"4008_CR44","volume-title":"Studies in fuzzyness and soft computing","author":"A Osyczka","year":"2002","unstructured":"Osyczka A (2002) Evolutionary algorithms for single and multicriteria design optimization. Studies in fuzzyness and soft computing. Springer, Heidelberg"},{"key":"4008_CR45","doi-asserted-by":"crossref","unstructured":"Mezura-Montes E, Coello CAC (2005) Useful infeasible solutions in engineering optimization with evolutionary algorithms. In: Mexican international conference on artificial intelligence, Springer, pp 652\u2013662","DOI":"10.1007\/11579427_66"},{"key":"4008_CR46","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: IEEE international conference on neural networks, 1995. Proceedings, vol 1944, pp 1942\u20131948"},{"key":"4008_CR47","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1109\/TEVC.2005.857610","volume":"10","author":"JJ Liang","year":"2006","unstructured":"Liang JJ, Qin AK, Suganthan PN, Baskar S (2006) Comprehensive learning particle swarm optimizer for global optimization of multimodal functions. IEEE Trans Evol Comput 10:281\u2013295","journal-title":"IEEE Trans Evol Comput"},{"key":"4008_CR48","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","volume":"69","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili S, Mirjalili SM, Lewis A (2014) Grey wolf optimizer. Adv Eng Softw 69:46\u201361","journal-title":"Adv Eng Softw"},{"key":"4008_CR49","unstructured":"Pham D, Ghanbarzadeh A, Koc E, Otri S, Rahim S, Zaidi M (2005) The bees algorithm. Technical note, Manufacturing Engineering Centre, Cardiff University, UK, pp 1\u201357"},{"key":"4008_CR50","doi-asserted-by":"crossref","first-page":"3735","DOI":"10.1016\/j.eswa.2010.09.032","volume":"38","author":"SZ Zhao","year":"2011","unstructured":"Zhao SZ, Suganthan PN, Pan Q-K, Tasgetiren MF (2011) Dynamic multi-swarm particle swarm optimizer with harmony search. Expert Syst Appl 38:3735\u20133742","journal-title":"Expert Syst Appl"},{"key":"4008_CR51","doi-asserted-by":"crossref","first-page":"4120","DOI":"10.1016\/j.eswa.2014.12.046","volume":"42","author":"C-L Chan","year":"2015","unstructured":"Chan C-L, Chen C-L (2015) A cautious PSO with conditional random. Expert Syst Appl 42:4120\u20134125","journal-title":"Expert Syst Appl"},{"key":"4008_CR52","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.knosys.2014.03.015","volume":"64","author":"Y Zhang","year":"2014","unstructured":"Zhang Y, Wang S, Phillips P, Ji G (2014) Binary PSO with mutation operator for feature selection using decision tree applied to spam detection. Knowl-Based Syst 64:22\u201331","journal-title":"Knowl-Based Syst"},{"key":"4008_CR53","doi-asserted-by":"crossref","first-page":"8509","DOI":"10.1016\/j.eswa.2011.01.050","volume":"38","author":"R Pandi","year":"2011","unstructured":"Pandi R, Panigrahi BK (2011) Dynamic economic load dispatch using hybrid swarm intelligence based harmony search algorithm. Expert Syst Appl 38:8509\u20138514","journal-title":"Expert Syst Appl"},{"key":"4008_CR54","doi-asserted-by":"crossref","DOI":"10.1201\/9781420036268","volume-title":"Handbook of parametric and nonparametric statistical procedures","author":"DJ Sheskin","year":"2003","unstructured":"Sheskin DJ (2003) Handbook of parametric and nonparametric statistical procedures. CRC Press, Boca Raton"},{"key":"4008_CR55","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/978-94-015-7744-1_2","volume-title":"Simulated annealing: theory and applications","author":"PJM Laarhoven Van","year":"1987","unstructured":"Van Laarhoven PJM, Aarts EH (1987) Simulated annealing. Simulated annealing: theory and applications. Springer, Dordrecht, pp 7\u201315"},{"key":"4008_CR56","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.ins.2016.02.054","volume":"352","author":"K Yu","year":"2016","unstructured":"Yu K, Wang X, Wang Z (2016) Constrained optimization based on improved teaching\u2013learning-based optimization algorithm. Inf Sci 352:61\u201378","journal-title":"Inf Sci"},{"key":"4008_CR57","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.eswa.2015.09.009","volume":"44","author":"W Yi","year":"2016","unstructured":"Yi W, Li X, Gao L, Zhou Y, Huang J (2016) \u03b5 constrained differential evolution with pre-estimated comparison using gradient-based approximation for constrained optimization problems. Expert Syst Appl 44:37\u201349","journal-title":"Expert Syst Appl"},{"key":"4008_CR58","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1214\/aos\/1176344552","volume":"7","author":"B Efron","year":"1979","unstructured":"Efron B (1979) Bootstrap methods: another look at the jackknife. Ann Stat 7:1\u201326","journal-title":"Ann Stat"},{"key":"4008_CR59","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1109\/TEVC.2005.857610","volume":"10","author":"JJ Liang","year":"2006","unstructured":"Liang JJ, Qin AK, Suganthan PN, Baskar S (2006) Comprehensive learning particle swarm optimizer for global optimization of multimodal functions. IEEE Trans Evol Comput 10:281\u2013295","journal-title":"IEEE Trans Evol Comput"},{"key":"4008_CR60","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1177\/003754970107600201","volume":"76","author":"ZW Geem","year":"2001","unstructured":"Geem ZW, Kim JH, Loganathan GV (2001) A new heuristic optimization algorithm: harmony search. Simulation 76:60\u201368","journal-title":"Simulation"},{"key":"4008_CR61","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1109\/TSMCB.2006.883272","volume":"37","author":"B Liu","year":"2007","unstructured":"Liu B, Wang L, Jin Y-H (2007) An effective PSO-based memetic algorithm for flow shop scheduling. IEEE Trans Syst Man Cybern Part B Cybern 37:18\u201327","journal-title":"IEEE Trans Syst Man Cybern Part B Cybern"},{"key":"4008_CR62","doi-asserted-by":"crossref","first-page":"3695","DOI":"10.1016\/j.eswa.2008.02.048","volume":"36","author":"SC Chiam","year":"2009","unstructured":"Chiam SC, Tan KC, Mamun AA (2009) A memetic model of evolutionary PSO for computational finance applications. Expert Syst Appl 36:3695\u20133711","journal-title":"Expert Syst Appl"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-019-04008-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-019-04008-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-019-04008-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,12]],"date-time":"2023-09-12T22:00:36Z","timestamp":1694556036000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-019-04008-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,13]]},"references-count":62,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["4008"],"URL":"https:\/\/doi.org\/10.1007\/s00521-019-04008-z","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,13]]},"assertion":[{"value":"14 July 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"Hussein Samma, Junita Mohamad-Saleh, Shahrel Azmin Suandi, and Badr Lahasan declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}