On integrating an Iterated Variable Neighborhood Search within a bi-objective Genetic Algorithm: Sum Coloring of Graphs Case Application
References (12)
- et al.
On chromatic sums and distributed resource allocation
Information and Computation
(1998) - et al.
Minimum color sum of bipartite graphs
Journal of Algorithms
(1998) - et al.
Minimum sum set coloring of trees and line graphs of trees
Discrete Applied Mathematics
(2011) - et al.
Variable neighborhood search: Principles and applications
European journal of operational research
(2001) - et al.
Hybrid evolutionary algorithms for graph coloring
Journal of combinatorial optimization
(1999) - et al.
Improved bounds for sum multicoloring and scheduling dependent jobs with minsum criteria
There are more references available in the full text version of this article.
Cited by (2)
Population-based iterated greedy algorithm for the S-labeling problem
2023, Computers and Operations ResearchLocal search for weighted sum coloring problem
2021, Applied Soft ComputingCitation Excerpt :The weighted sum coloring problem (WSCP) is a variant of the sum coloring problem or the weighted vertex coloring problem, so CPLEX provides a possible solution for solving WSCP. Genetic algorithm is a classical metaheuristic algorithm, which is one of the most studied heuristic algorithms to solve graph coloring problems and has been used to solve some graph coloring problems, such as sum coloring problem [25], total graph coloring [26] etc. So, using genetic algorithm to solve WSCP is also a potentially feasible solution.
© 2018 Elsevier B.V. All rights reserved.