A Hybrid Approach for Course Scheduling Inspired by Die-hard Co-operative Ant Behavior
暂无分享,去创建一个
M.Y. Javed | N. Ejaz | N. Ejaz | M.Y. Javed
[1] Marco Dorigo,et al. The ant colony optimization meta-heuristic , 1999 .
[2] Mauro Birattari,et al. An effective hybrid approach for the university course timetabling problem , 2003 .
[3] Ben Paechter,et al. Finding Feasible Timetables Using Group-Based Operators , 2007, IEEE Transactions on Evolutionary Computation.
[4] Sanja Petrovic,et al. A graph-based hyper-heuristic for educational timetabling problems , 2007, Eur. J. Oper. Res..
[5] H. Asmuni. Fuzzy multiple heuristic orderings for course timetabling , 2005 .
[6] E. Burke,et al. AN INVESTIGATION OF VARIABLE NEIGHBOURHOOD SEARCH FOR UNIVERSITY COURSE TIMETABLING , 2005 .
[7] Michael Sampels,et al. A MAX-MIN Ant System for the University Course Timetabling Problem , 2002, Ant Algorithms.
[8] Graham Kendall,et al. A Tabu-Search Hyperheuristic for Timetabling and Rostering , 2003, J. Heuristics.
[9] S. Hossein Cheraghi,et al. Ant Algorithms : Review and Future Applications , 2002 .