A Population-Based Algorithm for the Sphere Packing Problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

A Population-Based Algorithm for the Sphere Packing Problem

(1) , (1) ,
1

Résumé

In this paper, the sphere packing problem is approximately solved with a population-based method. The sphere packing problem, known as the three-dimensional knapsack, occurs in several real-world applications and because of its NP-hardness it is however computationally challenging. The designed method combines a population approach and a tolerance strategy: the population tries to maintain the diversity of a series of subsets of configurations reached throughout an iterative procedure while the tolerance strategy tries to highlight the quality of the solutions throughout the search process. The performance of the designed approach is evaluated on reference instances of the literature, where its achieved bounds are compared to those obtained by more recent algorithms.
Fichier non déposé

Dates et versions

hal-03778931 , version 1 (16-09-2022)

Identifiants

Citer

Mhand Hifi, A. Mohamed Youssouf, L. Yousef. A Population-Based Algorithm for the Sphere Packing Problem. 2022 8TH INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT'22), May 2022, Istanbul, Turkey. pp.1455-1460, ⟨10.1109/CODIT55151.2022.9804051⟩. ⟨hal-03778931⟩

Collections

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

Altmetric

Partager

Gmail Facebook Twitter LinkedIn More