抽象的

Optimization of Travelling Tournament Problem Using Nature Based Algorithms

Priyanka Tamgave, Shobhika Jain, Gitanjalee Waghmode, Shweta Udagire , Jayant Umale

Travelling tournament problem(TTP) is evolved NP-hard problem from its similarity to Travelling Salesman problem.(TSP). TTP aims to solve optimization of objectives to stimulate the schedule of tournaments which now a days is used in such organizations. The availability of resources, constraints and objectives for optimization makes TTP problem hard to produce successful results efficiently. The optimization approaches used to solve complex TTP problem with higher number of teams and venues by researchers shows the partially accurate results with higher execution time. We propose here the novel approach to solve TTP using Genetic algorithm (GA) which tend to produce accurate results compared to existing approaches. We further extend this solution to reduce execution overhead of GA using parallel decomposition of GA. In this paper we present the proposed project work to optimize TTP using hierarchical parallel GA (HPGA) implementation on Hadoop Map Reduce