How to solve it: modern heuristics
How to solve it: modern heuristics
Backjump-based backtracking for constraint satisfaction problems
Artificial Intelligence
Local search with constraint propagation and conflict-based heuristics
Artificial Intelligence
Building University Timetables Using Constraint Logic Programming
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
Constraint Processing
Dynamic Flexible Constraint Satisfaction and Its Application to Al Planning
Dynamic Flexible Constraint Satisfaction and Its Application to Al Planning
Limited assignments: a new cutoff strategy for incomplete depth-first search
Proceedings of the 2005 ACM symposium on Applied computing
An open interactive timetabling tool
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
Interactively solving school timetabling problems using extensions of constraint programming
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
A Computational Study of a Cutting Plane Algorithm for University Course Timetabling
Journal of Scheduling
A perspective on bridging the gap between theory and practice in university timetabling
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
Modeling and solution of a complex university course timetabling problem
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
The KTS high school timetabling system
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
Search spaces for min-perturbation repair
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Complex university course timetabling
Journal of Scheduling
Emergent timetabling organization
CEEMAS'05 Proceedings of the 4th international Central and Eastern European conference on Multi-Agent Systems and Applications
Feature selection in a fuzzy student sectioning algorithm
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
Interactively solving school timetabling problems using extensions of constraint programming
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
ETTO: emergent timetabling by cooperative self-organization
ESOA'05 Proceedings of the Third international conference on Engineering Self-Organising Systems
| Hi-index | 0.00 |
Many real-life problems are dynamic, with changes in the problem definition occurring after a solution to the initial formulation has been reached. A minimal perturbation problem incorporates these changes, along with the initial solution, as a new problem whose solution must be as close as possible to the initial solution. A new iterative forward search algorithm is proposed to solve minimal perturbation problems. Significant improvements to the solution quality are achieved by including new conflict-based statistics in this algorithm. The proposed methods were applied to find a new solution to an existing large scale class timetabling problem at Purdue University, incorporating the initial solution and additional input changes.