A block-based layer building approach for the 2D guillotine strip packing problem

DOI10.1016/J.EJOR.2014.04.020zbMATH Open1339.90291OpenAlexW2014459551MaRDI QIDQ297057FDOQ297057

Authors: Lijun Wei, Tian Tian, Wenbin Zhu, Andrew Lim 

Publication date: 24 June 2016

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2014.04.020

Recommendations

• An exact method for the 2D guillotine strip packing problem
• A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem
• A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
• The two-dimensional cutting stock problem revisited
• Strip based compact formulation for two-dimensional guillotine cutting problems

zbMATH Keywords

packingbest-fit heuristiccuttingguillotine-cutlayer-building

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
• A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem
• A recursive algorithm for constrained two-dimensional cutting problems
• Guillotineable bin packing: A genetic approach
• Exact algorithms for the guillotine strip cutting/packing problem.
• An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
• A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint
• Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems
• A reference length approach for the 3D strip packing problem
• A new iterative-doubling greedy-lookahead algorithm for the single container loading problem
• A prototype column generation strategy for the multiple container loading problem
• Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
• A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
• A new heuristic recursive algorithm for the strip rectangular packing problem
• Exact solution of the two-dimensional finite bin packing problem
• A tree search algorithm for solving the container loading problem
• A parallel branch-and-bound approach to the rectangular guillotine strip cutting problem
• A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock-cutting problem
• Heuristic for constrained T-shape cutting patterns of rectangular pieces
• Heuristic for the rectangular strip packing problem with rotation of items
• Two-Dimensional Finite Bin-Packing Algorithms
• An Algorithm for Two-Dimensional Cutting Problems
• A skyline heuristic for the 2D rectangular packing and strip packing problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
• Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems
• Fast heuristic for constrained homogenous T-shape cutting patterns
• Characterization and modelling of guillotine constraints
• A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
• An integer programming model for two- and three-stage two-dimensional cutting stock problems

Cited In (11)

• An efficient two-staged approach for generating block layouts
• Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review
• Exact approaches for the unconstrained two-dimensional cutting problem with defects
• A bidirectional building approach for the 2D constrained guillotine knapsack packing problem
• A hybrid algorithm based on variable neighbourhood for the strip packing problem
• An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem
• A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem
• A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem
• The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview
• An EDA for the 2D knapsack problem with guillotine constraint
• A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem

This page was built for publication: A block-based layer building approach for the 2D guillotine strip packing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q297057)