Automated timetable generation for rounds of a table-tennis league

Author

Schönberger, Jörn ; Mattfeld, Dirk C. ; Kopfer, H.

Author_Institution

Dept. of Econ., Bremen Univ., Germany

Volume

1

fYear

2000

fDate

2000

Firstpage

277

Abstract

Considers the problem of scheduling rounds of a non-professional table-tennis league. We formalize the problem in terms of a timetabling optimization problem, then we solve this highly constrained problem with a permutation-based genetic algorithm for which feasibility-preserving operators are defined. Since coding and operators cannot warrant feasibility in every case, the fitness function penalizes constraint violations. This algorithm is compared to an even more elaborated variant, which additionally aims at repairing infeasible solutions produced by the genetic operators

Keywords

administrative data processing; constraint theory; genetic algorithms; mathematical operators; scheduling; sport; automated timetable generation; coding; constrained problem; constraint violation penalization; feasibility-preserving operators; fitness function; genetic operators; infeasible solutions repair; nonprofessional table-tennis league; permutation-based genetic algorithm; timetabling optimization problem; tournament round scheduling; Genetics; Power cables;

fLanguage

English

Publisher

ieee

Conference_Titel

Evolutionary Computation, 2000. Proceedings of the 2000 Congress on

Conference_Location

La Jolla, CA

Print_ISBN

0-7803-6375-2

Type

conf

DOI

10.1109/CEC.2000.870307

Filename

870307