Column-generation for a two-dimensional multi-criteria bin-packing problem
By: Christof Groschke, Steffen Goebbels, Jochen Rethmann
Potential Business Impact:
Makes circuit boards with fewer wasted spaces.
In this study, we examine a two-dimensional bin-packing problem in printed circuit board manufacturing. Among other objectives, the number of bins, but also the number of different bin layouts, is to be minimized. As the running times of an earlier MIP presentation are only acceptable for small problem instances, we will now discuss a branch-and-price approach by using an adapted Ryan-Foster-branching. The pricing problem computes the layouts, separating the time-consuming constraints from the master problem.
Similar Papers
On the 2D Demand Bin Packing Problem: Hardness and Approximation Algorithms
Data Structures and Algorithms
Organizes computer jobs to use less space.
Green Bin Packing
Data Structures and Algorithms
Saves energy by packing computer servers smarter.
A Branch-and-Cut Algorithm for the Optimal Design of Parking Lots with One-way and Two-way Lanes
Optimization and Control
Fits more cars into parking lots.