Combinatorial aspects of construction of competition Dutch Professional Football Leagues
Discrete Applied Mathematics - Special issue: Timetabling and chromatic scheduling
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
Artificial Intelligence - Special volume on constraint-based reasoning
Improving repair-based constraint satisfaction methods by value propagation
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
A tabu search heuristic for the vehicle routing problem
Management Science
RAPS: A Rule-Based Language for Specifying Resource Allocation and Time-Tabling Problems
IEEE Transactions on Knowledge and Data Engineering
A Constraint-Based High School Scheduling System
IEEE Expert: Intelligent Systems and Their Applications
Look-ahead value ordering for constraint satisfaction problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Tabu search techniques for large high-school timetabling problems
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Combining local search and backtracking techniques for constraint satisfaction
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Modular Models of Intelligence – Review, Limitations and Prospects
Artificial Intelligence Review
Coloration Neighbourhood Search With Forward Checking
Annals of Mathematics and Artificial Intelligence
Local search with constraint propagation and conflict-based heuristics
Artificial Intelligence
AIMSA '00 Proceedings of the 9th International Conference on Artificial Intelligence: Methodology, Systems, and Applications
Parallel Execution of Stochastic Search Procedures on Reduced SAT Instances
PRICAI '02 Proceedings of the 7th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
A Hybrid Seachr Architecture Applied to Hard Random 3-SAT and Low-Autocorrelation Binary Sequences
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Connections Reservation with Rerouting for ATM Networks: A Hybrid Approach with Constraints
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Local Probing Applied to Scheduling
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Solving Employee Timetabling Problems by Generalized Local Search
AI*IA '99 Proceedings of the 6th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
Modelling and Solving Employee Timetabling Problems
Annals of Mathematics and Artificial Intelligence
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
ACM Computing Surveys (CSUR)
A constraint-based hybrid heuristic solver for practical school timetabling
Design and application of hybrid intelligent systems
Hybrid metaheuristics in combinatorial optimization: A survey
Applied Soft Computing
Chemical signaling as a useful metaphor for resource management
IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part I
| Hi-index | 0.00 |
We propose a solution technique for scheduling and constraint satisfaction problems that combines backtracking-free constructive methods and local search techniques. Our technique incrementally constructs the solution, performing a local search on partial solutions each time the construction reaches a dead-end. Local search on the space of partial solutions is guided by a cost function based on three components: the distance to feasibility of the partial solution, a look-ahead factor, and (for optimization problems) a lower bound of the objective function. In order to improve search effectiveness, we make use of an adaptive relaxation of constraints and an interleaving of different lookahead factors. The new technique has been successfully experimented on two real-life problems: university course scheduling and sport tournament scheduling.