A beam search approach to solve the convex irregular bin packing problem with guillotine guts
From MaRDI portal
Publication:1754728
DOI10.1016/j.ejor.2018.03.029zbMath1403.90562OpenAlexW2795195823WikidataQ59882120 ScholiaQ59882120MaRDI QIDQ1754728
Antonio Martínez-Sykora, Marta Cabo, Julia A. Bennell
Publication date: 31 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://eprints.soton.ac.uk/419798/1/BS_paper_EJORS.PDF.pdf
Computational aspects related to convexity (52B55) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (9)
An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations ⋮ Exact and approximate methods for the score-constrained packing problem ⋮ A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands ⋮ Heuristics for the two-dimensional irregular bin packing problem with limited rotations ⋮ Solving a large cutting problem in the glass manufacturing industry ⋮ Solving two-dimensional cutting stock problem via a DNA computing algorithm ⋮ Orientational variable-length strip covering problem: a branch-and-price-based algorithm ⋮ An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem ⋮ Irregular packing problems: a review of mathematical models
Cites Work
- Robust mixed-integer linear programming models for the irregular strip packing problem
- Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
- Generalized hyper-heuristics for solving 2D regular and irregular packing problems
- A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
- Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints
- A beam search algorithm for the circular packing problem
- A beam search implementation for the irregular shape packing problem
- A new algorithm for the minimal-area convex enclosure problem
- A clique covering MIP model for the irregular strip packing problem
- Matheuristics for the irregular bin packing problem with free rotations
- Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
- Job shop scheduling with beam search
- Approximation algorithm for the oriented two-dimensional bin packing problem
- Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
- An improved typology of cutting and packing problems
- Models and algorithms for three-stage two-dimensional bin packing
- A tutorial in irregular shape packing problems
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- Multistage Cutting Stock Problems of Two and More Dimensions
This page was built for publication: A beam search approach to solve the convex irregular bin packing problem with guillotine guts
