Accéder directement au contenu Accéder directement à la navigation
Communication dans un congrès

A Population-Based Algorithm for the Sphere Packing Problem

Abstract : 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.
Type de document :
Communication dans un congrès
Liste complète des métadonnées

https://hal-u-picardie.archives-ouvertes.fr/hal-03778931
Contributeur : Louise DESSAIVRE Connectez-vous pour contacter le contributeur
Soumis le : vendredi 16 septembre 2022 - 11:56:43
Dernière modification le : samedi 17 septembre 2022 - 03:07:01

Identifiants

Collections

Citation

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⟩

Partager

Métriques

Consultations de la notice

0