THE TRIM LOSS CONCENTRATION IN ONE-DIMENSIONAL CUTTING STOCK PROBLEM (1D-CSP) BY DEFINING A VIRTUAL COST

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.

JAVANSHIR H.; SHADALOUEI M.

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

Journal Paper

Paper Information

Journal: JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL Year:2007 | Volume:3 | Issue:4 Page(s): 51-58

Download Full-Text

View:

299

Download:

Cites:

Information Journal Paper

Title

THE TRIM LOSS CONCENTRATION IN ONE-DIMENSIONAL CUTTING STOCK PROBLEM (1D-CSP) BY DEFINING A VIRTUAL COST

Author(s)

JAVANSHIR H. | SHADALOUEI M. | Issue Writer Certificate

Keywords

ONE-DIMENSIONAL CUTTING STOCK PROBLEM

SIMULATED ANNEALING

TRIM LOSS CONCENTRATION

ITEMORIENTED

FDD ALGORITHM

VIRTUAL COST

Abstract

Nowadays, ONE-DIMENSIONAL CUTTING STOCK PROBLEM (1D-CSP) is used in many industrial processes and recently has been considered as one of the most important research topic. In this paper, a metaheuristic algorithm based on the SIMULATED ANNEALING (SA) method is represented to minimize the trim loss and also to focus the trim loss on the minimum number of large objects. In this method, the ID-CSP is taken into account as Item-oriented and the authors have tried to minimize the TRIM LOSS CONCENTRATION by using the SIMULATED ANNEALING algorithm and also defining a VIRTUAL COST for the trim loss of each stock. The solved sample problems show the ability of this algorithm to solve the ID-CSP in many cases.

Cites

References

No record.

Cite

APA: Copy

JAVANSHIR, H., & SHADALOUEI, M.. (2007). THE TRIM LOSS CONCENTRATION IN ONE-DIMENSIONAL CUTTING STOCK PROBLEM (1D-CSP) BY DEFINING A VIRTUAL COST. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, 3(4), 51-58. SID. https://sid.ir/paper/309794/en

Vancouver: Copy

JAVANSHIR H., SHADALOUEI M.. THE TRIM LOSS CONCENTRATION IN ONE-DIMENSIONAL CUTTING STOCK PROBLEM (1D-CSP) BY DEFINING A VIRTUAL COST. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL[Internet]. 2007;3(4):51-58. Available from: https://sid.ir/paper/309794/en

IEEE: Copy

H. JAVANSHIR, and M. SHADALOUEI, “THE TRIM LOSS CONCENTRATION IN ONE-DIMENSIONAL CUTTING STOCK PROBLEM (1D-CSP) BY DEFINING A VIRTUAL COST,” JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, vol. 3, no. 4, pp. 51–58, 2007, [Online]. Available: https://sid.ir/paper/309794/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops