Many techniques for solving the Examination Timetabling Problem have been studied over the years. One such successful method is Heuristic Ordering. Examinations are assigned sequentially to the timetable in a predefined order established on the basis of some characteristic of the individual events. Typically events are scheduled by decreasing order of difficulty. This construction heuristic may...

For mixed integer programming, recent years have seen a growing interest in the design of general purpose primal heuristics for use inside complete solvers. Many of these heuristics rely on an optimal LP solution. Finding this may itself take a significant amount of time. The presented paper addresses this issue by the introduction of the Shift-and-Propagate heuristic. Shift-and-Propagate is a ...

A multi-heuristic schedule repair model for schedule conflict resolution is presented and its application in repairing the schedules of a prefabrication plant is described in this paper. The model combines heuristic strategies with Genetic Algorithms to repair schedules with resource constraints. The GA determines the “best” sequence of resolving schedule disturbances using heuristic rules sele...

The object of this paper is to prove that the use of artificial intelligence techniques in computer graphics can greatly improve the obtained results. Improvements in three areas of computer graphics are presented in the paper: in scene modelling, where declarative modelling techniques can greatly improve the designer’s work ; in scene understanding, where the use of heuristic search and strate...

Combination of AI/OR methods is gaining a great deal of attention because many combinatorial problems especially in planning and scheduling areas can be solved by means of combined AI/OR techniques. Many of these combinatorial problems can be expressed in a natural way as a Constraint Satisfaction Problem (CSP). It is well known that a non-binary CSP can be transformed into an equivalent binary...

this paper considers the economic lot scheduling problem, that is, the problem of scheduling several products on a single facility so as to minimize holding and setup costs. combination of frequency and timing as well as production quantity make this problem np-hard. a heuristic is developed to obtain a good solution to elsp. the proposed heuristic makes use of the simulated annealing technique...

In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...

In this paper we study traditional and enhanced BDD-based exploration procedures capable of handling large planning problems. On the one hand, reachability analysis and model checking have eventually approached AI-Planning. Unfortunately, they typically rely on uninformed blind search. On the other hand, heuristic search and especially lower bound techniques have matured in effectively directin...

In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...

The use of heuristic search techniques for network optimisation problems has long been noted for its merits. It often requires both a significant understanding of both the heuristic methods themselves and the specific network problem domain. This precludes many network domain experts from effectively using heuristic search paradigms in building solutions. Solutions to network problems using heu...