DMCA
A Benders approach for the constrained minimum break problem (2007)
| Venue: | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH |
| Citations: | 15 - 2 self |
BibTeX
@ARTICLE{Rasmussen07abenders,
author = {Rasmus V. Rasmussen and Michael A. Trick},
title = {A Benders approach for the constrained minimum break problem},
journal = {EUROPEAN JOURNAL OF OPERATIONAL RESEARCH},
year = {2007},
volume = {177}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This paper presents a hybrid IP/CP algorithm for designing a double round robin schedule with a minimal number of breaks. Both mirrored and non-mirrored schedules with and without place constraints are considered. The algorithm uses Benders cuts to obtain feasible home-away pattern sets in few iterations and this approach leads to significant reductions in computation time for hard instances. Furthermore, the al-gorithm is capable of solving a number of previously unsolved benchmark problems for the Traveling Tournament Problem with constant distances.
Keyphrases
constrained minimum break problem bender approach hard instance significant reduction double round robin schedule hybrid ip cp algorithm constant distance benchmark problem non-mirrored schedule traveling tournament problem place constraint feasible home-away pattern set minimal number computation time bender cut
