A Step Counting Hill Climbing Algorithm applied to University Examination Timetabling

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

University Examination Timetabling using Genetic Algorithm

The scheduling of examinations in universities or institutions is known to be a highly constrained combinatorial optimization problem. Generally it is done manually or with the limited help of a simple administration system and it usually involves, taking the previous year's timetable and modifying that so it will work for the next year. But now a days most of good universities provide much gre...

متن کامل

When a genetic algorithm outperforms hill-climbing

A toy optimisation problem is introduced which consists of a ÿtness gradient broken up by a series of hurdles. The performance of a hill-climber and a stochastic hill-climber are computed. These are compared with the empirically observed performance of a genetic algorithm (GA) with and without. The hill-climber with a suuciently large neighbourhood outperforms the stochastic hill-climber, but i...

متن کامل

PALO: A Probabilistic Hill-Climbing Algorithm

Many learning systems search through a space of possible performance elements, seeking an element whose expected utility, over the distribution of problems, is high. As the task of nding the globally optimal element is often intractable, many practical learning systems instead hill-climb to a local optimum. Unfortunately, even this is problematic as the learner typically does not know the under...

متن کامل

Incremental Hill-Climbing Search Applied to Bayesian Network Structure Learning

We propose two general heuristics to transform a batch Hillclimbing search into an incremental one. Then, we apply our heuristics to two Bayesian network structure learning algorithms and experimentally see that our incremental approach saves a significant amount of computing time while it yields similar networks than the batch algorithms.

متن کامل

A Campus-Wide University Examination Timetabling Application

The authors of this paper were tasked to create an automated campus-wide timetabling system, for both course and examination timetable scheduling, for the National University of Singapore. This paper explains the development and design of the exam-scheduling portion of the University Timetable Scheduler (UTTS) software. The preliminary results of the application of the AC3 algorithm on this pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Scheduling

سال: 2016

ISSN: 1094-6136,1099-1425

DOI: 10.1007/s10951-016-0469-x