{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T12:02:59Z","timestamp":1776686579939,"version":"3.51.2"},"reference-count":28,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T00:00:00Z","timestamp":1774310400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100003593","name":"National Council for Scientific and Technological Development","doi-asserted-by":"publisher","award":["305557\/2024-68"],"award-info":[{"award-number":["305557\/2024-68"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002322","name":"Coordination for the improvement of Higher Education Personnel","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"State of Sao Paulo Research Foundation","doi-asserted-by":"publisher","award":["2022\/05803-3"],"award-info":[{"award-number":["2022\/05803-3"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"State of Sao Paulo Research Foundation","doi-asserted-by":"publisher","award":["2025\/00386-3"],"award-info":[{"award-number":["2025\/00386-3"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"State of Sao Paulo Research Foundation","doi-asserted-by":"publisher","award":["2024\/08848-3"],"award-info":[{"award-number":["2024\/08848-3"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.cor.2026.107482","type":"journal-article","created":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T23:48:31Z","timestamp":1774396111000},"page":"107482","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Random-key optimizer and linearization for the quadratic multiple constraints variable-sized bin packing problem"],"prefix":"10.1016","volume":"192","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-8111-1203","authenticated-orcid":false,"given":"Natalia Alves","family":"Santos","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1638-661X","authenticated-orcid":false,"given":"Marlon","family":"Jeske","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5767-6798","authenticated-orcid":false,"given":"Ant\u00f4nio Augusto","family":"Chaves","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.cor.2026.107482_b1","series-title":"Proc. Genet. Evol. Comput. Conf.","first-page":"1463","article-title":"A differential pheromone grouping ant colony optimization algorithm for the 1-D bin packing problem","author":"Ali","year":"2024"},{"key":"10.1016\/j.cor.2026.107482_b2","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2025.111293","article-title":"Open-end bin packing problem with conflicts","volume":"208","author":"Bal\u0131k","year":"2025","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"10.1016\/j.cor.2026.107482_b3","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","article-title":"Genetic algorithms and random keys for sequencing and optimization","volume":"6","author":"Bean","year":"1994","journal-title":"ORSA J. Comput."},{"issue":"4","key":"10.1016\/j.cor.2026.107482_b4","doi-asserted-by":"crossref","DOI":"10.1007\/s10732-025-09568-z","article-title":"A random-Key optimizer for combinatorial optimization","volume":"31","author":"Chaves","year":"2025","journal-title":"J. Heuristics"},{"issue":"6","key":"10.1016\/j.cor.2026.107482_b5","doi-asserted-by":"crossref","first-page":"855","DOI":"10.23952\/jnva.8.2024.6.03","article-title":"A random-key GRASP for combinatorial optimization","volume":"8","author":"Chaves","year":"2024","journal-title":"J. Nonlinear Var. Anal."},{"key":"10.1016\/j.cor.2026.107482_b6","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.105113","article-title":"Bin packing problem with conflicts and item fragmentation","volume":"126","author":"Ekici","year":"2021","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107482_b7","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2021.107844","article-title":"Variable-sized bin packing problem with conflicts and item fragmentation","volume":"163","author":"Ekici","year":"2022","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"10.1016\/j.cor.2026.107482_b8","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1016\/j.ejor.2022.12.042","article-title":"A large neighborhood search algorithm and lower bounds for the variable-Sized bin packing problem with conflicts","volume":"308","author":"Ekici","year":"2023","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107482_b9","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2019.105565","article-title":"A modified squirrel search algorithm based on improved best fit heuristic and operator strategy for bin packing problem","volume":"82","author":"El-Ashmawi","year":"2019","journal-title":"Appl. Soft Comput."},{"issue":"2","key":"10.1016\/j.cor.2026.107482_b10","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/j.disopt.2010.11.001","article-title":"Online variable-sized bin packing with conflicts","volume":"8","author":"Epstein","year":"2011","journal-title":"Discrete Optim."},{"issue":"1","key":"10.1016\/j.cor.2026.107482_b11","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.ejor.2022.02.014","article-title":"A MILP model and two heuristics for the bin packing problem with conflicts and item fragmentation","volume":"303","author":"Fleszar","year":"2022","journal-title":"European J. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107482_b12","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/S0305-0548(02)00195-8","article-title":"Heuristics and lower bounds for the bin packing problem with conflicts","volume":"31","author":"Gendreau","year":"2004","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107482_b13","series-title":"Gurobi Optimizer Reference Manual","author":"Gurobi Optimization, LLC","year":"2024"},{"issue":"10","key":"10.1016\/j.cor.2026.107482_b14","doi-asserted-by":"crossref","first-page":"2877","DOI":"10.1016\/j.cor.2008.12.016","article-title":"Heuristics for the variable sized bin-packing problem","volume":"36","author":"Haouari","year":"2009","journal-title":"Comput. Oper. Res."},{"issue":"5","key":"10.1016\/j.cor.2026.107482_b15","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/j.cor.2011.07.003","article-title":"Variable neighbourhood search for the variable sized bin packing problem","volume":"39","author":"Hemmelmayr","year":"2012","journal-title":"Comput. Oper. Res."},{"issue":"9","key":"10.1016\/j.cor.2026.107482_b16","doi-asserted-by":"crossref","first-page":"2122","DOI":"10.1016\/j.cor.2011.10.021","article-title":"The min-conflict packing problem","volume":"39","author":"Khanafer","year":"2012","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107482_b17","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/j.cie.2018.08.021","article-title":"Cooperative parallel grouping genetic algorithm for the one-dimensional bin packing problem","volume":"125","author":"Kucukyilmaz","year":"2018","journal-title":"Comput. Ind. Eng."},{"issue":"7","key":"10.1016\/j.cor.2026.107482_b18","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1057\/palgrave.jors.2601771","article-title":"Ant colony optimization and local search for bin packing and cutting stock problems","volume":"55","author":"Levine","year":"2004","journal-title":"J. Oper. Res. Soc."},{"issue":"2","key":"10.1016\/j.cor.2026.107482_b19","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/j.ejor.2007.06.032","article-title":"On solving multiobjective bin packing problems using evolutionary particle swarm optimization","volume":"190","author":"Liu","year":"2008","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107482_b20","first-page":"43","article-title":"The irace package: Iterated racing for automatic algorithm configuration","volume":"3","author":"L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","journal-title":"Oper. Res. Perspect."},{"key":"10.1016\/j.cor.2026.107482_b21","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.105803","article-title":"Variable neighborhood search for quadratic multiple constraint variable sized bin-packing problem","volume":"143","author":"Meng","year":"2022","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107482_b22","first-page":"401","article-title":"Algorithms for the bin packing problem with conflicts","volume":"22","author":"Muritiba","year":"2010","journal-title":"J. Comput."},{"key":"10.1016\/j.cor.2026.107482_b23","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.eswa.2019.01.052","article-title":"A variable neighborhood search algorithm for the bin packing problem with compatible categories","volume":"124","author":"Santos","year":"2019","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2026.107482_b24","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevApplied.18.054045","article-title":"Optimization of robot-trajectory planning with nature-inspired and hybrid quantum algorithms","volume":"18","author":"Schuetz","year":"2022","journal-title":"Phys. Rev. Appl."},{"key":"10.1016\/j.cor.2026.107482_b25","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2025.107159","article-title":"Random-Key Optimizer with reinforcement learning for the Capacitated Multi-period Cutting Stock Problem with setup cost","volume":"183","author":"Silva","year":"2025","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107482_b26","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1016\/j.ejor.2006.06.046","article-title":"Ant colony optimization for continuous domains","volume":"185","author":"Socha","year":"2008","journal-title":"European J. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107482_b27","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/j.cie.2008.01.007","article-title":"Evolutionary based heuristic for bin packing problem","volume":"55","author":"Stawowy","year":"2008","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107482_b28","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2025.113368","article-title":"Random-key algorithms for optimizing integrated Operating Room Scheduling","volume":"180","author":"Vieira","year":"2025","journal-title":"Appl. Soft Comput."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826001000?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826001000?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T11:20:19Z","timestamp":1776684019000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054826001000"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":28,"alternative-id":["S0305054826001000"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2026.107482","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Random-key optimizer and linearization for the quadratic multiple constraints variable-sized bin packing problem","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2026.107482","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"107482"}}