Open Access Open Access  Restricted Access Subscription or Fee Access

An Ant Algorithm for the Sum Coloring Problem

Sidi Mohamed Douiri, Souad El Bernoussi

Abstract


The sum coloring problem (MSCP) has serval applications in resource allocation and scheduling. It is related to the vertex coloring problem where the aim is to minimize the sum of colors in a graph. In this paper, we use a hybridization of Max-Min Ant System (MMAS) an extension of Ant System and a local heuristic based on an improvement of the maximal independent set algorithm (DBG).

Keywords


sum coloring problem, Max-Min Ant System (MMAS), maximal independent set.

Full Text:

PDF


Disclaimer/Regarding indexing issue:

We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information. Also: DOI is paid service which provided by a third party. We never mentioned that we go for this for our any journal. However, journal have no objection if author go directly for this paid DOI service.