Dynamic Programming Algorithms for Generating Optimal Strip Layouts

Authors:
Yaodong Cui;Ling Huang
Affiliations:
Computer Science Department, Guangxi Normal University, Guilin, China 541004;Computer Science Department, Guangxi Normal University, Guilin, China 541004
Venue:
Computational Optimization and Applications
Year:
2006

Citing 3
Cited 4

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Generating optimal T-shape cutting patterns for circular blanks

Computers and Operations Research
A cutting stock problem and its solution in the manufacturing industry of large electric generators

Computers and Operations Research

Heuristic and exact algorithms for generating homogenous constrained three-staged cutting patterns

Computers and Operations Research
Shortest path based simulated annealing algorithm for dynamic facility layout problem under dynamic business environment

Expert Systems with Applications: An International Journal
A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem

Computers and Operations Research
Efficient parts nesting schemes for improving stereolithography utilization

Computer-Aided Design

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper presents dynamic programming algorithms for generating optimal strip layouts of equal blanks processed by shearing and punching. The shearing and punching process includes two stages. The sheet is cut into strips using orthogonal guillotine cuts at the first stage. The blanks are punched from the strips at the second stage. The algorithms are applicable in solving the unconstrained problem where the blank demand is unconstrained, the constrained problem where the demand is exact, the unconstrained problem with blade length constraint, and the constrained problem with blade length constraint. When the sheet length is longer than the blade length of the guillotine shear used, the dynamic programming algorithm is applied to generate optimal layouts on segments of lengths not longer than the blade length, and the knapsack algorithm is employed to find the optimal layout of the segments on the sheet. Experimental computations show that the algorithms are efficient.