Filters








2,466 Hits in 4.5 sec

Traveling Tournament Scheduling: A Systematic Evaluation of Simulated Annealling [chapter]

Pascal Van Hentenryck, Yannis Vergados
2006 Lecture Notes in Computer Science  
The main technical contribution underlying these results is a number of compositive neighborhood moves that aggregate sequences of existing moves; these novel moves preserve the mirroring or distance structure  ...  In particular, the algorithm matches or improves most bestknown solutions and produces numerous new best solutions spread over all classes of problems.  ...  The algorithm in [6] works for single round-robin schedules but a double round-robin schedule can be obtained by a simple mirroring.  ... 
doi:10.1007/11757375_19 fatcat:cbl6pitxevce3f64ecurcxmrny

An ILS heuristic for the traveling tournament problem with predefined venues

Fabrício N. Costa, Sebastián Urrutia, Celso C. Ribeiro
2010 Annals of Operations Research  
The Traveling Tournament Problem with Predefined Venues (TTPPV) is a single round robin variant of the Traveling Tournament Problem, in which the venue of each game to be played is known beforehand.  ...  We also establish that the solution space defined by some commonly used neighborhoods in the sport scheduling literature is not connected in the case of single round robin tournaments, which explains the  ...  Different neighborhood structures have been used in local search procedures for scheduling round robin tournaments, see e.g.  ... 
doi:10.1007/s10479-010-0719-9 fatcat:qeszjqkdyzfybpjxgitvmtukwu

An Efficient Simulated Annealing Approach to the Travelling Tournament Problem

Sevnaz Nourollahi, Kourosh Eshghi, Hooshmand Shokri Razaghi
2012 American Journal of Operations Research  
A particular class of these problems is the Traveling Tournament Problem (TTP) which focuses on minimizing the total traveling distance for teams.  ...  Also, a computationally efficient modified greedy scheme is proposed for constructing a favorable initial solution for the simulated annealing algorithm.  ...  The Neighborhood Structure in SA Algorithm The neighborhood of a schedule is defined as the set of schedules which can be obtained by applying the following moves to it.  ... 
doi:10.4236/ajor.2012.23047 fatcat:eacoag4fdffarmv3lbxpzzelp4

Mirrored Traveling Tournament Problem: An Evolutionary Approach [chapter]

Fabrício Lacerda Biajoli, Luiz Antonio Nogueira Lorena
2006 Lecture Notes in Computer Science  
It suggests the use of Genetic Algorithm with a compact genetic codification in conjunction with an algorithm to expand the code.  ...  The validation of the results will be done in benchmark problems available in literature and real benchmark problems, e.g. Brazilian Soccer Championship.  ...  A scheduling to a double round-robin (DRR) tournament, played by n teams, where n is a even number, consists in a schedule where each team plays with each other twice, one game in its home and other in  ... 
doi:10.1007/11874850_25 fatcat:kvkervp3obbltjfinhxtmemmri

A combined local search and integer programming approach to the traveling tournament problem

Marc Goerigk, Stephan Westphal
2014 Annals of Operations Research  
The traveling tournament problem is a well-known combinatorial optimization problem with application to sport leagues scheduling, that sparked intensive algorithmic research over the last decade.  ...  The applicability of this method is demonstrated experimentally on the galaxy instance set, resulting in currently best known solutions for most of the considered instances.  ...  For scheduling single round robin tournaments a rather general and useful scheme called the canonical schedule has been known in sports scheduling literature for at least 30 years [dW81] .  ... 
doi:10.1007/s10479-014-1586-6 fatcat:hftf4ghymjanpcoc2hq6syoo2y

Scheduling in sports: An annotated bibliography

Graham Kendall, Sigrid Knust, Celso C. Ribeiro, Sebastián Urrutia
2010 Computers & Operations Research  
Procedures for structuring and scheduling sports tournaments: elimination, consolation, placement, and round-robin design, 3rd ed. Charles C Thomas; 2000.  ...  Global constraints for round robin tournament scheduling.  ...  TTP benchmark instances and real-life instances are in- The hardness of optimization problems in sports scheduling is also driving research on new algorithmic directions for clusters and computational  ... 
doi:10.1016/j.cor.2009.05.013 fatcat:dznvxw2ulvhk3gdvpybw324spa

A heuristic for minimizing weighted carry-over effects in round robin tournaments

Allison C. B. Guedes, Celso C. Ribeiro
2011 Journal of Scheduling  
Rasmussen and Trick [2] reviewed scheduling problems in round robin tournaments, which are of special importance due to their practical relevance and interesting mathematical structure.  ...  The carry-over effects value is one of the various measures one can consider to assess the quality of a round robin tournament schedule.  ...  ., as reported in [4, 24, 25] ), in particular in the context of scheduling problems in sports.  ... 
doi:10.1007/s10951-011-0244-y fatcat:mxxkoztanneldavywxrod4g5sy

Edge coloring: A natural model for sports scheduling

Tiago Januario, Sebastián Urrutia, Celso C. Ribeiro, Dominique de Werra
2016 European Journal of Operational Research  
We show, in particular, how edge coloring can be used to construct schedules for sports leagues.  ...  In this work, we consider some basic sports scheduling problems and introduce the notions of graph theory which are needed to build adequate models.  ...  It is often used to generate initial solutions for heuristics tackling round robin scheduling problems [3, 6, 31, 35] .  ... 
doi:10.1016/j.ejor.2016.03.038 fatcat:yrbwb2pqi5dwrfs5ytcvxoeai4

A Parallel Simulated Annealing Approach for the Mirrored Traveling Tournament Problem [article]

Vijay Menon, Saurabh Jha
2013 arXiv   pre-print
The Traveling Tournament Problem (TTP) is a benchmark problem in sports scheduling and has been extensively studied in recent years.  ...  In this paper we test a parallel simulated annealing approach for solving the mTTP using OpenMP on shared memory systems and we found that this approach is superior especially with respect to the number  ...  While arriving at an optimized schedule, S, for the double round robin tournament, TTP places two additional constraints on the schedule called the AtMost and the NonRepeat constraint.  ... 
arXiv:1311.1884v1 fatcat:lby4sp23tjhgbals3kxz5sw5nu

Scheduling algorithms for unpredictably heterogeneous CMP architectures

Jonathan A. Winter, David H. Albonesi
2008 2008 IEEE International Conference on Dependable Systems and Networks With FTCS and DCC (DSN)  
eight core chip multiprocessor with no degradation, compared to over 22% for a round robin policy.  ...  We propose scheduling algorithms based on the Hungarian Algorithm and artificial intelligence (AI) search techniques that account for this future uncertainty in core characteristics.  ...  Acknowledgements The authors thank Ken Birman for his valuable feedback, Paula Petrica for her help with the submission, and the anonymous referees for their useful comments.  ... 
doi:10.1109/dsn.2008.4630069 dblp:conf/dsn/WinterA08 fatcat:eogaq24nyvck5ppg7xp2ojejge

A simulated annealing and hill-climbing algorithm for the traveling tournament problem

A. Lim, B. Rodrigues, X. Zhang
2006 European Journal of Operational Research  
Trick, The traveling tournament problem description and benchmarks, in: ] schedules a double round-robin tournament to minimize the total distance traveled by competing teams.  ...  The Traveling Tournament Problem (TTP) [E. Easton, G. Nemhauser, M.  ...  Such round robin tournament scheduling is common and comes with varying rules in a number of sports [5, 6] ; in particular, a double round robin Traveling Tournament Problem (TTP) proposed by Easton et  ... 
doi:10.1016/j.ejor.2005.02.065 fatcat:mouc3leifvh23fvni6ao5ke6vq

Page 5031 of Mathematical Reviews Vol. , Issue 2004f [page]

2004 Mathematical Reviews  
The most important result given in this paper is the competitive analysis of a new clairvoyant on-line algorithm for this scheduling problem.  ...  An extension of the PCP is proposed for round robin, to allow a global control of pri- ority inversions under the layered priority policy and to prevent deadlocks.  ... 

Round robin scheduling – a survey

Rasmus V. Rasmussen, Michael A. Trick
2008 European Journal of Operational Research  
This paper presents a comprehensive survey on the literature considering round robin tournaments. The terminology used within the area has been modified over time and today it is highly inconsistent.  ...  Finally, we conclude the paper by discussing directions for future research within the area.  ...  The problem is a compact scheduling problem consisting of three segments: first a double round robin tournament for each division, then a double round robin tournament for the entire league and, finally  ... 
doi:10.1016/j.ejor.2007.05.046 fatcat:n257krxrzndzdkp2vdmpjth3yi

A composite-neighborhood tabu search approach to the traveling tournament problem

Luca Di Gaspero, Andrea Schaerf
2007 Journal of Heuristics  
We propose a family of tabu search solvers for the solution of TTP that make use of complex combination of many neighborhood structures.  ...  The Traveling Tournament Problem (TTP) is a combinatorial problem that combines features from the traveling salesman problem and the tournament scheduling problem.  ...  Acknowledgements We thank Glenn Langford for fruitful discussions about his work, and Aris Anagnostopoulos and Sebastiàn Urrutia for providing us their solutions.  ... 
doi:10.1007/s10732-006-9007-x fatcat:exnf656mzfe7pkvp5wgqfhuj7u

Scheduling a non-professional indoor football league: a tabu search based approach

David Van Bulck, Dries R. Goossens, Frits C. R. Spieksma
2018 Annals of Operations Research  
The goal is to develop a schedule for a time-relaxed, double round-robin tournament which avoids close successions of games involving the same team in a limited period of time.  ...  This scheduling problem is interesting, because games are not planned in rounds.  ...  This scheduling problem is similar to ours. In each division a double round-robin tournament is played and the schedule is time-relaxed.  ... 
doi:10.1007/s10479-018-3013-x fatcat:g6pikihc3zh55n56rxyg45pj5i
« Previous Showing results 1 — 15 out of 2,466 results