Abstract
This paper presents a simulated annealing algorithm that based on multiple search neighborhoods to solve a special kind of timetable problem. The new algorithm also can solve those problems that can be solved by local search algorithm. Various experimental results show that the new algorithm can actually give more satisfactory solutions than general simulated annealing algorithm can do. © Springer-Verlag 2004.
Cite
CITATION STYLE
Yan, H., & Yu, S. N. (2004). A multiple-neighborhoods-based simulated annealing algorithm for timetable problem. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3033, 474–481. https://doi.org/10.1007/978-3-540-24680-0_81
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
