A* based cutting plan generation for metal grating production

Authors:
Jin Myoung Kim;Tae Ho Cho
Affiliations:
School of Information and Communication Engineering, Sungkyunkwan University, Kyungkido, South Korea;School of Information and Communication Engineering, Sungkyunkwan University, Kyungkido, South Korea
Venue:
ACIIDS'11 Proceedings of the Third international conference on Intelligent information and database systems - Volume Part II
Year:
2011

Citing 5
Cited 0

Best-first search methods for constrained two-dimensional cutting stock problems

Operations Research
Artificial intelligence: a new synthesis

Artificial intelligence: a new synthesis
New heuristic and interactive approaches to 2D rectangular strip packing

Journal of Experimental Algorithmics (JEA)
A New Placement Heuristic for the Orthogonal Stock-Cutting Problem

Operations Research
The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the metal grating production process, a cutting plan should decide how pieces of metal rectangles are allocated and cutout from plate sheets called panels. The cutting plan can generate various possible combinations of rectangle allocations within the panels in order to select the best plan that minimizes material waste. To achieve the best plan, A* algorithm of artificial Intelligence is exploited. The plan is evaluated to show how effective it is in terms of material utilization.