{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:00:10Z","timestamp":1742965210635,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031234798"},{"type":"electronic","value":"9783031234804"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-23480-4_22","type":"book-chapter","created":{"date-parts":[[2023,1,23]],"date-time":"2023-01-23T09:09:35Z","timestamp":1674464975000},"page":"264-276","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Buggy Pinball: A Novel Single-point Meta-heuristic for\u00a0Global Continuous Optimization"],"prefix":"10.1007","author":[{"given":"Vasileios","family":"Lymperakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Athanasios Aris","family":"Panagopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,24]]},"reference":[{"issue":"1","key":"22_CR1","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/s10462-020-09860-3","volume":"54","author":"M Abdel-Basset","year":"2021","unstructured":"Abdel-Basset, M., Ding, W., El-Shahat, D.: A hybrid harris hawks optimization algorithm with simulated annealing for feature selection. Artif. Intell. Rev. 54(1), 593\u2013637 (2021)","journal-title":"Artif. Intell. Rev."},{"issue":"4","key":"22_CR2","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1007\/s10898-004-9972-2","volume":"31","author":"MM Ali","year":"2005","unstructured":"Ali, M.M., Khompatraporn, C., Zabinsky, Z.B.: A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems. J. Global Optim. 31(4), 635\u2013672 (2005)","journal-title":"J. Global Optim."},{"issue":"3","key":"22_CR3","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1088\/0305-4470\/28\/3\/018","volume":"28","author":"M Biehl","year":"1995","unstructured":"Biehl, M., Schwarze, H.: Learning by on-line gradient descent. J. Phys. A: Math. Gen. 28(3), 643 (1995)","journal-title":"J. Phys. A: Math. Gen."},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1017\/S096249291600009X","volume":"25","author":"A Chambolle","year":"2016","unstructured":"Chambolle, A., Pock, T.: An introduction to continuous optimization for imaging. Acta Numer 25, 161\u2013319 (2016)","journal-title":"Acta Numer"},{"issue":"11","key":"22_CR5","doi-asserted-by":"publisher","first-page":"1498","DOI":"10.1002\/nme.2873","volume":"83","author":"S Dhouib","year":"2010","unstructured":"Dhouib, S., Kharrat, A., Chabchoub, H.: A multi-start threshold accepting algorithm for multiple objective continuous optimization problems. Int. J. Numer. Meth. Eng. 83(11), 1498\u20131517 (2010)","journal-title":"Int. J. Numer. Meth. Eng."},{"unstructured":"Duchi, J., Hazan, E., Singer, Y.: Adaptive subgradient methods for online learning and stochastic optimization. J. Mach. Learn. Res. 12(7) (2011)","key":"22_CR6"},{"issue":"1","key":"22_CR7","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0021-9991(90)90201-B","volume":"90","author":"G Dueck","year":"1990","unstructured":"Dueck, G., Scheuer, T.: Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing. J. Comput. Phys. 90(1), 161\u2013175 (1990)","journal-title":"J. Comput. Phys."},{"issue":"1","key":"22_CR8","first-page":"8","volume":"26","author":"J Frausto-Solis","year":"2021","unstructured":"Frausto-Solis, J., Hern\u00e1ndez-Ram\u00edrez, L., Castilla-Valdez, G., Gonz\u00e1lez-Barbosa, J.J., S\u00e1nchez-Hern\u00e1ndez, J.P.: Chaotic multi-objective simulated annealing and threshold accepting for job shop scheduling problem. Math. Comput. Appli. 26(1), 8 (2021)","journal-title":"Math. Comput. Appli."},{"unstructured":"Geiger, M.J.: Pace solver description: A simplified threshold accepting approach for the cluster editing problem. In: 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2021)","key":"22_CR9"},{"issue":"2","key":"22_CR10","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/242587.242592","volume":"7","author":"J Grass","year":"1996","unstructured":"Grass, J., Zilberstein, S.: Anytime algorithm development tools. ACM SIGART Bulletin 7(2), 20\u201327 (1996)","journal-title":"ACM SIGART Bulletin"},{"issue":"3","key":"22_CR11","doi-asserted-by":"publisher","first-page":"2323","DOI":"10.1007\/s10462-020-09906-6","volume":"54","author":"AH Halim","year":"2021","unstructured":"Halim, A.H., Ismail, I., Das, S.: Performance assessment of the metaheuristic optimization algorithms: an exhaustive review. Artif. Intell. Rev. 54(3), 2323\u20132409 (2021)","journal-title":"Artif. Intell. Rev."},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/3-540-44668-0_13","volume-title":"Artificial Neural Networks \u2014 ICANN 2001","author":"S Hochreiter","year":"2001","unstructured":"Hochreiter, S., Younger, A.S., Conwell, P.R.: Learning to learn using gradient descent. In: Dorffner, G., Bischof, H., Hornik, K. (eds.) ICANN 2001. LNCS, vol. 2130, pp. 87\u201394. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44668-0_13"},{"doi-asserted-by":"publisher","unstructured":"Jeyakumar, V., Rubinov, A.M.: Continuous Optimization: Current Trends and Modern Applications, vol. 99. Springer Science & Business Media (2006). https:\/\/doi.org\/10.1007\/b137941","key":"22_CR13","DOI":"10.1007\/b137941"},{"doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of ICNN 1995-International Conference On Neural Networks, vol. 4, pp. 1942\u20131948. IEEE (1995)","key":"22_CR14","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"4598","key":"22_CR15","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"key":"22_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113837","volume":"165","author":"SW Lin","year":"2021","unstructured":"Lin, S.W., Cheng, C.Y., Pourhejazy, P., Ying, K.C.: Multi-temperature simulated annealing for optimizing mixed-blocking permutation flowshop scheduling problems. Expert Syst. Appl. 165, 113837 (2021)","journal-title":"Expert Syst. Appl."},{"key":"22_CR17","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.advengsoft.2016.01.008","volume":"95","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili, S., Lewis, A.: The whale optimization algorithm. Adv. Eng. Softw. 95, 51\u201367 (2016)","journal-title":"Adv. Eng. Softw."},{"key":"22_CR18","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","volume":"69","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili, S., Mirjalili, S.M., Lewis, A.: Grey wolf optimizer. Adv. Eng. Softw. 69, 46\u201361 (2014)","journal-title":"Adv. Eng. Softw."},{"key":"22_CR19","first-page":"48","volume":"101","author":"M Molga","year":"2005","unstructured":"Molga, M., Smutnicki, C.: Test functions for optimization needs. Test Funct. Optim. Needs 101, 48 (2005)","journal-title":"Test Funct. Optim. Needs"},{"doi-asserted-by":"publisher","unstructured":"Munoz, M.A., Kirley, M., Halgamuge, S.K.: The algorithm selection problem on the continuous optimization domain. In: Computational Intelligence In Intelligent Data Analysis, pp. 75\u201389. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-642-32378-2_6","key":"22_CR20","DOI":"10.1007\/978-3-642-32378-2_6"},{"issue":"1","key":"22_CR21","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0893-6080(98)00116-6","volume":"12","author":"N Qian","year":"1999","unstructured":"Qian, N.: On the momentum term in gradient descent learning algorithms. Neural Netw. 12(1), 145\u2013151 (1999)","journal-title":"Neural Netw."},{"doi-asserted-by":"crossref","unstructured":"Shalev-Shwartz, S., Ben-David, S.: Understanding machine learning: From theory to algorithms. Cambridge University Press (2014)","key":"22_CR22","DOI":"10.1017\/CBO9781107298019"},{"issue":"06","key":"22_CR23","doi-asserted-by":"publisher","first-page":"1630001","DOI":"10.1142\/S0218213016300015","volume":"25","author":"N Siddique","year":"2016","unstructured":"Siddique, N., Adeli, H.: Simulated annealing, its variants and engineering applications. Int. J. Artif. Intell. Tools 25(06), 1630001 (2016)","journal-title":"Int. J. Artif. Intell. Tools"},{"unstructured":"Taylan, P., Weber, G.W., Yerlikaya, F.: Continuous optimization applied in mars for modern applications in finance, science and technology. In: ISI Proceedings of 20th Mini-euro Conference Continuous Optimization and Knowledge-based Technologies, pp. 317\u2013322. Citeseer (2008)","key":"22_CR24"},{"issue":"2","key":"22_CR25","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0021-9991(84)90095-0","volume":"56","author":"D Vanderbilt","year":"1984","unstructured":"Vanderbilt, D., Louie, S.G.: A monte carlo simulated annealing approach to optimization over continuous variables. J. Comput. Phys. 56(2), 259\u2013271 (1984)","journal-title":"J. Comput. Phys."},{"issue":"2","key":"22_CR26","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1002\/bdrc.20151","volume":"87","author":"GW Weber","year":"2009","unstructured":"Weber, G.W., \u00d6z\u00f6\u011f\u00fcr-Aky\u00fcz, S., Kropat, E.: A review on data mining and continuous optimization applications in computational biology and medicine. Birth Defects Res. C Embryo Today 87(2), 165\u2013181 (2009)","journal-title":"Birth Defects Res. C Embryo Today"},{"issue":"16","key":"22_CR27","doi-asserted-by":"publisher","first-page":"3817","DOI":"10.1016\/S0009-2509(03)00236-7","volume":"58","author":"Q Xiong","year":"2003","unstructured":"Xiong, Q., Jutan, A.: Continuous optimization using a dynamic simplex method. Chem. Eng. Sci. 58(16), 3817\u20133828 (2003)","journal-title":"Chem. Eng. Sci."}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-23480-4_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,12]],"date-time":"2024-10-12T19:42:03Z","timestamp":1728762123000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-23480-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031234798","9783031234804"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-23480-4_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"24 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICAISC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Artificial Intelligence and Soft Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zakopane","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icaisc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icaisc.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}