Enhanced Formulation for Guillotine 2D Cutting Problems

11/11/2021
by   Henrique Becker, et al.
0

We advance the state of the art in Mixed-Integer Linear Programming (MILP) formulations for Guillotine 2D Cutting Problems by (i) adapting a previously known reduction to our preprocessing phase and by (ii) enhancing a previous formulation by cutting down its size and symmetries. Our focus is the Guillotine 2D Knapsack Problem with orthogonal and unrestricted cuts, constrained demand, unlimited stages, and no rotation – however, the formulation may be adapted to many related problems. The code is available. Concerning the set of 59 instances used to benchmark the original formulation, and summing the statistics for all models generated, the enhanced formulation has only a small fraction of the variables and constraints of the original model (respectively, 3.07 about 4 hours to solve all instances while the original formulation takes 12 hours to solve 53 of them (the other six runs hit a three-hour time limit each). We integrate, to both formulations, a pricing framework proposed for the original formulation; the enhanced formulation keeps a significant advantage in this situation. Finally, in a recently proposed set of 80 harder instances, the enhanced formulation (with and without the pricing framework) found: 22 optimal solutions for the unrestricted problem (5 already known, 17 new); 22 optimal solutions for the restricted problem (all are new and they are not the same 22 of the optimal unrestricted solutions); better lower bounds for 25 instances; better upper bounds for 58 instances.

READ FULL TEXT
research
08/09/2023

Comparative analysis of mathematical formulations for the two-dimensional guillotine cutting problem

About ten years ago, a paper proposed the first integer linear programmi...
research
09/06/2019

Strong Bounds for Resource Constrained Project Scheduling: Preprocessing and Cutting Planes

Resource Constrained Project Scheduling Problems (RCPSPs) without preemp...
research
01/19/2022

Educational Timetabling: Problems, Benchmarks, and State-of-the-Art Results

We propose a survey of the research contributions on the field of Educat...
research
08/31/2023

Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack

Standard mixed-integer programming formulations for the stable set probl...
research
11/06/2019

An improved binary programming formulation for the secure domination problem

The secure domination problem, a variation of the domination problem wit...
research
02/23/2020

Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection

This paper considers the multi-item inventory lot-sizing problem with su...
research
06/20/2019

Service Network Design Problem with Capacity-Demand Balancing

This paper addresses developing cost-effective strategies to respond to ...

Please sign up or login with your details

Forgot password? Click here to reset