메뉴 건너뛰기




Volumn 27, Issue 1, 2015, Pages 5-21

Solving scheduling tournament problems using a new version of CLONALG

Author keywords

artificial immune algorithm; CLONALG; relaxed travelling tournament problem

Indexed keywords

ALGORITHMS; OPERATIONS RESEARCH; SCHEDULING;

EID: 84922212727     PISSN: 09540091     EISSN: 13600494     Source Type: Journal    
DOI: 10.1080/09540091.2014.944099     Document Type: Article
Times cited : (9)

References (16)
  • 1
    • 33646436744 scopus 로고    scopus 로고
    • A simulated annealing approach to the traveling tournament problem
    • Anagnostopoulos, A., Michel, L., Van Hentenryck, P., & Vergados, Y. (2006). A simulated annealing approach to the traveling tournament problem. Journal of Scheduling, 9, 177–193. doi: 10.1007/s10951-006-7187-8
    • (2006) Journal of Scheduling , vol.9 , pp. 177-193
    • Anagnostopoulos, A.1    Michel, L.2    Van Hentenryck, P.3    Vergados, Y.4
  • 4
    • 0036613006 scopus 로고    scopus 로고
    • Learning and optimization using the clonal selection principle
    • De Castro, L. N., & Von Zuben, F. J. (2002). Learning and optimization using the clonal selection principle. IEEE Transactions on Evolutionary Computation, 6, 239–251. doi: 10.1109/TEVC.2002.1011539
    • (2002) IEEE Transactions on Evolutionary Computation , vol.6 , pp. 239-251
    • De Castro, L.N.1    Von Zuben, F.J.2
  • 5
    • 33847629210 scopus 로고    scopus 로고
    • A composite-neighborhood tabu search approach to the traveling tournament problem
    • Di Gaspero, L., & Schaerf, A. (2007). A composite-neighborhood tabu search approach to the traveling tournament problem. Journal of Heuristics, 13, 189–207. doi: 10.1007/s10732-006-9007-x
    • (2007) Journal of Heuristics , vol.13 , pp. 189-207
    • Di Gaspero, L.1    Schaerf, A.2
  • 6
    • 84947906243 scopus 로고    scopus 로고
    • The traveling tournament problem description and benchmarks
    • Proceedings of the 7th international conference on principles and practice of constraint programming, Berlin: Springer
    • Easton, K., Nemhauser, G., & Trick, M. (2001). The traveling tournament problem description and benchmarks. Proceedings of the 7th international conference on principles and practice of constraint programming (Vol. 2239, pp. 580–584). Berlin: Springer.
    • (2001) , vol.2239 , pp. 580-584
    • Easton, K.1    Nemhauser, G.2    Trick, M.3
  • 7
    • 33747020998 scopus 로고    scopus 로고
    • A simulated annealing and hill-climbing algorithm for the traveling tournament problem
    • Lim, A., Rodrigues, B., & Zhang, X. (2006). A simulated annealing and hill-climbing algorithm for the traveling tournament problem. European Journal of Operational Research, 174, 1459–1478. doi: 10.1016/j.ejor.2005.02.065
    • (2006) European Journal of Operational Research , vol.174 , pp. 1459-1478
    • Lim, A.1    Rodrigues, B.2    Zhang, X.3
  • 8
    • 84922259293 scopus 로고    scopus 로고
    • A new learning hyper-heuristic for the traveling tournament problem
    • July–, In The 8th Metaheuristic International Conference, (MIC’09, Hamburg: Germany
    • Misir, M., Wauters, T., Verbeeck, K., & Vanden Berghe, G. (2009, July 13–16). A new learning hyper-heuristic for the traveling tournament problem. In The 8th Metaheuristic International Conference (MIC’09). Hamburg, Germany.
    • (2009)
    • Misir, M.1    Wauters, T.2    Verbeeck, K.3    Vanden Berghe, G.4
  • 9
    • 38149116129 scopus 로고    scopus 로고
    • Clustering search approach for the traveling tournament problem
    • In Mexican international conference on artificial intelligence, Lecture Notes in Computer Science, Vol. 4827, Berlin: Springer
    • Nogueira, L., & Lacerda, F. (2007). Clustering search approach for the traveling tournament problem. In Mexican international conference on artificial intelligence (Lecture Notes in Computer Science, Vol. 4827, pp. 83–93). Berlin: Springer.
    • (2007) , pp. 83-93
    • Nogueira, L.1    Lacerda, F.2
  • 10
    • 33845917297 scopus 로고    scopus 로고
    • Heuristics for the mirrored traveling tournament problem
    • Ribeiro, C., & Urrutia, S. (2007). Heuristics for the mirrored traveling tournament problem. European Journal of Operational Research, 179, pp. 775–787. doi: 10.1016/j.ejor.2005.03.061
    • (2007) European Journal of Operational Research , vol.179 , pp. 775-787
    • Ribeiro, C.1    Urrutia, S.2
  • 11
    • 77958487594 scopus 로고    scopus 로고
    • A graph-based immune inspired constraint satisfaction search
    • Riff, M.-C., Zuniga, M., & Montero, E. (2010). A graph-based immune inspired constraint satisfaction search. Neural Computing and Applications Journal, 19, pp. 1133–1142. doi: 10.1007/s00521-010-0390-8
    • (2010) Neural Computing and Applications Journal , vol.19 , pp. 1133-1142
    • Riff, M.-C.1    Zuniga, M.2    Montero, E.3
  • 12
  • 13
    • 69849098169 scopus 로고    scopus 로고
    • DFS* and the traveling tournament problem
    • In Proceedings of the 6th international conference on integration of AI and OR techniques in constraint programming for combinatorial optimization problems, Lecture Notes in Computer Science, Vol. 5547, Berlin: Springer
    • Uthus, D., Riddle, P., & Guesgen, H. (2009a). DFS* and the traveling tournament problem. In Proceedings of the 6th international conference on integration of AI and OR techniques in constraint programming for combinatorial optimization problems (Lecture Notes in Computer Science, Vol. 5547, pp. 279–293). Berlin: Springer.
    • (2009) , pp. 279-293
    • Uthus, D.1    Riddle, P.2    Guesgen, H.3
  • 14
    • 72749097905 scopus 로고    scopus 로고
    • An ant colony optimization approach to the traveling tournament problem
    • Proceedings of the 11th annual conference on genetic and evolutionary computation, New York, NY, USA: ACM
    • Uthus, D., Riddle, P., & Guesgen, H. (2009b). An ant colony optimization approach to the traveling tournament problem. Proceedings of the 11th annual conference on genetic and evolutionary computation (pp. 81–88). New York, NY, USA: ACM.
    • (2009) , pp. 81-88
    • Uthus, D.1    Riddle, P.2    Guesgen, H.3
  • 15
    • 84870572594 scopus 로고    scopus 로고
    • Solving the traveling tournament problem with iterative-deepening A
    • Berlin: Springer
    • Uthus, D., Riddle, P., & Guesgen, H. (2012). Solving the traveling tournament problem with iterative-deepening A. Journal of Scheduling, 15, pp. 601–614. Berlin: Springer.
    • (2012) Journal of Scheduling , vol.15 , pp. 601-614
    • Uthus, D.1    Riddle, P.2    Guesgen, H.3
  • 16
    • 36348984990 scopus 로고    scopus 로고
    • Population-based simulated annealing for traveling tournaments
    • Proceedings of the 22nd national conference on artificial intelligence, AAAI Press
    • Van Hentenryck, P., & Vergados, Y. (2007). Population-based simulated annealing for traveling tournaments. Proceedings of the 22nd national conference on artificial intelligence (pp. 267–272). AAAI Press.
    • (2007) , pp. 267-272
    • Van Hentenryck, P.1    Vergados, Y.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.