POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms + data structures = evolution programs (3rd ed.)
Strategic directions in constraint programming
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
The OPL optimization programming language
The OPL optimization programming language
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
Improving Evolutionary Timetabling with Delta Evaluation and Directed Mutation
PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
Complete University Modular Timetabling Using Constraint Logic Programming
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
A Memetic Algorithm for University Exam Timetabling
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
Some Observations about GA-Based Exam Timetabling
PATAT '97 Selected papers from the Second International Conference on Practice and Theory of Automated Timetabling II
A General Scheme for Constraint Functional Logic Programming
Proceedings of the Third International Conference on Algebraic and Logic Programming
Fast Practical Evolutionary Timetabling
Selected Papers from AISB Workshop on Evolutionary Computing
Depth-bounded discrepancy search
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Specializing narrowing for timetable generation: a case study
PADL'05 Proceedings of the 7th international conference on Practical Aspects of Declarative Languages
Integrating ILOG CP technology into TOY
WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming
| Hi-index | 0.00 |
Labeling is crucial in the performance of solving timetabling problems with constraint programming. Traditionally, labeling strategies are based on static and dynamic information about variables and their domains, and selecting variables and values to assign. However, the size of combinatorial problems tractable by these techniques is limited. In this paper, we present a real problem solved with constraint programming using programmed search based on the knowledge about the solution structure as a starting point for classical propagation and labeling techniques to find a feasible solution. For those problems in which solutions are close to the seed because of its structure, propagation and labeling can reach a first solution within a small response time. We apply our approach to a real timetabling problem, and we tackle its implementation with two different languages, OPL and TOY, using the constraint programming paradigm over finite domains. While OPL is a commercial, algebraic, and specific-purpose constraint programming language, TOY is a prototype of a general-purpose constraint functional logic programming language. We present the specification of the problem, its implementation with both languages, and a comparative performance analysis.