{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T10:58:28Z","timestamp":1774522708006,"version":"3.50.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T00:00:00Z","timestamp":1771200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T00:00:00Z","timestamp":1771200000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Innovative Ability Development Funding Project for Graduate Students of Hebei Province","award":["CXZZSS2024109"],"award-info":[{"award-number":["CXZZSS2024109"]}]},{"name":"Science and Technology Project of Hebei Education Department","award":["ZD2021016"],"award-info":[{"award-number":["ZD2021016"]}]},{"name":"National Pre-research Funds of Hebei GEO University in 2023","award":["Grant KY202307"],"award-info":[{"award-number":["Grant KY202307"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s13042-025-02970-w","type":"journal-article","created":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T11:44:35Z","timestamp":1771242275000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An efficient improved group theory-based optimization algorithm with directed mutation operator for the discounted {0\u20131} knapsack problem"],"prefix":"10.1007","volume":"17","author":[{"given":"Hansong","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yichao","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinghong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bianfang","family":"Chai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seyedali","family":"Mirjalili","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,16]]},"reference":[{"key":"2970_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer H, Pferschy U, Pisinger D (2004) Knapsack problems. Springer, Berlin"},{"issue":"3","key":"2970_CR2","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1016\/j.ejor.2015.10.014","volume":"250","author":"RP Rooderkerk","year":"2016","unstructured":"Rooderkerk RP, Heerde HJ (2016) Robust optimization of the 0\u20131 knapsack problem: balancing risk and return in assortment optimization. Eur J Oper Res 250(3):842\u2013854","journal-title":"Eur J Oper Res"},{"key":"2970_CR3","unstructured":"Cho M (2019) The knapsack problem and its applications to the cargo loading problem. Anal Appl Math 48"},{"issue":"2","key":"2970_CR4","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1016\/j.ejor.2018.07.013","volume":"275","author":"F Brandt","year":"2019","unstructured":"Brandt F, Nickel S (2019) The air cargo load planning problem-a consolidated problem definition and literature review on related problems. Eur J Oper Res 275(2):399\u2013410","journal-title":"Eur J Oper Res"},{"issue":"1\u20132","key":"2970_CR5","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10479-013-1312-9","volume":"241","author":"P Jacko","year":"2016","unstructured":"Jacko P (2016) Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic. Ann Oper Res 241(1\u20132):83\u2013107","journal-title":"Ann Oper Res"},{"key":"2970_CR6","doi-asserted-by":"crossref","unstructured":"Su Z, He G, Li Z (2022) Using grasshopper optimization algorithm to solve 0\u20131 knapsack computation resources allocation problem in mobile edge computing. In: 2022 34th Chinese control and decision conference (CCDC), pp 6309\u20136314 . IEEE","DOI":"10.1109\/CCDC55256.2022.10034236"},{"key":"2970_CR7","unstructured":"Han S, Mao H, Dally WJ (2015) Deep compression: compressing deep neural networks with pruning, trained quantization and huffman coding. arXiv preprint arXiv:1510.00149"},{"issue":"3","key":"2970_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3164539","volume":"65","author":"A Badanidiyuru","year":"2018","unstructured":"Badanidiyuru A, Kleinberg R, Slivkins A (2018) Bandits with knapsacks. J ACM 65(3):1\u201355","journal-title":"J ACM"},{"key":"2970_CR9","unstructured":"Guder J (2005) Discounted knapsack problems for pairs of items. University of Erlangen-N\u00fcrnberg"},{"key":"2970_CR10","unstructured":"Guldan B (2007) Heuristic and exact algorithms for discounted knapsack problems. University of Erlangen-N\u00fcrnberg"},{"issue":"12","key":"2970_CR11","first-page":"6921","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 Comput 218(12):6921\u20136933","journal-title":"Appl Math Comput"},{"key":"2970_CR12","doi-asserted-by":"publisher","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 Comput 77:714\u2013722","journal-title":"Appl Soft Comput"},{"key":"2970_CR13","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1016\/j.ins.2016.07.037","volume":"369","author":"Y He","year":"2016","unstructured":"He Y, Wang X, He Y, Zhao S, Li W (2016) Exact and approximate algorithms for discounted $$\\{$$0-1$$\\}$$ knapsack problem. Inf Sci 369:634\u2013647","journal-title":"Inf Sci"},{"key":"2970_CR14","doi-asserted-by":"publisher","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 Syst 219:104445","journal-title":"Knowl-Based Syst"},{"key":"2970_CR15","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/j.matcom.2023.12.033","volume":"219","author":"Y He","year":"2024","unstructured":"He Y, Wang J, Liu X, Wang X, Ouyang H (2024) Modeling and solving of knapsack problem with setup based on evolutionary algorithm. Math Comput Simul 219:378\u2013403","journal-title":"Math Comput Simul"},{"key":"2970_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2021.102998","volume":"159","author":"Q Zhai","year":"2021","unstructured":"Zhai Q, He Y, Wang G, Hao X (2021) A general approach to solving hardware and software partitioning problem based on evolutionary algorithms. Adv Eng Softw 159:102998","journal-title":"Adv Eng Softw"},{"key":"2970_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.118978","volume":"213","author":"F Zhang","year":"2023","unstructured":"Zhang F, He Y, Ouyang H, Li W (2023) A fast and efficient discrete evolutionary algorithm for the uncapacitated facility location problem. Expert Syst Appl 213:118978","journal-title":"Expert Syst Appl"},{"issue":"1","key":"2970_CR18","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1186\/s12860-021-00358-6","volume":"22","author":"M Zhu","year":"2021","unstructured":"Zhu M, Wang DD, Yan H (2021) Genotype-determined egfr-rtk heterodimerization and its effects on drug resistance in lung cancer treatment revealed by molecular dynamics simulations. BMC Mol Cell Biol 22(1):34","journal-title":"BMC Mol Cell Biol"},{"issue":"4","key":"2970_CR19","doi-asserted-by":"publisher","first-page":"10933","DOI":"10.2196\/10933","volume":"6","author":"N Rahman","year":"2018","unstructured":"Rahman N, Wang DD, Ng SH, Ramachandran S, Sridharan S, Khoo A, Tan CS, Goh W, Tan XQ (2018) Processing of electronic medical records for health services research in an academic medical center: methods and validation. JMIR Med Inform 6(4):10933","journal-title":"JMIR Med Inform"},{"key":"2970_CR20","unstructured":"Dai Z, Liu Y, Di S, Fan Q (2021) Research on greedy core algorithms via piecewise sorting for discounted $$\\{$$0-1$$\\}$$ knapsack problem. J Front Comput Sci Technol, 1"},{"issue":"3","key":"2970_CR21","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1016\/j.ejor.2022.04.036","volume":"304","author":"C Wilbaut","year":"2023","unstructured":"Wilbaut C, Todosijevi\u0107 R, Hanafi S, Fr\u00e9ville A (2023) Heuristic and exact reduction procedures to solve the discounted 0\u20131 knapsack problem. Eur J Oper Res 304(3):901\u2013911","journal-title":"Eur J Oper Res"},{"key":"2970_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.109821","volume":"131","author":"C Wilbaut","year":"2022","unstructured":"Wilbaut C, Todosijevi\u0107 R, Hanafi S, Fr\u00e9ville A (2022) Variable neighborhood search for the discounted $$\\{$$0-1$$\\}$$ knapsack problem. Appl Soft Comput 131:109821","journal-title":"Appl Soft Comput"},{"issue":"12","key":"2970_CR23","first-page":"2614","volume":"39","author":"Y He","year":"2016","unstructured":"He Y, Wang X, Li W, Zhang X, Chen Y (2016) Research on genetic algorithms for the discounted $$\\{$$0-1$$\\}$$ knapsack problem. Chin J Comput 39(12):2614\u20132630","journal-title":"Chin J Comput"},{"issue":"4","key":"2970_CR24","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1504\/IJBIC.2017.087924","volume":"10","author":"H Zhu","year":"2017","unstructured":"Zhu H, He Y, Wang X, Tsang E (2017) Discrete differential evolutions for the discounted $$\\{$$0-1$$\\}$$ knapsack problem. Int J Bio-Inspired Comput 10(4):219\u2013238","journal-title":"Int J Bio-Inspired Comput"},{"key":"2970_CR25","doi-asserted-by":"publisher","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:1872\u20131888","journal-title":"Appl Intell"},{"issue":"18","key":"2970_CR26","first-page":"103","volume":"57","author":"X Hao","year":"2021","unstructured":"Hao X, He Y, Zhu X, Zhai Q (2021) Discrete hybrid multi-verse optimization algorithm for solving discounted $$\\{$$0-1$$\\}$$ knapsack problem. J Comput Eng Appl 57(18):103\u2013113","journal-title":"J Comput Eng Appl"},{"key":"2970_CR27","first-page":"1","volume":"2021","author":"T Truong","year":"2021","unstructured":"Truong T (2021) Different transfer functions for binary particle swarm optimization with a new encoding scheme for discounted $$\\{$$0-1$$\\}$$ knapsack problem. Math Probl Eng 2021:1\u201317","journal-title":"Math Probl Eng"},{"key":"2970_CR28","first-page":"1","volume":"2021","author":"T Truong","year":"2021","unstructured":"Truong T (2021) A new moth-flame optimization algorithm for discounted $$\\{$$0-1$$\\}$$ knapsack problem. Math Probl Eng 2021:1\u201315","journal-title":"Math Probl Eng"},{"issue":"4","key":"2970_CR29","doi-asserted-by":"publisher","first-page":"0266537","DOI":"10.1371\/journal.pone.0266537","volume":"17","author":"B Dang","year":"2022","unstructured":"Dang B, Truong T (2022) Binary salp swarm algorithm for discounted $$\\{$$0-1$$\\}$$ knapsack problem. PLoS ONE 17(4):0266537","journal-title":"PLoS ONE"},{"key":"2970_CR30","doi-asserted-by":"publisher","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 Comput 113:108012","journal-title":"Appl Soft Comput"},{"issue":"2","key":"2970_CR31","first-page":"468","volume":"16","author":"F Zhang","year":"2022","unstructured":"Zhang F, He Y, Liu X, Wang Z (2022) Novel discrete differential evolution algorithm for solving D $$\\{$$0-1$$\\}$$ KP problem. J Front Comput Sci Technol 16(2):468","journal-title":"J Front Comput Sci Technol"},{"issue":"6","key":"2970_CR32","doi-asserted-by":"publisher","first-page":"1208","DOI":"10.3390\/sym14061208","volume":"14","author":"A Sulaiman","year":"2022","unstructured":"Sulaiman A, Sadiq M, Mehmood Y, Akram M, Ali G (2022) Fitness-based acceleration coefficients binary particle swarm optimization (facbpso) to solve the discounted knapsack problem. Symmetry 14(6):1208","journal-title":"Symmetry"},{"issue":"17","key":"2970_CR33","doi-asserted-by":"publisher","first-page":"12691","DOI":"10.1007\/s00521-023-08367-6","volume":"35","author":"Y Kang","year":"2023","unstructured":"Kang Y, Wang H, Pu B, Liu J, Lee S, Yang X, Liu T (2023) Tmhsca: a novel hybrid two-stage mutation with a sine cosine algorithm for discounted $$\\{$$0-1$$\\}$$ knapsack problems. Neural Comput Appl 35(17):12691\u201312713","journal-title":"Neural Comput Appl"},{"key":"2970_CR34","doi-asserted-by":"crossref","unstructured":"Wang Z, Fang X, Gao F, Xie L, Meng X (2023) An adaptive grey wolf optimization with differential evolution operator for solving the discount $$\\{$$0\u20131$$\\}$$ knapsack problem. Neural Comput Appl, 1\u201317","DOI":"10.2139\/ssrn.4137161"},{"issue":"1","key":"2970_CR35","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TEVC.2010.2059031","volume":"15","author":"S Das","year":"2011","unstructured":"Das S, Suganthan PN (2011) Differential evolution: a survey of the state-of-the-art. IEEE Trans Evol Comput 15(1):4\u201331","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"2970_CR36","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac J, Garc\u00eda S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1(1):3\u201318","journal-title":"Swarm Evol Comput"},{"key":"2970_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2025.103282","volume":"65","author":"Z Zhang","year":"2025","unstructured":"Zhang Z, Li X, Gao L, Liu Q, Huang J (2025) Tackling dual-resource flexible job shop scheduling problem in the production line reconfiguration scenario: an efficient meta-heuristic with critical path-based neighborhood search. Adv Eng Inform 65:103282","journal-title":"Adv Eng Inform"},{"key":"2970_CR38","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110514","volume":"144","author":"Z Zhang","year":"2023","unstructured":"Zhang Z, Gao Y, Liu Y, Zuo W (2023) A hybrid biogeography-based optimization algorithm to solve high-dimensional optimization problems and real-world engineering problems. Appl Soft Comput 144:110514","journal-title":"Appl Soft Comput"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-025-02970-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13042-025-02970-w","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-025-02970-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T10:01:38Z","timestamp":1774519298000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13042-025-02970-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,16]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["2970"],"URL":"https:\/\/doi.org\/10.1007\/s13042-025-02970-w","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,16]]},"assertion":[{"value":"18 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 2026","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 no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"125"}}