A hybrid algorithm for packing identical spheres into a container - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Expert Systems with Applications Année : 2018

A hybrid algorithm for packing identical spheres into a container

(1) , (1)
1

Résumé

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.
Fichier non déposé

Dates et versions

hal-03617894 , version 1 (23-03-2022)

Identifiants

Citer

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

Collections

U-PICARDIE EPROAD
5 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook Twitter LinkedIn More