Fast heuristic for constrained homogenous T-shape cutting patterns

DOI10.1016/J.APM.2011.11.005zbMATH Open1252.90091OpenAlexW2042395469MaRDI QIDQ693480FDOQ693480

Authors Yaodong Cui 

Publication date 7 December 2012

Published in Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.apm.2011.11.005

zbMATH Keywords

cutting stocktwo-dimensional cuttingT-shape patterns

Mathematics Subject Classification ID

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

Recommendations

• Heuristic for constrained T-shape cutting patterns of rectangular pieces
• A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns
• An exact algorithm for generating homogeneous T-shape cutting patterns
• T-shape homogeneous block patterns for the two-dimensional cutting problem
• Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
• Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais
• Improved heuristics for sequencing cutting patterns
• An algorithm for the determination of optimal cutting patterns
• Generating optimal T-shape cutting patterns for circular blanks
• Fast pattern-based algorithms for cutting stock

Cites work

• A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
• A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
• A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns
• Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
• Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
• An Algorithm for Two-Dimensional Cutting Problems
• An approximation algorithm for solving unconstrained two-dimensional knapsack problems
• An efficient approach for large-scale two-dimensional guillotine cutting stock problems
• An exact algorithm for generating homogeneous T-shape cutting patterns
• An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
• Efficient algorithm for the constrained two-dimensional cutting stock problem
• Exact algorithms for large-scale unconstrained two and three staged cutting problems
• GRASP and path relinking for the two-dimensional two-stage cutting-stock problem
• Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
• Integer linear programming models for 2-staged two-dimensional knapsack problems
• On the two-dimensional knapsack problem

Cited in

(7)

• An open space based heuristic for the 2D strip packing problem with unloading constraints
• Heuristic for constrained T-shape cutting patterns of rectangular pieces
• An exact algorithm for generating homogeneous T-shape cutting patterns
• T-shape homogeneous block patterns for the two-dimensional cutting problem
• Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
• A block-based layer building approach for the 2D guillotine strip packing problem
• A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns

This page was built for publication: Fast heuristic for constrained homogenous T-shape cutting patterns

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