{"id":"https://openalex.org/W7133299318","doi":"https://doi.org/10.48550/arxiv.2603.00484","title":"MergeDJD: A Fast Constructive Algorithm with Piece Merging for the Two-Dimensional Irregular Bin Packing Problem","display_name":"MergeDJD: A Fast Constructive Algorithm with Piece Merging for the Two-Dimensional Irregular Bin Packing Problem","publication_year":2026,"publication_date":"2026-02-28","ids":{"openalex":"https://openalex.org/W7133299318","doi":"https://doi.org/10.48550/arxiv.2603.00484"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.00484","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.00484","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.00484","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5128033274","display_name":"Yi Zhou (2723)","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Zhou, Yi","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5127948459","display_name":"Haocheng Fu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fu, Haocheng","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126480796","display_name":"Yiping Liu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu, Yiping","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5127932954","display_name":"Jian Mao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mao, Jian","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091494821","display_name":"Zhang-Hua Fu","orcid":"https://orcid.org/0000-0002-3740-7408"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fu, Zhang-Hua","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5127864125","display_name":"Yuyi Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Yuyi","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5128033274"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9959999918937683,"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.9959999918937683,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0006000000284984708,"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"}},{"id":"https://openalex.org/T12971","display_name":"Material Properties and Processing","score":0.00019999999494757503,"subfield":{"id":"https://openalex.org/subfields/2211","display_name":"Mechanics of Materials"},"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/constructive","display_name":"Constructive","score":0.786899983882904},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7681999802589417},{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.7013999819755554},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6686000227928162},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5611000061035156},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4805000126361847},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.3935999870300293},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.38339999318122864}],"concepts":[{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.786899983882904},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7681999802589417},{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.7013999819755554},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6686000227928162},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6514000296592712},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5611000061035156},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5350000262260437},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4805000126361847},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46540001034736633},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4097000062465668},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.3935999870300293},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.38339999318122864},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.35760000348091125},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.314300000667572},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2775999903678894},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.275299996137619},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2727000117301941},{"id":"https://openalex.org/C774472","wikidata":"https://www.wikidata.org/wiki/Q6760393","display_name":"Margin (machine learning)","level":2,"score":0.26980000734329224},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.2655999958515167},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.26440000534057617},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.26030001044273376}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.00484","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.00484","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.00484","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.00484","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"two-dimensional":[1],"irregular":[2,14],"bin":[3,28],"packing":[4,222],"problem":[5],"(2DIBPP)":[6],"aims":[7],"to":[8,17,48,151,158],"pack":[9,159],"a":[10,104],"given":[11],"set":[12],"of":[13,69,124,142,201],"polygons,":[15],"referred":[16],"as":[18],"pieces,":[19],"into":[20,94,130,163],"fixed-size":[21],"rectangular":[22],"bins":[23],"without":[24],"overlap,":[25],"while":[26,181],"maximizing":[27],"utilization.":[29],"Although":[30],"numerous":[31],"metaheuristic":[32],"algorithms":[33],"have":[34,212],"been":[35],"proposed":[36,62,203],"for":[37,75,83,220],"the":[38,59,70,76,99,112,118,146,199,202,214],"2DIBPP,":[39],"many":[40,88],"industrial":[41],"applications":[42],"favor":[43],"simpler":[44],"constructive":[45,73,106],"heuristics":[46,74],"due":[47],"their":[49],"deterministic":[50],"behavior":[51],"and":[52,110,132,155,208,217],"low":[53],"computational":[54],"overhead.":[55],"Among":[56],"such":[57],"methods,":[58],"DJD":[60,79,113,177],"algorithm":[61,107],"by":[63,120],"L'opez-Camacho":[64],"et":[65],"al.":[66],"is":[67,80,149],"one":[68],"most":[71],"competitive":[72],"2DIBPP.":[77],"However,":[78],"less":[81],"effective":[82],"cutting":[84],"instances,":[85],"in":[86,144],"which":[87,145],"pieces":[89,125,162],"can":[90,127],"be":[91,128],"seamlessly":[92],"combined":[93,129,156],"larger":[95,131],"polygons.":[96],"To":[97,205],"address":[98],"issue,":[100],"we":[101,211],"propose":[102],"MergeDJD,":[103],"novel":[105],"that":[108,126,173],"integrates":[109],"extends":[111],"framework.":[114],"MergeDJD":[115,174,186],"first":[116],"preprocesses":[117],"instance":[119],"iteratively":[121],"identifying":[122],"groups":[123],"more":[133],"regular":[134],"piece.":[135],"It":[136],"then":[137],"employs":[138],"an":[139],"improved":[140],"version":[141],"DJD,":[143],"placement":[147],"strategy":[148],"enhanced":[150],"better":[152],"handle":[153],"non-convex":[154],"shapes,":[157],"all":[160],"resulting":[161],"bins.":[164],"Computational":[165],"experiments":[166],"on":[167,178,192],"1,089":[168],"well-known":[169],"benchmark":[170],"instances":[171,180],"show":[172],"consistently":[175],"outperforms":[176],"1,083":[179],"maintaining":[182],"short":[183],"runtimes.":[184],"Notably,":[185],"attains":[187],"new":[188],"best":[189],"known":[190],"values":[191],"515":[193],"instances.":[194],"Ablation":[195],"studies":[196],"further":[197],"confirm":[198],"effectiveness":[200],"components.":[204],"facilitate":[206],"reproducibility":[207],"future":[209],"research,":[210],"open-sourced":[213],"complete":[215],"implementation":[216],"provided":[218],"interfaces":[219],"visualizing":[221],"results.":[223]},"counts_by_year":[],"updated_date":"2026-03-04T07:09:34.246503","created_date":"2026-03-04T00:00:00"}