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 …

Abstract Traveling Tournament Problem (TTP) has been a major area of research due to its
huge application in developing smooth and healthy match schedules in a tournament. The …

This paper shows an enhanced heuristic approach of grey wolf optimizer and simulated
annealing in order to find optimum solution for Travelling Tournament Problem. In this paper …

Achieving an optimal solution for NP-complete problems is a big challenge nowadays. The
paper deals with the Traveling Salesman Problem (TSP) one of the most important …

This paper proposes an enhanced genetic algorithm (E-GA) with a new crossover operator
for the well-known NP-hard traveling tournament problem (TTP). TTP is the problem of …

Traveling Salesman Problem (TSP) is one of the most common studied problems in
combinatorial optimization. Given the list of cities and distances between them, the problem …

In today's fast-paced society, everyone is caught up in the hustle and bustle of life which has
resulted in ineffective Planning of their very important vacation tour. Either they spend much …

Sports scheduling has become an important area of applied operations research, since
satisfying the fans and teams' requests and revenues of a sports league and TV networks …

Travelling salesman problem (TSP) is a one of the most popular real world combinatorial
optimization problem in which we have to find a shortest possible tour that visits each city …