DocumentCode :
637290
Title :
A hybrid biogeography based heuristic for the mirrored traveling tournament problem
Author :
Gupta, Deepika ; Goel, Lavika ; Aggarwal, Vaneet
Author_Institution :
Comput. Eng. Dept., Delhi Technol. Univ., New Delhi, India
fYear :
2013
fDate :
8-10 Aug. 2013
Firstpage :
325
Lastpage :
330
Abstract :
The Travelling Tournament Problem (TTP) is a NP-hard problem that abstracts the features of certain types of sports scheduling problems. Objective of TTP is to minimize the total distance travelled by all the teams in a sports league during the tournament. This work proposes a novel hybrid approach of Biogeography Based optimization (BBO) and Simulated Annealing (SA) heuristics to generate schedules for mirrored version of TTP. We evaluate our hybrid algorithm on publicly available standard benchmarks. Results are found to be competitive with existing techniques in literature while taking reasonable amount of time.
Keywords :
computational complexity; heuristic programming; scheduling; simulated annealing; sport; BBO heuristic; NP-hard problem; SA heuristic; TTP; biogeography based optimization; hybrid algorithm; hybrid biogeography based heuristic; mirrored traveling tournament problem; simulated annealing; sports league; sports scheduling problems; total distance minimization; Abstracts; Biogeography; Schedules; Simulated annealing; Sociology; Statistics; Biogeography Based Optimization; Simulated Annealing; Sports Scheduling; TTP;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Contemporary Computing (IC3), 2013 Sixth International Conference on
Conference_Location :
Noida
Print_ISBN :
978-1-4799-0190-6
Type :
conf
DOI :
10.1109/IC3.2013.6612213
Filename :
6612213
Link To Document :
بازگشت