Solving the unsupervised graph partitioning problem with genetic algorithms: Classical and new encoding representations
| dc.contributor.author | Chaouche, Ali | |
| dc.contributor.author | Boulif, Menouar | |
| dc.date.accessioned | 2021-10-18T08:44:01Z | |
| dc.date.available | 2021-10-18T08:44:01Z | |
| dc.date.issued | 2019 | |
| dc.description.abstract | The Graph Partitioning Problem (GPP) is one of the most ubiquitous models that operations research practitioners encounter. Therefore, several methods have been proposed to solve it. Among these methods, Genetic Algorithm (GA) appears to carry very promising performances. However, despite the huge number of papers being published with this approach, only few of them deal with the encoding representation and its role in the reported performances. In this paper, we present classical and new encoding representations for the unsupervised graph partitioning problem. That is, we suppose that the number of partition subsets (clusters) is not known apriori. Next, we conduct an empiric comparison to identify the most promising encodings. | en_US |
| dc.identifier.issn | 0360-8352 | |
| dc.identifier.uri | https://doi.org/10.1016/j.cie.2019.106025 | |
| dc.identifier.uri | https://dspace.univ-boumerdes.dz/handle/123456789/7242 | |
| dc.language.iso | en | en_US |
| dc.publisher | Elsevier | en_US |
| dc.relation.ispartofseries | Computers & Industrial Engineering /Vol.137 (2019); | |
| dc.subject | Graph partitioning | en_US |
| dc.subject | K-way partition | en_US |
| dc.subject | Genetic algorithm | en_US |
| dc.subject | Encoding representatio | en_US |
| dc.subject | P-median | en_US |
| dc.title | Solving the unsupervised graph partitioning problem with genetic algorithms: Classical and new encoding representations | en_US |
| dc.type | Article | en_US |