{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T23:07:19Z","timestamp":1767913639767,"version":"3.49.0"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,4,4]],"date-time":"2021-04-04T00:00:00Z","timestamp":1617494400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,4,4]],"date-time":"2021-04-04T00:00:00Z","timestamp":1617494400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2022,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This article proposes a novel binary version of recently developed Gaining Sharing knowledge-based optimization algorithm (GSK) to solve binary optimization problems. GSK algorithm is based on the concept of how humans acquire and share knowledge during their life span. A binary version of GSK named novel binary Gaining Sharing knowledge-based optimization algorithm (NBGSK) depends on mainly two binary stages: binary junior gaining sharing stage and binary senior gaining sharing stage with knowledge factor 1. These two stages enable NBGSK for exploring and exploitation of the search space efficiently and effectively to solve problems in binary space. Moreover, to enhance the performance of NBGSK and prevent the solutions from trapping into local optima, NBGSK with population size reduction (PR-NBGSK) is introduced. It decreases the population size gradually with a linear function. The proposed NBGSK and PR-NBGSK applied to set of knapsack instances with small and large dimensions, which shows that NBGSK and PR-NBGSK are more efficient and effective in terms of convergence, robustness, and accuracy.<\/jats:p>","DOI":"10.1007\/s40747-021-00351-8","type":"journal-article","created":{"date-parts":[[2021,4,4]],"date-time":"2021-04-04T15:02:30Z","timestamp":1617548550000},"page":"43-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":33,"title":["Solving knapsack problems using a binary gaining sharing knowledge-based optimization algorithm"],"prefix":"10.1007","volume":"8","author":[{"given":"Prachi","family":"Agrawal","sequence":"first","affiliation":[]},{"given":"Talari","family":"Ganesh","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5895-2632","authenticated-orcid":false,"given":"Ali Wagdy","family":"Mohamed","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,4]]},"reference":[{"key":"351_CR1","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.cie.2019.04.025","volume":"132","author":"M Abdel-Basset","year":"2019","unstructured":"Abdel-Basset M, El-Shahat D, Faris H, Mirjalili S (2019) A binary multi-verse optimizer for 0\u20131 multidimensional knapsack problems with application in interactive multimedia systems. Comput Ind Eng 132:187\u2013206","journal-title":"Comput Ind Eng"},{"key":"351_CR2","unstructured":"Awad N, Ali M, Liang JJ, Qu B, Suganthan P (2016) Problem definitions and evaluation criteria for the cec 2017 special session and competition on single objective real-parameter numerical optimization. In: Tech Rep"},{"key":"351_CR3","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1016\/j.cam.2013.09.052","volume":"259","author":"MAK Azad","year":"2014","unstructured":"Azad MAK, Rocha AMA, Fernandes EM (2014) A simplified binary artificial fish swarm algorithm for 0\u20131 quadratic knapsack problems. J Comput Appl Math 259:897\u2013904","journal-title":"J Comput Appl Math"},{"key":"351_CR4","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.advengsoft.2019.03.008","volume":"132","author":"A Bahreininejad","year":"2019","unstructured":"Bahreininejad A (2019) Improving the performance of water cycle algorithm using augmented lagrangian method. Adv Eng Softw 132:55\u201364","journal-title":"Adv Eng Softw"},{"key":"351_CR5","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:252\u2013263","journal-title":"Appl Soft Comput"},{"issue":"11","key":"351_CR6","doi-asserted-by":"publisher","first-page":"2157","DOI":"10.1007\/s00500-010-0644-5","volume":"15","author":"J Brest","year":"2011","unstructured":"Brest J, Mau\u010dec MS (2011) Self-adaptive differential evolution algorithm using population size reduction and three strategies. Soft Comput 15(11):2157\u20132174","journal-title":"Soft Comput"},{"issue":"3","key":"351_CR7","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.orl.2009.01.007","volume":"37","author":"L Brotcorne","year":"2009","unstructured":"Brotcorne L, Hanafi S, Mansi R (2009) A dynamic programming algorithm for the bilevel knapsack problem. Oper Res Lett 37(3):215\u2013218","journal-title":"Oper Res Lett"},{"key":"351_CR8","first-page":"1","volume":"2008","author":"A Chen","year":"2008","unstructured":"Chen A, Yongjun F (2008) On the sequential combination tree algorithm for 0\u20131 knapsack problem. J Wenzhou Univ (Natural Sci) 2008:1","journal-title":"J Wenzhou Univ (Natural Sci)"},{"key":"351_CR9","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.ins.2013.06.011","volume":"247","author":"J Cheng","year":"2013","unstructured":"Cheng J, Zhang G, Neri F (2013) Enhancing distributed differential evolution with multicultural migration for global numerical optimization. Inf Sci 247:72\u201393","journal-title":"Inf Sci"},{"issue":"11\u201312","key":"351_CR10","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1016\/S0045-7825(01)00323-1","volume":"191","author":"CAC Coello","year":"2002","unstructured":"Coello CAC (2002) Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art. Comput Methods Appl Mech Eng 191(11\u201312):1245\u20131287","journal-title":"Comput Methods Appl Mech Eng"},{"key":"351_CR11","first-page":"56","volume":"2020","author":"S Cui","year":"2020","unstructured":"Cui S, Yin Y, Wang D, Li Z, Wang Y (2020) A stacking-based ensemble learning method for earthquake casualty prediction. Appl Soft Comput 2020:56","journal-title":"Appl Soft Comput"},{"key":"351_CR12","unstructured":"Das S, Suganthan PN (2010) Problem definitions and evaluation criteria for cec 2011 competition on testing evolutionary algorithms on real world optimization problems. In: Jadavpur University, Nanyang Technological University, Kolkata, pp 341\u2013359"},{"issue":"2\u20134","key":"351_CR13","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0045-7825(99)00389-8","volume":"186","author":"K Deb","year":"2000","unstructured":"Deb K (2000) An efficient constraint handling method for genetic algorithms. Comput Methods Appl Mech Eng 186(2\u20134):311\u2013338","journal-title":"Comput Methods Appl Mech Eng"},{"issue":"1","key":"351_CR14","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/BF01580448","volume":"8","author":"D Fayard","year":"1975","unstructured":"Fayard D, Plateau G (1975) Resolution of the 0\u20131 knapsack problem: comparison of methods. Math Program 8(1):272\u2013307","journal-title":"Math Program"},{"key":"351_CR15","first-page":"65","volume":"2020","author":"Y Fu","year":"2020","unstructured":"Fu Y, Wang H, Wang J, Pu X (2020) Multiobjective modeling and optimization for scheduling a stochastic hybrid flow shop with maximizing processing quality and minimizing total tardiness. IEEE Syst J 2020:65","journal-title":"IEEE Syst J"},{"issue":"12","key":"351_CR16","doi-asserted-by":"publisher","first-page":"5037","DOI":"10.1109\/TSMC.2019.2907575","volume":"50","author":"Y Fu","year":"2019","unstructured":"Fu Y, Zhou M, Guo X, Qi L (2019) Scheduling dual-objective stochastic hybrid flow shop with deteriorating jobs via bi-population evolutionary algorithm. IEEE Trans Syst Man Cybern Syst 50(12):5037\u20135048","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"issue":"1","key":"351_CR17","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10479-009-0660-y","volume":"184","author":"AS Fukunaga","year":"2011","unstructured":"Fukunaga AS (2011) A branch-and-bound algorithm for hard multiple knapsack problems. Ann Oper Res 184(1):97\u2013119","journal-title":"Ann Oper Res"},{"issue":"5","key":"351_CR18","doi-asserted-by":"publisher","first-page":"1108","DOI":"10.1109\/TCYB.2014.2345478","volume":"45","author":"WF Gao","year":"2014","unstructured":"Gao WF, Yen GG, Liu SY (2014) A dual-population differential evolution with coevolution for constrained optimization. IEEE Trans Cybern 45(5):1108\u20131121","journal-title":"IEEE Trans Cybern"},{"issue":"6","key":"351_CR19","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/s10732-008-9080-4","volume":"15","author":"S Garc\u00eda","year":"2009","unstructured":"Garc\u00eda S, Molina D, Lozano M, Herrera F (2009) A study on the use of non-parametric tests for analyzing the evolutionary algorithms\u2019 behaviour: a case study on the cec\u20192005 special session on real parameter optimization. J Heuristics 15(6):617","journal-title":"J Heuristics"},{"key":"351_CR20","first-page":"1","volume":"2007","author":"Z Jian-ying","year":"2007","unstructured":"Jian-ying Z (2007) Nonlinear reductive dimension approximate algorithm for 0\u20131 knapsack problem. J Inner Mongolia Normal Univ (Natural Sci Ed) 2007:1","journal-title":"J Inner Mongolia Normal Univ (Natural Sci Ed)"},{"key":"351_CR21","unstructured":"Li Z, Li N (2009) A novel multi-mutation binary particle swarm optimization for 0\/1 knapsack problem. In: 2009 Chinese control and decision conference, IEEE, pp 3042\u20133047"},{"issue":"1","key":"351_CR22","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.ejor.2006.12.046","volume":"185","author":"FT Lin","year":"2008","unstructured":"Lin FT (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"},{"key":"351_CR23","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1016\/j.asoc.2016.09.038","volume":"52","author":"WC Lin","year":"2017","unstructured":"Lin WC, Yin Y, Cheng SR, Cheng TE, Wu CH, Wu CC (2017) Particle swarm optimization and opposite-based particle swarm optimization for two-agent multi-facility customer order scheduling with ready times. Appl Soft Comput 52:877\u2013884","journal-title":"Appl Soft Comput"},{"key":"351_CR24","doi-asserted-by":"crossref","unstructured":"Liu Y, Liu C (2009) A schema-guiding evolutionary algorithm for 0-1 knapsack problem. In: 2009 International association of computer science and information technology-Spring Conference, IEEE, pp 160\u2013164","DOI":"10.1109\/IACSIT-SC.2009.31"},{"issue":"1","key":"351_CR25","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.ejor.2007.03.010","volume":"187","author":"G Mavrotas","year":"2008","unstructured":"Mavrotas G, Diakoulaki D, Kourentzis A (2008) Selection among ranked projects under segmentation, policy and logical constraints. Eur J Oper Res 187(1):177\u2013192","journal-title":"Eur J Oper Res"},{"key":"351_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00619-7","volume-title":"Constraint-handling in evolutionary optimization","author":"E Mezura-Montes","year":"2009","unstructured":"Mezura-Montes E (2009) Constraint-handling in evolutionary optimization, vol 198. Springer, Berlin"},{"key":"351_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2012.09.002","volume":"9","author":"S Mirjalili","year":"2013","unstructured":"Mirjalili S, Lewis A (2013) S-shaped versus v-shaped transfer functions for binary particle swarm optimization. Swarm Evol Comput 9:1\u201314","journal-title":"Swarm Evol Comput"},{"issue":"3\u20134","key":"351_CR28","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/s00521-013-1525-5","volume":"25","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili S, Mirjalili SM, Yang XS (2014) Binary bat algorithm. Neural Comput Appl 25(3\u20134):663\u2013681","journal-title":"Neural Comput Appl"},{"key":"351_CR29","doi-asserted-by":"crossref","unstructured":"Mohamed AK, Mohamed AW, Elfeky EZ, Saleh M (2018) Enhancing agde algorithm using population size reduction for global numerical optimization. In: International conference on advanced machine learning technologies and applications, Springer, pp 62\u201372","DOI":"10.1007\/978-3-319-74690-6_7"},{"key":"351_CR30","first-page":"1","volume":"2019","author":"AW Mohamed","year":"2019","unstructured":"Mohamed AW, Hadi AA, Mohamed AK (2019) Gaining-sharing knowledge based algorithm for solving optimization problems: a novel nature-inspired algorithm. Int J Mach Learn Cybern 2019:1\u201329","journal-title":"Int J Mach Learn Cybern"},{"key":"351_CR31","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.ins.2012.01.008","volume":"194","author":"AW Mohamed","year":"2012","unstructured":"Mohamed AW, Sabry HZ (2012) Constrained optimization based on modified differential evolution algorithm. Inf Sci 194:171\u2013208","journal-title":"Inf Sci"},{"key":"351_CR32","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.swevo.2014.10.002","volume":"20","author":"N Moosavian","year":"2015","unstructured":"Moosavian N (2015) Soccer league competition algorithm for solving knapsack problems. Swarm Evol Comput 20:14\u201322","journal-title":"Swarm Evol Comput"},{"key":"351_CR33","doi-asserted-by":"crossref","unstructured":"Shi H (2006) Solution to 0\/1 knapsack problem based on improved ant colony algorithm. In: 2006 IEEE international conference on information acquisition, IEEE, pp 1062\u20131066","DOI":"10.1109\/ICIA.2006.305887"},{"issue":"4","key":"351_CR34","doi-asserted-by":"publisher","first-page":"1774","DOI":"10.1016\/j.asoc.2012.11.048","volume":"13","author":"TK Truong","year":"2013","unstructured":"Truong TK, Li K, Xu Y (2013) Chemical reaction optimization with greedy strategy for the 0\u20131 knapsack problem. Appl Soft Comput 13(4):1774\u20131780","journal-title":"Appl Soft Comput"},{"issue":"9","key":"351_CR35","doi-asserted-by":"publisher","first-page":"28","DOI":"10.4304\/jsw.3.9.28-35","volume":"3","author":"L Wang","year":"2008","unstructured":"Wang L, Wang X, Fu J, Zhen L (2008) A novel probability binary particle swarm optimization algorithm and its application. J Softw 3(9):28\u201335","journal-title":"J Softw"},{"key":"351_CR36","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:58\u201387","journal-title":"Inf Sci"},{"key":"351_CR37","doi-asserted-by":"crossref","unstructured":"Yoshizawa H, Hashimoto S (2000) Landscape analyses and global search of knapsack problems. In: Smc 2000 conference proceedings. 2000 IEEE international conference on systems, man and cybernetics.\u2019cybernetics evolving to systems, humans, organizations, and their complex interactions\u2019(cat. no. 0, vol.\u00a03, IEEE, pp 2311\u20132315","DOI":"10.1109\/ICSMC.2000.886461"},{"key":"351_CR38","first-page":"10","volume":"4","author":"W You","year":"2007","unstructured":"You W (2007) Study of greedy-policy-based algorithm for 0\/1 knapsack problem. Compu Modern 4:10\u201316","journal-title":"Compu Modern"},{"issue":"5","key":"351_CR39","doi-asserted-by":"crossref","first-page":"1380","DOI":"10.1109\/JAS.2020.1003177","volume":"7","author":"H Yuan","year":"2020","unstructured":"Yuan H, Zhou M, Liu Q, Abusorrah A (2020) Fine-grained resource provisioning and task scheduling for heterogeneous applications in distributed green clouds. IEEE\/CAA J Autom Sin 7(5):1380\u20131393","journal-title":"IEEE\/CAA J Autom Sin"},{"key":"351_CR40","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:817\u2013830","journal-title":"Appl Soft Comput"},{"issue":"12","key":"351_CR41","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 LH, Ding Y, Kritaya K (2008) Dna ligation design and biological realization of knapsack problem. Chin J Comput 31(12):2207\u20132214","journal-title":"Chin J Comput"},{"issue":"2","key":"351_CR42","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"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-021-00351-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-021-00351-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-021-00351-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,27]],"date-time":"2024-08-27T14:26:36Z","timestamp":1724768796000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-021-00351-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,4]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["351"],"URL":"https:\/\/doi.org\/10.1007\/s40747-021-00351-8","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,4]]},"assertion":[{"value":"13 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 March 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2021","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"}}]}}