Volume 23, Number 2 (1-2005)                   jame 2005, 23(2): 59-76 | Back to browse issues page

XML Persian Abstract Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

GH. Moslehi and A. R. Rezaie. An Algorithm for Two Dimensional Cutting Stock Problems with Demand. jame. 2005; 23 (2) :59-76
URL: http://jame.iut.ac.ir/article-1-319-en.html

Abstract:   (1101 Views)
In this paper, two-dimensional cutting stock problem with demand has been studied.In this problem, cutting of large rectangular sheets into specific small pieces should be carried out hence, the waste will be minimized. Solving this problem is important to decrease waste materials in any industry that requires cutting of sheets. In most previus studies, the demand of pieces has not been usually considered. The cutting problems belong to the category of Np-hard problems. So finding a desirable solution in a suitable time is practically impossible and heuristic methods must be used. A meta-heuristic algorithm using SA approach is presented.Then attempt will be made to regulate the SAs parameters. Initial solutions are produced with a rule based algorithm and two internal and main SAs are used that lead to better performance of the algorithm. Due to lack of benchmark or test problems, two procedures for generating random problems is presented and are used to study efficiency of the algorithm. For this purpose, problems about 10 to 50 types of pieces with maximum demands of 2400 are generated and solved using the proposed algorithm. The results indicate that the algorithm capable of finding a solution with less than 6% of waste for problems with 30 types of pieces and total demands of 500.
Full-Text [PDF 199 kb]   (299 Downloads)    
Type of Study: Research | Subject: General
Received: 2014/10/25

Add your comments about this article : Your username or email:
Write the security code in the box

© 2015 All Rights Reserved | Journal of Advanced Materials in Engineering (Esteghlal)

Designed & Developed by : Yektaweb