{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T07:21:55Z","timestamp":1772781715592,"version":"3.50.1"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"17","license":[{"start":{"date-parts":[[2023,3,7]],"date-time":"2023-03-07T00:00:00Z","timestamp":1678147200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,7]],"date-time":"2023-03-07T00:00:00Z","timestamp":1678147200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No. 61762092"],"award-info":[{"award-number":["No. 61762092"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Open Foundation of the Key Laboratory in Software Engineering of Yunnan Province","award":["No. 2020SE303"],"award-info":[{"award-number":["No. 2020SE303"]}]},{"name":"Major Science and Technology Project of Precious Metal Materials Genome Engineering in Yunnan Province","award":["No. 2019ZE001-1 and 202002AB080001-6"],"award-info":[{"award-number":["No. 2019ZE001-1 and 202002AB080001-6"]}]},{"name":"Yunnan provincial major science and technology: Research and Application of key Technologies for Resource Sharing and Collaboration Toward Smart Tourism","award":["202002AD080047"],"award-info":[{"award-number":["202002AD080047"]}]},{"DOI":"10.13039\/501100018531","name":"Major Science and Technology Projects in Yunnan Province","doi-asserted-by":"publisher","award":["202202AD080007"],"award-info":[{"award-number":["202202AD080007"]}],"id":[{"id":"10.13039\/501100018531","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":[[2023,6]]},"DOI":"10.1007\/s00521-023-08367-6","type":"journal-article","created":{"date-parts":[[2023,3,7]],"date-time":"2023-03-07T10:03:27Z","timestamp":1678183407000},"page":"12691-12713","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["TMHSCA: a novel hybrid two-stage mutation with a sine cosine algorithm for discounted {0-1} knapsack problems"],"prefix":"10.1007","volume":"35","author":[{"given":"Yan","family":"Kang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haining","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4959-8432","authenticated-orcid":false,"given":"Bin","family":"Pu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiansong","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shin-Jye","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuekun","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liu","family":"Tao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,7]]},"reference":[{"key":"8367_CR1","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.ins.2020.07.013","volume":"542","author":"IM Ali","year":"2021","unstructured":"Ali IM, Essam D, Kasmarik K (2021) Novel binary differential evolution algorithm for knapsack problems. Inf Sci 542:177\u2013194","journal-title":"Inf Sci"},{"key":"8367_CR2","doi-asserted-by":"crossref","first-page":"106946","DOI":"10.1016\/j.cie.2020.106946","volume":"151","author":"M Abdel-Basset","year":"2021","unstructured":"Abdel-Basset M, Mohamed R, Mirjalili S (2021) A binary equilibrium optimization algorithm for 0\u20131 knapsack problems. Comp Ind Eng 151:106946","journal-title":"Comp Ind Eng"},{"issue":"4","key":"8367_CR3","doi-asserted-by":"crossref","first-page":"2284","DOI":"10.1109\/TCYB.2020.3002495","volume":"52","author":"Z Li","year":"2020","unstructured":"Li Z, Tang L, Liu J (2020) A memetic algorithm based on probability learning for solving the multidimensional knapsack problem. IEEE Trans Cybern 52(4):2284\u20135299","journal-title":"IEEE Trans Cybern"},{"issue":"2","key":"8367_CR4","doi-asserted-by":"crossref","first-page":"893","DOI":"10.1109\/TSMC.2018.2882792","volume":"51","author":"DY Gao","year":"2018","unstructured":"Gao DY (2018) Canonical duality theory and algorithm for solving bilevel knapsack problems with applications. IEEE Trans Syst, Man, Cybern: Sys 51(2):893\u2013904","journal-title":"IEEE Trans Syst, Man, Cybern: Sys"},{"issue":"4","key":"8367_CR5","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1504\/IJBIC.2017.087924","volume":"10","author":"H Zhu","year":"2017","unstructured":"Zhu H, He Y, Wang X, Tsang EC (2017) Discrete differential evolutions for the discounted $$\\{$$0-1$$\\}$$ knapsack problem. Int J Bio-Insp Comput 10(4):219\u2013238","journal-title":"Int J Bio-Insp Comput"},{"key":"8367_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/s00366-021-01470-z","author":"B Abdollahzadeh","year":"2021","unstructured":"Abdollahzadeh B, Barshandeh S, Javadi H, Epicoco N (2021) An enhanced binary slime mould algorithm for solving the 0\u20131 knapsack problem. Eng Comp. https:\/\/doi.org\/10.1007\/s00366-021-01470-z","journal-title":"Eng Comp"},{"key":"8367_CR7","volume-title":"Heuristic and exact algorithms for discounted knapsack problems","author":"B Guldan","year":"2007","unstructured":"Guldan B (2007) Heuristic and exact algorithms for discounted knapsack problems. University of Erlangen-N\u00fcrnberg, Germany"},{"issue":"12","key":"8367_CR8","doi-asserted-by":"crossref","first-page":"6921","DOI":"10.1016\/j.amc.2011.12.068","volume":"218","author":"A Rong","year":"2012","unstructured":"Rong A, Figueira JR, Klamroth K (2012) Dynamic programming based algorithms for the discounted $$\\{$$0-1$$\\}$$ knapsack problem. Appl Math Comp 218(12):6921\u20136933","journal-title":"Appl Math Comp"},{"key":"8367_CR9","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1016\/j.ins.2016.07.037","volume":"369","author":"Y-C He","year":"2016","unstructured":"He Y-C, Wang X-Z, He Y-L, Zhao S-L, Li W-B (2016) Exact and approximate algorithms for discounted $$\\{$$0-1$$\\}$$ knapsack problem. Inf Sci 369:634\u2013647","journal-title":"Inf Sci"},{"key":"8367_CR10","doi-asserted-by":"crossref","first-page":"107077","DOI":"10.1016\/j.asoc.2020.107077","volume":"102","author":"J Garc\u00eda","year":"2021","unstructured":"Garc\u00eda J, Maureira C (2021) A knn quantum cuckoo search algorithm applied to the multidimensional knapsack problem. Appl Soft Comp 102:107077","journal-title":"Appl Soft Comp"},{"key":"8367_CR11","doi-asserted-by":"crossref","first-page":"116238","DOI":"10.1016\/j.eswa.2021.116238","volume":"191","author":"M A\u00efder","year":"2022","unstructured":"A\u00efder M, Gacem O, Hifi M (2022) A hybrid population-based algorithm for the bi-objective quadratic multiple knapsack problem. Exp Syst Appl 191:116238","journal-title":"Exp Syst Appl"},{"key":"8367_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-1701-9","volume-title":"Design and analysis of approximation algorithms","author":"D Du","year":"2012","unstructured":"Du D, Ko K-I, Hu X et al (2012) Design and analysis of approximation algorithms. Springer, Berlin"},{"issue":"1","key":"8367_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1162\/evco.1996.4.1.1","volume":"4","author":"Z Michalewicz","year":"1996","unstructured":"Michalewicz Z, Schoenauer M (1996) Evolutionary algorithms for constrained parameter optimization problems. Evol Comput 4(1):1\u201332","journal-title":"Evol Comput"},{"issue":"9","key":"8367_CR14","doi-asserted-by":"crossref","first-page":"8529","DOI":"10.1109\/TVT.2021.3097203","volume":"70","author":"J Wen","year":"2021","unstructured":"Wen J, Yang J, Wang T (2021) Path planning for autonomous underwater vehicles under the influence of ocean currents based on a fusion heuristic algorithm. IEEE Trans Vehic Technol 70(9):8529\u20138544","journal-title":"IEEE Trans Vehic Technol"},{"issue":"12","key":"8367_CR15","doi-asserted-by":"crossref","first-page":"6274","DOI":"10.1109\/TCYB.2020.2974832","volume":"51","author":"X Bai","year":"2020","unstructured":"Bai X, Cao M, Yan W, Ge SS, Zhang X (2020) Efficient heuristic algorithms for single-vehicle task planning with precedence constraints. IEEE Trans Cybern 51(12):6274\u20136283","journal-title":"IEEE Trans Cybern"},{"key":"8367_CR16","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2022.3215129","author":"Y Kang","year":"2022","unstructured":"Kang Y, Wang H, Pu B, Tao L, Chen J, Philip SY (2022) A hybrid two-stage teaching-learning-based optimization algorithm for feature selection in bioinformatics. IEEE\/ACM Trans Comput Biol Bioinf. https:\/\/doi.org\/10.1109\/TCBB.2022.3215129","journal-title":"IEEE\/ACM Trans Comput Biol Bioinf"},{"issue":"2","key":"8367_CR17","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1109\/TCYB.2018.2871673","volume":"50","author":"X Zhang","year":"2018","unstructured":"Zhang X, Zhou K, Pan H, Zhang L, Zeng X, Jin Y (2018) A network reduction-based multiobjective evolutionary algorithm for community detection in large-scale complex networks. IEEE Trans Cybern 50(2):703\u2013716","journal-title":"IEEE Trans Cybern"},{"issue":"20","key":"8367_CR18","doi-asserted-by":"crossref","first-page":"3805","DOI":"10.3390\/math10203805","volume":"10","author":"Y Kang","year":"2022","unstructured":"Kang Y, Xu Z, Wang H, Yuan Y, Yang X, Pu K (2022) An improved gray wolf optimization algorithm with a novel initialization method for community detection. Mathematics 10(20):3805","journal-title":"Mathematics"},{"key":"8367_CR19","doi-asserted-by":"crossref","unstructured":"Haq FU, Shin D, Briand L (2022) Efficient online testing for dnn-enabled systems using surrogate-assisted and many-objective optimization. In: Proceedings of the 44th international conference on software engineering, pp. 811\u2013822","DOI":"10.1145\/3510003.3510188"},{"key":"8367_CR20","doi-asserted-by":"publisher","DOI":"10.1155\/2021\/2864607","author":"TK Truong","year":"2021","unstructured":"Truong TK (2021) Different transfer functions for binary particle swarm optimization with a new encoding scheme for discounted $$\\{$$0-1$$\\}$$ knapsack problem. Math Prob Eng. https:\/\/doi.org\/10.1155\/2021\/2864607","journal-title":"Math Prob Eng"},{"issue":"4","key":"8367_CR21","first-page":"0266537","volume":"17","author":"BT Dang","year":"2022","unstructured":"Dang BT, Truong TK (2022) Binary salp swarm algorithm for discounted $$\\{$$0-1$$\\}$$ knapsack problem. Plos one 17(4):0266537","journal-title":"Plos one"},{"issue":"11","key":"8367_CR22","doi-asserted-by":"crossref","first-page":"7433","DOI":"10.1109\/TII.2021.3056428","volume":"17","author":"T Zuo","year":"2021","unstructured":"Zuo T, Zhang Y, Meng K, Tong Z, Dong ZY, Fu Y (2021) A two-layer hybrid optimization approach for large-scale offshore wind farm collector system planning. IEEE Trans Ind Inf 17(11):7433\u20137444","journal-title":"IEEE Trans Ind Inf"},{"issue":"6","key":"8367_CR23","first-page":"1524","volume":"8","author":"J Chen","year":"2021","unstructured":"Chen J, Luo X, Zhou M (2021) Hierarchical particle swarm optimization-incorporated latent factor analysis for large-scale incomplete matrices. IEEE Trans Big Data 8(6):1524\u20131536","journal-title":"IEEE Trans Big Data"},{"issue":"3","key":"8367_CR24","doi-asserted-by":"crossref","first-page":"1175","DOI":"10.1109\/TCYB.2020.2977956","volume":"51","author":"Z-J Wang","year":"2020","unstructured":"Wang Z-J, Zhan Z-H, Kwong S, Jin H, Zhang J (2020) Adaptive granularity learning distributed particle swarm optimization for large-scale optimization. IEEE Trans Cybern 51(3):1175\u20131188","journal-title":"IEEE Trans Cybern"},{"issue":"8","key":"8367_CR25","doi-asserted-by":"crossref","first-page":"7328","DOI":"10.1109\/TCYB.2021.3049845","volume":"52","author":"H Sakai","year":"2021","unstructured":"Sakai H, Iiduka H (2021) Riemannian adaptive optimization algorithm and its application to natural language processing. IEEE Trans Cybern 52(8):7328\u20137339","journal-title":"IEEE Trans Cybern"},{"issue":"9","key":"8367_CR26","doi-asserted-by":"crossref","first-page":"2605","DOI":"10.1007\/s00521-016-2192-0","volume":"28","author":"B Zhang","year":"2017","unstructured":"Zhang B, Yuan H, Sun L, Shi J, Ma Z, Zhou L (2017) A two-stage framework for bat algorithm. Neural Comp Appl 28(9):2605\u20132619","journal-title":"Neural Comp Appl"},{"key":"8367_CR27","doi-asserted-by":"crossref","first-page":"107933","DOI":"10.1016\/j.patcog.2021.107933","volume":"116","author":"W Ma","year":"2021","unstructured":"Ma W, Zhou X, Zhu H, Li L, Jiao L (2021) A two-stage hybrid ant colony optimization for high-dimensional feature selection. Patt Recognit 116:107933","journal-title":"Patt Recognit"},{"key":"8367_CR28","doi-asserted-by":"crossref","first-page":"108012","DOI":"10.1016\/j.asoc.2021.108012","volume":"113","author":"W Guo","year":"2021","unstructured":"Guo W, Xu P, Dai F, Zhao F, Wu M (2021) Improved harris hawks optimization algorithm based on random unscented sigma point mutation strategy. Appl Soft Comp 113:108012","journal-title":"Appl Soft Comp"},{"key":"8367_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-021-06634-y","author":"EH Houssein","year":"2022","unstructured":"Houssein EH, Helmy BE-d, Rezk H, Nassef AM (2022) An efficient orthogonal opposition-based learning slime mould algorithm for maximum power point tracking. Neural Comp Appl. https:\/\/doi.org\/10.1007\/s00521-021-06634-y","journal-title":"Neural Comp Appl"},{"issue":"24","key":"8367_CR30","doi-asserted-by":"crossref","first-page":"17497","DOI":"10.1007\/s00521-021-06340-9","volume":"33","author":"Y Sharafi","year":"2021","unstructured":"Sharafi Y, Teshnehlab M (2021) Opposition-based binary competitive optimization algorithm using time-varying v-shape transfer function for feature selection. Neural Comp Appl 33(24):17497\u201317533","journal-title":"Neural Comp Appl"},{"issue":"1","key":"8367_CR31","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evolut Comput 1(1):67\u201382","journal-title":"IEEE Trans Evolut Comput"},{"issue":"3","key":"8367_CR32","doi-asserted-by":"crossref","first-page":"901","DOI":"10.1016\/j.ejor.2022.04.036","volume":"304","author":"C Wilbaut","year":"2022","unstructured":"Wilbaut C, Todosijevic R, Hanafi S, Fr\u00e9ville A (2022) Heuristic and exact reduction procedures to solve the discounted 0\u20131 knapsack problem. Eur J Operat Res 304(3):901\u2013911","journal-title":"Eur J Operat Res"},{"issue":"10","key":"8367_CR33","doi-asserted-by":"crossref","first-page":"3019","DOI":"10.1007\/s00521-017-2903-1","volume":"30","author":"Y Feng","year":"2018","unstructured":"Feng Y, Wang G-G, Li W, Li N (2018) Multi-strategy monarch butterfly optimization algorithm for discounted $$\\{$$0-1$$\\}$$ knapsack problem. Neural Comp Appl 30(10):3019\u20133036","journal-title":"Neural Comp Appl"},{"issue":"6","key":"8367_CR34","doi-asserted-by":"crossref","first-page":"1872","DOI":"10.1007\/s10489-020-01652-0","volume":"50","author":"C Wu","year":"2020","unstructured":"Wu C, Zhao J, Feng Y, Lee M (2020) Solving discounted $$\\{$$0-1$$\\}$$ knapsack problems by a discrete hybrid teaching-learning-based optimization algorithm. Appl Intell 50(6):1872\u20131888","journal-title":"Appl Intell"},{"issue":"6","key":"8367_CR35","doi-asserted-by":"crossref","first-page":"1208","DOI":"10.3390\/sym14061208","volume":"14","author":"A Sulaiman","year":"2022","unstructured":"Sulaiman A, Sadiq M, Mehmood Y, Akram M, Ali GA (2022) Fitness-based acceleration coefficients binary particle swarm optimization (facbpso) to solve the discounted knapsack problem. Symmetry 14(6):1208","journal-title":"Symmetry"},{"key":"8367_CR36","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1016\/j.asoc.2019.01.049","volume":"77","author":"Y He","year":"2019","unstructured":"He Y, Wang X, Gao S (2019) Ring theory-based evolutionary algorithm and its application to d $$\\{$$0-1$$\\}$$ kp. Appl Soft Comp 77:714\u2013722","journal-title":"Appl Soft Comp"},{"key":"8367_CR37","doi-asserted-by":"crossref","first-page":"104445","DOI":"10.1016\/j.knosys.2018.07.045","volume":"219","author":"Y He","year":"2021","unstructured":"He Y, Wang X (2021) Group theory-based optimization algorithm for solving knapsack problems. Knowl-Based Sys 219:104445","journal-title":"Knowl-Based Sys"},{"key":"8367_CR38","unstructured":"Tran VN, Truong TK A binary social spider algorithm for discounted 10-11 knapsack problem"},{"key":"8367_CR39","doi-asserted-by":"publisher","DOI":"10.1155\/2021\/5092480","author":"TK Truong","year":"2021","unstructured":"Truong TK (2021) A new moth-flame optimization algorithm for discounted $$\\{$$0-1$$\\}$$ knapsack problem. Math Prob Eng. https:\/\/doi.org\/10.1155\/2021\/5092480","journal-title":"Math Prob Eng"},{"key":"8367_CR40","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.knosys.2015.12.022","volume":"96","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S (2016) Sca: a sine cosine algorithm for solving optimization problems. Knowl-Based Sys 96:120\u2013133","journal-title":"Knowl-Based Sys"},{"issue":"4","key":"8367_CR41","doi-asserted-by":"crossref","first-page":"993","DOI":"10.1007\/s10489-019-01570-w","volume":"50","author":"S Gupta","year":"2020","unstructured":"Gupta S, Deep K (2020) A novel hybrid sine cosine algorithm for global optimization and its application to train multilayer perceptrons. Appl Intell 50(4):993\u20131026","journal-title":"Appl Intell"},{"issue":"12","key":"8367_CR42","doi-asserted-by":"crossref","first-page":"7011","DOI":"10.1007\/s00521-020-05474-6","volume":"33","author":"BA Hassan","year":"2021","unstructured":"Hassan BA (2021) Cscf: a chaotic sine cosine firefly algorithm for practical application problems. Neural Comp Appl 33(12):7011\u20137030","journal-title":"Neural Comp Appl"},{"key":"8367_CR43","doi-asserted-by":"crossref","first-page":"114607","DOI":"10.1016\/j.eswa.2021.114607","volume":"172","author":"H Muthusamy","year":"2021","unstructured":"Muthusamy H, Ravindran S, Yaacob S, Polat K (2021) An improved elephant herding optimization using sine-cosine mechanism and opposition based learning for global optimization problems. Exp Sys Appl 172:114607","journal-title":"Exp Sys Appl"},{"key":"8367_CR44","doi-asserted-by":"crossref","unstructured":"Tizhoosh HR (2005) Opposition-based learning: a new scheme for machine intelligence. In: CIMCA-IAWTIC\u201906, IEEE, 1:695\u2013701","DOI":"10.1109\/CIMCA.2005.1631345"},{"key":"8367_CR45","doi-asserted-by":"crossref","first-page":"107139","DOI":"10.1016\/j.knosys.2021.107139","volume":"226","author":"X Yu","year":"2021","unstructured":"Yu X, Xu W, Li C (2021) Opposition-based learning grey wolf optimizer for global optimization. Knowl-Based Sys 226:107139","journal-title":"Knowl-Based Sys"},{"issue":"5","key":"8367_CR46","doi-asserted-by":"crossref","first-page":"4207","DOI":"10.1007\/s00366-021-01368-w","volume":"35","author":"BS Yildiz","year":"2021","unstructured":"Yildiz BS, Pholdee N, Bureerat S, Yildiz AR, Sait SM (2021) Enhanced grasshopper optimization algorithm using elite opposition-based learning for solving real-world engineering problems. Eng Comp 35(5):4207\u20134219","journal-title":"Eng Comp"},{"issue":"5","key":"8367_CR47","first-page":"1","volume":"1","author":"R Wang","year":"2021","unstructured":"Wang R, Zhang Z, Ng WW, Wu W (2021) An improved group theory-based optimization algorithm for discounted 0\u20131 knapsack problem. Adv Comp Intell 1(5):1\u201311","journal-title":"Adv Comp Intell"},{"issue":"3","key":"8367_CR48","first-page":"656","volume":"39","author":"Y Yang","year":"2019","unstructured":"Yang Y, Dazhi P, Yi L, Dailun T (2019) New simplified model of discounted $$\\{$$0-1$$\\}$$ knapsack problem and solution by genetic algorithm. J Comp Appl 39(3):656","journal-title":"J Comp Appl"},{"key":"8367_CR49","doi-asserted-by":"crossref","first-page":"104556","DOI":"10.1016\/j.engappai.2021.104556","volume":"108","author":"G Rivera","year":"2022","unstructured":"Rivera G, Porras R, Sanchez-Solis JP, Florencia R, Garc\u00eda V (2022) Outranking-based multi-objective PSO for scheduling unrelated parallel machines with a freight industry-oriented application. Eng Appl Artif Intell 108:104556","journal-title":"Eng Appl Artif Intell"},{"key":"8367_CR50","doi-asserted-by":"crossref","first-page":"114950","DOI":"10.1016\/j.eswa.2021.114950","volume":"177","author":"Y Li","year":"2021","unstructured":"Li Y, Zhao Y, Liu J (2021) Dynamic sine cosine algorithm for large-scale global optimization problems. Expert Sys Appl 177:114950","journal-title":"Expert Sys Appl"},{"issue":"1","key":"8367_CR51","first-page":"19","volume":"7","author":"R Rao","year":"2016","unstructured":"Rao R (2016) Jaya: a simple and new optimization algorithm for solving constrained and unconstrained optimization problems. Int J Ind Eng Comp 7(1):19\u201334","journal-title":"Int J Ind Eng Comp"},{"issue":"2\u20133","key":"8367_CR52","first-page":"279","volume":"42","author":"AR Kan","year":"1993","unstructured":"Kan AR, Stougie L, Vercellis C (1993) A class of generalized greedy algorithms for the multi-knapsack problem. Discr Appl Mathemat 42(2\u20133):279\u2013290","journal-title":"Discr Appl Mathemat"},{"key":"8367_CR53","doi-asserted-by":"crossref","first-page":"113395","DOI":"10.1016\/j.eswa.2020.113395","volume":"154","author":"S Gupta","year":"2020","unstructured":"Gupta S, Deep K, Mirjalili S, Kim JH (2020) A modified sine cosine algorithm with novel transition parameter and mutation operator for global optimization. Expert Sys Appl 154:113395","journal-title":"Expert Sys Appl"},{"key":"8367_CR54","doi-asserted-by":"crossref","first-page":"113873","DOI":"10.1016\/j.eswa.2020.113873","volume":"164","author":"M Tubishat","year":"2021","unstructured":"Tubishat M, Ja\u2019afar S, Alswaitti M et al (2021) Dynamic salp swarm algorithm for feature selection. Expert Syst Appl 164:113873","journal-title":"Expert Syst Appl"},{"issue":"6","key":"8367_CR55","first-page":"1343","volume":"46","author":"FENG Y-h","year":"2018","unstructured":"Y-h FENG, Yang J, Y-c HE, Wang G-G (2018) Monarch butterfly optimization algorithm with differential evolution for the discounted $$\\{$$0-1$$\\}$$ knapsack problem. Acta Electonica Sinica 46(6):1343","journal-title":"Acta Electonica Sinica"},{"key":"8367_CR56","doi-asserted-by":"crossref","first-page":"10708","DOI":"10.1109\/ACCESS.2018.2809445","volume":"6","author":"Y-H Feng","year":"2018","unstructured":"Feng Y-H, Wang G-G (2018) Binary moth search algorithm for discounted $$\\{$$0-1$$\\}$$ knapsack problem. IEEE Access 6:10708\u201310719","journal-title":"IEEE Access"},{"issue":"10","key":"8367_CR57","doi-asserted-by":"crossref","first-page":"3350","DOI":"10.1007\/s10489-020-01722-3","volume":"50","author":"Y Li","year":"2020","unstructured":"Li Y, He Y, Liu X, Guo X, Li Z (2020) A novel discrete whale optimization algorithm for solving knapsack problems. Appl Intell 50(10):3350\u20133366","journal-title":"Appl Intell"},{"key":"8367_CR58","doi-asserted-by":"crossref","first-page":"116918","DOI":"10.1016\/j.eswa.2022.116918","volume":"201","author":"BH Meyer","year":"2022","unstructured":"Meyer BH, Pozo ATR, Zola WMN (2022) Global and local structure preserving gpu t-sne methods for large-scale applications. Expert Sys Appl 201:116918","journal-title":"Expert Sys Appl"}],"updated-by":[{"DOI":"10.1007\/s00521-023-08595-w","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2023,4,24]],"date-time":"2023-04-24T00:00:00Z","timestamp":1682294400000}}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-023-08367-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-023-08367-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-023-08367-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T17:37:59Z","timestamp":1683826679000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-023-08367-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,7]]},"references-count":58,"journal-issue":{"issue":"17","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["8367"],"URL":"https:\/\/doi.org\/10.1007\/s00521-023-08367-6","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s00521-023-08595-w","asserted-by":"object"}]},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,7]]},"assertion":[{"value":"6 September 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 February 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 March 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2023","order":4,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":5,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s00521-023-08595-w","URL":"https:\/\/doi.org\/10.1007\/s00521-023-08595-w","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}