Meta-heuristics such as simulated annealing, genetic algorithms and tabu search have been
successfully applied to many difficult optimization problems for which no satisfactory …

The allocation of fresh produce to shelf space represents a new decision support research
area which is motivated by the desire of many retailers to improve their service due to the …

The problem of timetabling examinations and courses is of much interest and concern to
academic institutions. The basic problem is to allocate a time slot and a room for all events …

This paper will consider a non-traditional solution methodology for examination timetabling.
Over the years, many approaches have been proposed for solving exam timetabling …

For decades, optimisation research has investigated methods to find optimal solutions to
many problems in the fields of scheduling, timetabling and rostering. A family of abstract …

A hyperheuristic is a heuristic that performs a search over a set of low-level heuristics for
solving difficult problems. A perturbative hyperheuristic consists of two successive stages. In …

Statik optimizasyon problemlerinde uygunluk alanları süreç boyunca değişmezler ve
önerilen algoritmaların asıl amacı verilen bir problem için optimum çözümü bulmaktır …