RESOURCE SCHEDULING - COMPARING SIMULATED ANNEALING WITH CONSTRAINT PROGRAMMING

This paper compares two different approaches to optimisation problems. It attempts to determine which technique is best under which circumstance. On the one hand a solution-based approach was considered using simulated annealing, and on the other a state based approach using constraint propagation techniques and heuristic labelling. The aim is to show that where the problems have few constraints, the solution-based simulated annealing will perform well, but where the problems involve more constraints, then state-based constraint techniques are more appropriate.