{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:17:43Z","timestamp":1752229063722,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,4,30]],"date-time":"2022-04-30T00:00:00Z","timestamp":1651276800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,4,30]],"date-time":"2022-04-30T00:00:00Z","timestamp":1651276800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004895","name":"European Social Fund","doi-asserted-by":"publisher","award":["MIS-5033021"],"award-info":[{"award-number":["MIS-5033021"]}],"id":[{"id":"10.13039\/501100004895","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1007\/s10898-022-01162-y","type":"journal-article","created":{"date-parts":[[2022,4,30]],"date-time":"2022-04-30T02:02:32Z","timestamp":1651284152000},"page":"685-705","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Parallel algorithm portfolios with adaptive resource allocation strategy"],"prefix":"10.1007","volume":"88","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0599-4353","authenticated-orcid":false,"given":"Konstantinos E.","family":"Parsopoulos","sequence":"first","affiliation":[]},{"given":"Vasileios A.","family":"Tatsis","sequence":"additional","affiliation":[]},{"given":"Ilias S.","family":"Kotsireas","sequence":"additional","affiliation":[]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,30]]},"reference":[{"key":"1162_CR1","doi-asserted-by":"crossref","unstructured":"Almakhlafi, A., Knowles, J.: Systematic construction of algorithm portfolios for a maintenance scheduling problem. In: IEEE Congress On Evolutionary Computation, pp. 245\u2013252. Cancun, Mexico (2013)","DOI":"10.1109\/CEC.2013.6557577"},{"key":"1162_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1007\/978-3-540-74446-7_8","volume-title":"Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics, International Workshop, SLS","author":"R Battiti","year":"2007","unstructured":"Battiti, R., Mascia, F.: An algorithm portfolio for the sub-graph isomorphism problem. In: St\u00fctzle, T., Birattari, M., Hoos, H.H. (eds.) Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics, International Workshop, SLS. Lecture Notes in Computer Science, vol. 4638, pp. 106\u2013120. Springer, New York (2007)"},{"key":"1162_CR3","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s12293-016-0210-5","volume":"9","author":"JF Calder\u00edn","year":"2016","unstructured":"Calder\u00edn, J.F., Masegosa, A.D., Pelta, D.A.: An algorithm portfolio for the dynamic maximal covering location problem. Memet. Comput. 9, 141\u2013151 (2016)","journal-title":"Memet. Comput."},{"issue":"1","key":"1162_CR4","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1109\/4235.985692","volume":"6","author":"M Clerc","year":"2002","unstructured":"Clerc, M., Kennedy, J.: The particle swarm-explosion, stability, and convergence in a multidimensional complex space. IEEE Trans. Evol. Comput. 6(1), 58\u201373 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"1162_CR5","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/BF00116878","volume":"5","author":"DE Goldberg","year":"1990","unstructured":"Goldberg, D.E.: Probability matching, the magnitude of reinforcement, and classifier system bidding. Mach. Learn. 5, 407\u2013425 (1990)","journal-title":"Mach. Learn."},{"key":"1162_CR6","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1126\/science.275.5296.51","volume":"27","author":"BA Huberman","year":"1997","unstructured":"Huberman, B.A., Lukose, R.M., Hogg, T.: An economics approach to hard computational problems. Science 27, 51\u201353 (1997)","journal-title":"Science"},{"key":"1162_CR7","doi-asserted-by":"crossref","unstructured":"Loreggia, A., Malitsky, Y., Samulowitz, H., Saraswat, V.: Deep learning for algorithm portfolios. In: Thirtieth AAAI Conference on Artificial Intelligence, pp. 1280\u20131286. Phoenix, Arizona(2016)","DOI":"10.1609\/aaai.v30i1.10170"},{"issue":"4","key":"1162_CR8","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1162\/EVCO_a_00086","volume":"20","author":"CL M\u00fcller","year":"2012","unstructured":"M\u00fcller, C.L., Sbalzarini, I.F.: Energy landscapes of atomic clusters as black box optimization benchmarks. Evol. Comput. 20(4), 543\u2013573 (2012)","journal-title":"Evol. Comput."},{"issue":"4","key":"1162_CR9","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"JA Nelder","year":"1965","unstructured":"Nelder, J.A., Mead, R.: A simplex method for function minimization. Comput. J. 7(4), 308\u2013313 (1965)","journal-title":"Comput. J."},{"key":"1162_CR10","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, New York (2006)"},{"volume-title":"Global Minimization of Nonconvex Energy Functions: Molecular Conformation and Protein Folding, DIMACS-Series in Discrete Mathematics and Theoretical Computer Science","year":"1996","key":"1162_CR11","unstructured":"Pardalos, P.M., Shalloway, D., Xue, G. (eds.): Global Minimization of Nonconvex Energy Functions: Molecular Conformation and Protein Folding, DIMACS-Series in Discrete Mathematics and Theoretical Computer Science, vol. 23. AMS, Providence (1996)"},{"key":"1162_CR12","doi-asserted-by":"publisher","DOI":"10.4018\/978-1-61520-666-7","volume-title":"Particle Swarm Optimization and Intelligence: Advances and Applications","author":"KE Parsopoulos","year":"2010","unstructured":"Parsopoulos, K.E., Vrahatis, M.N.: Particle Swarm Optimization and Intelligence: Advances and Applications. Information Science Publishing (IGI Global), New York (2010)"},{"issue":"5","key":"1162_CR13","doi-asserted-by":"publisher","first-page":"782","DOI":"10.1109\/TEVC.2010.2040183","volume":"14","author":"F Peng","year":"2010","unstructured":"Peng, F., Tang, K., Chen, G., Yao, X.: Population-based algorithm portfolios for numerical optimization. IEEE Trans. Evol. Comput. 14(5), 782\u2013800 (2010)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"1162_CR14","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0065-2458(08)60520-3","volume":"15","author":"JR Rice","year":"1976","unstructured":"Rice, J.R.: The algorithm selection problem. Adv. Comput. 15, 65\u2013118 (1976)","journal-title":"Adv. Comput."},{"key":"1162_CR15","unstructured":"Shukla, N., Dashora, Y., Tiwari, M., Chan, F., Wong, T.: Introducing algorithm portfolios to a class of vehicle routing and scheduling problem. In: Operations and Supply Chain Management (OSCM 2007), pp. 1015\u20131026. Bangkok, Thailand (2007)"},{"key":"1162_CR16","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/978-3-319-28697-6_79","volume-title":"Operations Research Proceedings 2014","author":"D Souravlias","year":"2016","unstructured":"Souravlias, D., Parsopoulos, K.E., Alba, E.: Parallel algorithm portfolio with market trading-based time allocation. In: L\u00fcbbecke, M., et al. (eds.) Operations Research Proceedings 2014, pp. 567\u2013574. Springer, New York (2016)"},{"issue":"6","key":"1162_CR17","doi-asserted-by":"publisher","first-page":"1303","DOI":"10.1007\/s11590-015-0927-y","volume":"10","author":"D Souravlias","year":"2016","unstructured":"Souravlias, D., Parsopoulos, K.E., Kotsireas, I.S.: Circulant weighing matrices: a demanding challenge for parallel optimization metaheuristics. Optim. Lett. 10(6), 1303\u20131314 (2016)","journal-title":"Optim. Lett."},{"key":"1162_CR18","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/j.asoc.2017.05.052","volume":"59","author":"D Souravlias","year":"2017","unstructured":"Souravlias, D., Parsopoulos, K.E., Meletiou, G.C.: Designing bijective S-boxes using algorithm portfolios with limited time budgets. Appl. Soft Comput. 59, 475\u2013486 (2017)","journal-title":"Appl. Soft Comput."},{"key":"1162_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-68514-0","volume-title":"Algorithm Portfolios: Advances, Applications, and Challenges. Springer Briefs in Optimization","author":"D Souravlias","year":"2021","unstructured":"Souravlias, D., Parsopoulos, K.E., Kotsireas, I.S., Pardalos, P.M.: Algorithm Portfolios: Advances, Applications, and Challenges. Springer Briefs in Optimization. Springer, New York (2021)"},{"key":"1162_CR20","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.ins.2014.03.105","volume":"279","author":"K Tang","year":"2014","unstructured":"Tang, K., Peng, F., Chen, G., Yao, X.: Population-based algorithm portfolios with automated constituent algorithms selection. Inf. Sci. 279, 94\u2013104 (2014)","journal-title":"Inf. Sci."},{"key":"1162_CR21","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1109\/TSMC.1985.6313407","volume":"15","author":"MAL Thathachar","year":"1985","unstructured":"Thathachar, M.A.L., Sastry, P.S.: A class of rapidly converging algorithms for learning automata. IEEE Trans. Syst. Man Cybern. 15, 168\u2013175 (1985)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"1162_CR22","doi-asserted-by":"crossref","unstructured":"Thierens, D.: An adaptive pursuit strategy for allocating operator probabilities. In: Proceedings of the 7th Annual Conference on Genetic and Evolutionary Computation (GECCO\u201905), pp. 1539\u20131546. ACM (2005)","DOI":"10.1145\/1068009.1068251"},{"issue":"3","key":"1162_CR23","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1016\/j.ejor.2019.11.055","volume":"283","author":"J Wawrzyniak","year":"2020","unstructured":"Wawrzyniak, J., Drozdowski, M., Sanlaville, \u00c9.: Selecting algorithms for large berth allocation problems. Eur. J. Oper. Res. 283(3), 844\u2013862 (2020)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01162-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-022-01162-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01162-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,21]],"date-time":"2024-03-21T03:04:59Z","timestamp":1710990299000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-022-01162-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,30]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["1162"],"URL":"https:\/\/doi.org\/10.1007\/s10898-022-01162-y","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2022,4,30]]},"assertion":[{"value":"4 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 April 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 April 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}