Abstract

The classical set partitioning problem is defined on a graph G = (V, E) and consists of partitioning V in disjoint subsets. In this study, we propose a Split procedure to minimize the number of partitions for a given sequence of nodes, considering local and global capacity constraints on the partitions. The procedure relies on dynamic programming and it is applied here to the SONET Ring Assignment Problem. It is used as a decoding function in a Biased Random Key Genetic Algorithm and as a constructive heuristic in a hybrid multistart Evolutionary Local Search. High-quality results are computed on classic benchmarks.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.