Matheuristics for the irregular bin packing problem with free rotations

DOI10.1016/j.ejor.2016.09.043zbMath1394.90488OpenAlexW2523777431WikidataQ61308157 ScholiaQ61308157MaRDI QIDQ1751657

Rubén Ruiz, José Manuel Tamarit, Julia A. Bennell, Antonio Martínez-Sykora, Ramón Alvarez-Valdés

Publication date: 25 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://eprints.whiterose.ac.uk/139290/1/BCP-EJOR.pdf

zbMATH Keywords

integer programmingcutting and packingtwo-dimensional irregular bin packing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

A simple and effective algorithm for the maximum happy vertices problem, Aircraft parking stand allocation problem with safety consideration for independent hangar maintenance service providers, An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations, 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, The board packing problem, A beam search approach to solve the convex irregular bin packing problem with guillotine guts, Orientational variable-length strip covering problem: a branch-and-price-based algorithm, Irregular packing problems: a review of mathematical models

Cites Work

• An effective heuristic for the two-dimensional irregular bin packing problem
• A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
• Generalized hyper-heuristics for solving 2D regular and irregular packing problems
• A beam search implementation for the irregular shape packing problem
• On genetic algorithms for the packing of polygons
• Worst-case analysis of the subset sum algorithm for bin packing.
• An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
• Mathematical model and efficient algorithms for object packing problem
• Mixed-integer programming models for nesting problems
• Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
• The geometry of nesting problems: a tutorial
• An improved typology of cutting and packing problems
• A tutorial in irregular shape packing problems
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms