EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
On the performance of Scatter Search for post-enrolment course timetabling problems
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
This presentation explores the evolutionary approach called scatter search, which originated from strategies for creating composite decision rules and surrogate constraints. Recent studies have demonstrated the practical advantages of this approach for solving a diverse collection of optimization problems from both classical and real world settings. Scatter search contrasts with other evolutionary procedures, such as genetic algorithms, by providing unifying principles for joining solutions based on generalized path constructions in Euclidean space and by utilizing strategic designs where other approaches resort to randomization. Additional advantages are provided by intensification and diversification mechanisms that exploit adaptive memory, drawing on foundations that link scatter search to tabu search.