Distributed Cutting Stock System Based on Heuristic Search and Knapsack Algorithm
Article
Figures
Metrics
Preview PDF
Reference
Related
Cited by
Materials
Abstract:
A approximate algorithm is presented by which satisfactory results of two dimensional optimal layout belonged to NP complete problems can be obtained efficiently and rapidly. The algorithm integrated with widespread of computer network has been applied to the distributed cutting stock system Adopting Heuristic search and Knapsack algorithm, the algorithm makes each layout optimal locally and obtained the approximate optimal solution. It is compared with other two approximate algorithms and pointed out their shortcomings. In the end of the article a layout example was presented.
