Particle Swarm Algorithm for Improved Handling of the Mirrored Traveling Tournament Problem
In this study, we used a particle swarm optimization (PSO) algorithm to address a variation of the non-deterministic polynomial-time read more NP-hard traveling tournament problem, which determines the optimal schedule for a double round-robin tournament, for an even number of teams, to minimize the number of trips taken.Our proposed algorithm iter