Packing non-equal hyperspheres into a hypersphere of minimal radius
Keywords:
hypersphere, packing, mathematical modeling, jump algorithmAbstract
The problem of packing different hyperspheres into a hypersphere of minimal radius is considered. All hypersphere radii are supposed to be variable. Solving the problem is reduced to solving a sequence of mathematical programming problems. A special way of construction of starting pointsis suggested. A smooth transition from one local minimum point to another providing a decrease of the objective value is realized using the jump algorithm is fulfilled. Then, solution results are improved due to reduction of the solution space dimension by step-by-step fixing radii of hyperspheres and rearrangements of hypersphere pairs. Non-linear mathematical programming problems are solved with the IPOPT (Interior Point Optimizer) solver and the concept of active inequalities. A number of numerical results are given.
References
Skoge, M., Donev, A., Stillinger, F.H., Torquato, S. Packing hyperspheres in high-dimensional Euclidean spaces, Physical Review, E 74, 041127, 2006. 2. Agapie, S.C., Whitlock, P.A. Random packing of hyperspheres and Marsaglia's parking lot test, Monte Carlo Methods and Applications, 16(3-4), 197–209, 2010. 3. Conway, J. H., Sloane, N.J.A. Sphere Packings, Lattices, and Groups, New York: Springer-Verlag, 2010, 703 p. 4. Torquato, S. Exactly solvable disordered sphere-packing model in arbitrary-dimensional Euclidean spaces, Physical Review, E 73, 031106, 2006. 5. Jodrey, W.S., Tory, E.M. Computer simulation of close random packing of equal spheres, Physical Review, A32, 2347-2351, 1985. 6. Fraser, D.P. Setting up Random Configurations, Information Quarterly for Computer Simulation of Condensed Phases, 19, 53–59, 1985. 7. Morse, P., Clusel, M., Corwin, E. Polydisperse sphere packing in high dimensions, a search for an upper critical dimension, Proc. APS March Meeting 2012, February 27–March 2, 2012, Boston, Massachusetts, 57(1), 2012. 8. Stoyan, Yu., Yaskov, G. Packing congruent hyperspheres into a hypersphere, Journal of Global Optimization, 52(4), 855–868, 2012. 9. Stoyan, Yu., Yaskov, G. Packing unequal circles into a strip of minimal length with a jump algorithm, Optimization Letters, 1-22, 2013 (DOI: 10.1007/s11590-013-0646-1). 10. Stoyan, Yu. G., Yaskov, G. A mathematical model and a solution method for the problem of placing various-sized circles into a strip, European Journal of Operational Research, 156, 590–600, 2004. 11. Wächter, A, Biegler, L. T. On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming, Mathematical Programming, 106(1), 25–57, 2006. 12. Zoutendijk,. G. Methods of feasible directions. A study in linear and non-linear programming, Amsterdam, London, New York, Princeton: Elsevier Publishing Company, 1960, 126 p.
Downloads
Published
Issue
Section
License
Copyright (c) 2015 G. N. Yaskov
This work is licensed under a Creative Commons Attribution-NoDerivatives 4.0 International License.
All authors agree with the following conditions:
- The authors reserve the right to claim authorship of their work and transfer to the journal the right of first publication of the work under the license agreement (the agreement).
- Authors have a right to conclude independently additional agreement on non-exclusive spreading the work in the form in which it was published by the jpurnal (for example, to place the work in institution repository or to publish as a part of a monograph), providing a link to the first publication of the work in this journal.
- Journal policy allows authors to place the manuscript in the Internet (for example, in the institution repository or on a personal web sites) both before its submission to the editorial board and during its editorial processing, as this ensures the productive scientific discussion and impact positively on the efficiency and dynamics of citation of published work (see The Effect of Open Access).
