DocumentCode
2709775
Title
Structured Neighborhood Tabu Search for Assigning Judges to Competitions
Author
Lamghari, Amina ; Ferland, Jacques A.
Author_Institution
Dept. d´´Informatique et de Recherche Operationnelle, Univ. de Montreal, Que.
fYear
2007
fDate
1-5 April 2007
Firstpage
238
Lastpage
245
Abstract
A metaheuristic approach including three different stages is introduced to assign the judges for the John Molson International Case Competition. The complexity of the mathematical formulation accounting for the rules to be followed in assigning the judges, leads us to use such an approach. The two different tabu search methods in the first two stages are combined with a diversification strategy. Numerical results are provided to indicate the efficiency of the approach to generate very good solutions.
Keywords
commerce; computational complexity; search problems; John Molson International Case Competition; judge assignment; mathematical formulation complexity; metaheuristic approach; structured neighborhood tabu search; Computational intelligence; Performance evaluation; Power generation; Processor scheduling; Search methods;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Intelligence in Scheduling, 2007. SCIS '07. IEEE Symposium on
Conference_Location
Honolulu, HI
Print_ISBN
1-4244-0704-4
Type
conf
DOI
10.1109/SCIS.2007.367696
Filename
4218623
Link To Document