An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry
From MaRDI portal
Publication:6551075
DOI10.1016/j.cor.2023.106476MaRDI QIDQ6551075
Songhuan Wu, Lijun Wei, Qiang Liu, Hao Zhang, Chao Tang, Shao-Wen Yao
Publication date: 6 June 2024
Published in: Computers \& Operations Research (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Robust mixed-integer linear programming models for the irregular strip packing problem
- An effective heuristic for the two-dimensional irregular bin packing problem
- Algorithms for nesting with defects
- Generalized hyper-heuristics for solving 2D regular and irregular packing problems
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
- An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
- The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
- Exact Minkowski sums of polygons with holes
- A clique covering MIP model for the irregular strip packing problem
- Efficient local search heuristics for packing irregular shapes in two-dimensional heterogeneous bins
- Matheuristics for the irregular bin packing problem with free rotations
- Packing of concave polyhedra with continuous rotations using nonlinear optimisation
- A beam search approach to solve the convex irregular bin packing problem with guillotine guts
- Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations
- Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem
- A 2-exchange heuristic for nesting problems
- A variable neighborhood search algorithm for the leather nesting problem
- Irregular packing problems: a review of mathematical models
- Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
- A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
- The geometry of nesting problems: a tutorial
- An improved typology of cutting and packing problems
- An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations
- A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
- Two-Dimensional Finite Bin-Packing Algorithms
- A SCANLINE-BASED ALGORITHM FOR THE 2D FREE-FORM BIN PACKING PROBLEM
- An extended model formulation for the two-dimensional irregular strip packing problem considering general industry-relevant aspects
This page was built for publication: An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry