Automated Timetable Generation for Rounds of a Table-Tennis League

In this research we consider the problemof scheduling rounds of a non-professional table-tennisleague. We formalize the problem in terms of atimetabling optimization problem. Then we solve thishighly constrained problem with a permutation based GeneticAlgorithm for which feasibility preserving operatorsare defined. Since coding and operators cannot warrantfeasibility in every case, the fitness function penalizes constraintviolations. This algorithm is compared to an evenmore elaborated variant, which additionally aims at repairinginfeasible solutions produced by the genetic operators.

MoreLess

Year of publication:	2000
Authors:	Schönberger, Jörn ; Mattfeld, Dirk C. ; Kopfer, Herbert
Published in:	Universität Bremen - Lehrstuhl für Logistik - Publikationen Proceedings of CEC2000, La Jolla, p. 277-284
Publisher:	Universität <Bremen> / Lehrstuhl für Logistik
Subject:	Operations Research \| operations research \| Tischtennis \| Permutation \| Optimierungsproblem

Full text |

More access options

Check Google Scholar

I need help

More details

Extent:	110592 bytes 8 p. application/pdf
Type of publication:	Article
Language:	English
Classification:	Lot sizing and Scheduling ; Individual Conference Proceedings ; No country specification
Source:	USB Cologne (business full texts)

Persistent link: https://www.econbiz.de/10005840446