Population-based simulated annealing for traveling tournaments

摘要: This paper reconsiders the travelling tournament problem, a complex sport-scheduling application which has attracted significant interest recently. It proposes population-based simulated annealing algorithm With both itensification and diversitication. The is organized as series of waves, each wave being followed by macro-intensification. diversification obtained through concept elite runs that opportunistically survive waves. A parallel implementation on cluster workstations exhibits remarkable results. improves best known solutions all considered benchmarks, sometimes reduces optimality gap about 60%, produces novel instances had been stable for several years.