Enhanced heuristic approach for Travelling Tournament Problem based on extended species abundance models of biogeography

This paper shows a heuristic approach of enhanced simulated annealing based on extended species abundance models of biogeography in order to obtain optimal solution for Travelling Tournament Problem. We upgrade the migration step of BBO by using probabilistic measures and hybridize it with simulated annealing to solve the TTP problem and avoid the problem of local minima. Our proposed hybrid approach converges to an optimal solution for TTP. There is negative impact of non deterministic problems on the TTP solution. We considered all these non-deterministic problems as noise. The physical significance of noise in our algorithm is any existing parameter which can affect the fitness of the habitat. We also calculate the overall cost of TTP for various extended species abundance models of BBO (Linear and Non linear models) to achieve desirable results. We compare the performance of our approach with other methodologies like ACO and PSO.

[1]  George L. Nemhauser,et al.  Solving the Travelling Tournament Problem: A Combined Integer Programming and Constraint Programming Approach , 2002, PATAT.

[2]  Kourosh Eshghi,et al.  A hybrid PSO-SA algorithm for the Traveling Tournament Problem , 2009, 2009 International Conference on Computers & Industrial Engineering.

[3]  Celso C. Ribeiro,et al.  Scheduling in sports: An annotated bibliography , 2010, Comput. Oper. Res..

[4]  Christian Callegari,et al.  Advances in Computing, Communications and Informatics (ICACCI) , 2015 .

[5]  Celso C. Ribeiro,et al.  An ILS heuristic for the traveling tournament problem with fixed venues , 2008 .

[6]  Goel Lavika,et al.  Information Sharing in Swarm Intelligence Techniques: A Perspective Application for Natural Terrain Feature Elicitation , 2011 .

[7]  Phillip D. Stroud,et al.  Kalman-extended genetic algorithm for search in nonstationary environments with noisy fitness evaluations , 2001, IEEE Trans. Evol. Comput..

[8]  Siti Mariyam Shamsuddin,et al.  Particle Swarm Optimization: Technique, System and Challenges , 2011 .

[9]  Walter D. Wallis,et al.  Scheduling a Tournament , 2006 .

[10]  Kevin K. H. Cheung Solving mirrored traveling tournament problem benchmark instances with eight teams , 2008, Discret. Optim..

[11]  Riccardo Poli,et al.  Analysis of the publications on the applications of particle swarm optimisation , 2008 .

[12]  L. Goel,et al.  Extended Species Abundance Models of Biogeography Based Optimization , 2012, 2012 Fourth International Conference on Computational Intelligence, Modelling and Simulation.

[13]  Luca Di Gaspero,et al.  A composite-neighborhood tabu search approach to the traveling tournament problem , 2007, J. Heuristics.

[14]  Celso C. Ribeiro,et al.  An ILS heuristic for the traveling tournament problem with predefined venues , 2010, Annals of Operations Research.

[15]  V. K. Panchal,et al.  Dynamic Model of Blended Biogeography Based Optimization for Land Cover Feature Extraction , 2012, IC3.

[16]  Dan Simon,et al.  Biogeography-Based Optimization , 2022 .