Method of sentinels for packing items within arbitrary convex regions

Method of sentinels for packing items within arbitrary convex regions

0.00 Avg rating0 Votes
Article ID: iaor20072049
Country: United Kingdom
Volume: 57
Issue: 6
Start Page Number: 735
End Page Number: 746
Publication Date: Jun 2006
Journal: Journal of the Operational Research Society
Authors: , , ,
Keywords: programming: nonlinear
Abstract:

A new method is introduced for packing items in convex regions of the Euclidian n-dimensional space. By means of this approach the packing problem becomes a global finite-dimensional continuous optimization problem. The strategy is based on the new concept of sentinels. Sentinels sets are finite subsets of the items to be packed such that, when two items are superposed, at least one sentinel of one item is in the interior of the other. Minimal sets of sentinels are found in simple two-dimensional cases. Numerical experiments and pictures showing the potentiality of the new technique are presented.

Reviews

Required fields are marked *. Your email address will not be published.