Timetabling through constrained heuristic search and genetic algorithms

Software - Practice and Experience

Volumn 26, Issue 3, 1996, Pages 251-279

  Monfroglio, Angelo ^a,b  

^a Om Institute of Technology ^*  (Italy)

^b Om Institute of Technology   (Italy)

Author keywords

Constrained heuristic search; Constraint satisfaction; Crossover; Hybrid genetic algorithms; Order based genetic algorithms; Timetabling

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; CROSSTALK; HEURISTIC METHODS; OPTIMIZATION; SCHEDULING;

CONSTRAINED HEURISTIC SEARCH; CONSTRAINED SATISFACTION; HYBRID GENETIC ALGORITHMS; ORDER BASED GENETIC ALGORITHMS; TIMETABLING;

GENETIC ALGORITHMS;

EID: 0030104080     PISSN: 00380644     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-024X(199603)26:3<251::AID-SPE9>3.0.CO;2-E     Document Type: Article

References (34)

1. M. R. Garey and D. S. Johnson, Computer and Intractability, Freeman, San Francisco, 1979.
2. G. J. Sussman and G. L. Steele Jr., 'Constraints: a language for expressing almost-hierarchical descriptions', A.I., 14, 1-39 (1980).
3. A. K. Mackworth, 'The logic of constraint satisfaction', A.I., 58, 3-20 (1992).
4. C. J. V. Murphy, 'TIMELOG, an intelligent spreadsheet for school timetabling', SIGART Newsletter, No. 101, 21-23, 1987.
5. Wah Lim Chee, 'Intelligent timetabling spreadsheet', Master of Science in Information Technology, University of Ulster, 1988.
6. D. Pellerin and J. Herault, 'Scheduling with neural networks', Neurocomputing, Vol. 6, Elsevier, Amsterdam, 1994.
7. A. Monfroglio, 'Timetabling through a deductive data base, a case study', Data & Knowledge Engineering, North Holland, Amsterdam, 1988, No. 3.
8. R. A. Kowalski, Logic for Problem Solving, North Holland, Amsterdam, 1979.
9. F. Rossi, 'Constraint satisfaction problems in logic programming', SIGART Newsletter, No. 106, 24-28, 1988.
10. A. Thayse (ed.), From Modal Logic to Deductive Databases, Wiley, 1989.
11. C. Berge, Hypergraphs, North-Holland, Amsterdam, 1989.
12. L. Sterling and E. Shapiro, The Art of Prolog, Advanced Programming Techniques (Second Edition), The MIT Press, Cambridge, 1994.
13. K. L. Clark and F. G. McCabe, microPROLOG: programming in logic, C.A.R. Series, Prentice Hall, LPA Ltd., London, 1984.
14. W. F. Clocksin and C. S. Mellish, Programming in Prolog, Springer-Verlag, Berlin, 1994.
15. K. L. Clark and S. Gregory, 'PARLOG: parallel programming in logic', Research Report DOC 84/4, Imperial College, Department of Computing, London, 1984.
16. S. Clayman, 'Exploiting parallelism in knowledge-based systems', Kingston Polytechnic Report, 1987.
17. A. Martelli and U. Montanari, 'Optimization decision tress through heuristically guided search', CACM, 21 (12), 1025-1039 (1978).
18. E. Rich and K. Knight, Artificial Intelligence, 2nd edition, McGraw-Hill, 1991.
19. W. A. Kornfeld, 'Combinatorially implosive algorithms', CACM, 25 (10), 734-738 (1982).
20. R. G. Parker and R. L. Rardin, Discrete Optimization, Academic Press, San Diego, CA, 1988.
21. A. Monfroglio, 'General heuristics for logic constraint satisfaction', in Proceedings of the first AIIA Conference, Trento, Italy, 1989.
22. P. Van Hentenryck, Constraint Satisfaction in Logic Programming, MIT Press, 1989.
23. A. Thayse (ed.), From Natural Language Processing to Logic for Expert Systems, Wiley, 1991.
24. A. Monfroglio, 'Logic decisions under constraints', Decision Support Systems, Vol. 11, Elsevier, Amsterdam, 1994.
25. M. Fox, 'Why is scheduling difficult? A CSP perspective', Proc. ECAI '90, 1990.
26. J. H. Holland, Adaptation in Natural and Artificial Systems, The University of Michigan Press, Ann Arbor, 1975.
27. L. Davis (ed.), Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York, 1991.
28. D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, Mass., 1989.
29. I. M. Oliver, D. J. Smith and J. R. C. Holland, 'A study of permutation crossover operators on the traveling salesman problem', in John Gefenstette (ed.), Genetic Algorithms and their Applications: Proc. of the 2nd Intern. Conf. on Genetic Algorithms, Hillsdale, N.J., Lawrence Erlbaum Associates, 1987.
30. A. Colorni, M. Dorigo and V. Maniezzo, 'Gli algoritmi genetici e il problema dell'orario', Ricerca Operativa, No. 60, Franco Angeli, Milano, Italy, 1991.
31. R. Bahgat and S. Gregory, 'Pandora: non-deterministic parallel logic programming', Imperial College, London, 1988.
32. A. Monfroglio, 'Integer programs for logic constraint satisfaction', Theoretical Computer Science, The Journal of the EATCS, 97, 105-130 (1992).
33. G. C. W. Sabin and G. K. Winter, 'The impact of automated timetabling on universities - a case study', Journal of the Operational Research Society, 37 (7) (1986).
34. G. Syswerda, 'Schedule optimization using genetic algorithms', in L. Davis (ed.), Handbook of Genetic Algorithms, VNR, New York, 1991.