Development of a framework for modeling preference times in triathlon

Preference time in a triathlon denotes the time that is planned to be achieved by an athlete in a particular competition. Usually, the preference time is calculated some days, weeks, or even months before the competition. Mostly, trainers calculate the proposed preference time according to the current form, body performances of athletes, psychological abilities and their health state. They also take course specifications into account in order to make their proposal as exact as possible. However, until recently, this prediction was performed manually. This paper presents an automatic framework for modeling preference times based on previous results of athletes on a particular racecourse and particle swarm optimization. Indeed, the framework observed the problem as optimization, where the goal is to find such preference time that is as much as possible correlated with past data. Practical experiments with different scenarios reveal that the proposed solution is promising.

[1]  Xin-She Yang,et al.  Nature-Inspired Metaheuristic Algorithms , 2008 .

[2]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[3]  Bahadorreza Ofoghi,et al.  Data Mining in Elite Sports: A Review and a Framework , 2013 .

[4]  Jun Zhang,et al.  Orthogonal Learning Particle Swarm Optimization , 2011, IEEE Trans. Evol. Comput..

[5]  Thomas Rosemann,et al.  Participation and Performance Trends in Triple Iron Ultra-triathlon – a Cross-sectional and Longitudinal Data Analysis , 2012, Asian journal of sports medicine.

[6]  Iztok Fister,et al.  Modeling preference time in middle distance triathlons , 2017, 2017 5th International Symposium on Computational and Business Intelligence (ISCBI).

[7]  Pin Luarn,et al.  A discrete version of particle swarm optimization for flowshop scheduling problems , 2007, Comput. Oper. Res..

[8]  Kalyan Veeramachaneni,et al.  Fitness-distance-ratio based particle swarm optimization , 2003, Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706).

[9]  Mohamed Abdel-Basset,et al.  An improved nature inspired meta-heuristic algorithm for 1-D bin packing problems , 2018, Personal and Ubiquitous Computing.

[10]  Michael N. Vrahatis,et al.  Particle Swarm Optimization Method for Constrained Optimization Problems , 2002 .

[11]  K. Pearson VII. Note on regression and inheritance in the case of two parents , 1895, Proceedings of the Royal Society of London.

[12]  B. Alatas,et al.  Chaos embedded particle swarm optimization algorithms , 2009 .

[13]  Jun Zhang,et al.  Orthogonal Learning Particle Swarm Optimization , 2009, IEEE Transactions on Evolutionary Computation.

[14]  Salman Mohagheghi,et al.  Particle Swarm Optimization: Basic Concepts, Variants and Applications in Power Systems , 2008, IEEE Transactions on Evolutionary Computation.

[15]  Thomas Rosemann,et al.  The age of peak performance in Ironman triathlon: a cross-sectional and longitudinal data analysis , 2013, Extreme Physiology & Medicine.

[16]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[17]  Beat Knechtle Pacing in Deca and Double Deca Iron Ultra-Triathlon , 2017 .

[18]  Luca Paolo Ardigò,et al.  Infodemiological data of Ironman Triathlon in the study period 2004–2013 , 2016, Data in brief.

[19]  Arun Kumar Sangaiah,et al.  An improved Lévy based whale optimization algorithm for bandwidth-efficient virtual machine placement in cloud computing environment , 2018, Cluster Computing.

[20]  Mohamed Abdel-Basset,et al.  Flower pollination algorithm: a comprehensive review , 2018, Artificial Intelligence Review.

[21]  Rajesh Kumar,et al.  A review on particle swarm optimization algorithms and their applications to data clustering , 2011, Artificial Intelligence Review.