A New Cut-Based Genetic Algorithm for Graph Partitioning Applied to Cell Formation

dc.contributor.authorBoulif, Menouar
dc.date.accessioned2020-12-29T08:01:28Z
dc.date.available2020-12-29T08:01:28Z
dc.date.issued2020
dc.description.abstractCell formation is a critical step in the design of cellular manufacturing systems. Recently, it was tackled by using a cut-based-graph-partitioning model. This model meets real-life production systems requirements as it uses the actual amount of product flows, it looks for the suitable number of cells, and it takes into account the natural constraints such as operation sequences, maximum cell size, cohabitation and non-cohabitation constraints. Based on this model, we propose an original encoding representation to solve the problem by using a genetic algorithm. We discuss the performance of this new GA in comparison to some approaches taken from the literature when they are applied to a set of medium sized instances. Given the results we obtained, it is reasonable to assume that the new GA will provide similar results for large real-life instances.en_US
dc.identifier.citationHeuristics for Optimization and Learningen_US
dc.identifier.isbn978-3-030-58929-5
dc.identifier.isbn978-3-030-58930-1
dc.identifier.isbnhttps://link.springer.com/chapter/10.1007/978-3-030-58930-1_18
dc.identifier.urihttps://doi.org/10.1007/978-3-030-58930-1_18
dc.identifier.urihttps://dspace.univ-boumerdes.dz/handle/123456789/6051
dc.language.isoenen_US
dc.publisherspringeren_US
dc.relation.ispartofseriesStudies in Computational Intelligence;(SCI, volume 906) pp 269-284
dc.titleA New Cut-Based Genetic Algorithm for Graph Partitioning Applied to Cell Formationen_US
dc.typeBook chapteren_US

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Boulif2021_Chapter_ANewCut-BasedGeneticAlgorithmF.pdf
Size:
536.21 KB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: