{"id":"https://openalex.org/W4414569243","doi":"https://doi.org/10.1016/j.cor.2025.107276","title":"Solving the strip packing problem with a decomposition framework and a generic solver: Implementation, tuning, and reinforcement-learning-based hybridization","display_name":"Solving the strip packing problem with a decomposition framework and a generic solver: Implementation, tuning, and reinforcement-learning-based hybridization","publication_year":2025,"publication_date":"2025-09-27","ids":{"openalex":"https://openalex.org/W4414569243","doi":"https://doi.org/10.1016/j.cor.2025.107276"},"language":"en","primary_location":{"id":"doi:10.1016/j.cor.2025.107276","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.cor.2025.107276","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.2025.107276","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5107404801","display_name":"Fatih Burak Ak\u00e7ay","orcid":"https://orcid.org/0009-0008-2525-7108"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Fatih Burak Ak\u00e7ay","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0009-0008-2525-7108","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5041221592","display_name":"Maxence Delorme","orcid":"https://orcid.org/0000-0003-3730-0894"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Maxence Delorme","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-3730-0894","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5107404801"],"corresponding_institution_ids":[],"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.36036628,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"185","issue":null,"first_page":"107276","last_page":"107276"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998999834060669,"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.9998999834060669,"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/T11159","display_name":"Manufacturing Process and Optimization","score":0.993399977684021,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9883999824523926,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6917999982833862},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6244999766349792},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.6089000105857849},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5996999740600586},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.5784000158309937},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5041999816894531},{"id":"https://openalex.org/keywords/set-packing","display_name":"Set packing","score":0.44609999656677246},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.43779999017715454},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4228000044822693}],"concepts":[{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6917999982833862},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6488000154495239},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6244999766349792},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.6089000105857849},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5996999740600586},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.5784000158309937},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5041999816894531},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48989999294281006},{"id":"https://openalex.org/C134516590","wikidata":"https://www.wikidata.org/wiki/Q475603","display_name":"Set packing","level":3,"score":0.44609999656677246},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.43779999017715454},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4300000071525574},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4228000044822693},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4163999855518341},{"id":"https://openalex.org/C188198153","wikidata":"https://www.wikidata.org/wiki/Q1613840","display_name":"Limiting","level":2,"score":0.4099000096321106},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.3840999901294708},{"id":"https://openalex.org/C103646786","wikidata":"https://www.wikidata.org/wiki/Q5179260","display_name":"Covering problems","level":3,"score":0.376800000667572},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.3422999978065491},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.3409000039100647},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.3197999894618988},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.313400000333786},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.2939999997615814},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.28949999809265137},{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.2793999910354614},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.2687999904155731},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.26759999990463257},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.2639000117778778},{"id":"https://openalex.org/C204241405","wikidata":"https://www.wikidata.org/wiki/Q461499","display_name":"Transformation (genetics)","level":3,"score":0.25780001282691956}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/j.cor.2025.107276","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.cor.2025.107276","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"},{"id":"pmh:oai:tilburguniversity.edu:openaire/b9f8d382-db80-4775-a12a-0766fe749674","is_oa":true,"landing_page_url":"https://research.tilburguniversity.edu/en/publications/b9f8d382-db80-4775-a12a-0766fe749674","pdf_url":null,"source":{"id":"https://openalex.org/S4306401490","display_name":"Research portal (Tilburg University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I193700539","host_organization_name":"Tilburg University","host_organization_lineage":["https://openalex.org/I193700539"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Ak\u00e7ay, F B & Delorme, M 2026, 'Solving the strip packing problem with a decomposition framework and a generic solver: Implementation, tuning, and reinforcement-learning-based hybridization', Computers & Operations Research, vol. 185, 107276. https://doi.org/10.1016/j.cor.2025.107276","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1016/j.cor.2025.107276","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.cor.2025.107276","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W178407265","https://openalex.org/W1536304539","https://openalex.org/W1969218070","https://openalex.org/W1969327924","https://openalex.org/W1973019085","https://openalex.org/W1973264127","https://openalex.org/W1982886000","https://openalex.org/W1984445840","https://openalex.org/W1991548888","https://openalex.org/W2010808151","https://openalex.org/W2011690685","https://openalex.org/W2018182024","https://openalex.org/W2028761439","https://openalex.org/W2040366695","https://openalex.org/W2044121814","https://openalex.org/W2048230499","https://openalex.org/W2060747552","https://openalex.org/W2074821977","https://openalex.org/W2088086246","https://openalex.org/W2088674138","https://openalex.org/W2136790460","https://openalex.org/W2165033395","https://openalex.org/W2224382944","https://openalex.org/W2277512636","https://openalex.org/W2511290267","https://openalex.org/W2519499514","https://openalex.org/W2558364177","https://openalex.org/W2883766878","https://openalex.org/W2935888884","https://openalex.org/W3026181585","https://openalex.org/W3047863327","https://openalex.org/W3121105430","https://openalex.org/W3122681984","https://openalex.org/W3127398847","https://openalex.org/W3163152928","https://openalex.org/W4200072569","https://openalex.org/W4214717370","https://openalex.org/W4307726936","https://openalex.org/W4386319705","https://openalex.org/W4389580951","https://openalex.org/W4391829925","https://openalex.org/W4394577095","https://openalex.org/W4402700623","https://openalex.org/W4404459441","https://openalex.org/W4406236735"],"related_works":[],"abstract_inverted_index":{"In":[0],"the":[1,5,23,27,37,45,50,54,58,86,94,97,118,126,138,143,146,161,170,183,195,203,213,231,241],"strip":[2,17,55],"packing":[3,28,72],"problem,":[4],"objective":[6],"is":[7,29,152,206,217],"to":[8,120,141,229],"pack":[9],"a":[10,16,40,63,70,134,154,176,225],"set":[11,64],"of":[12,18,26,65,96,149,173,194,234],"two-dimensional":[13],"items":[14],"into":[15],"fixed":[19],"width":[20],"such":[21,116,158,180],"that":[22,153,197,240],"total":[24],"height":[25],"minimized.":[30],"The":[31],"current":[32],"state-of-the-art":[33,245],"exact":[34],"approach":[35,243],"for":[36,110],"problem":[38,47,205],"uses":[39],"decomposition":[41,77],"framework":[42,78,196],"in":[43,69,85,125],"which":[44],"main":[46,204],"(MP)":[48],"fixes":[49],"item":[51,66],"abscissas":[52],"and":[53,106,137,145,212,238],"height,":[56],"whereas":[57],"subproblem":[59],"(SP)":[60],"determines":[61],"whether":[62],"ordinates":[67],"resulting":[68,242],"feasible":[71],"exists.":[73],"Even":[74],"though":[75],"this":[76,101,111],"has":[79],"already":[80],"been":[81],"used":[82,140],"several":[83],"times":[84],"literature,":[87],"implementation":[88,156],"details":[89],"were":[90],"often":[91],"obfuscated,":[92],"limiting":[93],"outreach":[95],"approach.":[98],"We":[99,222],"address":[100],"issue":[102],"by":[103,129],"thoroughly":[104],"describing":[105],"testing":[107],"various":[108],"builds":[109],"framework,":[112],"investigating":[113],"important":[114],"features":[115],"as":[117,159,175,181],"way":[119],"forbid":[121],"an":[122],"infeasible":[123],"solution":[124],"MP":[127,144,166],"(e.g.,":[128],"rejecting":[130],"them":[131],"or":[132],"through":[133],"no-good":[135,184],"cut)":[136],"techniques":[139],"solve":[142],"SP.":[147],"One":[148],"our":[150,187],"findings":[151],"minor":[155],"tweak":[157],"changing":[160],"random":[162],"seed":[163],"between":[164],"two":[165,192,236],"iterations":[167],"can":[168],"bring":[169],"same":[171],"level":[172],"improvement":[174],"more":[177],"involved":[178],"feature":[179],"strengthening":[182],"cuts.":[185],"From":[186],"extensive":[188],"experiments,":[189],"we":[190],"identify":[191],"versions":[193],"produce":[198],"complementary":[199],"results:":[200],"one":[201],"where":[202,215],"solved":[207,218],"with":[208,219],"integer":[209],"linear":[210],"programming":[211],"other":[214],"it":[216],"constraint":[220],"programming.":[221],"then":[223],"train":[224],"reinforcement":[226],"learning":[227],"agent":[228],"find":[230],"best":[232],"hybridization":[233],"these":[235],"algorithms":[237],"show":[239],"obtains":[244],"results":[246],"on":[247],"benchmark":[248],"instances.":[249]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}