{"id":"https://openalex.org/W7140186594","doi":"https://doi.org/10.1016/j.cor.2026.107482","title":"Random-key optimizer and linearization for the quadratic multiple constraints variable-sized bin packing problem","display_name":"Random-key optimizer and linearization for the quadratic multiple constraints variable-sized bin packing problem","publication_year":2026,"publication_date":"2026-03-24","ids":{"openalex":"https://openalex.org/W7140186594","doi":"https://doi.org/10.1016/j.cor.2026.107482"},"language":"en","primary_location":{"id":"doi:10.1016/j.cor.2026.107482","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.cor.2026.107482","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/j.cor.2026.107482","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Natalia Alves Santos","orcid":"https://orcid.org/0009-0003-8111-1203"},"institutions":[{"id":"https://openalex.org/I88273585","display_name":"Universidade Federal de S\u00e3o Paulo","ror":"https://ror.org/02k5swt12","country_code":"BR","type":"education","lineage":["https://openalex.org/I88273585"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Natalia Alves Santos","raw_affiliation_strings":["Federal University of S\u00e3o Paulo, Av. Cesare Mansueto Giulio Lattes, 1201, S\u00e3o Jos\u00e9 dos Campos, 12247-014, SP, Brazil"],"affiliations":[{"raw_affiliation_string":"Federal University of S\u00e3o Paulo, Av. Cesare Mansueto Giulio Lattes, 1201, S\u00e3o Jos\u00e9 dos Campos, 12247-014, SP, Brazil","institution_ids":["https://openalex.org/I88273585"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Marlon Jeske","orcid":"https://orcid.org/0000-0002-1638-661X"},"institutions":[{"id":"https://openalex.org/I107428990","display_name":"Instituto Tecnol\u00f3gico de Aeron\u00e1utica","ror":"https://ror.org/05vh67662","country_code":"BR","type":"education","lineage":["https://openalex.org/I107428990"]},{"id":"https://openalex.org/I4210123805","display_name":"Instituto de Aeron\u00e1utica e Espa\u00e7o","ror":"https://ror.org/025n1fp68","country_code":"BR","type":"other","lineage":["https://openalex.org/I4210123805"]},{"id":"https://openalex.org/I88273585","display_name":"Universidade Federal de S\u00e3o Paulo","ror":"https://ror.org/02k5swt12","country_code":"BR","type":"education","lineage":["https://openalex.org/I88273585"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Marlon Jeske","raw_affiliation_strings":["Aeronautics Institute of Technology, Pra\u00e7a Marechal Eduardo Gomes, 50, S\u00e3o Jos\u00e9 dos Campos, 12228-900, SP, Brazil","Federal University of S\u00e3o Paulo, Av. Cesare Mansueto Giulio Lattes, 1201, S\u00e3o Jos\u00e9 dos Campos, 12247-014, SP, Brazil"],"affiliations":[{"raw_affiliation_string":"Aeronautics Institute of Technology, Pra\u00e7a Marechal Eduardo Gomes, 50, S\u00e3o Jos\u00e9 dos Campos, 12228-900, SP, Brazil","institution_ids":["https://openalex.org/I4210123805","https://openalex.org/I107428990"]},{"raw_affiliation_string":"Federal University of S\u00e3o Paulo, Av. Cesare Mansueto Giulio Lattes, 1201, S\u00e3o Jos\u00e9 dos Campos, 12247-014, SP, Brazil","institution_ids":["https://openalex.org/I88273585"]}]},{"author_position":"last","author":{"id":null,"display_name":"Ant\u00f4nio Augusto Chaves","orcid":"https://orcid.org/0000-0001-5767-6798"},"institutions":[{"id":"https://openalex.org/I88273585","display_name":"Universidade Federal de S\u00e3o Paulo","ror":"https://ror.org/02k5swt12","country_code":"BR","type":"education","lineage":["https://openalex.org/I88273585"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Ant\u00f4nio Augusto Chaves","raw_affiliation_strings":["Federal University of S\u00e3o Paulo, Av. Cesare Mansueto Giulio Lattes, 1201, S\u00e3o Jos\u00e9 dos Campos, 12247-014, SP, Brazil"],"affiliations":[{"raw_affiliation_string":"Federal University of S\u00e3o Paulo, Av. Cesare Mansueto Giulio Lattes, 1201, S\u00e3o Jos\u00e9 dos Campos, 12247-014, SP, Brazil","institution_ids":["https://openalex.org/I88273585"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I88273585"],"apc_list":{"value":3210,"currency":"USD","value_usd":3210},"apc_paid":{"value":3210,"currency":"USD","value_usd":3210},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.92071913,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":"192","issue":null,"first_page":"107482","last_page":"107482"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9785000085830688,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9785000085830688,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.00279999990016222,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0027000000700354576,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.704200029373169},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.6317999958992004},{"id":"https://openalex.org/keywords/linearization","display_name":"Linearization","score":0.6251999735832214},{"id":"https://openalex.org/keywords/quadratic-assignment-problem","display_name":"Quadratic assignment problem","score":0.5705000162124634},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5636000037193298},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.5347999930381775},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.499099999666214},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.48649999499320984}],"concepts":[{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.704200029373169},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.695900022983551},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.6317999958992004},{"id":"https://openalex.org/C11210021","wikidata":"https://www.wikidata.org/wiki/Q1520713","display_name":"Linearization","level":3,"score":0.6251999735832214},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.5705000162124634},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5636000037193298},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.5347999930381775},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5077999830245972},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.499099999666214},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.48649999499320984},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4648999869823456},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.453900009393692},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.41179999709129333},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40070000290870667},{"id":"https://openalex.org/C177179195","wikidata":"https://www.wikidata.org/wiki/Q7268372","display_name":"Quadratic unconstrained binary optimization","level":4,"score":0.37610000371932983},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.367900013923645},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.3416999876499176},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.33869999647140503},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.3336000144481659},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.30799999833106995},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29660001397132874},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.29420000314712524},{"id":"https://openalex.org/C166437778","wikidata":"https://www.wikidata.org/wiki/Q50695","display_name":"Quadratic function","level":3,"score":0.27129998803138733}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.cor.2026.107482","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.cor.2026.107482","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/j.cor.2026.107482","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.cor.2026.107482","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1975009952","https://openalex.org/W1976093834","https://openalex.org/W2002284890","https://openalex.org/W2021844871","https://openalex.org/W2032554570","https://openalex.org/W2044180942","https://openalex.org/W2083120958","https://openalex.org/W2083558280","https://openalex.org/W2109469182","https://openalex.org/W2168079536","https://openalex.org/W2888329226","https://openalex.org/W2914169547","https://openalex.org/W2950892016","https://openalex.org/W3091308197","https://openalex.org/W3217631781","https://openalex.org/W4211082341","https://openalex.org/W4220652621","https://openalex.org/W4309066270","https://openalex.org/W4313479085","https://openalex.org/W4403730653","https://openalex.org/W4411163025","https://openalex.org/W4411194220","https://openalex.org/W4412031566","https://openalex.org/W4414530031"],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"addresses":[2],"the":[3,19,45,60,75,92,114,124,139,159,174,177,202,209,217],"Quadratic":[4],"Multiple":[5],"Constraints":[6],"Variable-Sized":[7],"Bin":[8],"Packing":[9],"Problem":[10],"(QMC-VSBPP),":[11],"a":[12,49,85,186],"challenging":[13],"combinatorial":[14],"optimization":[15],"problem":[16,23],"that":[17,43,113],"generalizes":[18],"classical":[20],"bin":[21,30],"packing":[22,170],"by":[24],"incorporating":[25],"multiple":[26],"capacity":[27],"dimensions,":[28],"heterogeneous":[29],"types,":[31],"and":[32,102,157,163,181],"quadratic":[33,57,126,169,192],"interaction":[34],"costs":[35],"between":[36],"items.":[37],"We":[38],"propose":[39],"two":[40],"complementary":[41],"methods":[42],"advance":[44],"current":[46],"state-of-the-art.":[47],"First,":[48],"linearized":[50,116,188,203],"mathematical":[51],"model":[52,117,204],"is":[53],"introduced":[54],"to":[55,68],"eliminate":[56],"terms,":[58],"enabling":[59],"use":[61],"of":[62,161,201,213],"exact":[63,180,199],"solvers":[64],"such":[65],"as":[66],"Gurobi":[67],"compute":[69],"strong":[70],"lower":[71,121,196],"bounds\u2014reported":[72],"here":[73],"for":[74,78,145,154,166,176,216],"first":[76],"time":[77],"this":[79],"problem.":[80],"Second,":[81],"we":[82],"develop":[83],"RKO-ACO,":[84],"continuous-domain":[86],"Ant":[87],"Colony":[88],"Optimization":[89],"algorithm":[90],"within":[91],"Random-Key":[93,218],"Optimizer":[94],"framework,":[95],"enhanced":[96],"with":[97,179],"adaptive":[98],"Q-learning":[99],"parameter":[100],"control":[101],"efficient":[103],"local":[104],"search.":[105],"Extensive":[106],"computational":[107],"experiments":[108],"on":[109],"benchmark":[110],"instances":[111],"show":[112],"proposed":[115],"produces":[118],"significantly":[119],"tighter":[120],"bounds":[122,144,197],"than":[123],"original":[125],"model,":[127,189],"while":[128],"RKO-ACO":[129],"consistently":[130],"matches":[131],"or":[132],"improves":[133],"upon":[134],"all":[135],"best-known":[136],"solutions":[137,200],"in":[138],"literature,":[140],"establishing":[141],"new":[142,151,187],"upper":[143],"large-scale":[146],"instances.":[147],"These":[148],"results":[149],"provide":[150],"reference":[152],"values":[153],"future":[155],"studies":[156],"demonstrate":[158],"effectiveness":[160],"evolutionary":[162],"random-key":[164],"approaches":[165],"solving":[167],"complex":[168,191],"problems.":[171],"\u2022":[172,184,194,207],"Advances":[173],"state-of-the-art":[175],"QMC-VSBPP":[178],"metaheuristic":[182],"methods.":[183],"Proposes":[185],"eliminating":[190],"terms.":[193],"Introduces":[195],"via":[198],"using":[205],"Gurobi.":[206],"Develops":[208],"RKO-ACO:":[210],"an":[211],"adaptation":[212],"continuous":[214],"ACO":[215],"Optimizer.":[219]},"counts_by_year":[],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2026-03-25T00:00:00"}