Open AccessA Novel Encoding Scheme for Traveling Tournament Problem using Genetic Algorithm
Author(s) -
Nitin S. Choubey
Publication year - 2010
Publication title -
international journal of computer applications
Language(s) - English
Resource type - Journals
ISSN - 0975-8887
DOI - 10.5120/1536-139
Subject(s) - tournament , computer science , encoding (memory) , scheme (mathematics) , tournament selection , algorithm , mathematical optimization , scheduling (production processes) , genetic algorithm , job shop scheduling , travelling salesman problem , schedule , artificial intelligence , mathematics , combinatorics , machine learning , operating system , mathematical analysis
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. General Terms Optimization, Scheduling, Encoding, Algorithm.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom