Article ID: | iaor20126767 |
Volume: | 63 |
Issue: | 4 |
Start Page Number: | 1089 |
End Page Number: | 1095 |
Publication Date: | Dec 2012 |
Journal: | Computers & Industrial Engineering |
Authors: | Lorena Luiz Antonio Nogueira, Carvalho Marco Antonio Moreira de |
Keywords: | programming: integer, combinatorial optimization |
The Mirrored Traveling Tournament Problem (mTTP) is a challenging combinatorial optimization problem which consists in generating a timetable for sports tournaments with two half series, what is equivalent to a double round‐robin timetable problem. The distance traveled by the teams should be minimized in the final timetable, and a new objective is to minimize the longest distance traveled, named