Graph Coloring with Adaptive Evolutionary Algorithms
作者： A.E. Eiben , J.K. van der Hauw , J.I. van Hemert
关键词:
摘要: … problem size than the other two algorithms and indicates a linear computational complexity. … EA, the Grouping GA and DSatur is made. We observe that the Grouping GA exhibits the …
springer.com
acm.org
sci-hub.se 参考文章(42)
Paul Morris, The breakout method for escaping from local minima national conference on artificial intelligence. pp. 40- 45 ,(1993)
Bart Selman, Henry Kautz, Domain-independent extensions to GSAT: solving large structured satisfiability problems international joint conference on artificial intelligence. pp. 290- 295 ,(1993)
Joseph C. Culberson, Feng Luo, Exploring the k-colorable landscape with Iterated Greedy. Cliques, Coloring, and Satisfiability. pp. 245- 284 ,(1993)
Fred Glover, Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges Operations Research/Computer Science Interfaces Series. pp. 1- 75 ,(1997) , 10.1007/978-1-4615-4102-8_1
Bernard Nudel, Consistent-labeling problems and their algorithms national conference on artificial intelligence. pp. 128- 132 ,(1982)
Hans-Paul Paul Schwefel, Evolution and Optimum Seeking: The Sixth Generation John Wiley & Sons, Inc.. ,(1993)
B.R. Fox, M.B. McMahon, Genetic Operators for Sequencing Problems Foundations of Genetic Algorithms. ,vol. 1, pp. 284- 300 ,(1991) , 10.1016/B978-0-08-050684-5.50021-5
Joseph Culberson, On the Futility of Blind Search ,(1996) , 10.7939/R3WP9T925
Gregor von Laszewski, Intelligent Structural Operators for the k-way Graph Partitioning Problem ICGA. pp. 45- 52 ,(1991)
A. E. Eiben, P. -E. Raué, Zs. Ruttkay, Genetic algorithms with multi-parent recombination parallel problem solving from nature. pp. 78- 87 ,(1994) , 10.1007/3-540-58484-6_252