.png){kind=icon}
.png){kind=icon}
Return
Instance space analysis for 2D bin packing mathematical models
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2023.12.008.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we apply Instance Space Analysis (ISA) to study the two-dimensional bin-packing problem. We consider classical and newly-generated instances to test the performance of four mixed-integer programming (MIP) models from the literature. This is the first time ISA is used to compare MIP models. We set as a performance metric the time taken by the black -box MIP solver CPLEX to obtain a proven optimal solution when running each model. Our results provide a new perspective on the different models' performance according to each instance's features.
Keywords:
Packing
Instance space analysis
Instance generation
Performance evaluation
Mixed integer programming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W