Title of article
Packing Unit Spheres into a Cube Using VNS
Author/Authors
MʹHallah، نويسنده , , Rym and Alkandari، نويسنده , , Abdulaziz، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2012
Pages
8
From page
201
To page
208
Abstract
This paper applies a variable neighborhood search (VNS) to the difficult problem of packing unit radii spheres into the smallest cube (PSC). VNS identifies (near-) global optima by searching the neighborhoods of local minima. It obtains neighboring solutions by shaking one or more spheres. It alters the size of a neighborhood every time it fails to find an improving solution. VNS matches 42 out of 55 upper bounds.
Keywords
variable neighborhood search , Three dimensional packing , Non-linear programming , Packing spheres in a cube
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2012
Journal title
Electronic Notes in Discrete Mathematics
Record number
1456011
Link To Document