A New Ant Colony Optimization Algorithm for the Lower Bound of Sum Coloring Problem

Authors:
Sidi Mohamed Douiri;Souad Elbernoussi
Affiliations:
Research laboratory Mathematics Computing and Applications, Faculty of Sciences-Agdal, University Mohammed V, RP, Rabat, Morocco 1014;Research laboratory Mathematics Computing and Applications, Faculty of Sciences-Agdal, University Mohammed V, RP, Rabat, Morocco 1014
Venue:
Journal of Mathematical Modelling and Algorithms
Year:
2012

Citing 13
Cited 0

An introduction to chromatic sums

CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
The priority-based coloring approach to register allocation

ACM Transactions on Programming Languages and Systems (TOPLAS)
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

SIAM Journal on Computing
On chromatic sums and distributed resource allocation

Information and Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The Optimal Cost Chromatic Partition Problem for Trees and Interval Graphs

WG '96 Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science
Ant Colony Optimization

Ant Colony Optimization
Ant colony optimization theory: a survey

Theoretical Computer Science
An exact method for graph coloring

Computers and Operations Research
A graph coloring heuristic using partial solutions and a reactive tabu scheme

Computers and Operations Research
Graph colouring approaches for a satellite range scheduling problem

Journal of Scheduling
On Sum Coloring of Graphs with Parallel Genetic Algorithms

ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I
A modified ant colony system for solving the travelling salesman problem with time windows

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider an undirected graph G驴=驴(V, E), the minimum sum coloring problem (MSCP) asks to find a valid vertex coloring of G, using natural numbers (1,2,...), the aim is to minimize the total sum of colors. In this paper we are interested in the elaboration of an approximate solution for the minimum sum coloring problem (MSCP), more exactly we try to give a lower bound for MSCP by looking for a decomposition of the graph based on the metaheuristic of ant colony optimization (ACO). We test different instances to validate our approach.