A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing

Computers and Operations Research

Volumn 36, Issue 7, 2009, Pages 2295-2310

  Lewis, Rhyd ^a  

^a CARDIFF UNIVERSITY   (United Kingdom)

Author keywords

Graph colouring; Grouping problems; Metaheuristics; Packing

Indexed keywords

ABERRATIONS; BINS; GENETIC ALGORITHMS;

BIN PACKINGS; CASE STUDIES; GENERIC METHODS; GRAPH COLOURING; GROUPING GENETIC ALGORITHMS; GROUPING PROBLEMS; ITERATED GREEDY ALGORITHMS; METAHEURISTICS; PROBLEM INSTANCES;

OPTICAL PROPERTIES;

EID: 57649240453     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2008.09.004     Document Type: Article

References (57)

1. Carter M., Laporte G., and Lee S.Y. Examination timetabling: algorithmic strategies and applications. Journal of the Operational Research Society 47 (1996) 373-383
2. Lewis R., and Paechter B. Finding feasible timetables using group based operators. IEEE Transactions on Evolutionary Computation 11 3 (2007) 397-413
3. Thompson J., and Dowsland K. A robust simulated annealing based examination timetabling system. Computers & Operations Research 25 7/8 (1998) 637-648
4. Martello S., and Toth P. Lower bounds and reduction procedures for the bin packing problem. Discrete Applied Mathematics 28 (1990) 59-70
5. Schwerin P., and Wascher G. The bin-packing problem: a problem generator and some numerical experiments with FFD packing and MTP. International Transactions in Operational Research 4 (1997) 377-389
6. Falkenauer E. Solving equal piles with the grouping genetic algorithm. In: Eshelman L.J. (Ed). Proceedings of the 6th international conference on genetic algorithms (1995), Morgan Kaufmann, Los Altos, CA 492-497
7. Valenzuela C.M. A study of permutation operators for minimum span frequency assignment using an order based representation. Journal of Heuristics 7 (2001) 5-21
8. Jensen T.R., and Toft B. Graph coloring problems. 1st ed. (1994), Wiley-Interscience, New York
9. von Lazewski G.V. Intelligent structural operators for the k-way graph partitioning problem. In: Belew R.K., and Booker L.B. (Eds). Forth international conference on genetic algorithms (1991), Morgan Kaufmann, San Mateo, CA, USA 45-52
10. Garey M.R., and Johnson D.S. Computers and intractability-a guide to NP-completeness. 1st ed. (1979), WH Freeman and Company, San Francisco
11. Falkenauer E. Genetic algorithms and grouping problems (1998), Wiley, New York
12. Morgenstern C. Algorithms for general graph coloring. PhD thesis, University of New Mexico; 1989.
13. Thompson J., and Dowsland K. Variants of simulated annealing for the examination timetabling problem. Annals of Operational Research 63 1 (1996) 105-128
14. Khuri S., Walters T., and Sugono Y. A grouping genetic algorithm for coloring the edges of graphs. SAC'00: Proceedings of the 2000 ACM symposium on applied computing (2000), ACM Press, New York 422-427
15. Levine J, Ducatelle F. Ant colony optimisation and local search for bin packing and cutting stock problems. Journal of the Operational Research Society 2003;55(12)(7):705-16.
16. Brelaz D. New methods to color the vertices of a graph. Communications of the ACM 22 4 (1979) 251-256
17. Leighton F.T. A graph coloring algorithm for large scheduling problems. Journal of Research of the National Bureau of Standards 84 6 (1979) 489-506
18. Prestwich S. Using an incomplete version of dynamic backtracking for graph colouring. Electronic Notes in Discrete Mathematics 1 (1999) 61-73
19. Mehrotra A., and Trick M. A column generation approach for graph coloring. INFORMS Journal on Computing 8 (1996) 344-354
20. Randall-Brown J. Chromatic scheduling and the chromatic number problem. Management Science 19 4 (1972) 456-463
21. Scholl A., Klein R., and Jurgens C. Bison: a fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Computers & Operations Research 25 7 (1997) 627-645
22. Dorne R., and Hao J.-K. A new genetic local search algorithm for graph coloring. In: Eiben A., Back T., Schoenauer M., and Schwefel H. (Eds). Parallel problem solving from nature (PPSN) V vol. 1498 (1998), Springer, Berlin 745-754
23. Eiben A.E., van der Hauw J.K., and van Hemert J.I. Graph coloring with adaptive evolutionary algorithms. Journal of Heuristics 4 1 (1998) 25-46
24. Erben E. A grouping genetic algorithm for graph colouring and exam timetabling. In: Burke E., and Erben W. (Eds). Practice and theory of automated timetabling (PATAT) III vol. 2079 (2001), Springer, Berlin 132-158
25. Falkenauer E. A new representation and operators for genetic algorithms applied to grouping problems. Evolutionary Computation 2 2 (1994) 123-144
26. Galinier P., and Hao J.-K. Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization 3 (1999) 379-397
27. Tucker A., Crampton J., and Swift S. RGFGA: an efficient representation and crossover for grouping genetic algorithms. Evolutionary Computation 13 4 (2005) 477-499
28. Chiarandini M, Stützle T. An application of iterated local search to graph coloring. In: Johnson D, Mehrotra A, Trick M, editors. Proceedings of the computational symposium on graph coloring and its generalizations, New York, USA, 2002. p. 112-25.
29. Paquete L, Stützle T. An experimental investigation of iterated local search for coloring graphs. In: Cagnoni S, Gottlieb J, Hart E, Middendorf M, Raidl G, editors. Applications of evolutionary computing, Proceedings of EvoWorkshops2002: EvoCOP, EvoIASP, EvoSTim, Kinsale, Ireland, vol. 2279. Berlin: Springer; 3-4, 2002. p. 121-30.
30. Chams M., Hertz A., and Dubuis O. Some experiments with simulated annealing for coloring graphs. European Journal of Operations Research 32 (1987) 260-266
31. Hertz A., and de Werra D. Using tabu search techniques for graph coloring. Computing 39 4 (1987) 345-351
32. Avanthay C., Hertz A., and Zufferey N. A variable neighborhood search for graph coloring. European Journal of Operations Research 151 (2003) 379-388
33. Ross P., Hart E., and Corne D. Genetic algorithms and timetabling. In: Ghosh A., and Tsutsui K. (Eds). Advances in evolutionary computing: theory and applications (2003), Springer, New York 755-771
34. Costa D., and Hertz A. Ants can colour graphs. Journal of the Operational Research Society 48 (1997) 295-305
35. Dowsland K., and Thompson J. An improved ant colony optimisation heuristic for graph colouring. Discrete Applied Mathematics 156 (2008) 313-324
36. Corne D., Ross P., and Fang H. Evolving timetables. In: Chambers L.C. (Ed). The practical handbook of genetic algorithms vol. 1 (1995), CRC Press, Boca Raton, FL 219-276
37. Paechter B., Rankin R., Cumming A., and Fogarty T. Timetabling the classes of an entire university with an evolutionary algorithm. In: Baeck T., Eiben A., Schoenauer M., and Schwefel H. (Eds). Parallel problem solving from nature (PPSN) V vol. 1498 (1998), Springer, Berlin 865-874
38. Culberson J., and Luo F. Exploring the k-colorable landscape with iterated greedy. In: Johnson D.S., and Trick M.A. (Eds). Cliques, coloring, and satisfiability: second DIMACS implementation challenge vol. 26 (1996), American Mathematical Society, Providence, RI 245-284
39. Falkenauer E. A hybrid grouping genetic algorithm for bin packing. Journal of heuristics 2 1 (1996) 5-30
40. Di Gaspero L., and Schaerf A. Neighborhood portfolio approach for local search applied to timetabling problems. Journal of Mathematical Modelling and Algorithms 5 1 (2006) 65-89
41. Lourenco H, Martin O, Stutzle T. Applying iterated local search to the permutation flow shop problem. In: Handbook of metaheuristics. Boston, MA: Kluwer Academic Publishers; 2003.
42. Culberson J. 〈http://web.cs.ualberta.ca/∼joe/coloring/〉.
43. Craenen BGW. Solving constraint satisfaction problems with evolutionary algorithms. PhD thesis, Vrije Universiteit Amsterdam; 2005.
44. Lewis R. Metaheuristics can solve Sudoku puzzles. Journal of heuristics 13 4 (2007) 387-401
45. Wolpert D.H., and Macready W.G. No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation 1 1 (1997) 67-82
46. Juhos I., and van Hemert J.I. Increasing the efficiency of graph colouring algorithms with a representation based on vector operations. Journal of Software 1 2 (2006) 24-33
47. Craenen B.G.W., Eiben A.E., and van Hemert J.I. Comparing evolutionary algorithms on binary constraint satisfaction problems. IEEE Transactions on Evolutionary Computation 7 5 (2003) 424-444
48. Cheeseman P, Kanefsky B, Taylor W. Where the really hard problems are. In: Proceedings of IJCAI-91, 1991. p. 331-7.
49. Turner J.S. Almost all k-colorable graphs are easy to color. Journal of Algorithms 9 (1988) 63-82
50. Beasley J. 〈http://people.brunel.ac.uk/∼mastjjb/jeb/orlib/binpackinfo.html〉.
51. Ross P, Marin-Blazquez JG, Schulenburg S, Hart E. Learning a procedure that can solve hard bin-packing problems: A new ga-based approach to hyper-heuristics. In: Cantu-Paz E, Foster JA, Deb K, Davis L, Roy R, O'Reilly UM, Beyer HG, Standish RK, Kendall G, Wilson SW, Harman M, Wegener J, Dasgupta D, Potter MA, Schultz AC, Dowsland KA, Jonoska N, Miller JF, editors, GECCO, vol. 2724 of Lecture Notes in Computer Science, Berlin: Springer; 2003. p. 1295-306.
52. Gent I. Heuristic solution of open bin packing problems. Journal of Heuristics 3 4 (1998) 299-304
53. Falkenauer E. On method overfitting. Journal of Heuristics 4 3 (1998) 281-287
54. Gent I. A response to "on method overfitting". Journal of Heuristics 5 1 (1999) 109-111
55. Scholl A, Klein R. 〈http://www.wiwi.uni-jena.de/entscheidung/binpp/index.htm〉.
56. Lodi A., Martello S., and Vigo G. Recent advances on two-dimensional bin packing problems. Discrete Applied Mathematics 123 (2002) 379-396
57. Friedman E. 〈http://www.stetson.edu/∼efriedma/packing.html〉.