论文信息 - A Multineighbourhood Local Search Solver for the Timetabling Competition TTComp 2002

A Multineighbourhood Local Search Solver for the Timetabling Competition TTComp 2002

The International Timetabling Competition 2002 has been organized by the Metaheuristic Network in order to compare different algorithms in a common measurable ground. All information about problem definition, instances, rules, and solution evaluation is available at the webpage http://www.idsia.ch/ Files/ttcomp2002/, and for the sake of brevity we do not repeat them here. We have participated in the competition, and in this abstract, we discuss our solution method, our scores, and we provide some personal comments about the general outcomes.

Luca Di Gaspero | Andrea Schaerf

[1] Ben Paechter,et al. A Comparison of the Performance of Different Metaheuristics on the Timetabling Problem , 2002, PATAT.

[2] Alon Itai,et al. Some Matching Problems for Bipartite Graphs , 1978, JACM.

[3] L TanimotoSteven,et al. Some Matching Problems for Bipartite Graphs , 1978 .

[4] Luca Di Gaspero,et al. EASYLOCAL++: an object‐oriented framework for the flexible design of local‐search algorithms , 2003, Softw. Pract. Exp..

[5] Luca Di Gaspero,et al. Multi-neighbourhood Local Search with Application to Course Timetabling , 2002, PATAT.