Geometric batch optimization for packing equal circles in a circle on large scale - Université de Picardie Jules Verne Accéder directement au contenu
Article Dans Une Revue Expert Systems with Applications Année : 2024

Geometric batch optimization for packing equal circles in a circle on large scale

Résumé

The problem of packing equal circles in a circular container is a classic and famous packing problem, which is well-studied in academia and has a variety of applications in industry. The problem is computationally challenging, and researchers mainly focus on small to moderate-scale instances with the number of circular items less than 320 in the literature. In this work, we aim to solve this problem on large scale, and it is the bottleneck for most global optimization problems. Specifically, we propose a novel geometric batch optimization method that makes batch gradient descent based on the geometric locations of packing items. This method not only can speed up the convergence process of continuous optimization significantly but also reduce the memory requirement during the program’s runtime. Then, we propose a heuristic search method, called solution-space exploring and descent, that can discover a feasible solution efficiently on large scale. Besides, we propose an adaptive neighbor object maintenance method to maintain the neighbor structure applied in the continuous optimization process. In this way, we can find high-quality solutions on large-scale instances within reasonable computational times. Extensive experiments on the benchmark instances sampled from 300 to 1000 show that our proposed algorithm outperforms the state-of-the-art algorithms and performs excellently on large-scale instances. In particular, our algorithm found 10 improved solutions among the 21 well-studied moderate-scale instances and 95 improved solutions among the 101 sampled large-scale instances. Furthermore, our geometric batch optimization, heuristic search, and adaptive maintenance methods are general and can be adapted to other packing and continuous optimization problems.
Fichier non déposé

Dates et versions

hal-04543462 , version 1 (12-04-2024)

Identifiants

Citer

Jianrong Zhou, Kun He, Jiongzhi Zheng, Chu-Min Li. Geometric batch optimization for packing equal circles in a circle on large scale. Expert Systems with Applications, 2024, pp.123952. ⟨10.1016/j.eswa.2024.123952⟩. ⟨hal-04543462⟩

Collections

U-PICARDIE MIS
4 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More