{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:20:43Z","timestamp":1740108043051,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T00:00:00Z","timestamp":1660262400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T00:00:00Z","timestamp":1660262400000},"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":[[2023,1]]},"DOI":"10.1007\/s00521-022-07555-0","type":"journal-article","created":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T13:02:54Z","timestamp":1660309374000},"page":"1183-1209","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Effect of learning strategies in an evolutionary method: the case of the bi-objective quadratic multiple knapsack problem"],"prefix":"10.1007","volume":"35","author":[{"given":"M\u00e9ziane","family":"A\u00efder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oussama","family":"Gacem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1031-7701","authenticated-orcid":false,"given":"Mhand","family":"Hifi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,12]]},"reference":[{"key":"7555_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.116238","volume":"191","author":"M Aider","year":"2022","unstructured":"Aider M, Gacem O, Hifi M (2022) A hybrid population-based algorithm for the bi-objective quadratic multiple knapsack problem. Appear Exp Syst Appl 191:116238. https:\/\/doi.org\/10.1016\/j.eswa.2021.116238","journal-title":"Appear Exp Syst Appl"},{"key":"7555_CR2","doi-asserted-by":"publisher","unstructured":"Aider M, Gacem O, Hifi M (2020) A two-stage $$\\varepsilon $$-constraint strategy-based heuristic for bi-objective quadratic multiple knapsack problems, In Proceedings of IEEE, 7th international conference on soft computing & machine intelligence (ISCMI). Stockholm, Sweden, pp 51-55. https:\/\/doi.org\/10.1109\/ISCMI51676.2020.9311581","DOI":"10.1109\/ISCMI51676.2020.9311581"},{"key":"7555_CR3","doi-asserted-by":"publisher","DOI":"10.1080\/01605682.2020.1843982","author":"M Aider","year":"2020","unstructured":"Aider M, Gacem O, Hifi M (2020) Branch and solve strategies-based algorithm for the quadratic multiple knapsack problem. J Oper Res Soc. https:\/\/doi.org\/10.1080\/01605682.2020.1843982","journal-title":"J Oper Res Soc"},{"issue":"5","key":"7555_CR4","doi-asserted-by":"publisher","first-page":"1259","DOI":"10.1016\/j.cor.2004.09.016","volume":"33","author":"Md-M Akbar","year":"2006","unstructured":"Akbar Md-M, Rahman MS, Kaykobad M, Manning EG, Shoja GC (2006) Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls. Comput Oper Res 33(5):1259\u20131273","journal-title":"Comput Oper Res"},{"key":"7555_CR5","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1016\/j.cie.2011.01.019","volume":"60","author":"H Akeb","year":"2011","unstructured":"Akeb H, Hifi M, Ould Ahmed Mounir M-E (2011) Local branching-based algorithms for the disjunctively constrained knapsack problem. Comput Indus Eng 60:811\u2013820","journal-title":"Comput Indus Eng"},{"issue":"5","key":"7555_CR6","doi-asserted-by":"publisher","first-page":"1130","DOI":"10.1287\/opre.28.5.1130","volume":"28","author":"E Balas","year":"1980","unstructured":"Balas E, Zemel E (1980) An algorithm for large zero-one knapsack problems. Oper Res Soc Am 28(5):1130\u20131154","journal-title":"Oper Res Soc Am"},{"issue":"3","key":"7555_CR7","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1016\/S0377-2217(03)00244-3","volume":"157","author":"A Billionnet","year":"2004","unstructured":"Billionnet A, Soutif E (2004) An exact method for the 0\u20131 quadratic knapsack problem based on lagrangian decomposition. Eur J Oper Res 157(3):565\u2013575","journal-title":"Eur J Oper Res"},{"key":"7555_CR8","doi-asserted-by":"crossref","unstructured":"Julstrom BA (2005) Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem, In Proceedings of the 7th annual conference on Genetic and evolutionary computation (GECCO \u201905), pp 607-614","DOI":"10.1145\/1068009.1068111"},{"key":"7555_CR9","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.jspi.2014.12.004","volume":"160","author":"Y Cao","year":"2015","unstructured":"Cao Y, Smucker B-J, Robinson T-J (2015) On using the hypervolume indicator to compare Pareto fronts: applications to multi-criteria optimal experimental design. J Stat Plan Inference 160:60\u201374","journal-title":"J Stat Plan Inference"},{"key":"7555_CR10","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.knosys.2015.10.004","volume":"92","author":"Y Chen","year":"2016","unstructured":"Chen Y, Hao J-K, Glover F (2016) An evolutionary path relinking approach for the quadratic multiple knapsack problem. Knowl-Based Syst 92:23\u201334","journal-title":"Knowl-Based Syst"},{"issue":"1","key":"7555_CR11","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.knosys.2016.01.014","volume":"97","author":"Y Chen","year":"2016","unstructured":"Chen Y, Hao J-K (2016) The bi-objective quadratic multiple knapsack problem: model and heuristics. Knowl-Based Syst 97(1):89\u2013100","journal-title":"Knowl-Based Syst"},{"issue":"1","key":"7555_CR12","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s10479-014-1720-5","volume":"226","author":"Y Chen","year":"2015","unstructured":"Chen Y, Hao J-K (2015) Iterated responsive threshold search for the quadratic multiple knapsack problem. Annal Oper Res 226(1):101\u2013131","journal-title":"Annal Oper Res"},{"issue":"1","key":"7555_CR13","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1504\/IJOR.2009.024531","volume":"5","author":"N Cherfi","year":"2009","unstructured":"Cherfi N, Hifi M (2009) Hybrid algorithms for the multiple-choice multi-dimensional knapsack problem. Int J Oper Res 5(1):89\u2013109","journal-title":"Int J Oper Res"},{"issue":"2","key":"7555_CR14","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1080\/03052150512331303436","volume":"37","author":"R Farmani","year":"2005","unstructured":"Farmani R, Savic DA, Walters GA (2005) Evolutionary multi-objective optimization in water distribution network design. Eng Opt 37(2):167\u2013183","journal-title":"Eng Opt"},{"issue":"1\u20133","key":"7555_CR15","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M Fischetti","year":"2003","unstructured":"Fischetti M, Lodi A (2003) Local branching. Math Program 98(1\u20133):23\u201347","journal-title":"Math Program"},{"key":"7555_CR16","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.cor.2019.04.012","volume":"108","author":"AA Garc\u00eda-Le\u00f3n","year":"2019","unstructured":"Garc\u00eda-Le\u00f3n AA, Dauz\u00e8re-P\u00e9r\u00e8s S, Mat\u00ec Y (2019) An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria. Comput Oper Res 108:187\u2013200","journal-title":"Comput Oper Res"},{"key":"7555_CR17","doi-asserted-by":"crossref","unstructured":"Hiley A, Julstrom B-A (2006) The quadratic multiple knapsack problem and three heuristic approaches to it, In Proceeding GECCO \u201906 Proceedings of the 8th annual conference on Genetic and evolutionary computation, pp 547-552","DOI":"10.1145\/1143997.1144096"},{"issue":"3","key":"7555_CR18","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1002\/nav.3800250316","volume":"25","author":"MS Hung","year":"1978","unstructured":"Hung MS, Fisk JC (1978) An algorithm for 0\u20131 multiple-knapsack problems. Naval Res Logist Q 25(3):571\u2013579","journal-title":"Naval Res Logist Q"},{"key":"7555_CR19","volume-title":"Pisinger","author":"H Kellerer","year":"2004","unstructured":"Kellerer H, Perschy U (2004) Pisinger. Knapsack problems, Springer, Berlin"},{"key":"7555_CR20","volume-title":"Knapsack problems: algorithms and computer implementations","author":"S Martello","year":"1990","unstructured":"Martello S, Toth P (1990) Knapsack problems: algorithms and computer implementations. Wiley, Chichester"},{"issue":"5","key":"7555_CR21","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1109\/TIT.1978.1055927","volume":"24","author":"M Merkle","year":"1978","unstructured":"Merkle M, Hellman M (1978) Hiding information and signatures in trapdoor knapsacks. IEEE Trans Inf Theory 24(5):525\u2013530","journal-title":"IEEE Trans Inf Theory"},{"key":"7555_CR22","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1016\/j.sbspro.2014.01.101","volume":"111","author":"G Perboli","year":"2014","unstructured":"Perboli G, Gobbato L, Perfetti F (2014) Packing problems in transportation and supply chain: new problems and trends. Procedia - Soci Behav Sci 111:672\u2013681","journal-title":"Procedia - Soci Behav Sci"},{"key":"7555_CR23","doi-asserted-by":"crossref","unstructured":"Sara\u00e7 T, Sipahioglu A (2007) A genetic algorithm for the quadratic multiple knapsack problem, In Proceedings of the international symposium on brain, vision, and artificial intelligence pp 490\u2013498","DOI":"10.1007\/978-3-540-75555-5_47"},{"key":"7555_CR24","unstructured":"Zhao F, Asmus ThN, Assanis DN, Dec JE, Eng JA, Najt PM (2003) Homogeneous charge compression ignition. HCCI engines, SAE Technical Paper"},{"issue":"4","key":"7555_CR25","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans Evolutionary Comput 3(4):257\u2013271","journal-title":"IEEE Trans Evolutionary Comput"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-07555-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-022-07555-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-07555-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T17:10:45Z","timestamp":1673284245000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-022-07555-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,12]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["7555"],"URL":"https:\/\/doi.org\/10.1007\/s00521-022-07555-0","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"type":"print","value":"0941-0643"},{"type":"electronic","value":"1433-3058"}],"subject":[],"published":{"date-parts":[[2022,8,12]]},"assertion":[{"value":"3 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 2022","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."}},{"value":"This article does not contain any studies with human participants performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval."}}]}}