Packing unit spheres into the smallest sphere using VNS and NLP

Computers and Operations Research

Volumn 40, Issue 2, 2013, Pages 603-615

  M'Hallah, R ^a   Alkandari, A ^b   Mladenovic, N ^c  

^a KUWAIT UNIVERSITY   (Kuwait)

^b MANUFACTURING ENGINEERING DEPARTMENT   (Kuwait)

^c BRUNEL UNIVERSITY   (United Kingdom)

Author keywords

Non linear programming; Three dimensional packing; Unit sphere packing; Variable neighborhood search

Indexed keywords

COMPUTATIONAL INVESTIGATION; GLOBAL MINIMA; GLOBALOPTIMUM; HYBRID HEURISTICS; INITIAL SOLUTION; LINE SEARCHES; LOCAL MINIMUMS; LOCAL SEARCH; NP-HARD; OPTIMIZATION PROBLEMS; QUADRATIC ALGORITHMS; THREE-DIMENSIONAL PACKING; UPPER BOUND; VARIABLE NEIGHBORHOOD SEARCH;

COMPUTER SCIENCE; OPERATIONS RESEARCH;

SPHERES;

EID: 84867401355     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2012.08.019     Document Type: Article

References (31)

1. I. Al-Modahka, M. Hifi, and R. MHallah Packing circles in the smallest circle an adaptive hybrid algorithm. Journal of the Operational Research Society 62 2011 1917 1930
2. T. Aste, M. Saadatfar, A. Sakellariou, and T.J. Senden Investigating the geometrical structure of disordered sphere packings Physica A 339 2004 16 23
3. E.B. Baum Toward practical 'neural' computation for combinatorial optimization problems J. Denker, Neural networks for computing 1986 American Institute of Physics
4. K. Bezdek Sphere packings revisited European Journal of Combinatorics 27 2006 864 883
5. E.G. Birgin, and J.M. Gentil New and improved results for packing identical unitary radius circles within triangles Computers & Operations Research 37 2010 1318 1327
6. E.G. Birgin, and F.N.C. Sobral Minimizing the object dimensions in circle and sphere packing problems Computers & Operations Research 35 2008 2357 2375
7. J.H. Conway, and N.J.A. Sloane Sphere packings, lattices, and groups 1999 Springer-Verlag New York
8. M. Gan, N. Gopinathan, X. Jia, and R.A. Williams Predicting packing characteristics of particles of arbitrary shapes KONA 22 2004 82 93
9. T. Gensane Dense packings of equal spheres in a cube Electronic Journal of Combinatorics 11 2004 R33
10. P. Hansen, N. Mladenovic, and D. Urosevic Variable neighborhood search and local branching Computers & Operations Research 33 2006 3034 3045
11. T.C. Hales A proof of the Kepler conjecture Annals of Mathematics 162 2005 1065 1185
12. P. Hansen, N. Mladenovic, and J.A. Moreno-Perez Variable neighbourhood search methods and applications. Annals of Operations Research 175 2010 367 407
13. P. Hansen, and N. Mladenovic Variable neighborhood search principles and applications. European Journal of Operational Research 130 2001 449 467
14. P. Hansen, and N. Mladenovic Developments of variable neighborhood search C. Ribeiro, P. Hansen, Essays and surveys in metaheuristics 2001 Kluwer Academic Publishers Boston, Dordrecht, London 415 440
15. N. Mladenovic, R. Todosijevic, and D. Urosevic An efficient general variable neighborhood search for large TSP problems with time windows Yugoslav Journal of Operations Research 22 2012 141 151
16. Hifi M, MHallah R. A literature review of circle and sphere packing problems: models and methodologies. Advances in Operations Research 2009, Article ID 150624, 22p. http://dx.doi.org/10.1155/2009/150624; 2009.
17. M. Hifi, and R. MHallah Beam search and non-linear programming tools for the circular packing problem International Journal of Mathematics in Operational Research 1 2009 476 503
18. J.F. Liu, Y.L. Yao, Y. Zheng, H.T. Geng, and G.C. Zhou An effective hybrid algorithm for the circles and spheres packing problems D.Z. Du, X.D. Hu, P.M. Pardalos, Combinatorial optimization and applications third international conference 2009 Springer Berlin 135 144
19. N. Mladenovic, and P. Hansen Variable neighborhood search Computers and Operations Research 24 1997 1097 1100
20. Schittkowski K. NLPQLP: a Fortran implementation of a sequential quadratic programming algorithm with distributed and non-monotone line search - users guide, version 3.1. Report, Department of Computer Science, University of Bayreuth; 2010.
21. Stoyan YG. Mathematical methods for geometric design. In: Advances in CAD/CAM: proceedings of PROLAMAT, Leningrad, USSR, 16-18 May 1982. Amsterdam: North-Holland; 2003. p. 67-86.
22. Y.G. Stoyan, G.N. Yaskov, and G. Scheithauer Packing of various radii solid spheres into a paralleliped Central European Journal of Operational Research 11 2003 389 407
23. Y.G. Stoyan, and G.N. Yaskov A mathematical model and a solution method for the problem of placing various sized circles into a strip European Journal of Operational Research 156 2004 590 600
24. Y.G. Stoyan, and G. Yaskov Packing identical spheres into a rectangular parallelepiped A. Bortfeldt, J. Homberger, H. Kopfer, G. Pankratz, R. Strangmeier, Intelligent decision support. Current challenges and approaches 2008 Betriebswirtschaftlicher Verlar Dr. Th. Gabler, GWV Fachverlage GMbH Wiesbaden 47 67
25. A. Sutou, and Y. Dai Global optimization approach to unequal sphere packing problems in 3D Journal of Optimization Theory and Applications 114 2002 671 694
26. S. Torquato, and F.H. Stillinger Exactly solvable disordered sphere-packing model in arbitrary-dimensional Euclidean spaces Physical Review E 73 2006 031106-1 031106-9
27. J. Wang Packing of unequal spheres and automated radiosurgical treatment planning Journal of Combinatorial Optimization 3 1999 453 463
28. G. Wascher, H. Haussner, and H. Schumann An improved typology of cutting and packing problems European Journal of Operational Research 183 2007 1109 1130
29. S.R. Williams, and A.P. Philipse Random packing of spheres and sphero-cylinders simulated by mechanical contraction Physical Review E 67 2003 051301-1 051301-9
30. 〈 http://www.ime.usp.br/∼egbirgin/packing/packing-by-nlp 〉, last visited on August 2012.
31. 〈 www.randomwalk.de/sphere/insphr/sequences.txt 〉, last visited on August 2012.