کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
482878 1446222 2006 19 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Solving Irregular Strip Packing problems by hybridising simulated annealing and linear programming
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
Solving Irregular Strip Packing problems by hybridising simulated annealing and linear programming
چکیده انگلیسی

In this paper a hybrid algorithm to solve Irregular Strip Packing problems is presented. The metaheuristic simulated annealing is used to guide the search over the solution space while linear programming models are solved to generate neighbourhoods during the search process. These linear programming models, which are used to locally optimise the layouts, derive from the application of compaction and separation algorithms.Computational tests were run using instances that are commonly used as benchmarks in the literature. The best results published so far have been improved by this new hybrid packing algorithm.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 171, Issue 3, 16 June 2006, Pages 811–829
نویسندگان
, ,