Applying tabu search to the job-shop scheduling problem
Annals of Operations Research - Special issue on Tabu search
A fast taboo search algorithm for the job shop problem
Management Science
Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
Management Science
Comparing trailing and copying for constraint programming
Proceedings of the 1999 international conference on Logic programming
A conceptual basis for feature engineering
Journal of Systems and Software
Workflow enactment with continuation and future objects
OOPSLA '02 Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
A constraint-based architecture for local search
OOPSLA '02 Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Constraints
Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics
Journal of Heuristics
Search Procedures and Parallelism in Constraint Programming
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
A decomposition-based implementation of search strategies
ACM Transactions on Computational Logic (TOCL)
A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows
Transportation Science
Integer optimization by local search: a domain-independent approach
Integer optimization by local search: a domain-independent approach
Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Solving Non-Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of Encodings
Journal of Automated Reasoning
SLS'07 Proceedings of the 2007 international conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics
Kangaroo: an efficient constraint-based local search system using lazy propagation
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
On the design of the next generation access networks
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
| Hi-index | 0.00 |
Comet is an object-oriented language supporting a constraint-based architecture for local search through declarative and search components. This paper proposes three novel and lightweight control abstractions for the search component, significantly enhancing the compositionality, modularity, and reuse of Comet programs. These abstractions, which includes events and checkpoints, rely on first-class closures as the enabling technology. They are especially useful for expressing, in a modular way, heuristic and meta-heuristics, unions of heterogeneous neighborhoods, and sequential composition of neighborhoods.