Asset Details
Do you wish to reserve the book?
Solving the traveling tournament problem with iterative-deepening A super()
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Solving the traveling tournament problem with iterative-deepening A super()
Do you wish to request the book?
Solving the traveling tournament problem with iterative-deepening A super()
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Solving the traveling tournament problem with iterative-deepening A super()
2012
Overview
This work presents an iterative-deepening A super() (IDA super()) based approach to the traveling tournament problem (TTP). The TTP is a combinatorial optimization problem which abstracts the Major League Baseball schedule. IDA super() is able to find optimal solutions to this problem, with performance improvements coming from the incorporation of various past concepts including disjoint pattern databases, symmetry breaking, and parallelization along with new ideas of subtree skipping, forced deepening, and elite paths to help to reduce the search space. The results of this work show that an IDA super() based approach can find known optimal solutions to most TTP instances much faster than past approaches. More importantly, it has been able to optimally solve two larger instances that have been unsolved since the problem's introduction in 2001. In addition, a new problem set called GALAXY is introduced, using a 3D space to create a challenging problem set.
Subject
