Filters








36 Hits in 6.6 sec

Mirrored Traveling Tournament Problem: An Evolutionary Approach [chapter]

Fabrício Lacerda Biajoli, Luiz Antonio Nogueira Lorena
2006 Lecture Notes in Computer Science  
The Mirrored Traveling Tournament Problem (mTTP) is an optimization problem that represents certain types of sports timetabling, where the objective is to minimize the total distance traveled by the teams  ...  This work proposes the use of hybrid heuristic to solve the mTTP, using an evolutionary algorithm in association with the metaheuristic Simulated Annealing.  ...  Three different neighborhood structures for local search was investigated: two simple neighborhood (Home-away swap and Team swap) and a more complicated based on ejection chain, whose the importance was  ... 
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  
With the Challenge Traveling Tournament Instances as an established benchmark, the most successful approaches to the problem use meta-heuristics like tabu search or simulated annealing, partially heavily  ...  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 five neighborhood search moves are presented in Table 3 . Neighborhood Input Effect Swap Homes t 1 , t 2 ∈ T Swap home/away pattern for matches between t 1 and t 2 .  ... 
doi:10.1007/s10479-014-1586-6 fatcat:hftf4ghymjanpcoc2hq6syoo2y

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

Pascal Van Hentenryck, Yannis Vergados
2006 Lecture Notes in Computer Science  
This paper considers all the variants of the traveling tournament problem (TTP) proposed in [17, 7] to abstract the salient features of major league baseball (MLB) in the United States.  ...  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  ...  Problem Description The traveling tournament problem, as originally introduced in [7] , was first studied only for benchmarks based on the distances between cities of the 16 teams of National League Baseball  ... 
doi:10.1007/11757375_19 fatcat:cbl6pitxevce3f64ecurcxmrny

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

Vijay Menon, Saurabh Jha
2013 arXiv   pre-print
The Mirrored Traveling Tournament Problem (mTTP) is variation of the TTP that represents certain types of sports scheduling problems where the main objective is to minimize the total distance traveled  ...  The Traveling Tournament Problem (TTP) is a benchmark problem in sports scheduling and has been extensively studied in recent years.  ...  The neighborhood of a schedule S is defined as the set of all schedules that can be generated by applying any one of the 5 five moves : swap-teams, column-swap, row-swap, swap-rounds, interchange-home-away  ... 
arXiv:1311.1884v1 fatcat:lby4sp23tjhgbals3kxz5sw5nu

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

Luca Di Gaspero, Andrea Schaerf
2007 Journal of Heuristics  
The Traveling Tournament Problem (TTP) is a combinatorial problem that combines features from the traveling salesman problem and the tournament scheduling problem.  ...  We propose a family of tabu search solvers for the solution of TTP that make use of complex combination of many neighborhood structures.  ...  We are also grateful to Michael Trick for maintaining the TTP web page. Finally, we thank an anonymous referee for helpful comments that allowed us to improve the paper.  ... 
doi:10.1007/s10732-006-9007-x fatcat:exnf656mzfe7pkvp5wgqfhuj7u

Scheduling in sports: An annotated bibliography

Graham Kendall, Sigrid Knust, Celso C. Ribeiro, Sebastián Urrutia
2010 Computers & Operations Research  
The balanced tournament problem (prob026 of CSPLib) is solved with a tabu search algorithm based on a swap neighborhood.  ...  A two-phase method based on generating timetables from 1factorizations and finding optimal home/away assignments solves the mirrored traveling tournament problem benchmark instances NL8 and CIRC8. [65]  ...  Interest by problems in this area has risen, in particular, since the introduction of the traveling tournament problem and its benchmark instances in the seminal paper by Easton et al. [4], discussed in  ... 
doi:10.1016/j.cor.2009.05.013 fatcat:dznvxw2ulvhk3gdvpybw324spa

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  
The standard denitions of neighborhoods that are used in such procedures need to be extended. Graph theory provides ecient tools for describing various move types in the solution space.  ...  In this work, we consider some basic sports scheduling problems and introduce the notions of graph theory which are needed to build adequate models.  ...  Lewis and Thompson [22] presented models based on vertex coloring to solve the traveling tournament problem [10] .  ... 
doi:10.1016/j.ejor.2016.03.038 fatcat:yrbwb2pqi5dwrfs5ytcvxoeai4

Particle Swarm Algorithm for Improved Handling of the Mirrored Traveling Tournament Problem

2021 Tehnički Vjesnik  
heuristic on a set of 20 teams.  ...  In this study, we used a particle swarm optimization (PSO) algorithm to address a variation of the non-deterministic polynomial-time NP-hard traveling tournament problem, which determines the optimal schedule  ...  The X i, t value of the table indicates that the t th Team will play at home or away in t th week, based on a value of 0 or 1, respectively.  ... 
doi:10.17559/tv-20200618162959 fatcat:mqffqimzwzgnjcoqzxjvddesmu

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

Allison C. B. Guedes, Celso C. Ribeiro
2011 Journal of Scheduling  
In some situations, one seeks for a schedule minimizing the total traveled distance, as in the case of the traveling tournament problem [3] and in that of its mirrored variant [4] , which is common to  ...  The problem is formulated by integer programming and an algorithm based on the hybridization of the Iterated Local Search metaheuristic with a multistart strategy is proposed.  ...  of scheduling problems in sports.  ... 
doi:10.1007/s10951-011-0244-y fatcat:mxxkoztanneldavywxrod4g5sy

A 5.875-approximation for the Traveling Tournament Problem

Stephan Westphal, Karl Noparlik
2012 Annals of Operations Research  
In this paper we propose an approximation for the Traveling Tournament Problem which is the problem of designing a schedule for a sports league consisting of a set of teams T such that the total traveling  ...  It is not allowed for any team to have more than k home-games or k away-games in a row.  ...  In this paper we will focus on the Traveling Tournament Problem (TTP) introduced by Easton et al. (2001) .  ... 
doi:10.1007/s10479-012-1061-1 fatcat:valg6d2pzzfrlmjm7ebvvm3qrq

A distributed and hierarchical strategy for autonomic grid-enabled cooperative metaheuristics with applications

Aletéia P.F. Araújo, Cristina Boeres, Vinod E.F. Rebello, Celso C. Ribeiro
2011 International Transactions in Operational Research  
Two problems, the mirrored traveling tournament problem and the bounded diameter minimum spanning tree problem, for which high quality sequential heuristics based on the paradigms of the GRASP and ILS  ...  The adoption of the same cluster-based programming strategies for grid applications, although requiring minimal effort from a programmer's point of view, does not always take advantage of the available  ...  Next, we review the formulation and the main sequential heuristics available for the two application problems that will be used as case studies: the mirrored traveling tournament problem and the diameter  ... 
doi:10.1111/j.1475-3995.2011.00823.x fatcat:qqg2oc6xdzh53kajtlwjqvt6qa

Clustering Search Approach for the Traveling Tournament Problem [chapter]

Fabrício Lacerda Biajoli, Luiz Antonio Nogueira Lorena
MICAI 2007: Advances in Artificial Intelligence  
This work proposes the use of a hybrid heuristic to solve the mirrored TTP (mTTP), called Clustering Search (*CS), that consists in detecting supposed promising search areas based on clustering.  ...  The Traveling Tournament Problem (TTP) is an optimization problem that represents some types of sports timetabling, where the objective is to minimize the total distance traveled by the teams.  ...  Conclusions In this work was investigate the Mirrored Traveling Tournament Problem, first published in [16] , with a implementation of a new way of detecting promising search areas based on clustering  ... 
doi:10.1007/978-3-540-76631-5_9 dblp:conf/micai/BiajoliL07 fatcat:cabgsnw2qjawfmymh5wpdovase

EngagedScholarship@CSU Time Relaxed Round Robin Tournament and the NBA Scheduling Problem TIME RELAXED ROUND ROBIN TOURNAMENT AND THE NBA SCHEDULING PROBLEM

Renjun Bao, Renjun Bao, John Frater, Wenbing Zhao, Walter Rom, Dr, Hanz Richter, Their
1998 unpublished
Svestka that inspired me of the idea of working on sports scheduling problem after he learned I was doing some work with the NBA, which eventually became my doctoral research topic.  ...  Dr .Keys generously agreed to serve as the academic advisor for my graduate study. Without their help, it was impossible for me to start this doctoral research. Throughout my study, Dr. Keys and Dr.  ...  They developed a heuristic approach based on the pairing.  ... 
fatcat:okwebeqlazdwnjzmidzjfbq7vm

General Purpose Optimization Library (GPOL): A Flexible and Efficient Multi-Purpose Optimization Library in Python

Illya Bakurov, Marco Buzzelli, Mauro Castelli, Leonardo Vanneschi, Raimondo Schettini
2021 Applied Sciences  
Several interesting libraries for optimization have been proposed. Some focus on individual optimization algorithms, or limited sets of them, and others focus on limited sets of problems.  ...  search algorithms, through which flexible and modular implementation can allow for solving many different problem types from the fields of continuous and combinatorial optimization and supervised machine  ...  Following this perspective, by creating an instance of the class GeneticAlgorithm with, for example, ramped half-and-half (RHH) initialization, tournament selection, swap crossover and sub-tree mutation  ... 
doi:10.3390/app11114774 fatcat:w4wrvvcwfvbqtbpv67tc3uxln4

Intelligent Flow Control under a Game Theoretic Framework [chapter]

Huimin Chen, Yanda Li
2001 Telecommunications Optimization: Heuristic and Adaptive Techniques  
Also thanks are due to Peter Hale for his help in formulating the access network planning problem.  ...  Acknowledgements The node-pair encodings used in this chapter are based on an earlier encoding developed by Christos Dimitrakakis as part of an MSc in Telecommunication and Information Systems, supervised  ...  The heuristic employs the same neighborhood of moves as used for the tabu search algorithm, i.e. constructive moves, destructive moves and swap moves.  ... 
doi:10.1002/047084163x.ch17 fatcat:k63jsso4ingcjnkzrp2sljylb4
« Previous Showing results 1 — 15 out of 36 results