Using Global Constraints for Local Search [chapter]

2001 Lecture Notes in Computer Science  
Conventional ways of using local search are di cult to generalize. Increased e ciency is the only goal, generality often being disregarded. This is manifested in the highly monolithic encodings of complex problems and the application of highly speci c satisfaction methods. Other approaches take the general constraint programming framework as a starting point and try to introduce local search methods for constraint satisfaction. These methods frequently fail because they have only a very limited
more » ... view of the unknown search-space structure. The present paper attempts to overcome the drawbacks of these two approaches by using global constraints. The use of global constraints for local search a l l o ws us to revise a current state on a more global level with domainspeci c knowledge, while preserving features like reusability and maintenance. The proposed strategy is demonstrated on a dynamic job-shop scheduling problem.
doi:10.1007/3-540-45746-1_2 fatcat:e2nl2si56ffxbi4snbxv7vrtoq