Copyright © 2026 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{194880,
        author = {Hakim AKEB},
        title = {A Look-Forward Exploring Strategy for the Sphere Packing Problem},
        journal = {International Journal of Innovative Research in Technology},
        year = {2026},
        volume = {12},
        number = {10},
        pages = {5990-5995},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=194880},
        abstract = {Cutting and Packing (C&P) problems are largely studied in the literature. In this work, a look-forward exploring strategy is proposed and applied to the sphere strip packing problem to place a set of n spheres of known radii into a parallelepiped of fixed width and height but variable length. The objective is then to minimize the length. The computational results, compared with other already published works in the literature, show the effectiveness of the proposed algorithm since it improves most of the results.},
        keywords = {Cutting-and-Packing, Local Search, Look-Forward Strategy, Sphere Packing, Strip Packing.},
        month = {March},
        }