An efficient solution space exploring and descent method for packing equal spheres in a sphere - Université de Picardie Jules Verne Accéder directement au contenu
Article Dans Une Revue Computers and Operations Research Année : 2024

An efficient solution space exploring and descent method for packing equal spheres in a sphere

Shuo Ren
Yanli Liu

Résumé

The problem of packing equal spheres in a spherical container is a classic global optimization problem, which has attracted enormous studies in academia and found various applications in industry. This problem is computationally very challenging, and many efforts focus on small-scale instances with the number of spherical items less than 200 in the literature. In this work, we propose an efficient local search heuristic algorithm named solution space exploring and descent for solving this problem, which can quantify the solution’s quality to determine the number of exploring actions and quickly discover a high-quality configuration. Besides, we propose an adaptive neighbor item maintenance method to speed up the convergence of the continuous optimization process and reduce the time consumption. Computational experiments on a large number of benchmark instances with spherical items show that our algorithm significantly outperforms the state-of-the-art algorithm. Specifically, our algorithm improves 274 best-known results and matches 84 best-known results out of the 396 well-known benchmark instances.

Dates et versions

hal-04473319 , version 1 (22-02-2024)

Identifiants

Citer

Jianrong Zhou, Shuo Ren, Kun He, Yanli Liu, Chu-Min Li. An efficient solution space exploring and descent method for packing equal spheres in a sphere. Computers and Operations Research, 2024, 164, pp.106522. ⟨10.1016/j.cor.2023.106522⟩. ⟨hal-04473319⟩
3 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More