AN ALGORITHM FOR TWO DIMENSIONAL CUTTING STOCK PROBLEMS WITH DEMAND

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

MOSLEHI GH.; REZAEI A.R.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: ESTEGHLAL Year:2005 | Volume:23 | Issue:2 Page(s): 59-76

Download Full-Text

Persian Verion

View:

1,590

Download:

Cites:

Information Journal Paper

Title

AN ALGORITHM FOR TWO DIMENSIONAL CUTTING STOCK PROBLEMS WITH DEMAND

Author(s)

MOSLEHI GH. | REZAEI A.R. | Issue Writer Certificate

Keywords

TWO DIMENSIONAL CUTTING STOCK PROBLEMQ4

WASTEQ4

CUTTING PATTERNSQ4

SIMULATED ANNEALINGQ4

Abstract

In this paper two-dimensional cutting stock problem with demand has been studied. In this problem, cutting of large rectangular sheets in to specific small pieces, should be carried out, hence for the WASTE will be minimized. Solving this problem is important to decrease WASTE materials in any industry that requires cutting of sheets. In most of the papers the demand of pieces has not been usually considered. The cutting problems belong to 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 attempts have been 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.

Cites

No record.

References

No record.

Cite

APA: Copy

MOSLEHI, GH., & REZAEI, A.R.. (2005). AN ALGORITHM FOR TWO DIMENSIONAL CUTTING STOCK PROBLEMS WITH DEMAND . ESTEGHLAL, 23(2), 59-76. SID. https://sid.ir/paper/5965/en

Vancouver: Copy

MOSLEHI GH., REZAEI A.R.. AN ALGORITHM FOR TWO DIMENSIONAL CUTTING STOCK PROBLEMS WITH DEMAND . ESTEGHLAL[Internet]. 2005;23(2):59-76. Available from: https://sid.ir/paper/5965/en

IEEE: Copy

GH. MOSLEHI, and A.R. REZAEI, “AN ALGORITHM FOR TWO DIMENSIONAL CUTTING STOCK PROBLEMS WITH DEMAND ,” ESTEGHLAL, vol. 23, no. 2, pp. 59–76, 2005, [Online]. Available: https://sid.ir/paper/5965/en

Related Journal Papers