کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
476174 | 699424 | 2006 | 14 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization](/preview/png/476174.png)
The orthogonal packing of rectangular items in an arbitrary convex region is considered in this work. The packing problem is modeled as the problem of deciding for the feasibility or infeasibility of a set of nonlinear equality and inequality constraints. A procedure based on nonlinear programming is introduced and numerical experiments which show that the new procedure is reliable are exhibited.Scope and purposeWe address the problem of packing orthogonal rectangles within an arbitrary convex region. We aim to show that smooth nonlinear programming models are a reliable alternative for packing problems and that well-known general-purpose methods based on continuous optimization can be used to solve the models. Numerical experiments illustrate the capabilities and limitations of the approach.
Journal: Computers & Operations Research - Volume 33, Issue 12, December 2006, Pages 3535–3548