{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T21:12:02Z","timestamp":1778101922411,"version":"3.51.4"},"reference-count":28,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100010097","name":"China Association for Science and Technology","doi-asserted-by":"publisher","award":["2022QNRC001"],"award-info":[{"award-number":["2022QNRC001"]}],"id":[{"id":"10.13039\/100010097","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62472189"],"award-info":[{"award-number":["62472189"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72571283"],"award-info":[{"award-number":["72571283"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Engineering Applications of Artificial Intelligence"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.engappai.2026.114769","type":"journal-article","created":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T02:52:20Z","timestamp":1776307940000},"page":"114769","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"P2","title":["A doubly reinforced local search for solving the Quadratic Multiple Knapsack Problem"],"prefix":"10.1016","volume":"176","author":[{"given":"Yingsong","family":"Nie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lingyan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaolu","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Guan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6748-5634","authenticated-orcid":false,"given":"Yan","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.engappai.2026.114769_b1","series-title":"Asian Conference on Machine Learning","first-page":"81","article-title":"A state aggregation approach for solving knapsack problem with deep reinforcement learning","author":"Afshar","year":"2020"},{"issue":"3","key":"10.1016\/j.engappai.2026.114769_b2","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1080\/01605682.2020.1843982","article-title":"Branch and solve strategies-based algorithm for the quadratic multiple knapsack problem","volume":"73","author":"A\u00efder","year":"2022","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/j.engappai.2026.114769_b3","series-title":"2018 International Arab Conference on Information Technology","first-page":"1","article-title":"A survey of the knapsack problem","author":"Assi","year":"2018"},{"key":"10.1016\/j.engappai.2026.114769_b4","series-title":"Neural combinatorial optimization with reinforcement learning","author":"Bello","year":"2016"},{"issue":"3","key":"10.1016\/j.engappai.2026.114769_b5","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1287\/ijoc.2018.0840","article-title":"An exact algorithm for the quadratic multiknapsack problem with an application to event seating","volume":"31","author":"Bergman","year":"2019","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.engappai.2026.114769_b6","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/s10479-014-1720-5","article-title":"Iterated responsive threshold search for the quadratic multiple knapsack problem","volume":"226","author":"Chen","year":"2015","journal-title":"Ann. Oper. Res."},{"issue":"6","key":"10.1016\/j.engappai.2026.114769_b7","doi-asserted-by":"crossref","first-page":"908","DOI":"10.1109\/TEVC.2016.2546340","article-title":"Memetic search for the generalized quadratic multiple knapsack problem","volume":"20","author":"Chen","year":"2016","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.engappai.2026.114769_b8","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.knosys.2015.10.004","article-title":"An evolutionary path relinking approach for the quadratic multiple knapsack problem","volume":"92","author":"Chen","year":"2016","journal-title":"Knowl.-Based Syst."},{"issue":"7","key":"10.1016\/j.engappai.2026.114769_b9","doi-asserted-by":"crossref","first-page":"1151","DOI":"10.1287\/mnsc.1050.0392","article-title":"Efficient production-distribution system design","volume":"51","author":"Elhedhli","year":"2005","journal-title":"Manag. Sci."},{"issue":"1","key":"10.1016\/j.engappai.2026.114769_b10","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.ejor.2021.06.018","article-title":"A branch-and-bound algorithm for the quadratic multiple knapsack problem","volume":"298","author":"Fleszar","year":"2022","journal-title":"European J. Oper. Res."},{"issue":"3","key":"10.1016\/j.engappai.2026.114769_b11","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1016\/j.ejor.2020.10.047","article-title":"Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem","volume":"291","author":"Galli","year":"2021","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.engappai.2026.114769_b12","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.dam.2022.06.033","article-title":"Lagrangian matheuristics for the quadratic multiple knapsack problem","volume":"335","author":"Galli","year":"2023","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.engappai.2026.114769_b13","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s10589-013-9623-y","article-title":"Strategic oscillation for the quadratic multiple knapsack problem","volume":"58","author":"Garc\u00eda-Mart\u00ednez","year":"2014","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"10.1016\/j.engappai.2026.114769_b14","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1016\/j.ejor.2013.07.035","article-title":"Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem","volume":"232","author":"Garc\u00eda-Mart\u00ednez","year":"2014","journal-title":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/j.engappai.2026.114769_b15","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/TCOM.1977.1093709","article-title":"On the topological design of distributed computer networks","volume":"25","author":"Gerla","year":"1977","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/j.engappai.2026.114769_b16","series-title":"Handbook of Combinatorial Optimization","first-page":"3261","article-title":"Tabu search*","author":"Glover","year":"2013"},{"key":"10.1016\/j.engappai.2026.114769_b17","doi-asserted-by":"crossref","unstructured":"Hiley, A., Julstrom, B.A., 2006. The quadratic multiple knapsack problem and three heuristic approaches to it. In: Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation. pp. 547\u2013552.","DOI":"10.1145\/1143997.1144096"},{"key":"10.1016\/j.engappai.2026.114769_b18","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2023.106508","article-title":"Container stacking optimization based on deep reinforcement learning","volume":"123","author":"Jin","year":"2023","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.engappai.2026.114769_b19","article-title":"Learning combinatorial optimization algorithms over graphs","volume":"vol. 30","author":"Khalil","year":"2017"},{"key":"10.1016\/j.engappai.2026.114769_b20","first-page":"9839","article-title":"Reinforcement learning for solving the vehicle routing problem","volume":"vol. 31","author":"Nazari","year":"2018"},{"issue":"2","key":"10.1016\/j.engappai.2026.114769_b21","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/j.ejor.2016.02.043","article-title":"An ejection chain approach for the quadratic multiple knapsack problem","volume":"253","author":"Peng","year":"2016","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.engappai.2026.114769_b22","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.cor.2015.08.002","article-title":"Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem","volume":"66","author":"Qin","year":"2016","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.engappai.2026.114769_b23","series-title":"Advances in Brain, Vision, and Artificial Intelligence: BVAI 2007","first-page":"490","article-title":"A genetic algorithm for the quadratic multiple knapsack problem","author":"Sara\u00e7","year":"2007"},{"key":"10.1016\/j.engappai.2026.114769_b24","series-title":"Evolutionary Computation in Combinatorial Optimization: EvoCOP 2007","first-page":"210","article-title":"A new grouping genetic algorithm for the quadratic multiple knapsack problem","author":"Singh","year":"2007"},{"key":"10.1016\/j.engappai.2026.114769_b25","series-title":"Neural Information Processing, ICONIP 2010","first-page":"626","article-title":"A swarm intelligence approach to the quadratic multiple knapsack problem","author":"Sundar","year":"2010"},{"issue":"19","key":"10.1016\/j.engappai.2026.114769_b26","doi-asserted-by":"crossref","first-page":"5867","DOI":"10.1080\/00207543.2020.1794075","article-title":"Adaptive scheduling for assembly job shop with uncertain assembly times based on dual Q-learning","volume":"59","author":"Wang","year":"2021","journal-title":"Int. J. Prod. Res."},{"issue":"1","key":"10.1016\/j.engappai.2026.114769_b27","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1287\/mnsc.46.1.148.15134","article-title":"Three scheduling algorithms applied to the earth observing systems domain","volume":"46","author":"Wolfe","year":"2000","journal-title":"Manag. Sci."},{"key":"10.1016\/j.engappai.2026.114769_b28","article-title":"A co-evolution algorithm with dueling reinforcement learning mechanism for the energy-aware distributed heterogeneous flexible flow-shop scheduling problem","author":"Zhao","year":"2024","journal-title":"IEEE Trans. Syst. Man Cybern.: Syst."}],"container-title":["Engineering Applications of Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0952197626010511?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0952197626010511?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T20:24:06Z","timestamp":1778099046000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0952197626010511"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":28,"alternative-id":["S0952197626010511"],"URL":"https:\/\/doi.org\/10.1016\/j.engappai.2026.114769","relation":{},"ISSN":["0952-1976"],"issn-type":[{"value":"0952-1976","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A doubly reinforced local search for solving the Quadratic Multiple Knapsack Problem","name":"articletitle","label":"Article Title"},{"value":"Engineering Applications of Artificial Intelligence","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.engappai.2026.114769","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"114769"}}