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

A Population-Based Algorithm for the k-Clustering Minimum Biclique Completion Problem

Abstract : In this paper we propose a population-based method for tackling the k-clustering minimum bi-clique completion problem. We investigate the use of the discrete particle swarm optimisation combined with a special neighborhood decent procedure. Often configuration generated by the so-called swarm process induces infeasible solutions. In order to overcome to these situations, we introduce a tolerance strategy, where its aim is to highlight the quality of the current solution where an enlarging search space is considered. The behavior of the designed method is evaluated on some benchmark instances and its provided bounds are compared to those achieved by more recent methods available in the literature. New bounds are discovered.
Type de document :
Communication dans un congrès
Liste complète des métadonnées
Contributeur : Louise DESSAIVRE Connectez-vous pour contacter le contributeur
Soumis le : vendredi 16 septembre 2022 - 11:56:41
Dernière modification le : samedi 17 septembre 2022 - 03:07:01




Gérard-Michel Cochard, Mhand Hifi, E-S Samod, L. Yousef. A Population-Based Algorithm for the k-Clustering Minimum Biclique Completion Problem. 2022 8TH INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT'22), May 2022, Istanbul, Turkey. pp.1461-1466, ⟨10.1109/CODIT55151.2022.9804072⟩. ⟨hal-03778929⟩



Consultations de la notice