A critical element-guided perturbation strategy for iterated local search

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5482 LNCS, Issue , 2009, Pages 1-12

  Lü, Zhipeng ^a   Hao, Jin Kao ^a  

^a UNIVERSITÉ D'ANGERS   (France)

Author keywords

Course timetabling; Critical element guided perturbation; Graph coloring; Iterated local search; Perturbation operator

Indexed keywords

COURSE TIMETABLING; CRITICAL ELEMENT-GUIDED PERTURBATION; GRAPH COLORING; ITERATED LOCAL SEARCH; PERTURBATION OPERATOR;

COMBINATORIAL OPTIMIZATION;

COLORING;

EID: 67650660995     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-01009-5_1     Document Type: Conference Paper

References (20)

1. Blöchliger, I., Zufferey, N.: A graph coloring heuristic using partial solutions and a reactive tabu scheme. Computers and Operations Research 35(3), 960-975 (2008) (Pubitemid 47368857)
2. Bŕelaz, D.: New methods to color the vertices of a graph. Communications of the ACM 22(4), 251-256 (1979) (Pubitemid 9452014)
3. Chiarandini, M., Stützle, T.: An application of iterated local search to graph coloring. In: Johnson, D.S., Mehrotra, A., Trick, M.A. (eds.) Proceedings of the Computational Symposium on Graph Coloring and its Generalizations, Ithaca, New York, USA, pp. 112-125 (2002)
4. De Cesco, F., Di Gaspero, L., Schaerf, A.: Benchmarking curriculum-based course timetabling: Formulations, data formats, instances, validation, and results. In: Proceedings of the 7th PATAT Conference (2008), http://tabu.diegm.uniud.it/ctt/DDS2008.pdf
5. Di Gaspero, L., Schaerf, A.: Neighborhood portfolio approach for local search applied to timetabling problems. Journal of Mathematical Modeling and Algorithms 5(1), 65-89 (2006)
6. Dorne, R., Hao, J.K.: Tabu search for graph coloring, T-colorings and set Tcolorings. In: Voss, S., Martello, S., Osman, I.H., Roucairol, C. (eds.) Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, ch. 6, pp. 77-92. Kluwer, Dordrecht (1998)
7. Fleurent, C., Ferland, J.A.: Object-oriented implementation of heuristic search methods for graph coloring, maximum clique, and satisfiability. In: Johnson, D.S., Trick, M.A. (eds.) DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.26, pp. 619-652. American Mathematical Society, Providence (1996)
8. Galinier, P., Hao, J.K.: Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization 3(4), 379-397 (1999) (Pubitemid 129575323)
9. Galinier, P., Hertz, A., Zufferey, N.: An adaptive memory algorithm for the Kcolouring problem. Discrete Applied Mathematics 156(2), 267-279 (2008) (Pubitemid 350251597)
10. Glover, F., Parker, M., Ryan, J.: Coloring by tabu branch and bound. In: Johnson, D.S., Trick, M.A. (eds.) DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.26, pp. 285-307. American Mathematical Society, Providence (1996)
11. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Boston (1997)
12. Hansen, P., Mladenović, N.: Variable neighborhood search: principles and applications. European Journal of Operational Research 130, 449-467 (2001) (Pubitemid 32875304)
13. Hertz, A., De Werra, D.: Using tabu search techniques for graph coloring. Computing 39(4), 345-351 (1987) (Pubitemid 18562739)
14. Hoos, H.H., Stützle, T.: Stochastic local search: foundations and applications. Morgan Kaufmann, San Francisco (2004)
15. Lach, G., Lübbecke, M.E.: Curriculum based course timetabling: optimal solutions to the udine benchmark instances. In: Proceedings of the 7th PATAT Conference (2008), http://www.math.tu-berlin.de/~luebbeck/papers/udine.pdf
16. Lourenco, H.R., Martin, O., Stützle, T.: Iterated local search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Meta-heuristics, pp. 321-353. Springer, Heidelberg (2003)
17. Lü, Z., Hao, J.K.: Adaptive tabu search for course timetabling. European Journal of Operational Research (2009), doi:10.1016/j.ejor.2008.12.007
18. Müller, T.: ITC2007 solver description: A hybrid approach. In: Proceedings of the 7th PATAT Conference (2008), http://www.unitime.org/papers/ itc2007.pdf
19. Tsang, E.: Foundations of constraint satisfaction. Academic Press, London (1993)
20. Zhang, Q., Sun, J.: Iterated local search with guided mutation. In: Proceedings of IEEE Congress on Evolutionary Computation, pp. 924-929 (2006) (Pubitemid 47130599)