Solving the balanced academic curriculum problem with an hybridization of genetic algorithm and constraint propagation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4029 LNAI, Issue , 2006, Pages 410-419

  Lambert, T ^a,b   Castro, C ^c   Monfroy, E ^a,c   Saubion, F ^b  

^a UNIVERSITÉ DE NANTES   (France)

^b UNIVERSITÉ D'ANGERS   (France)

^c DEPARTAMENTO DE FÍSICA   (Chile)

Author keywords

Constraint propagation; CSP; Genetic algorithms; Hybrid resolution

Indexed keywords

COMPUTATION THEORY; CONSTRAINT THEORY; CURRICULA; FUNCTIONS; PARAMETER ESTIMATION; PROBLEM SOLVING;

ACADEMIC CURRICULUM PROBLEM; CONSTRAINT PROPAGATION; HYBRID RESOLUTION; SEARCH STRATEGIES;

GENETIC ALGORITHMS;

EID: 33746268319     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11785231_44     Document Type: Conference Paper

References (15)

1. E. Aarts and J. K. Lenstra. Local Search in Combinatorial Optimization. John Wiley & Sons, Inc., 1997.
2. K. R. Apt. From chaotic iteration to constraint propagation. In Proceedings of ICALP'97, pages 36-55. Springer-Verlag, 1997.
3. K. R. Apt. Principles of Constraint Programming, Cambridge Univ. Press, 2003.
4. N. Barnier and P. Brisset. Combine and conquer: Genetic algorithm and cp for optimization. In Proc. of CP'98, page 463, LNCS 1520, Springer, 1998.
5. E. K. Burke, D. Elliman, and R. F. Weare. A hybrid genetic algorithm for highly constrained timetabling problems. In Proc. of ICGA, pages 605-610, Morgan Kaufmann, 1995.
6. C. Castro and S. Manzano. Variable and value ordering when solving balanced academic curriculum problems. In Proceedings of 6th Workshop of the ERCIM WG on Constraints. CoRR cs. PL/0110007, 2001.
7. E. Monfroy and F. Saubion and T. Lambert. Hybrid CSP Solving. Proceeding of 5th International Workshop Frontiers of Combining Systems (FroCoS). LNCS 3717, Springer, 2005
8. F. Focacci, F. Laburthe, and A. Lodi. Local search and constraint programming. In Handbook of Metaheuristics, Kluwer Academic, 2002.
9. I. Gent, T. Walsh, and B. Selman. http://www.4c.ucc.ie/tw/csplib/, funded by the UK Network of Constraints.
10. D. E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Longman Publishing Co., Inc., 1989.
11. L. Granvilliers and E. Monfroy. Implementing constraint propagation by composition of reductions. In Proc. of ICLP'2003, LNCS 2916, pages 300-314. Springer, 2003.
12. J. H. Holland. Adaptation in Natural and Artificial Systems, 1975.
13. K. A. D. Jong. An analysis of the behavior of a class of genetic adaptive systems, Phd thesis, University of Michigan, 1975.
14. T. Lambert, E. Monfroy, and F. Saubion. Solving strategies using a hybridization model for local search and constraint propagation. In Proceedings of ACM SAC'2005. ACM, 2005.
15. E. Monfroy, F. Saubion, and T. Lambert. On hybridization of local search and constraint propagation. Proc. of ICLP'04, LNCS 3132, pp 299-313. Springer, 2004.