Heuristic algorithm for a cutting stock problem in the steel bridge construction

Authors:
Yaodong Cui;Yiping Lu
Affiliations:
Department of Computer Science, Guangxi Normal University, Guilin 541004, China;School of Mechanical, Electronic and Control Engineering, Beijing Jiaotong University, Beijing 100044, China
Venue:
Computers and Operations Research
Year:
2009

Citing 6
Cited 4

A Mixed Integer Programming Model for Solving a Layout Problem in the Fashion Industry

Management Science
The cutting stock problem in a hardboard industry: a case study

Computers and Operations Research
A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem

Management Science
A new heuristic recursive algorithm for the strip rectangular packing problem

Computers and Operations Research
A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem

Computers and Operations Research
A meta-heuristic algorithm for the strip rectangular packing problem

ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III

Hybrid heuristic algorithm for two-dimensional steel coil cutting problem

Computers and Industrial Engineering
Shadow price based genetic algorithms for the cutting stock problem

International Journal of Artificial Intelligence and Soft Computing
An integrated algorithm for cutting stock problems in the thin-film transistor liquid crystal display industry

Computers and Industrial Engineering
Intelligent Systems Research in the Construction Industry

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

A rectangular two-dimensional cutting stock problem in the steel bridge construction is discussed. It is the problem of cutting a set of rectangular items from plates with arbitrary sizes that lie in the supplier specified ranges, such that the necessary plate area is minimized. Several types of cutting patterns are used to compose the cutting plan. All of them are easy to generate and cut except the last one. The algorithm uses both recursive and dynamic programming techniques to generate patterns of the last type. The computational results of 22 practical instances indicate that the algorithm can produce solutions close to optimal, and the computation time is reasonable for practical use.