On integrating an iterated variable neighborhood search within a bi-objective genetic algorithm: sum coloring of graphs case application

DOI10.1016/J.ENDM.2018.03.008zbMath1408.90345OpenAlexW2797984069WikidataQ129985576 ScholiaQ129985576MaRDI QIDQ1791912

Jouhaina Chaouachi Siala, Olfa Harrabi, Hend Bouziri

Publication date: 11 October 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2018.03.008

zbMATH Keywords

variable neighborhood searchlocal optimizationhybrid searchminimum sum coloring problembi-objective modelizationVEGA algorithm

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Population-based iterated greedy algorithm for the S-labeling problem

Cites Work

• Unnamed Item
• Minimum sum set coloring of trees and line graphs of trees
• On chromatic sums and distributed resource allocation
• Hybrid evolutionary algorithms for graph coloring
• Lower Bounds for the Minimal Sum Coloring Problem
• Minimum Color Sum of Bipartite Graphs
• Approximation and Online Algorithms
• Variable neighborhood search: Principles and applications

This page was built for publication: On integrating an iterated variable neighborhood search within a bi-objective genetic algorithm: sum coloring of graphs case application