The 2-D Bin Packing Problem with Multiple Levels of Prioritization: A Spatial Optimization Perspective Article Swipe
YOU?
·
· 2025
· Open Access
·
· DOI: https://doi.org/10.31224/4647
This paper integrates two-dimensional bin packing with facility layout concepts to address scenarios in which items must not only fit within a confined space but also be arranged according to spatial priorities. We embed a prioritization matrix into the bin packing framework, enabling items to be clustered with one another or pulled toward certain bin access points based on assigned priority weights. Unlike traditional bin packing, which focuses on space utilization alone, our approach balances proximity to bin access points and adjacency among functionally related items, extending the utility of bin packing to applications requiring more nuanced layout preferences. We introduce a single mixed-integer linear programming (MILP) model and a complementary sliding window decomposition method that scales effectively to larger problem instances. Numerical experiments illustrate that this decomposition approach consistently outperforms a direct MILP solve with a commercial solver in both runtime and solution quality. This computational study underscores the flexibility and effectiveness of embedding multi-level priorities into bin packing.
Related Topics
- Type
- preprint
- Language
- en
- Landing Page
- https://doi.org/10.31224/4647
- https://engrxiv.org/preprint/download/4647/8039/6641
- OA Status
- gold
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4410626433
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4410626433Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.31224/4647Digital Object Identifier
- Title
-
The 2-D Bin Packing Problem with Multiple Levels of Prioritization: A Spatial Optimization PerspectiveWork title
- Type
-
preprintOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2025Year of publication
- Publication date
-
2025-05-23Full publication date if available
- Authors
-
William Kirschenman, H. Sebastian Heese, Michael G. Kay, Russell E. King, Brandon M. McConnellList of authors in order
- Landing page
-
https://doi.org/10.31224/4647Publisher landing page
- PDF URL
-
https://engrxiv.org/preprint/download/4647/8039/6641Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
goldOpen access status per OpenAlex
- OA URL
-
https://engrxiv.org/preprint/download/4647/8039/6641Direct OA link when available
- Concepts
-
Perspective (graphical), Prioritization, Bin, Bin packing problem, Mathematical optimization, Computer science, Mathematics, Operations research, Algorithm, Engineering, Artificial intelligence, Management scienceTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4410626433 |
|---|---|
| doi | https://doi.org/10.31224/4647 |
| ids.doi | https://doi.org/10.31224/4647 |
| ids.openalex | https://openalex.org/W4410626433 |
| fwci | 0.0 |
| type | preprint |
| title | The 2-D Bin Packing Problem with Multiple Levels of Prioritization: A Spatial Optimization Perspective |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T12176 |
| topics[0].field.id | https://openalex.org/fields/22 |
| topics[0].field.display_name | Engineering |
| topics[0].score | 0.9980999827384949 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/2209 |
| topics[0].subfield.display_name | Industrial and Manufacturing Engineering |
| topics[0].display_name | Optimization and Packing Problems |
| topics[1].id | https://openalex.org/T11814 |
| topics[1].field.id | https://openalex.org/fields/22 |
| topics[1].field.display_name | Engineering |
| topics[1].score | 0.9976999759674072 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/2209 |
| topics[1].subfield.display_name | Industrial and Manufacturing Engineering |
| topics[1].display_name | Advanced Manufacturing and Logistics Optimization |
| topics[2].id | https://openalex.org/T11159 |
| topics[2].field.id | https://openalex.org/fields/22 |
| topics[2].field.display_name | Engineering |
| topics[2].score | 0.9793000221252441 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/2209 |
| topics[2].subfield.display_name | Industrial and Manufacturing Engineering |
| topics[2].display_name | Manufacturing Process and Optimization |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C12713177 |
| concepts[0].level | 2 |
| concepts[0].score | 0.8039203882217407 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q1900281 |
| concepts[0].display_name | Perspective (graphical) |
| concepts[1].id | https://openalex.org/C2777615720 |
| concepts[1].level | 2 |
| concepts[1].score | 0.795546293258667 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q11888847 |
| concepts[1].display_name | Prioritization |
| concepts[2].id | https://openalex.org/C156273044 |
| concepts[2].level | 2 |
| concepts[2].score | 0.7621467113494873 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q4913766 |
| concepts[2].display_name | Bin |
| concepts[3].id | https://openalex.org/C87219788 |
| concepts[3].level | 3 |
| concepts[3].score | 0.6644003987312317 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q814581 |
| concepts[3].display_name | Bin packing problem |
| concepts[4].id | https://openalex.org/C126255220 |
| concepts[4].level | 1 |
| concepts[4].score | 0.4832063913345337 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[4].display_name | Mathematical optimization |
| concepts[5].id | https://openalex.org/C41008148 |
| concepts[5].level | 0 |
| concepts[5].score | 0.47049427032470703 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[5].display_name | Computer science |
| concepts[6].id | https://openalex.org/C33923547 |
| concepts[6].level | 0 |
| concepts[6].score | 0.36404556035995483 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[6].display_name | Mathematics |
| concepts[7].id | https://openalex.org/C42475967 |
| concepts[7].level | 1 |
| concepts[7].score | 0.32837504148483276 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q194292 |
| concepts[7].display_name | Operations research |
| concepts[8].id | https://openalex.org/C11413529 |
| concepts[8].level | 1 |
| concepts[8].score | 0.2962009906768799 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[8].display_name | Algorithm |
| concepts[9].id | https://openalex.org/C127413603 |
| concepts[9].level | 0 |
| concepts[9].score | 0.17949390411376953 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q11023 |
| concepts[9].display_name | Engineering |
| concepts[10].id | https://openalex.org/C154945302 |
| concepts[10].level | 1 |
| concepts[10].score | 0.17291676998138428 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q11660 |
| concepts[10].display_name | Artificial intelligence |
| concepts[11].id | https://openalex.org/C539667460 |
| concepts[11].level | 1 |
| concepts[11].score | 0.16489273309707642 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q2414942 |
| concepts[11].display_name | Management science |
| keywords[0].id | https://openalex.org/keywords/perspective |
| keywords[0].score | 0.8039203882217407 |
| keywords[0].display_name | Perspective (graphical) |
| keywords[1].id | https://openalex.org/keywords/prioritization |
| keywords[1].score | 0.795546293258667 |
| keywords[1].display_name | Prioritization |
| keywords[2].id | https://openalex.org/keywords/bin |
| keywords[2].score | 0.7621467113494873 |
| keywords[2].display_name | Bin |
| keywords[3].id | https://openalex.org/keywords/bin-packing-problem |
| keywords[3].score | 0.6644003987312317 |
| keywords[3].display_name | Bin packing problem |
| keywords[4].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[4].score | 0.4832063913345337 |
| keywords[4].display_name | Mathematical optimization |
| keywords[5].id | https://openalex.org/keywords/computer-science |
| keywords[5].score | 0.47049427032470703 |
| keywords[5].display_name | Computer science |
| keywords[6].id | https://openalex.org/keywords/mathematics |
| keywords[6].score | 0.36404556035995483 |
| keywords[6].display_name | Mathematics |
| keywords[7].id | https://openalex.org/keywords/operations-research |
| keywords[7].score | 0.32837504148483276 |
| keywords[7].display_name | Operations research |
| keywords[8].id | https://openalex.org/keywords/algorithm |
| keywords[8].score | 0.2962009906768799 |
| keywords[8].display_name | Algorithm |
| keywords[9].id | https://openalex.org/keywords/engineering |
| keywords[9].score | 0.17949390411376953 |
| keywords[9].display_name | Engineering |
| keywords[10].id | https://openalex.org/keywords/artificial-intelligence |
| keywords[10].score | 0.17291676998138428 |
| keywords[10].display_name | Artificial intelligence |
| keywords[11].id | https://openalex.org/keywords/management-science |
| keywords[11].score | 0.16489273309707642 |
| keywords[11].display_name | Management science |
| language | en |
| locations[0].id | doi:10.31224/4647 |
| locations[0].is_oa | True |
| locations[0].source | |
| locations[0].license | cc-by |
| locations[0].pdf_url | https://engrxiv.org/preprint/download/4647/8039/6641 |
| locations[0].version | acceptedVersion |
| locations[0].raw_type | posted-content |
| locations[0].license_id | https://openalex.org/licenses/cc-by |
| locations[0].is_accepted | True |
| locations[0].is_published | False |
| locations[0].raw_source_name | |
| locations[0].landing_page_url | https://doi.org/10.31224/4647 |
| indexed_in | crossref |
| authorships[0].author.id | https://openalex.org/A5117645962 |
| authorships[0].author.orcid | https://orcid.org/0009-0000-5514-7737 |
| authorships[0].author.display_name | William Kirschenman |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | William Kirschenman |
| authorships[0].is_corresponding | False |
| authorships[1].author.id | https://openalex.org/A5008266777 |
| authorships[1].author.orcid | https://orcid.org/0000-0002-4897-9655 |
| authorships[1].author.display_name | H. Sebastian Heese |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Hans Sebastian Heese |
| authorships[1].is_corresponding | False |
| authorships[2].author.id | https://openalex.org/A5032943079 |
| authorships[2].author.orcid | https://orcid.org/0000-0002-1359-8270 |
| authorships[2].author.display_name | Michael G. Kay |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Michael Kay |
| authorships[2].is_corresponding | False |
| authorships[3].author.id | https://openalex.org/A5030218873 |
| authorships[3].author.orcid | https://orcid.org/0000-0003-4576-6600 |
| authorships[3].author.display_name | Russell E. King |
| authorships[3].author_position | middle |
| authorships[3].raw_author_name | Russell King |
| authorships[3].is_corresponding | False |
| authorships[4].author.id | https://openalex.org/A5083913075 |
| authorships[4].author.orcid | https://orcid.org/0000-0003-0091-215X |
| authorships[4].author.display_name | Brandon M. McConnell |
| authorships[4].author_position | last |
| authorships[4].raw_author_name | Brandon McConnell |
| authorships[4].is_corresponding | False |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://engrxiv.org/preprint/download/4647/8039/6641 |
| open_access.oa_status | gold |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | The 2-D Bin Packing Problem with Multiple Levels of Prioritization: A Spatial Optimization Perspective |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T12176 |
| primary_topic.field.id | https://openalex.org/fields/22 |
| primary_topic.field.display_name | Engineering |
| primary_topic.score | 0.9980999827384949 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/2209 |
| primary_topic.subfield.display_name | Industrial and Manufacturing Engineering |
| primary_topic.display_name | Optimization and Packing Problems |
| related_works | https://openalex.org/W2797538013, https://openalex.org/W2026961896, https://openalex.org/W173368591, https://openalex.org/W2034272113, https://openalex.org/W2138242427, https://openalex.org/W2104955674, https://openalex.org/W4288260564, https://openalex.org/W2068892231, https://openalex.org/W2096053066, https://openalex.org/W2001915926 |
| cited_by_count | 0 |
| locations_count | 1 |
| best_oa_location.id | doi:10.31224/4647 |
| best_oa_location.is_oa | True |
| best_oa_location.source | |
| best_oa_location.license | cc-by |
| best_oa_location.pdf_url | https://engrxiv.org/preprint/download/4647/8039/6641 |
| best_oa_location.version | acceptedVersion |
| best_oa_location.raw_type | posted-content |
| best_oa_location.license_id | https://openalex.org/licenses/cc-by |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | |
| best_oa_location.landing_page_url | https://doi.org/10.31224/4647 |
| primary_location.id | doi:10.31224/4647 |
| primary_location.is_oa | True |
| primary_location.source | |
| primary_location.license | cc-by |
| primary_location.pdf_url | https://engrxiv.org/preprint/download/4647/8039/6641 |
| primary_location.version | acceptedVersion |
| primary_location.raw_type | posted-content |
| primary_location.license_id | https://openalex.org/licenses/cc-by |
| primary_location.is_accepted | True |
| primary_location.is_published | False |
| primary_location.raw_source_name | |
| primary_location.landing_page_url | https://doi.org/10.31224/4647 |
| publication_date | 2025-05-23 |
| publication_year | 2025 |
| referenced_works_count | 0 |
| abstract_inverted_index.a | 21, 34, 101, 109, 131, 136 |
| abstract_inverted_index.We | 32, 99 |
| abstract_inverted_index.be | 26, 45 |
| abstract_inverted_index.in | 13, 139 |
| abstract_inverted_index.of | 89, 153 |
| abstract_inverted_index.on | 58, 68 |
| abstract_inverted_index.or | 50 |
| abstract_inverted_index.to | 10, 29, 44, 76, 92, 118 |
| abstract_inverted_index.and | 80, 108, 142, 151 |
| abstract_inverted_index.bin | 4, 39, 54, 64, 77, 90, 158 |
| abstract_inverted_index.but | 24 |
| abstract_inverted_index.fit | 19 |
| abstract_inverted_index.not | 17 |
| abstract_inverted_index.one | 48 |
| abstract_inverted_index.our | 72 |
| abstract_inverted_index.the | 38, 87, 149 |
| abstract_inverted_index.MILP | 133 |
| abstract_inverted_index.This | 0, 145 |
| abstract_inverted_index.also | 25 |
| abstract_inverted_index.both | 140 |
| abstract_inverted_index.into | 37, 157 |
| abstract_inverted_index.more | 95 |
| abstract_inverted_index.must | 16 |
| abstract_inverted_index.only | 18 |
| abstract_inverted_index.that | 115, 125 |
| abstract_inverted_index.this | 126 |
| abstract_inverted_index.with | 6, 47, 135 |
| abstract_inverted_index.among | 82 |
| abstract_inverted_index.based | 57 |
| abstract_inverted_index.embed | 33 |
| abstract_inverted_index.items | 15, 43 |
| abstract_inverted_index.model | 107 |
| abstract_inverted_index.paper | 1 |
| abstract_inverted_index.solve | 134 |
| abstract_inverted_index.space | 23, 69 |
| abstract_inverted_index.study | 147 |
| abstract_inverted_index.which | 14, 66 |
| abstract_inverted_index.(MILP) | 106 |
| abstract_inverted_index.Unlike | 62 |
| abstract_inverted_index.access | 55, 78 |
| abstract_inverted_index.alone, | 71 |
| abstract_inverted_index.direct | 132 |
| abstract_inverted_index.items, | 85 |
| abstract_inverted_index.larger | 119 |
| abstract_inverted_index.layout | 8, 97 |
| abstract_inverted_index.linear | 104 |
| abstract_inverted_index.matrix | 36 |
| abstract_inverted_index.method | 114 |
| abstract_inverted_index.points | 56, 79 |
| abstract_inverted_index.pulled | 51 |
| abstract_inverted_index.scales | 116 |
| abstract_inverted_index.single | 102 |
| abstract_inverted_index.solver | 138 |
| abstract_inverted_index.toward | 52 |
| abstract_inverted_index.window | 112 |
| abstract_inverted_index.within | 20 |
| abstract_inverted_index.address | 11 |
| abstract_inverted_index.another | 49 |
| abstract_inverted_index.certain | 53 |
| abstract_inverted_index.focuses | 67 |
| abstract_inverted_index.nuanced | 96 |
| abstract_inverted_index.packing | 5, 40, 91 |
| abstract_inverted_index.problem | 120 |
| abstract_inverted_index.related | 84 |
| abstract_inverted_index.runtime | 141 |
| abstract_inverted_index.sliding | 111 |
| abstract_inverted_index.spatial | 30 |
| abstract_inverted_index.utility | 88 |
| abstract_inverted_index.approach | 73, 128 |
| abstract_inverted_index.arranged | 27 |
| abstract_inverted_index.assigned | 59 |
| abstract_inverted_index.balances | 74 |
| abstract_inverted_index.concepts | 9 |
| abstract_inverted_index.confined | 22 |
| abstract_inverted_index.enabling | 42 |
| abstract_inverted_index.facility | 7 |
| abstract_inverted_index.packing, | 65 |
| abstract_inverted_index.packing. | 159 |
| abstract_inverted_index.priority | 60 |
| abstract_inverted_index.quality. | 144 |
| abstract_inverted_index.solution | 143 |
| abstract_inverted_index.weights. | 61 |
| abstract_inverted_index.Numerical | 122 |
| abstract_inverted_index.according | 28 |
| abstract_inverted_index.adjacency | 81 |
| abstract_inverted_index.clustered | 46 |
| abstract_inverted_index.embedding | 154 |
| abstract_inverted_index.extending | 86 |
| abstract_inverted_index.introduce | 100 |
| abstract_inverted_index.proximity | 75 |
| abstract_inverted_index.requiring | 94 |
| abstract_inverted_index.scenarios | 12 |
| abstract_inverted_index.commercial | 137 |
| abstract_inverted_index.framework, | 41 |
| abstract_inverted_index.illustrate | 124 |
| abstract_inverted_index.instances. | 121 |
| abstract_inverted_index.integrates | 2 |
| abstract_inverted_index.priorities | 156 |
| abstract_inverted_index.effectively | 117 |
| abstract_inverted_index.experiments | 123 |
| abstract_inverted_index.flexibility | 150 |
| abstract_inverted_index.multi-level | 155 |
| abstract_inverted_index.outperforms | 130 |
| abstract_inverted_index.priorities. | 31 |
| abstract_inverted_index.programming | 105 |
| abstract_inverted_index.traditional | 63 |
| abstract_inverted_index.underscores | 148 |
| abstract_inverted_index.utilization | 70 |
| abstract_inverted_index.applications | 93 |
| abstract_inverted_index.consistently | 129 |
| abstract_inverted_index.functionally | 83 |
| abstract_inverted_index.preferences. | 98 |
| abstract_inverted_index.complementary | 110 |
| abstract_inverted_index.computational | 146 |
| abstract_inverted_index.decomposition | 113, 127 |
| abstract_inverted_index.effectiveness | 152 |
| abstract_inverted_index.mixed-integer | 103 |
| abstract_inverted_index.prioritization | 35 |
| abstract_inverted_index.two-dimensional | 3 |
| cited_by_percentile_year | |
| countries_distinct_count | 0 |
| institutions_distinct_count | 5 |
| citation_normalized_percentile.value | 0.24742942 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |