A Virtual-Force Based Swarm Algorithm for ...
Type de document :
Pré-publication ou Document de travail
Titre :
A Virtual-Force Based Swarm Algorithm for Balanced Circular Bin Packing Problems
Auteur(s) :
Gamot, Juliette [Auteur]
DTIS, ONERA, Université Paris Saclay [Palaiseau]
Balesdent, Mathieu [Auteur]
DTIS, ONERA, Université Paris Saclay [Palaiseau]
Wuilbercq, Romain [Auteur]
DTIS, ONERA, Université Paris Saclay [Palaiseau]
Tremolet, Arnault [Auteur]
DTIS, ONERA, Université Paris Saclay [Palaiseau]
Melab, Nouredine [Auteur]
Optimisation de grande taille et calcul large échelle [BONUS]
Talbi, El-Ghazali [Auteur]
Optimisation de grande taille et calcul large échelle [BONUS]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Inria Lille - Nord Europe
Université de Lille
DTIS, ONERA, Université Paris Saclay [Palaiseau]
Balesdent, Mathieu [Auteur]
DTIS, ONERA, Université Paris Saclay [Palaiseau]
Wuilbercq, Romain [Auteur]
DTIS, ONERA, Université Paris Saclay [Palaiseau]
Tremolet, Arnault [Auteur]
DTIS, ONERA, Université Paris Saclay [Palaiseau]
Melab, Nouredine [Auteur]
Optimisation de grande taille et calcul large échelle [BONUS]
Talbi, El-Ghazali [Auteur]
Optimisation de grande taille et calcul large échelle [BONUS]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Inria Lille - Nord Europe
Université de Lille
Date de publication :
2023
Mot(s)-clé(s) en anglais :
Artificial Intelligence (cs.AI)
Neural and Evolutionary Computing (cs.NE)
FOS: Computer and information sciences
Neural and Evolutionary Computing (cs.NE)
FOS: Computer and information sciences
Discipline(s) HAL :
Informatique [cs]
Résumé en anglais : [en]
Balanced circular bin packing problems consist in positioning a given number of weighted circles in order to minimize the radius of a circular container while satisfying equilibrium constraints. These problems are NP-hard, ...
Lire la suite >Balanced circular bin packing problems consist in positioning a given number of weighted circles in order to minimize the radius of a circular container while satisfying equilibrium constraints. These problems are NP-hard, highly constrained and dimensional. This paper describes a swarm algorithm based on a virtual-force system in order to solve balanced circular bin packing problems. In the proposed approach, a system of forces is applied to each component allowing to take into account the constraints and minimizing the objective function using the fundamental principle of dynamics. The proposed algorithm is experimented and validated on benchmarks of various balanced circular bin packing problems with up to 300 circles. The reported results allow to assess the effectiveness of the proposed approach compared to existing results from the literature.Lire moins >
Lire la suite >Balanced circular bin packing problems consist in positioning a given number of weighted circles in order to minimize the radius of a circular container while satisfying equilibrium constraints. These problems are NP-hard, highly constrained and dimensional. This paper describes a swarm algorithm based on a virtual-force system in order to solve balanced circular bin packing problems. In the proposed approach, a system of forces is applied to each component allowing to take into account the constraints and minimizing the objective function using the fundamental principle of dynamics. The proposed algorithm is experimented and validated on benchmarks of various balanced circular bin packing problems with up to 300 circles. The reported results allow to assess the effectiveness of the proposed approach compared to existing results from the literature.Lire moins >
Langue :
Anglais
Collections :
Source :
Fichiers
- 2306.01021
- Accès libre
- Accéder au document