Heuristic Methods for Graph Coloring Problems

More documents

Recommendations

Info

$Course Syllabus - Penn State Harrisburg Math/Computer Sciences ...$

$A Simulator for the MARIE Architecture - Penn State Harrisburg Math ...$

and Satisfiability, Second DIMACS Implementation Challenge, 1993. [6] A. Hertz and D. de Werra. Using tabu search techniques for graph coloring. Computing, 39:345–351, 1987. [7] D. S. Johnson, C. A. Aragon, L. A. Mcgeoch, and C. Schevon. Optimization by simulated annealing: An experimental evaluation c part ii (graph coloring and number partitioning). Operations Research, 31:378–406, 1991. [8] David S. Johnson and Michael A. Trick (Editors). Cliques, Coloring and Satisfiability, Second DIMACS Implementation Challenge. American Mathematical Society, 1993. [9] David E. Joslin and David P. Clements. “squeaky wheel” optimization. In Proceedings of American Association of Artificial Intelligence National Conference 1998, pages 340–346, 1998. [10] Gray Lewandowski and Anne Condon. Expreiments with parallel graph coloring heuristics and applications of graph coloring. Cliques, Coloring and Satisfiability, Second DIMACS Implementation Challenge, 1993. [11] Andrew Lim, Brian Rodrigues, and Yi Zhu. Crane scheduling using swo with local search. In Proceedings of 4th Asia-Pacific Conference on Simulated Evolution and Learning, 2002. [12] Andrew Lim, Xingwen Zhang, and Yi Zhu. A hybrid method for the graph coloring problem and its generalizations. In 5th Metaheuristics International Conference (MIC 2003), 2002. [13] Craig Morgenstern. Distributed coloration neighborhood search. Cliques, Coloring and Satisfiability, Second DIMACS Implementation Challenge, 1993. [14] Eun-Jon Park, Yong-Hyuk Kim, and Byung-Ro Moon. Genetic search for fixed channel assignment problem with limited bandwidth. In Proceedings of Genetic and Evolutionary Computation Conference, pages 1772–1779, 2002. [15] Steven Prestwich. Constrained bandwidth multicoloration neighborhoods. In Proceedings of Computational Symposium on Graph Coloring and its Generalizations, 2002. [16] E. C. Sewell. An improved algorithm for exact graph coloring. Cliques, Coloring and Satisfiability, Second DIMACS Implementation Challenge, 1993. 938
Graph M1 M2 M3 Graph M1 M2 M3 k t k t k t k t k t k t GEOM20 - - 28 0 28 4 GEOM80 - - 63 0 63 551 GEOM20a - - 30 0 30 3 GEOM80a - - 68 0 68 476 GEOM20b - - 8 0 8 7 GEOM80b - - 25 0 25 111 GEOM30 - - 26 0 26 61 GEOM90 - - 51 0 51 697 GEOM30a - - 40 0 40 99 GEOM90a - - 65 0 65 625 GEOM30b - - 11 0 11 20 GEOM90b - - 28 0 28 135 GEOM40 - - 31 0 31 131 GEOM100 - - 60 0 60 845 GEOM40a - - 46 0 46 138 GEOM100a - - 81 0 81 854 GEOM40b - - 14 0 14 29 GEOM100b - - 30 0 30 156 GEOM50 - - 35 0 35 227 GEOM110 - - 62 0 62 1022 GEOM50a - - 61 0 61 312 GEOM110a - - 91 0 91 1172 GEOM50b - - 17 0 17 46 GEOM110b - - 37 0 37 211 GEOM60 - - 36 0 36 275 GEOM120 - - 64 0 64 1268 GEOM60a - - 65 0 65 391 GEOM120a - - 93 0 93 2349 GEOM60b - - 22 0 22 64 GEOM120b - - 34 0 34 489 GEOM70 - - 44 0 44 374 GEOM70a - - 71 0 71 439 GEOM70b - - 22 0 22 84 Table 3: Experimental Results for MCP Graph M1 M2 M3 Graph M1 M2 M3 k t k t k t k t k t k t GEOM20 159 56 149 0 149 176 GEOM80 - - 394 4041 383 2159 GEOM20a 175 145 169 16 169 169 GEOM80a - - 379 677 379 2006 GEOM20b 44 25 44 0 44 25 GEOM80b 152 1380 145 3230 141 417 GEOM30 168 178 160 0 160 241 GEOM90 - - 335 4095 332 2623 GEOM30a 235 64 211 10 209 425 GEOM90a - - 382 10404 377 2587 GEOM30b 79 14 77 0 77 69 GEOM90b - - 157 648 157 489 GEOM40 189 135 167 3 167 496 GEOM100 - - 413 631 404 3283 GEOM40a 260 24 214 358 213 573 GEOM100a - - 462 172 459 3529 GEOM40b 80 94 76 8 74 108 GEOM100b - - 172 4893 170 584 GEOM50 257 96 224 41 224 819 GEOM110 - - 389 577 383 3893 GEOM50a 395 299 326 96 318 125 GEOM110a - - 501 4671 494 4661 GEOM50b 89 94 87 53 87 162 GEOM110b - - 210 12 206 716 GEOM60 279 514 258 46 258 1016 GEOM120 - - 409 1825 402 4317 GEOM60a - - 368 3748 358 1717 GEOM120a - - 564 5335 556 6688 GEOM60b 128 1012 119 300 116 246 GEOM120b - - 201 869 199 1028 GEOM70 310 1019 279 25 273 1458 GEOM70a - - 478 417 469 1987 GEOM70b 133 766 124 136 121 312 Table 4: Experimental Results for Bandwidth MCP 939
Page 1 and 2: 2005 ACM Symposium on Applied Compu
Page 3 and 4: 3 k = 2 2 k = 1 2 3 2 k = 3 2 Split
Page 5: Parameters Pure Coloring Bandwidth

Heuristic Methods for Graph Coloring Problems

Create successful ePaper yourself

Delete template?

Save as template?