TY - JOUR
T1 - Packing Unit Spheres into a Cube Using VNS
AU - M'Hallah, Rym
AU - Alkandari, Abdulaziz
N1 - Copyright:
Copyright 2012 Elsevier B.V., All rights reserved.
PY - 2012/12/1
Y1 - 2012/12/1
N2 - 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.
AB - 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.
KW - Non-linear programming
KW - Packing spheres in a cube
KW - Three dimensional packing
KW - Variable neighborhood search
UR - http://www.scopus.com/inward/record.url?scp=84870266988&partnerID=8YFLogxK
U2 - 10.1016/j.endm.2012.10.027
DO - 10.1016/j.endm.2012.10.027
M3 - Article
AN - SCOPUS:84870266988
SN - 1571-0653
VL - 39
SP - 201
EP - 208
JO - Electronic Notes in Discrete Mathematics
JF - Electronic Notes in Discrete Mathematics
ER -