{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,31]],"date-time":"2026-07-31T15:11:54Z","timestamp":1785510714600,"version":"3.56.0"},"reference-count":28,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers &amp; Industrial Engineering"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.cie.2026.112197","type":"journal-article","created":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T16:38:30Z","timestamp":1781541510000},"page":"112197","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A controlled operator-level study of perturbation mechanisms for the Set-Union Knapsack Problem"],"prefix":"10.1016","volume":"219","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3126-8352","authenticated-orcid":false,"given":"Jose","family":"Garcia","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-8082-0423","authenticated-orcid":false,"given":"Ivo","family":"Cattarinich","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-8935-7595","authenticated-orcid":false,"given":"Luis","family":"Rojas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.cie.2026.112197_b1","series-title":"Proceedings of the 2024 international conference on engineering & computing technologies","article-title":"Trajectory data mining and trip travel time prediction on specific roads","author":"Amin","year":"2024"},{"key":"10.1016\/j.cie.2026.112197_b2","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/j.dam.2013.12.015","article-title":"A note on the set union knapsack problem","volume":"169","author":"Arulselvan","year":"2014","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"10.1016\/j.cie.2026.112197_b3","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1166\/jmihi.2019.2654","article-title":"Optimization of neural network using improved bat algorithm for data classification","volume":"9","author":"Bangyal","year":"2019","journal-title":"Journal of Medical Imaging and Health Informatics"},{"key":"10.1016\/j.cie.2026.112197_b4","series-title":"Combinatorial optimization and applications","first-page":"25","article-title":"Variable neighborhood search with dynamic exploration for the set union knapsack problem","author":"Coelho","year":"2024"},{"issue":"1","key":"10.1016\/j.cie.2026.112197_b5","doi-asserted-by":"crossref","first-page":"17","DOI":"10.3390\/math7010017","article-title":"The importance of transfer function in solving set-union knapsack problem based on discrete moth search algorithm","volume":"7","author":"Feng","year":"2019","journal-title":"Mathematics"},{"key":"10.1016\/j.cie.2026.112197_b6","doi-asserted-by":"crossref","DOI":"10.1016\/j.neucom.2025.132135","article-title":"Recent advances in knapsack problem: A comprehensive review of models, algorithms, and applications","volume":"666","author":"Feng","year":"2026","journal-title":"Neurocomputing"},{"key":"10.1016\/j.cie.2026.112197_b7","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2025.107050","article-title":"A causal framework for stochastic local search optimization algorithms","volume":"180","author":"Franzin","year":"2025","journal-title":"Computers & Operations Research"},{"issue":"1","key":"10.1016\/j.cie.2026.112197_b8","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.ejor.2026.01.032","article-title":"Optimisation of bus timetables: An adaptive large neighbourhood search-based matheuristic with a novel operator weight","volume":"333","author":"Gaborit","year":"2026","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"10.1016\/j.cie.2026.112197_b9","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1002\/1520-6750(199410)41:6<833::AID-NAV3220410611>3.0.CO;2-Q","article-title":"Note: On the set-union knapsack problem","volume":"41","author":"Goldschmidt","year":"1994","journal-title":"Naval Research Logistics"},{"key":"10.1016\/j.cie.2026.112197_b10","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2025.107255","article-title":"Learning-guided iterated local search for the minmax multiple traveling salesman problem","volume":"185","author":"He","year":"2026","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.cie.2026.112197_b11","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2018.07.045","article-title":"Group theory-based optimization algorithm for solving knapsack problems","volume":"219","author":"He","year":"2021","journal-title":"Knowledge-Based Systems"},{"key":"10.1016\/j.cie.2026.112197_b12","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.future.2017.05.044","article-title":"A novel binary artificial bee colony algorithm for the set-union knapsack problem","volume":"78","author":"He","year":"2018","journal-title":"Future Generation Computer Systems"},{"key":"10.1016\/j.cie.2026.112197_b13","series-title":"Proceedings of the 2023 international conference on human-centered cognitive systems","first-page":"1","article-title":"An android application for unwanted vehicle detection and counting","author":"Khalid","year":"2023"},{"key":"10.1016\/j.cie.2026.112197_b14","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/j.eswa.2019.06.007","article-title":"A hybrid binary particle swarm optimization with tabu search for the set-union knapsack problem","volume":"135","author":"Lin","year":"2019","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.cie.2026.112197_b15","series-title":"Computer graphics forum","first-page":"2304","article-title":"A key-pose caching system for rendering an animated crowd in real-time","volume":"vol. 29","author":"Lister","year":"2010"},{"key":"10.1016\/j.cie.2026.112197_b16","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s11750-025-00699-x","article-title":"Iterated local search, iterated greedy and applications","volume":"33","author":"Ramalhinho","year":"2025","journal-title":"TOP"},{"key":"10.1016\/j.cie.2026.112197_b17","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2024.112095","article-title":"CUDA-based parallel local search for the set-union knapsack problem","volume":"299","author":"Sonu\u00e7","year":"2024","journal-title":"Knowledge-Based Systems"},{"issue":"2","key":"10.1016\/j.cie.2026.112197_b18","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/j.ejor.2025.08.002","article-title":"A hybrid population-based ruin-and-recreate algorithm for the blocking flow shop scheduling problem","volume":"329","author":"Teixeira","year":"2026","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cie.2026.112197_b19","series-title":"2016 IEEE\/CIC international conference on communications in China","first-page":"1","article-title":"System resilience enhancement through modularization for large scale cyber systems","author":"Tu","year":"2016"},{"key":"10.1016\/j.cie.2026.112197_b20","doi-asserted-by":"crossref","first-page":"3241","DOI":"10.1007\/s00500-025-10631-x","article-title":"Adaptive iterated local search algorithm for dynamic patient admission scheduling problems","volume":"29","author":"Turky","year":"2025","journal-title":"Soft Computing"},{"key":"10.1016\/j.cie.2026.112197_b21","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1016\/j.future.2019.07.062","article-title":"Iterated two-phase local search for the set-union knapsack problem","volume":"101","author":"Wei","year":"2019","journal-title":"Future Generation Computer Systems"},{"key":"10.1016\/j.cie.2026.112197_b22","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2020.113802","article-title":"Kernel based tabu search for the set-union knapsack problem","volume":"165","author":"Wei","year":"2021","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.cie.2026.112197_b23","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2021.107260","article-title":"Multistart solution-based tabu search for the set-union knapsack problem","volume":"105","author":"Wei","year":"2021","journal-title":"Applied Soft Computing"},{"key":"10.1016\/j.cie.2026.112197_b24","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2026.102289","article-title":"Adaptive neighborhood reduction-based memetic algorithm for the set-union knapsack problem","volume":"101","author":"Wei","year":"2026","journal-title":"Swarm and Evolutionary Computation"},{"issue":"3","key":"10.1016\/j.cie.2026.112197_b25","doi-asserted-by":"crossref","first-page":"1883","DOI":"10.1007\/s00500-019-04021-3","article-title":"Solving the set-union knapsack problem by a novel hybrid Jaya algorithm","volume":"24","author":"Wu","year":"2020","journal-title":"Soft Computing"},{"key":"10.1016\/j.cie.2026.112197_b26","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2025.114426","article-title":"Memory-based iterated local search with multiple perturbation operators for personalized learning path planning","volume":"188","author":"Xu","year":"2026","journal-title":"Applied Soft Computing"},{"issue":"3","key":"10.1016\/j.cie.2026.112197_b27","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1016\/j.ejor.2016.01.042","article-title":"An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters","volume":"252","author":"Yang","year":"2016","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cie.2026.112197_b28","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2024.120855","article-title":"An adaptive evolutionary search-based method for efficiently tackling the set-union knapsack problem","volume":"676","author":"Zhao","year":"2024","journal-title":"Information Sciences"}],"container-title":["Computers &amp; Industrial Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0360835226003980?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0360835226003980?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,31]],"date-time":"2026-07-31T14:40:46Z","timestamp":1785508846000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0360835226003980"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":28,"alternative-id":["S0360835226003980"],"URL":"https:\/\/doi.org\/10.1016\/j.cie.2026.112197","relation":{},"ISSN":["0360-8352"],"issn-type":[{"value":"0360-8352","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A controlled operator-level study of perturbation mechanisms for the Set-Union Knapsack Problem","name":"articletitle","label":"Article Title"},{"value":"Computers & Industrial Engineering","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cie.2026.112197","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":"112197"}}