Skip to main content
Log in

Global Optimization Approach to Unequal Global Optimization Approach to Unequal Sphere Packing Problems in 3D

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

The problem of the unequal sphere packing in a 3-dimen-sional polytope is analyzed. Given a set of unequal spheres and a poly-tope, the double goal is to assemble the spheres in such a way that (i) they do not overlap with each other and (ii) the sum of the volumes of the spheres packed in the polytope is maximized. This optimization has an application in automated radiosurgical treatment planning and can be formulated as a nonconvex optimization problem with quadratic constraints and a linear objective function. On the basis of the special structures associated with this problem, we propose a variety of algorithms which improve markedly the existing simplicial branch-and-bound algorithm for the general nonconvex quadratic program. Further, heuristic algorithms are incorporated to strengthen the efficiency of the algorithm. The computational study demonstrates that the proposed algorithm can obtain successfully the optimization up to a limiting size.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. COFFMAN, E. G., JR., GAREY, M. R., and JOHNSON, D. S., Approximation Algorithms for Bin-Packing: An Updated Survey, Algorithm Design for Computer System Design, Edited by G. Ausiello, M. Lucertini, and P. Serafini, Springer Verlag, New York, NY, pp. 49–106, 1984.

    Google Scholar 

  2. LI, K., and CHENG, K. H., On Three-Dimensional Packing, SIAM Journal on Computing, Vol. 19, pp. 847–867, 1990.

    Google Scholar 

  3. STEINBERG, A., A Strip-Packing Algorithm with Absolute Performance Bound 2, SIAM Journal on Computing, Vol. 26, pp. 401–409, 1997.

    Google Scholar 

  4. WANG, J., Packing of Unequal Spheres and Automated Radiosurgical Treatment Planning, Journal of Combinatorial Optimization, Vol. 3, pp. 453–463, 1999.

    Google Scholar 

  5. WU, Q. J., and BOURLAND, J. D., Morphology-Guided Radiosurgery Treatment Planning and Optimization for Multiple Isocenters, Medical Physics, Vol. 26, pp. 2151–2160, 1992.

    Google Scholar 

  6. WU, A., Physics and Dosimetry of the Gamma Knife, Neurosurgery Clinics of North America, Vol. 3, pp. 35–50, 1992.

    Google Scholar 

  7. AL-KHAYYAL, F. A., LARSEN, C., and VAN VOORHIS, T., A Relaxation Method for Nonconvex Quadratically-Constrained Quadratic Programs, Journal of Global Optimization, Vol. 6, pp. 215–230, 1995.

    Google Scholar 

  8. RABER, U., A Simplicial Branch-and-Bound Method for Solving Nonconvex All-Quadratic Programs, Journal of Global Optimization, Vol. 13, pp. 417–432, 1998.

    Google Scholar 

  9. SHERALI, H. D., and TUNCBILEK, C. H., A New Reformulation-Linearization Technique for Bilinear Programming Problems, Journal of Global Optimization, Vol. 2, pp. 101–112, 1992.

    Google Scholar 

  10. HORST, R., On Generalized Bisection of n-Simplices, Mathematics of Computation, Vol. 66, pp. 691–698, 1997.

    Google Scholar 

  11. HORST, R., and PARDALOS, P. M., Handbook of Global Optimization, Kluwer Academic Publishers, Dordrecht, Holland, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sutou, A., Dai, Y. Global Optimization Approach to Unequal Global Optimization Approach to Unequal Sphere Packing Problems in 3D. Journal of Optimization Theory and Applications 114, 671–694 (2002). https://doi.org/10.1023/A:1016083231326

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1016083231326

Navigation