ITERATED LOCAL SEARCH ALGORITHM FOR THE CONSTRAINED TWO-DIMENSIONAL NON-GUILLOTINE CUTTING PROBLEM

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.

KHEBBACHE S.; PRINS CH.; YALAOUI A.

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

Journal Paper

Paper Information

Journal: Journal of Industrial and Systems Engineering Year:2008 | Volume:2 | Issue:3 Page(s): 164-179

Download Full-Text

View:

342

Download:

149

Cites:

Information Journal Paper

Title

ITERATED LOCAL SEARCH ALGORITHM FOR THE CONSTRAINED TWO-DIMENSIONAL NON-GUILLOTINE CUTTING PROBLEM

Author(s)

KHEBBACHE S. | PRINS CH. | YALAOUI A. | Issue Writer Certificate

Keywords

CUTTING AND PACKING

TWO-DIMENSIONAL NON-GUILLOTINE CUTTING

HEURISTICS

ITERATED LOCAL SEARCH

Abstract

An ITERATED LOCAL SEARCH method for the constrained TWO-DIMENSIONAL NON-GUILLOTINE CUTTING problem is presented. This problem consists in cutting pieces from a large stock rectangle to maximize the total value of pieces cut. In this problem, we take into account restrictions on the number of pieces of each size required to be cut. It can be classified as 2D-SLOPP (two dimensional single large objects placement problem) and has many industrial applications like in wood and steel industries. The proposed ITERATED LOCAL SEARCH algorithm in which we use a constructive heuristic and a local search move based on reducing pieces. The algorithm is tested on well known instances from the literature. Our computational results are very competitive compared to the best known solutions of literature and improve a part of them.

Cites

No record.

References

No record.

Cite

APA: Copy

KHEBBACHE, S., PRINS, CH., & YALAOUI, A.. (2008). ITERATED LOCAL SEARCH ALGORITHM FOR THE CONSTRAINED TWO-DIMENSIONAL NON-GUILLOTINE CUTTING PROBLEM. JOURNAL OF INDUSTRIAL AND SYSTEMS ENGINEERING (JISE), 2(3), 164-179. SID. https://sid.ir/paper/307085/en

Vancouver: Copy

KHEBBACHE S., PRINS CH., YALAOUI A.. ITERATED LOCAL SEARCH ALGORITHM FOR THE CONSTRAINED TWO-DIMENSIONAL NON-GUILLOTINE CUTTING PROBLEM. JOURNAL OF INDUSTRIAL AND SYSTEMS ENGINEERING (JISE)[Internet]. 2008;2(3):164-179. Available from: https://sid.ir/paper/307085/en

IEEE: Copy

S. KHEBBACHE, CH. PRINS, and A. YALAOUI, “ITERATED LOCAL SEARCH ALGORITHM FOR THE CONSTRAINED TWO-DIMENSIONAL NON-GUILLOTINE CUTTING PROBLEM,” JOURNAL OF INDUSTRIAL AND SYSTEMS ENGINEERING (JISE), vol. 2, no. 3, pp. 164–179, 2008, [Online]. Available: https://sid.ir/paper/307085/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops