A Late Acceptance Strategy in Hill-Climbing for Exam Timetabling Problems
暂无分享,去创建一个
[1] G. Dueck. New optimization heuristics , 1993 .
[2] Andrew B. Kahng,et al. Old Bachelor Acceptance: A New Class of Non-Monotone Threshold Accepting Methods , 1995, INFORMS J. Comput..
[3] Gilbert Laporte,et al. Examination Timetabling: Algorithmic Strategies and Applications , 1994 .
[4] Luca Maria Gambardella,et al. Adaptive memory programming: A unified view of metaheuristics , 1998, Eur. J. Oper. Res..
[5] Jonathan M. Thompson,et al. GRASPing the Examination Scheduling Problem , 2002, PATAT.
[6] Sanja Petrovic,et al. A time-predefined local search approach to exam timetabling problems , 2004 .
[7] Sanja Petrovic,et al. A Novel Similarity Measure for Heuristic Selection in Examination Timetabling , 2004, PATAT.
[8] Graham Kendall,et al. Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques , 2013 .
[9] Sanja Petrovic,et al. Hybrid Variable Neighborhood Approaches to Exam Timetabling , 2007 .
[10] Giuseppe F. Italiano,et al. Novel Local-Search-Based Approaches to University Examination Timetabling , 2008, INFORMS J. Comput..
[11] Edmund K. Burke,et al. A survey of search methodologies and automated system development for examination timetabling , 2009, J. Sched..
[12] F. Glover,et al. Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.
[13] Eric F Darve,et al. Author ' s personal copy A hybrid method for the parallel computation of Green ’ s functions , 2009 .