کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
474911 | 699171 | 2006 | 16 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Generating optimal two-section cutting patterns for rectangular blanks
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Generating optimal two-section cutting patterns for rectangular blanks Generating optimal two-section cutting patterns for rectangular blanks](/preview/png/474911.png)
چکیده انگلیسی
This paper presents an algorithm for generating unconstrained guillotine-cutting patterns for rectangular blanks. A pattern includes at most two sections, each of which consists of strips of the same length and direction. The sizes and strip directions of the sections must be determined optimally to maximize the value of the blanks cut. The algorithm uses an implicit enumeration method to consider all possible section sizes, from which the optimal sizes are selected. It may solve all the benchmark problems listed in the OR-Library to optimality. The computational results indicate that the algorithm is efficient both in computation time and in material utilization. Finally, solutions to some problems are given.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 33, Issue 6, June 2006, Pages 1505–1520
Journal: Computers & Operations Research - Volume 33, Issue 6, June 2006, Pages 1505–1520
نویسندگان
Yaodong Cui, Dongli He, Xiaoxia Song,