18 résultats avec le mot-clé: 'memetic algorithm minimum sum coloring problem'
This algorithm combines an original crossover based on the union of independent sets proposed in [1] and local search techniques dedicated to the minimum sum coloring problem
N/A
We develop a reduction memetic algorithm (RMA) for the graph coloring problem, a feasible and infeasible search algorithm (FISA) for the equitable coloring problem, an adaptive
N/A
We propose two families of greedy algorithms for solving MSCP, and suggest improvements to the two greedy algorithms most often referred to in the literature for solving the
N/A
HESA is also a hybrid search algorithm [24] that alternates between feasible and infea- sible regions of the search space. HESA relies on a double-crossover recombination method and
N/A
L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des
N/A
The proposed algorithm relies on a joint use of two dedicated crossover operators to generate offspring solutions and an iterated double-phase tabu search procedure to improve
N/A
The proposed algorithm relies on a joint use of two dedicated crossover operators to generate offspring solutions and an iterated double-phase tabu search procedure to improve
N/A
Universit´ e Paris 7-Denis Diderot Alg` ebre et G´ eom´ etrieM. Licence de math´ ematiques et informatique Ann´
N/A
The GVCP consists in finding the minimum number of colors (or equivalently the minimum number of subsets), called chromatic number χ(G), required to color (or equivalently to
N/A
En amont, si le processus de professionnalisation en formation initiale intensifie les contacts avec la pratique et vise à développer des compétences réflexives, si des
N/A
En amont, si le processus de professionnalisation en formation initiale intensifie les contacts avec la pratique et vise à développer des compétences réflexives, si des
N/A
previous work to the business process area with the consideration to its spe- cific characteristics, especially to adjust methods for sequence alignment to be able to
N/A
These results indicate that, by adapting the segment partitions to the view popularity, the proposed method is able to provide different levels of navigation interactivity for
N/A
- Territoire à Energie Positive pour la Croissance Verte (TEPCV) avec le Ministère de l’Environnement - Contrat d’Objectifs Territoire Energie Climat (COTEC) avec l’ADEME?.
N/A
There are other types of graph coloring, in particular the edge coloring problem is the problem of coloring the edges of a graph with a minimum number of colors such that no two
N/A
Next, there is a color distribution analysis of each layer, which results in a corrected table (matrix) of the color. The next stage of the resulting new three-layer matrix is
N/A
Genetic algorithms have been successfully applied to the resolution of combinatorial optimization problems, several algorithms have been developed; Potvin [14]
N/A
The documents may come from teaching and research institutions in France or abroad, or from public or private research centers.. L’archive ouverte pluridisciplinaire HAL, est
N/A