{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:03:44Z","timestamp":1757617424608,"version":"3.44.0"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"7-8","license":[{"start":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T00:00:00Z","timestamp":1740355200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T00:00:00Z","timestamp":1740355200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003787","name":"Natural Science Foundation of Hebei Province","doi-asserted-by":"crossref","award":["F2020403013"],"award-info":[{"award-number":["F2020403013"]}],"id":[{"id":"10.13039\/501100003787","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1007\/s13042-025-02565-5","type":"journal-article","created":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T07:23:21Z","timestamp":1740381801000},"page":"5161-5180","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["One-way mutation: an efficient strategy to improve the performance of evolutionary algorithms for solving 0-1 knapsack problem"],"prefix":"10.1007","volume":"16","author":[{"given":"Yichao","family":"He","sequence":"first","affiliation":[]},{"given":"Jinghong","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Guoxin","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Bianfang","family":"Chai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,24]]},"reference":[{"key":"2565_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-Verlag, Berlin"},{"issue":"3","key":"2565_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, Van 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"},{"issue":"3","key":"2565_CR3","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1016\/j.ejor.2016.06.049","volume":"256","author":"J Simon","year":"2017","unstructured":"Simon J, Apte A, Regnier E (2017) An application of the multiple knapsack problem: The self-sufficient marine. Eur J Oper Res 256(3):868\u2013876","journal-title":"Eur J Oper Res"},{"issue":"3","key":"2565_CR4","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1016\/j.ejor.2019.07.052","volume":"289","author":"S Mancini","year":"2019","unstructured":"Mancini S, Ciavotta M, Meloni C (2019) The multiple multidimensional knapsack with family-split penalties. Eur J Oper Res 289(3):987\u2013998. https:\/\/doi.org\/10.1016\/j.ejor.2019.07.052","journal-title":"Eur J Oper Res"},{"issue":"2","key":"2565_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.9734\/ajrcos\/2019\/v3i230087","volume":"3","author":"EO Oppong","year":"2019","unstructured":"Oppong EO, Oppong SO, Asamoah D, Abiew NAK (2019) Meta-heuristics approach to knapsack problem in memory management. Asian J Res Comput Sci 3(2):1\u201310","journal-title":"Asian J Res Comput Sci"},{"issue":"1","key":"2565_CR6","first-page":"13","volume":"116","author":"K Keumseok","year":"2019","unstructured":"Keumseok K, Kemal A, Inkyoung H (2019) Mobile coupons delivery problem: Postponable online multi-constraint knapsack. Decis Support Syst 116(1):13\u201325","journal-title":"Decis Support Syst"},{"issue":"6","key":"2565_CR7","first-page":"399","volume":"27","author":"F Brandt","year":"2018","unstructured":"Brandt F, Nickel S (2018) The air cargo load planning problem - a consolidated problem definition and literature review on related problems. Eur J Oper Res 27(6):399\u2013410","journal-title":"Eur J Oper Res"},{"issue":"5","key":"2565_CR8","doi-asserted-by":"publisher","first-page":"1311","DOI":"10.1016\/j.cor.2003.11.005","volume":"32","author":"M Hifi","year":"2005","unstructured":"Hifi M, M\u2019Halla H, Sadfi S (2005) An exact algorithm for the knapsack sharing problem. Comput Operat Res 32(5):1311\u20131324","journal-title":"Comput Operat Res"},{"issue":"2","key":"2565_CR9","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/S0377-2217(99)00260-X","volume":"123","author":"S Martello","year":"2000","unstructured":"Martello S, Pisinger D, Toth P (2000) New trends in exact algorithms for the 0\u20131 knapsack problem. Eur J Oper Res 123(2):325\u2013332","journal-title":"Eur J Oper Res"},{"issue":"9","key":"2565_CR10","doi-asserted-by":"publisher","first-page":"2271","DOI":"10.1016\/j.cor.2004.03.002","volume":"32","author":"D Pisinger","year":"2005","unstructured":"Pisinger D (2005) Where are the hard knapsack problems? Comput Operat Res 32(9):2271\u20132284","journal-title":"Comput Operat Res"},{"issue":"8","key":"2565_CR11","doi-asserted-by":"publisher","first-page":"5547","DOI":"10.1016\/S0362-546X(01)00658-7","volume":"47","author":"L Caccetta","year":"2001","unstructured":"Caccetta L, Kulanoot A (2001) Computational aspects of hard knapsack problems. Nonlinear Anal Theory Methods Appl 47(8):5547\u20135558","journal-title":"Nonlinear Anal Theory Methods Appl"},{"key":"2565_CR12","unstructured":"Martello PDTPS Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem"},{"issue":"1","key":"2565_CR13","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1145\/234313.234327","volume":"28","author":"R Motwani","year":"1996","unstructured":"Motwani R, Raghavan P (1996) Randomized algorithms. ACM Comput Surv 28(1):33\u201337","journal-title":"ACM Comput Surv"},{"key":"2565_CR14","volume-title":"Design Analy Approx Algorithm","author":"D-Z Du","year":"2012","unstructured":"Du D-Z, Ko KI, Hu X (2012) Design Analy Approx Algorithm. Springer Science Business Media LLC, Berlin"},{"issue":"2","key":"2565_CR15","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1016\/j.amc.2006.09.020","volume":"187","author":"M Darehmiraki","year":"2007","unstructured":"Darehmiraki M, Nehi HM (2007) Molecular solution to the 0\u20131 knapsack problem based on dna computing. Appl Math Comput 187(2):1033\u20131037. https:\/\/doi.org\/10.1016\/j.amc.2006.09.020","journal-title":"Appl Math Comput"},{"issue":"12","key":"2565_CR16","doi-asserted-by":"publisher","first-page":"2207","DOI":"10.3724\/SP.J.1016.2008.02207","volume":"31","author":"Y Zhu","year":"2008","unstructured":"Zhu Y, Ren L, Ding Y, Kongsuwan K (2008) DNA Ligation design and biological realization of knapsack problem. Chin J Comput 31(12):2207\u20132214","journal-title":"Chin J Comput"},{"issue":"1","key":"2565_CR17","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":"11","key":"2565_CR18","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.ins.2014.06.002","volume":"283","author":"A Rahmani","year":"2014","unstructured":"Rahmani A, Mirhassani SA (2014) A hybrid firefly-genetic algorithm for the capacitated facility location problem. Inf Sci 283(11):70\u201378","journal-title":"Inf Sci"},{"issue":"2","key":"2565_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2017.06.002","volume":"38","author":"BY Qu","year":"2018","unstructured":"Qu BY, Zhu YS, Jiao YC, Wu MY, Suganthan PN, Liang JJ (2018) A survey on multi-objective evolutionary algorithms for the solution of the environmentaleconomic dispatch problems. Swarm Evol Comput 38(2):1\u201311","journal-title":"Swarm Evol Comput"},{"key":"2565_CR20","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"},{"issue":"3","key":"2565_CR21","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(3):104445","journal-title":"Knowl Based Syst"},{"issue":"8","key":"2565_CR22","doi-asserted-by":"publisher","first-page":"13011","DOI":"10.1109\/TITS.2021.3119080","volume":"23","author":"Q Luo","year":"2022","unstructured":"Luo Q, Wu G, Ji B, Wang L, Suganthan PN (2022) Hybrid multi-objective optimization approach with pareto local search for collaborative truck-drone routing problems considering flexible time windows. IEEE Trans Intell Transp Syst 23(8):13011\u201313025","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"11","key":"2565_CR23","first-page":"2655","volume":"28","author":"Y He","year":"2007","unstructured":"He Y, Liu K, Zhang C, Zhang W (2007) Greedy genetic algorithm for solving knapsack problems and its applications. Comput Eng Des 28(11):2655\u20132657","journal-title":"Comput Eng Des"},{"issue":"2","key":"2565_CR24","doi-asserted-by":"publisher","first-page":"1556","DOI":"10.1016\/j.asoc.2010.07.019","volume":"11","author":"D Zou","year":"2011","unstructured":"Zou D, Gao L, Li S, Wu J (2011) Solving 0\u20131 knapsack problem by a novel global harmony search algorithm. Appl Soft Comput 11(2):1556\u20131564","journal-title":"Appl Soft Comput"},{"issue":"22","key":"2565_CR25","first-page":"11042","volume":"218","author":"JC Bansal","year":"2012","unstructured":"Bansal JC, Deep K (2012) A modified binary particle swarm optimization for knapsack problems. Appl Math Comput 218(22):11042\u201311061","journal-title":"Appl Math Comput"},{"issue":"7","key":"2565_CR26","doi-asserted-by":"publisher","first-page":"5337","DOI":"10.1016\/j.eswa.2015.02.015","volume":"42","author":"X Kong","year":"2015","unstructured":"Kong X, Gao L, Ouyang H, Li S (2015) A simplified binary harmony search algorithm for large scale 0\u20131 knapsack problems. Expert Syst Appl 42(7):5337\u20135355","journal-title":"Expert Syst Appl"},{"issue":"1","key":"2565_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.13328\/j.cnki.jos.005139","volume":"28","author":"X Wang","year":"2017","unstructured":"Wang X, He Y (2017) Evolutionary algorithms for knapsack problems. J Softw 28(1):1\u201316. https:\/\/doi.org\/10.13328\/j.cnki.jos.005139","journal-title":"J Softw"},{"key":"2565_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03315-9","volume-title":"Genetic Algorithms + Data Structures = Evolution Programs","author":"BZ Michalewicz","year":"1996","unstructured":"Michalewicz BZ (1996) Genetic Algorithms + Data Structures = Evolution Programs. Springer-Verlag, New York"},{"issue":"1","key":"2565_CR29","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10878-014-9717-1","volume":"31","author":"Y He","year":"2016","unstructured":"He Y, Zhang X, Li W, Li X, Wu W, Gao S (2016) Algorithms for randomized time-varying knapsack problems. J Comb Optim 31(1):95\u2013117. https:\/\/doi.org\/10.1007\/s10878-014-9717-1","journal-title":"J Comb Optim"},{"key":"2565_CR30","volume-title":"Computational intelligence-simulated evolutionary computation","author":"Z Xu","year":"2005","unstructured":"Xu Z (2005) Computational intelligence-simulated evolutionary computation. Higher Education Press, Beijing"},{"issue":"1","key":"2565_CR31","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.ejor.2006.12.046","volume":"185","author":"F-T Lin","year":"2008","unstructured":"Lin F-T (2008) Solving the knapsack problem with imprecise weight coefficients using genetic algorithms. Eur J Oper Res 185(1):133\u2013145","journal-title":"Eur J Oper Res"},{"issue":"7","key":"2565_CR32","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.eswa.2016.01.055","volume":"54","author":"TY Lim","year":"2016","unstructured":"Lim TY, Al-Betar MA, Khader AT (2016) Taming the 0\/1 knapsack problem with monogamous pairs genetic algorithm. Expert Syst Appl 54(7):241\u2013250","journal-title":"Expert Syst Appl"},{"issue":"9","key":"2565_CR33","doi-asserted-by":"publisher","first-page":"1476","DOI":"10.1360\/crad20070905","volume":"44","author":"Y He","year":"2007","unstructured":"He Y, Wang X, Kou Y (2007) A binary differential evolution algorithm with hybrid encoding. J Comput Res Dev 44(9):1476\u20131484","journal-title":"J Comput Res Dev"},{"issue":"1","key":"2565_CR34","doi-asserted-by":"publisher","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(1):177\u2013194","journal-title":"Inf Sci"},{"issue":"5","key":"2565_CR35","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.ins.2012.12.043","volume":"232","author":"L Wang","year":"2013","unstructured":"Wang L, Yang R, Xu Y, Niu Q, Pardalos PM, Fei M (2013) An improved adaptive binary harmony search algorithm. Inf Sci 232(5):58\u201387","journal-title":"Inf Sci"},{"issue":"10","key":"2565_CR36","first-page":"243","volume":"223","author":"GS Mahapatra","year":"2013","unstructured":"Mahapatra GS (2013) An ant colony optimization approach for binary knapsack problem under fuzziness. Appl Math Comput 223(10):243\u2013253","journal-title":"Appl Math Comput"},{"issue":"6","key":"2565_CR37","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1016\/j.asoc.2014.02.010","volume":"19","author":"KK Bhattacharjee","year":"2014","unstructured":"Bhattacharjee KK, Sarmah SP (2014) Shuffled frog leaping algorithm and its application to 0\/1 knapsack problem. Appl Soft Comput 19(6):252\u2013263","journal-title":"Appl Soft Comput"},{"issue":"2","key":"2565_CR38","first-page":"14","volume":"20","author":"M Naser","year":"2015","unstructured":"Naser M (2015) Soccer league competition algorithm for solving knapsack problems. Swarm Evol Comput 20(2):14\u201322","journal-title":"Swarm Evol Comput"},{"issue":"1","key":"2565_CR39","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1016\/j.asoc.2015.10.043","volume":"38","author":"Y Zhou","year":"2016","unstructured":"Zhou Y, Chen X, Zhou G (2016) An improved monkey algorithm for a 0\u20131 knapsack problem. Appl Soft Comput 38(1):817\u2013830","journal-title":"Appl Soft Comput"},{"issue":"3","key":"2565_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10489-016-0855-2","volume":"46","author":"Y Zhou","year":"2017","unstructured":"Zhou Y, Bao Z, Luo Q, Zhang S (2017) A complex-valued encoding wind driven optimization for the 0\u20131 knapsack problem. Appl Intell 46(3):1\u201319","journal-title":"Appl Intell"},{"issue":"8","key":"2565_CR41","doi-asserted-by":"publisher","first-page":"1582","DOI":"10.1007\/s10489-017-1025-x","volume":"48","author":"J Cao","year":"2018","unstructured":"Cao J, Yin B, Lu X, Kang Y, Chen X (2018) A modified artificial bee colony approach for the 0\u20131 knapsack problem. Appl Intell 48(8):1582\u20131595. https:\/\/doi.org\/10.1007\/s10489-017-1025-x","journal-title":"Appl Intell"},{"issue":"1","key":"2565_CR42","doi-asserted-by":"publisher","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-1 knapsack problems. Comput Ind Eng 151(1):106946","journal-title":"Comput Ind Eng"},{"issue":"1","key":"2565_CR43","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106949","volume":"151","author":"M Abdel-Basset","year":"2021","unstructured":"Abdel-Basset M, Mohamed R, Ripon K, C., Michael, R., Mirjalili, S, (2021) New binary marine predators optimization algorithms for 0-1 knapsack problems. Comput Ind Eng 151(1):106949","journal-title":"Comput Ind Eng"},{"key":"2565_CR44","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921735","volume-title":"The design of approximation algorithms","author":"DP Williamson","year":"2011","unstructured":"Williamson DP, Shmoys DB (2011) The design of approximation algorithms. Cambridge University Press, Cambridge"},{"key":"2565_CR45","volume-title":"Randomized algorithms","author":"M Rajeev","year":"1996","unstructured":"Rajeev M, Prabhakar R (1996) Randomized algorithms. Cambridge University Press, Cambridge"},{"key":"2565_CR46","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2007","unstructured":"Cormen TH, Leiserson CE, Rivest RL (2007) Introduction to algorithms. The MIT Press, Cambridge"},{"issue":"5","key":"2565_CR47","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107180","volume":"103","author":"Y He","year":"2021","unstructured":"He Y, Hao X, Li W, Zhai Q (2021) Binary team game algorithm based on modulo operation for knapsack problem with a single continuous variable. Appl Soft Comput 103(5):107180. https:\/\/doi.org\/10.1016\/j.asoc.2021.107180","journal-title":"Appl Soft Comput"},{"issue":"3","key":"2565_CR48","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(3):118978. https:\/\/doi.org\/10.1016\/j.eswa.2022.118978","journal-title":"Expert Syst Appl"},{"key":"2565_CR49","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart RC (1997) A discrete binary version of the particle swarm algorithm. 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation, 4104\u20134109","DOI":"10.1109\/ICSMC.1997.637339"},{"key":"2565_CR50","doi-asserted-by":"publisher","unstructured":"He Y (2024) \u201cCalculation results of 10 algorithms for solving 108 instances of 0-1 knapsack problem\u201d. https:\/\/doi.org\/10.13140\/RG.2.2.32973.24808 URL:https:\/\/www.researchgate.net\/publication","DOI":"10.13140\/RG.2.2.32973.24808"},{"key":"2565_CR51","doi-asserted-by":"crossref","unstructured":"Joaqu\u00c3\u00adn D, Salvador G, Daniel M, Francisco H (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","DOI":"10.1016\/j.swevo.2011.02.002"},{"issue":"3","key":"2565_CR52","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1016\/j.ejor.2021.12.009","volume":"301","author":"J Jooken","year":"2022","unstructured":"Jooken J, Leyman P, De Causmaecker P (2022) A new class of hard problem instances for the 0\u20131 knapsack problem. Eur J Oper Res 301(3):841\u2013854. https:\/\/doi.org\/10.1016\/j.ejor.2021.12.009","journal-title":"Eur J Oper Res"}],"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-02565-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13042-025-02565-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-025-02565-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T06:31:55Z","timestamp":1757140315000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13042-025-02565-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,24]]},"references-count":52,"journal-issue":{"issue":"7-8","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["2565"],"URL":"https:\/\/doi.org\/10.1007\/s13042-025-02565-5","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"type":"print","value":"1868-8071"},{"type":"electronic","value":"1868-808X"}],"subject":[],"published":{"date-parts":[[2025,2,24]]},"assertion":[{"value":"19 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 February 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}