Name
Abstract | ||
|---|---|---|
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 MinMaxTTP. It is proposed an integer programming formulation to the mTTP and two models with dynamic constraints to its solution. Both models are based on the detection of independent sets on conflict graphs, whose use has not been reported in the literature about the problem. Real data benchmarks from a baseball tournament are used in the experiments carried out. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.cie.2012.08.002 | Computers & Industrial Engineering |
Keywords | Field | DocType |
dynamic constraint,baseball tournament,conflict graph,half series,new model,tournament problem,challenging combinatorial optimization problem,independent set,longest distance,final timetable,double round-robin timetable problem,integer programming | Traveling tournament problem,Graph,Mathematical optimization,Tournament,Combinatorial optimization problem,Schedule,Integer programming,Mathematics | Journal |
Volume | Issue | ISSN |
63 | 4 | 0360-8352 |
Citations | PageRank | References |
4 | 0.40 | 12 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marco Antonio Moreira De Carvalho | 1 | 5 | 0.75 |
| Luiz Antonio Nogueira Lorena | 2 | 498 | 36.72 |