{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T16:31:37Z","timestamp":1762014697662,"version":"build-2065373602"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"33","license":[{"start":{"date-parts":[[2023,6,5]],"date-time":"2023-06-05T00:00:00Z","timestamp":1685923200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,5]],"date-time":"2023-06-05T00:00:00Z","timestamp":1685923200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JSPS KAKENHI 23K11263"],"award-info":[{"award-number":["JSPS KAKENHI 23K11263"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1007\/s00521-023-08676-w","type":"journal-article","created":{"date-parts":[[2023,6,5]],"date-time":"2023-06-05T05:02:55Z","timestamp":1685941375000},"page":"27525-27542","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Genetic algorithm introducing the estimation of optimal objective function values in subproblems by pre-training"],"prefix":"10.1007","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9596-8679","authenticated-orcid":false,"given":"Hitoshi","family":"Iima","sequence":"first","affiliation":[]},{"given":"Yohei","family":"Hazama","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,5]]},"reference":[{"issue":"2","key":"8676_CR1","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1023\/A:1022602019183","volume":"3","author":"DE Goldberg","year":"1988","unstructured":"Goldberg DE, Holland JH (1988) Genetic algorithms and machine learning. Mach Learn 3(2):95\u201399. https:\/\/doi.org\/10.1023\/A:1022602019183","journal-title":"Mach Learn"},{"key":"8676_CR2","doi-asserted-by":"publisher","first-page":"1697","DOI":"10.1007\/s12351-020-00616-z","volume":"22","author":"R Said","year":"2021","unstructured":"Said R, Elarbi M, Bechikh S, Said LB (2021) Solving combinatorial bi-level optimization problems using multiple populations and migration schemes. Oper Res Int J 22:1697\u20131735. https:\/\/doi.org\/10.1007\/s12351-020-00616-z","journal-title":"Oper Res Int J"},{"issue":"1","key":"8676_CR3","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1002\/dac.1336","volume":"26","author":"A Peiravi","year":"2013","unstructured":"Peiravi A, Mashhadi HR, Javadi SH (2013) An optimal energy-efficient clustering method in wire less sensor networks using multi-objective genetic algorithm. Int J Commun Syst 26(1):114\u2013126. https:\/\/doi.org\/10.1002\/dac.1336","journal-title":"Int J Commun Syst"},{"key":"8676_CR4","doi-asserted-by":"publisher","DOI":"10.1155\/2021\/2026834","author":"W Yu","year":"2021","unstructured":"Yu W, Ha C, Park S (2021) A hybrid genetic algorithm for integrated truck scheduling and product routing on the cross-docking system with multiple receiving and shipping docks. Math Problems Eng. https:\/\/doi.org\/10.1155\/2021\/2026834","journal-title":"Math Problems Eng"},{"key":"8676_CR5","doi-asserted-by":"publisher","first-page":"129461","DOI":"10.1109\/ACCESS.2020.3009018","volume":"8","author":"H You","year":"2020","unstructured":"You H, Pan Z, Liu N, You X (2020) User clustering scheme for downlink hybrid NOMA systems based on genetic algorithm. IEEE Access 8:129461\u2013129468. https:\/\/doi.org\/10.1109\/ACCESS.2020.3009018","journal-title":"IEEE Access"},{"key":"8676_CR6","doi-asserted-by":"publisher","first-page":"102199","DOI":"10.1109\/ACCESS.2020.2997777","volume":"8","author":"Y-Y Tan","year":"2020","unstructured":"Tan Y-Y, Li Y-X, Wang R-X (2020) Scheduling extra train paths into cyclic timetable based on the genetic algorithm. IEEE Access 8:102199\u2013102211. https:\/\/doi.org\/10.1109\/ACCESS.2020.2997777","journal-title":"IEEE Access"},{"key":"8676_CR7","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10845-004-5888-4","volume":"16","author":"E Vin","year":"2005","unstructured":"Vin E, Lit PD, Delchambre A (2005) A multiple-objective grouping genetic algorithm for the cell formation problem with alternative routings. J Intell Manuf 16:189\u2013205. https:\/\/doi.org\/10.1007\/s10845-004-5888-4","journal-title":"J Intell Manuf"},{"key":"8676_CR8","first-page":"4182","volume":"119","author":"O Henaff","year":"2020","unstructured":"Henaff O (2020) Data-efficient image recognition with contrastive predictive coding. Proc Int Conf Mach Learn 119:4182\u20134192","journal-title":"Proc Int Conf Mach Learn"},{"key":"8676_CR9","doi-asserted-by":"publisher","first-page":"19143","DOI":"10.1109\/ACCESS.2019.2896880","volume":"7","author":"AB Nassif","year":"2019","unstructured":"Nassif AB, Shahin I, Attili I, Azzeh M, Shaalan K (2019) Speech recognition using deep neural networks: a systematic review. IEEE Access 7:19143\u201319165. https:\/\/doi.org\/10.1109\/ACCESS.2019.2896880","journal-title":"IEEE Access"},{"key":"8676_CR10","doi-asserted-by":"publisher","unstructured":"Choi Y, El-Khamy M, Lee J (2019) Variable rate deep image compression with a conditional autoencoder. In: Proceedings of IEEE\/CVF international conference on computer vision, pp 3146\u20133154. https:\/\/doi.org\/10.1109\/ICCV.2019.00324","DOI":"10.1109\/ICCV.2019.00324"},{"issue":"4","key":"8676_CR11","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1109\/JAS.2017.7510583","volume":"4","author":"K Wang","year":"2017","unstructured":"Wang K, Gou C, Duan Y, Lin Y, Zheng X, Wang FY (2017) Generative adversarial networks: introduction and outlook. IEEE\/CAA J Autom Sin 4(4):588\u2013598. https:\/\/doi.org\/10.1109\/JAS.2017.7510583","journal-title":"IEEE\/CAA J Autom Sin"},{"key":"8676_CR12","doi-asserted-by":"publisher","unstructured":"Rombach R, Blattmann A, Lorenz D, Esser P, Ommer B (2022) High-resolution image synthesis with latent diffusion models. In: Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition, pp 10684\u201310695. https:\/\/doi.org\/10.1109\/CVPR52688.2022.01042","DOI":"10.1109\/CVPR52688.2022.01042"},{"key":"8676_CR13","doi-asserted-by":"publisher","unstructured":"Collobert R, Westion J (2008) A unified architecture for natural language processing: deep neural networks with multitask learning. In: Proceedings of the international conference on machine learning, pp 160\u2013167. https:\/\/doi.org\/10.1145\/1390156.1390177","DOI":"10.1145\/1390156.1390177"},{"key":"8676_CR14","doi-asserted-by":"publisher","DOI":"10.3390\/e24040455","author":"S Yang","year":"2022","unstructured":"Yang S, Tan J, Chen B (2022) Robust spike-based continual meta-learning improved by restricted minimum error entropy criterion. Entropy. https:\/\/doi.org\/10.3390\/e24040455","journal-title":"Entropy"},{"key":"8676_CR15","doi-asserted-by":"publisher","DOI":"10.3389\/fnins.2022.850932","volume":"16","author":"S Yang","year":"2022","unstructured":"Yang S, Linares-Barranco B, Chen B (2022) Heterogeneous ensemble-based spike-driven few-shot online learning. Front Neurosci 16:850932. https:\/\/doi.org\/10.3389\/fnins.2022.850932","journal-title":"Front Neurosci"},{"key":"8676_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.heliyon.2018.e00938","author":"OI Abiodun","year":"2018","unstructured":"Abiodun OI, Jantan A, Omolara AE, Dada KV, Mohamed NA, Arshad H (2018) State-of-the-art in artificial neural network applications: a survey. Heliyon. https:\/\/doi.org\/10.1016\/j.heliyon.2018.e00938","journal-title":"Heliyon"},{"issue":"2","key":"8676_CR17","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.swevo.2011.05.001","volume":"1","author":"Y Jin","year":"2011","unstructured":"Jin Y (2011) Surrogate-assisted evolutionary computation: recent advances and future challenges. Swarm Evol Comput 1(2):61\u201370. https:\/\/doi.org\/10.1016\/j.swevo.2011.05.001","journal-title":"Swarm Evol Comput"},{"key":"8676_CR18","doi-asserted-by":"publisher","unstructured":"Le HL, Landa-Silva D, Galar M, Garcia S, Triguero I (2020) A hybrid surrogate model for evolutionary under sampling in imbalanced classification. In: Proceedings of IEEE congress on evolutionary computation. https:\/\/doi.org\/10.1109\/CEC48606.2020.9185774","DOI":"10.1109\/CEC48606.2020.9185774"},{"key":"8676_CR19","doi-asserted-by":"publisher","unstructured":"Sonoda T, Nakata M (2020) MOEA\/D-S$$^{3}$$: MOEA\/D using SVM-based surrogates adjusted to subproblems for many objective optimization. In: Proceedings of IEEE congress on evolutionary computation. https:\/\/doi.org\/10.1109\/CEC48606.2020.9185549","DOI":"10.1109\/CEC48606.2020.9185549"},{"key":"8676_CR20","doi-asserted-by":"publisher","unstructured":"Tan Z, Wang H (2020) A kriging-assisted evolutionary algorithm using feature selection for expensive sparse multi-objective optimization. In: Proceedings of IEEE congress on evolutionary computation. https:\/\/doi.org\/10.1109\/CEC48606.2020.9185825","DOI":"10.1109\/CEC48606.2020.9185825"},{"key":"8676_CR21","doi-asserted-by":"publisher","unstructured":"Dushatskiy A, Alderliesten T, Bosman PAN (2021) A novel surrogate-assisted evolutionary algorithm applied to partition-based ensemble learning. In: Proceedings of the genetic and evolutionary computation conference, pp 583\u2013591. https:\/\/doi.org\/10.1145\/3449639.3459306","DOI":"10.1145\/3449639.3459306"},{"key":"8676_CR22","doi-asserted-by":"publisher","unstructured":"Ruan X, Li K, Derbel B, Liefooghe A (2020) Surrogate assisted evolutionary algorithm for medium scale multi-objective optimization problems. In: Proceedings of the genetic and evolutionary computation conference, pp 560\u2013568. https:\/\/doi.org\/10.1145\/3377930.3390191","DOI":"10.1145\/3377930.3390191"},{"issue":"3","key":"8676_CR23","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1016\/j.ejor.2007.10.013","volume":"192","author":"JPC Kleijnen","year":"2009","unstructured":"Kleijnen JPC (2009) Kriging metamodeling in simulation: a review. Eur J Oper Res 192(3):707\u2013716. https:\/\/doi.org\/10.1016\/j.ejor.2007.10.013","journal-title":"Eur J Oper Res"},{"key":"8676_CR24","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1016\/j.apm.2017.07.033","volume":"51","author":"Z Majdisova","year":"2017","unstructured":"Majdisova Z, Skala V (2017) Radial basis function approximations: comparison and applications. Appl Math Model 51:728\u2013743. https:\/\/doi.org\/10.1016\/j.apm.2017.07.033","journal-title":"Appl Math Model"},{"issue":"7","key":"8676_CR25","doi-asserted-by":"publisher","first-page":"622","DOI":"10.14778\/2180912.2180915","volume":"5","author":"B Bahmani","year":"2012","unstructured":"Bahmani B, Moseley B, Vattani A, Kumar R, Vassilvitskii S (2012) Scalable k-means++. Proc VLDB Endowm 5(7):622\u2013633. https:\/\/doi.org\/10.14778\/2180912.2180915","journal-title":"Proc VLDB Endowm"},{"key":"8676_CR26","doi-asserted-by":"publisher","first-page":"1565","DOI":"10.1038\/nbt1206-1565","volume":"24","author":"WS Noble","year":"2006","unstructured":"Noble WS (2006) What is a support vector machine? Nat Biotechnol 24:1565\u20131567. https:\/\/doi.org\/10.1038\/nbt1206-1565","journal-title":"Nat Biotechnol"},{"key":"8676_CR27","doi-asserted-by":"publisher","unstructured":"Iima H, Hazama Y (2022) Genetic algorithm with machine learning to estimate the optimal objective function values of subproblems. In: Proceedings of international conference on intelligent systems, metaheuristics and swarm intelligence, pp 1\u20138. https:\/\/doi.org\/10.1145\/3533050.3533051","DOI":"10.1145\/3533050.3533051"},{"key":"8676_CR28","doi-asserted-by":"publisher","unstructured":"Assi M, Haraty RA (2018) A survey of the knapsack problem. In: Proceedings of the international Arab conference on information technology, pp 1\u20136. https:\/\/doi.org\/10.1109\/ACIT.2018.8672677","DOI":"10.1109\/ACIT.2018.8672677"},{"issue":"2","key":"8676_CR29","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0377-2217(92)90138-Y","volume":"59","author":"G Laporte","year":"1992","unstructured":"Laporte G (1992) The traveling salesman problem: an overview of exact and approximate algorithms. Eur J Oper Res 59(2):231\u2013247. https:\/\/doi.org\/10.1016\/0377-2217(92)90138-Y","journal-title":"Eur J Oper Res"},{"key":"8676_CR30","unstructured":"Mishima K, Karuno Y (2019) A parcel delivery scheduling problem with multiple unmanned aerial vehicles and a single truck. In: Proceedings of the scheduling symposium, pp 19\u201324"},{"issue":"1","key":"8676_CR31","first-page":"205","volume":"4","author":"C-Y Liong","year":"2008","unstructured":"Liong C-Y, Ismail WR, Omar K, Zirour M (2008) Vehicle routing problem: models and solutions. J Qual Meas Anal 4(1):205\u2013218","journal-title":"J Qual Meas Anal"},{"key":"8676_CR32","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.disopt.2016.01.005","volume":"19","author":"DR Morrison","year":"2016","unstructured":"Morrison DR, Jacobson SH, Sauppe JJ, Sewell EC (2016) Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning. Discret Optim 19:79\u2013102. https:\/\/doi.org\/10.1016\/j.disopt.2016.01.005","journal-title":"Discret Optim"},{"key":"8676_CR33","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1090\/S0002-9904-1954-09848-8","volume":"60","author":"R Bellman","year":"1954","unstructured":"Bellman R (1954) The theory of dynamic programming. Bull Am Math Soc 60:503\u2013515. https:\/\/doi.org\/10.1090\/S0002-9904-1954-09848-8","journal-title":"Bull Am Math Soc"},{"key":"8676_CR34","doi-asserted-by":"publisher","unstructured":"Glover F, Laguna M (1998) Tabu Search, Handbook of combinatorial optimization. Springer, Boston. pp 2093\u20132229 https:\/\/doi.org\/10.1007\/978-1-4613-0303-9","DOI":"10.1007\/978-1-4613-0303-9"},{"key":"8676_CR35","doi-asserted-by":"publisher","DOI":"10.1515\/9780691187563","volume-title":"Local search in combinatorial optimization","author":"E Aarts","year":"2003","unstructured":"Aarts E, Lenstra JK (2003) Local search in combinatorial optimization. Princeton University Press, Princeton. https:\/\/doi.org\/10.1515\/9780691187563"},{"issue":"1","key":"8676_CR36","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1147\/rd.471.0057","volume":"47","author":"R Lougee-Heimer","year":"2003","unstructured":"Lougee-Heimer R (2003) The common optimization interface for operations research: promoting open-source software in the operations research community. IBM J Res Dev 47(1):57\u201366. https:\/\/doi.org\/10.1147\/rd.471.0057","journal-title":"IBM J Res Dev"},{"key":"8676_CR37","unstructured":"Kingma DP, Ba JL (2015) Adam: a method for stochastic optimization, Proceedings of the 3rd International Conference on Learning Representations"},{"issue":"9","key":"8676_CR38","doi-asserted-by":"publisher","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"RL Graham","year":"1966","unstructured":"Graham RL (1966) Bounds for certain multiprocessing anomalies. Bell Syst Tech J 45(9):1563\u20131581. https:\/\/doi.org\/10.1002\/j.1538-7305.1966.tb01709.x","journal-title":"Bell Syst Tech J"},{"issue":"6","key":"8676_CR39","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-1-4612-4380-9_16","volume":"1","author":"F Wilcoxon","year":"1945","unstructured":"Wilcoxon F (1945) Individual comparisons by ranking methods. Biometrics 1(6):80\u201383. https:\/\/doi.org\/10.1007\/978-1-4612-4380-9_16","journal-title":"Biometrics"},{"issue":"2","key":"8676_CR40","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s11704-019-8208-z","volume":"14","author":"X Dong","year":"2020","unstructured":"Dong X, Yu Z, Cao W, Shi Y, Ma Q (2020) A survey on ensemble learning. Front Comput Sci 14(2):241\u2013258. https:\/\/doi.org\/10.1007\/s11704-019-8208-z","journal-title":"Front Comput Sci"},{"issue":"1","key":"8676_CR41","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1109\/TNNLS.2019.2899936","volume":"31","author":"S Yang","year":"2020","unstructured":"Yang S, Deng B, Wang J, Li H, Lu M, Che Y, Wei X, Loparo KA (2020) Scalable digital neuromorphic architecture for large-scale biophysically meaningful neural network with multi-compartment neurons. IEEE Trans Neural Netw Learn Syst 31(1):148\u2013162. https:\/\/doi.org\/10.1109\/TNNLS.2019.2899936","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"7","key":"8676_CR42","doi-asserted-by":"publisher","first-page":"2801","DOI":"10.1109\/TNNLS.2020.3045492","volume":"33","author":"S Yang","year":"2022","unstructured":"Yang S, Wang J, Hao X, Li H, Wei X, Deng B, Loparo KA (2022) BiCoSS: toward large-scale cognition brain with multigranular neuromorphic architecture. IEEE Trans Neural Netw Learn Syst 33(7):2801\u20132815. https:\/\/doi.org\/10.1109\/TNNLS.2020.3045492","journal-title":"IEEE Trans Neural Netw Learn Syst"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-023-08676-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-023-08676-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-023-08676-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T16:27:29Z","timestamp":1762014449000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-023-08676-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,5]]},"references-count":42,"journal-issue":{"issue":"33","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["8676"],"URL":"https:\/\/doi.org\/10.1007\/s00521-023-08676-w","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"type":"print","value":"0941-0643"},{"type":"electronic","value":"1433-3058"}],"subject":[],"published":{"date-parts":[[2023,6,5]]},"assertion":[{"value":"17 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 May 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 June 2023","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 have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}