Optimization of Graph Coloring Problem using Hybrid Selection: A Genetic Algorithm Approach

[1]  Katsumi Inoue,et al.  Distance based hybrid genetic algorithm: an application for the graph coloring problem , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[2]  Lata Narayanan,et al.  Static Frequency Assignment in Cellular Networks , 2001, Algorithmica.

[3]  Zbigniew Michalewicz,et al.  Parameter control in evolutionary algorithms , 1999, IEEE Trans. Evol. Comput..

[4]  Edward G. Coffman,et al.  Scheduling File Transfers , 1985, SIAM J. Comput..

[5]  Yen-Wei Chen,et al.  An evolutionary approach for graph coloring , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).

[6]  Roman V. Yampolskiy,et al.  Genetic Algorithm Applied to the Graph Coloring Problem , 2012, MAICS.

[7]  Charles Fleurent,et al.  Genetic and hybrid algorithms for graph coloring , 1996, Ann. Oper. Res..

[8]  Thomas Bäck,et al.  Evolutionary computation: comments on the history and current state , 1997, IEEE Trans. Evol. Comput..

[9]  Han Hoogeveen,et al.  Complexity of Scheduling Multiprocessor Tasks with Prespecified Processor Allocations , 1994, Discret. Appl. Math..

[10]  Ian Holyer,et al.  The NP-Completeness of Edge-Coloring , 1981, SIAM J. Comput..

[11]  Lalit M. Patnaik,et al.  Adaptive probabilities of crossover and mutation in genetic algorithms , 1994, IEEE Trans. Syst. Man Cybern..

[12]  Kenneth A. De Jong,et al.  A formal analysis of the role of multi-point crossover in genetic algorithms , 1992, Annals of Mathematics and Artificial Intelligence.