Call for Paper - March 2022 Edition
IJCA solicits original research papers for the March 2022 Edition. Last date of manuscript submission is February 22, 2022. Read More

A Novel Encoding Scheme for Traveling Tournament Problem using Genetic Algorithm

Print
PDF
Evolutionary Computation for Optimization Techniques
© 2010 by IJCA Journal
Number 2 - Article 7
Year of Publication: 2010
Authors:
Dr. Nitin S. Choubey
10.5120/1536-139

Dr. Nitin S Choubey. A Novel Encoding Scheme for Traveling Tournament Problem using Genetic Algorithm. IJCA Special Issue on Evolutionary Computation (2):79–82, 2010. Full text available. BibTeX

@article{key:article,
	author = {Dr. Nitin S. Choubey},
	title = {A Novel Encoding Scheme for Traveling Tournament Problem using Genetic Algorithm},
	journal = {IJCA Special Issue on Evolutionary Computation},
	year = {2010},
	number = {2},
	pages = {79--82},
	note = {Full text available}
}

Abstract

Traveling Tournament Problem is a sports timetabling problem that abstracts the important issues in creating timetables where team travel is an important issue. The instances of this problem seem to be very difficult to solve even for very small cases. In this paper, Author has suggested a Novel encoding scheme for representing a solution instance. The scheme is implemented and tested for several instances of Traveling tournament problem such as NL-4, NL-6, NL-8, CIRC-4 (Constrained), CIRC-6 (Constrained), CIRC-8 (Constrained), Galaxi-4, Galaxi-6, Galaxi-8, Super-4 , Super-6 and Super-8 from Double round robin Traveling Tournament Problem. The results of the simulation are presented in the paper.

Reference

  • Campbell, R. T. and Chen D. S., 1976. “A Minimum Distance Basketball Scheduling Problem”, in Optimal Stratgies in Sport, S.P. Ladany and R.E. Machol (eds.). North-Holland, Amsterdam.
  • Russel, R. A. and Leung J. M., 1994. “Devising a cost effective schedule for a baseball league”, Operation Research, 42,614-625.
  • Kelly Easton, Nemhauser George L., and Trick Michael A. The Traveling Tournament Problem Description and Benchmarks. CP 2001: 580-584.
  • Challenge Traveling Tournament Instances, August 23, 2010, from http://mat.gsia.cmu.edu/TOURN/
  • Kelly Easton, Nemhauser George L., and Trick Michael A. Solving the Traveling Tournament Problem: A Combined Integer Programming and Constraint Programming Approach. PATAT 2002: 100-112.
  • Trick Michael A. Integer and Constraint Programming Approaches for Round-Robin Tournament Scheduling. PATAT 2002: 63-77.
  • Trick Michael A. A Schedule-Then-Break Approach to Sports Timetabling. PATAT 2000: 242-253.
  • Choubey N. S. and M. U. Kharat. “Stochastic Mutation approach for Grammar Induction using Genetic Algorithm”, in the 2nd International Conference on Electronic Computer Technology (ICECT 2010), ICECT 2010,7 - 10, May 2010, Kuala Lumpur, Malaysia.
  • Choubey, N. S. and M. U. Kharat. “Reproduction Operator Evaluation for CFG Induction using Genetic Algorithm”, in Journal of Computing (Registered with the Library of Congress, USA), NY 14005-9710, USA, Journal of Computing, 2(9):89-95, September 2010, ISSN 2151-9617.