Accéder directement au contenu Accéder directement à la navigation
Article dans une revue

A hybrid algorithm for packing identical spheres into a container

Abstract : Packing identical spheres occur in several commercial and industrial contexts, like automated radio surgical treatment planning and in materials science for studying the dynamic behavior of granular material systems. In this paper, a hybrid algorithm is proposed for approximately solving the identical sphere packing problem. Given a set of identical spheres and a large container (open or spherical container), the goal of the problem is to find a smallest container that contains all spheres without overlapping between spheres and between spheres and the container. The proposed algorithm combines both particle swarm optimization and an efficient continuous local optimization procedure. The swarm optimization generates a series of diversified populations of particles whereas the continuous optimization serves either to repair the infeasibility of solutions or improve their qualities. The performance of the proposed algorithm is evaluated on a set of standard benchmark instances and its obtained results are compared to those reached by the more recent methods available in the literature. The experimental part shows that the proposed approach remains competitive, where it is able to reach 47 new upper bounds out of the 93 tested instances. (C) 2017 Elsevier Ltd. All rights reserved.
Type de document :
Article dans une revue
Liste complète des métadonnées
Contributeur : Louise DESSAIVRE Connectez-vous pour contacter le contributeur
Soumis le : mercredi 23 mars 2022 - 18:08:12
Dernière modification le : samedi 17 septembre 2022 - 17:28:28




Mhand Hifi, Labib Yousef. A hybrid algorithm for packing identical spheres into a container. Expert Systems with Applications, Elsevier, 2018, 96, pp.249-260. ⟨10.1016/j.eswa.2017.11.052⟩. ⟨hal-03617894⟩



Consultations de la notice