کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
478674 1446126 2010 9 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems
چکیده انگلیسی

This paper approximately solves the high school timetabling problem using a simulated annealing based algorithm with a newly-designed neighborhood structure. In search for the best neighbor, the heuristic performs a sequence of swaps between pairs of time slots, instead of swapping two assignments as in a standard simulated annealing. The computational results show that the proposed heuristic, which is tested on two sets of benchmark instances, performs better than existing approaches.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 203, Issue 3, 16 June 2010, Pages 550–558
نویسندگان
, , , ,