{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T15:37:47Z","timestamp":1768405067901,"version":"3.49.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"27","license":[{"start":{"date-parts":[[2023,10,3]],"date-time":"2023-10-03T00:00:00Z","timestamp":1696291200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,3]],"date-time":"2023-10-03T00:00:00Z","timestamp":1696291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s00521-023-09075-x","type":"journal-article","created":{"date-parts":[[2023,10,3]],"date-time":"2023-10-03T13:01:31Z","timestamp":1696338091000},"page":"22369-22385","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An adaptive grey wolf optimization with differential evolution operator for solving the discount {0\u20131} knapsack problem"],"prefix":"10.1007","volume":"37","author":[{"given":"Zijian","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3783-2041","authenticated-orcid":false,"given":"Xi","family":"Fang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fei","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liang","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xianchen","family":"Meng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,3]]},"reference":[{"key":"9075_CR1","unstructured":"Guldan B (2007) Heuristic and exact algorithms for discounted knapsack problems. Master thesis, University of Erlangen-Nu \u00a8rnberg, Germany."},{"issue":"12","key":"9075_CR2","first-page":"2614","volume":"39","author":"Y-C He","year":"2016","unstructured":"He Y-C, Wang X-Z, Li W-B et al (2016) Research on genetic algorithms for the discounted 0\u20131 knapsack problem. Chinese J Comput 39(12):2614\u20132630","journal-title":"Chinese J Comput"},{"key":"9075_CR3","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","volume":"69","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili S, Mirjalili SM, Lewis A (2014) Grey wolf optimizer. Adv Eng Softw 69:46\u201361","journal-title":"Adv Eng Softw"},{"issue":"4","key":"9075_CR4","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 ECC (2017) Discrete differential evolutions for the discounted 0\u20131 knapsack problem. Int J Bio-Inspired Comput 10(4):219","journal-title":"Int J Bio-Inspired Comput"},{"key":"9075_CR5","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":"4","key":"9075_CR6","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1016\/j.cam.2013.09.052","volume":"259","author":"AK Azad","year":"2014","unstructured":"Azad AK, Rocha AMAC, Fernandes EMGP (2014) A simplified binary artificial fish swarm algorithm for 0\u20131 quadratic knapsack problems\u2019. J Comput Appl Mathematics 259(4):897\u2013904","journal-title":"J Comput Appl Mathematics"},{"key":"9075_CR7","doi-asserted-by":"publisher","first-page":"107399","DOI":"10.1016\/j.compeleceng.2021.107399","volume":"96","author":"RG Babukarthik","year":"2021","unstructured":"Babukarthik RG, Dhasarathan C, Kumar M, Shankar A, Thakur S, Cheng X (2021) A novel approach for multi-constraints knapsack problem using cluster particle swarm optimization. Comput Electric Eng 96:107399","journal-title":"Comput Electric Eng"},{"issue":"4","key":"9075_CR8","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1016\/j.cor.2003.08.021","volume":"32","author":"VC Li","year":"2005","unstructured":"Li VC, Curry GL (2005) Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search. Comput Oper Res 32(4):825\u2013848","journal-title":"Comput Oper Res"},{"issue":"1","key":"9075_CR9","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.disopt.2008.09.004","volume":"6","author":"V Poirriez","year":"2009","unstructured":"Poirriez V, Yanev N, Andonov R (2009) A hybrid algorithm for the unbounded knapsack problem. Discret Optim 6(1):110\u2013124","journal-title":"Discret Optim"},{"key":"9075_CR10","doi-asserted-by":"crossref","unstructured":"Lai X et al. (2020) Diversity-preserving quantum particle swarm optimization for the multidimensional knapsack problem. Exp Syst Appl (2020):113310.","DOI":"10.1016\/j.eswa.2020.113310"},{"key":"9075_CR11","first-page":"455","volume":"13","author":"A Syarif","year":"2020","unstructured":"Syarif A et al (2020) Comparing various genetic algorithm approaches for multiple-choice multi-dimensional knapsack problem (mm-KP). Int J Intell Eng Syst 13:455\u2013462","journal-title":"Int J Intell Eng Syst"},{"key":"9075_CR12","doi-asserted-by":"crossref","unstructured":"Xie X, Feng JL (20017) A mini-swarm for the quadratic knapsack problem. Swarm Intell Symposium IEEE, 2007:190\u2013197.","DOI":"10.1109\/SIS.2007.368045"},{"issue":"4","key":"9075_CR13","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1287\/opre.1080.0555","volume":"56","author":"GY Lin","year":"2008","unstructured":"Lin GY, Lu Y, Yao DD (2008) The stochastic knapsack revisited: switch-over policies and dynamic pricing. Oper Res 56(4):945\u2013957","journal-title":"Oper Res"},{"issue":"2","key":"9075_CR14","doi-asserted-by":"publisher","first-page":"157","DOI":"10.3982\/TE700","volume":"6","author":"D Dizdar","year":"2011","unstructured":"Dizdar D, Gershkov A, Moldovanu B (2011) Revenue maximization in the dynamic knapsack problem. Theor Econ 6(2):157\u2013184","journal-title":"Theor Econ"},{"issue":"12","key":"9075_CR15","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\u20131 knapsack problem. Appl Math Comput 218(12):6921\u20136933","journal-title":"Appl Math Comput"},{"key":"9075_CR16","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1016\/j.ins.2016.07.037","volume":"369","author":"YC He","year":"2016","unstructured":"He YC, Wang XZ, He YL, Zhao SL, Li WB (2016) Exact and approximate algorithms for discounted 0\u20131 knapsack problem. Inf Sci 369:634\u2013647","journal-title":"Inf Sci"},{"key":"9075_CR17","doi-asserted-by":"crossref","unstructured":"Feng Y, Wang GG, Li W, Li N (2017) Multi-strategy monarch butterfly optimization algorithm for discounted {0\u20131} knapsack problem. Neural Comput Applic: 1\u201318.","DOI":"10.1007\/s00521-017-2903-1"},{"issue":"99","key":"9075_CR18","doi-asserted-by":"publisher","first-page":"10708","DOI":"10.1109\/ACCESS.2018.2809445","volume":"6","author":"YH Feng","year":"2018","unstructured":"Feng YH, Wang GG (2018) Binary moth search algorithm for discounted 0\u20131 knapsack problem. IEEE Access 6(99):10708\u201310719","journal-title":"IEEE Access"},{"key":"9075_CR19","doi-asserted-by":"crossref","unstructured":"Cauteruccio F, Terracina G, Ursino D (2020) Generalizing identity-based string comparison metrics: framework and techniques. Knowledge-Based Syst, 187(Jan.), 104820.1\u2013104820.17.","DOI":"10.1016\/j.knosys.2019.06.028"},{"key":"9075_CR20","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1016\/j.energy.2016.05.105","volume":"111","author":"T Jayabarathi","year":"2016","unstructured":"Jayabarathi T, Raghunathan T, Adarsh BR, Suganthan PN (2016) Economic dispatch using hybrid grey wolf optimizer. Energy 111:630\u2013641","journal-title":"Energy"},{"key":"9075_CR21","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.advengsoft.2016.05.015","volume":"99","author":"S Zhang","year":"2016","unstructured":"Zhang S, Zhou Y, Li Z, Pan W (2016) Grey wolf optimizer for unmanned combat aerial vehicle path planning. Adv Eng Softw 99:121\u2013136","journal-title":"Adv Eng Softw"},{"key":"9075_CR22","unstructured":"Chandramohan D, Dumka A, Dhilipkumar V, Loganathan J (2020) Data dissemination for green-vanets communication: an opportunistic optimization approach. Int J Pervasive Comput Commun, ahead-of-print."},{"key":"9075_CR23","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/j.swevo.2017.08.002","volume":"38","author":"LK Panwar","year":"2018","unstructured":"Panwar LK, Reddy S, Verma A, Panigrahi BK, Kumar R (2018) Binary grey wolf optimizer for large scale unit commitment problem, Swarm. Evol Comput 38:251\u2013266","journal-title":"Evol Comput"},{"key":"9075_CR24","doi-asserted-by":"publisher","first-page":"105645","DOI":"10.1016\/j.asoc.2019.105645","volume":"83","author":"K Luo","year":"2019","unstructured":"Luo K, Zhao Q (2019) A binary grey wolf optimizer for the multidimensional knapsack problem. Appl Soft Comput 83:105645","journal-title":"Appl Soft Comput"},{"key":"9075_CR25","doi-asserted-by":"publisher","unstructured":"Camacho Villal\u00f3n CL, Thomas S, Dorigo M (2020) Grey wolf, firefly and bat algorithms: three widespread algorithms that do not contain any novelty. Swarm Intelligence: 12th International Conference, ANTS 2020, LNCS 12421, Springer, 121\u2013133. DOI: https:\/\/doi.org\/10.1007\/978-3-030-60376-2_10.","DOI":"10.1007\/978-3-030-60376-2_10"},{"key":"9075_CR26","doi-asserted-by":"publisher","DOI":"10.1111\/itor.13176","author":"CL Camacho-Villal\u00f3n","year":"2022","unstructured":"Camacho-Villal\u00f3n CL, Dorigo M, St\u00fctzle T (2022) Exposing the grey wolf, moth-flame, whale, firefly, bat, and antlion algorithms: six misleading optimization techniques inspired by bestial metaphors. Int Trans Operat Res. https:\/\/doi.org\/10.1111\/itor.13176","journal-title":"Int Trans Operat Res"},{"key":"9075_CR27","doi-asserted-by":"crossref","unstructured":"Deb K, Datta R (2010) A fast and accurate solution of constrained optimization problems using a hybrid bi-objective and penalty function approach.:1\u20138.","DOI":"10.1109\/CEC.2010.5586543"},{"key":"9075_CR28","volume-title":"Algorithms design techniques and analysis","author":"MH Alsuwaiyel","year":"2009","unstructured":"Alsuwaiyel MH (2009) Algorithms design techniques and analysis. World Scientific Publishing Company, Singapore"},{"key":"9075_CR29","doi-asserted-by":"crossref","unstructured":"Coello, Carlos AC (2002) Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art. Comput Methods in Appl Mech Eng 191. 11\u201312(2002):1245\u20131287.","DOI":"10.1016\/S0045-7825(01)00323-1"},{"issue":"1","key":"9075_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/evco.1996.4.1.1","volume":"4","author":"Z Michalewicz","year":"1996","unstructured":"Michalewicz Z (1996) Evolutionary algorithms for constrained parameter optimization problems. Evol Comput 4(1):1\u201332","journal-title":"Evol Comput"},{"issue":"5","key":"9075_CR31","doi-asserted-by":"publisher","first-page":"1257","DOI":"10.1007\/s00521-014-1806-7","volume":"26","author":"S Saremi","year":"2015","unstructured":"Saremi S, Mirjalili SZ, Mirjalili SM (2015) Evolutionary population dynamics and grey wolf optimizer. Neural Comput Appl 26(5):1257\u20131263","journal-title":"Neural Comput Appl"},{"key":"9075_CR32","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.asoc.2017.06.044","volume":"60","author":"AA Heidari","year":"2017","unstructured":"Heidari AA, Pahlavani P (2017) An efficient modified grey wolf optimizer with L\u00e9vy flight for optimization tasks. Appl Soft Comput 60:115\u2013134","journal-title":"Appl Soft Comput"},{"key":"9075_CR33","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/j.asoc.2019.01.025","volume":"77","author":"K Luo","year":"2019","unstructured":"Luo K (2019) Enhanced grey wolf optimizer with a model for dynamically estimating the location of the prey. Appl Soft Comput 77:225\u2013235","journal-title":"Appl Soft Comput"},{"issue":"5","key":"9075_CR34","first-page":"1292","volume":"37","author":"C Wu","year":"2017","unstructured":"Wu C, He Y, Chen Y et al (2017) Mutated bat algorithm for solving discounted 0\u20131 knapsack problem. J Comput Appl (China) 37(5):1292\u20131299","journal-title":"J Comput Appl (China)"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-023-09075-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-023-09075-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-023-09075-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T14:12:54Z","timestamp":1757340774000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-023-09075-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,3]]},"references-count":34,"journal-issue":{"issue":"27","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["9075"],"URL":"https:\/\/doi.org\/10.1007\/s00521-023-09075-x","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,3]]},"assertion":[{"value":"21 September 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 September 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 October 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 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"}},{"value":"The hyperlinks to the datasets used in this paper are as follows:","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Data availability"}}]}}