Hybridization of genetic algorithms and constraint propagation for the BACP Constraint Satisfaction Problems (CSP) provide a modelling framework for many computer aided decision making problems. Many of these problems are associated to an optimization criterion. Solving a CSP consists in finding an assignment of values to the variables that satisfies the constraints and optimizes a given objective function (in case of an optimization problem). In this paper, we extend our framework for genetic algorithms (GA) as suggested by the reviewers of our previous ICLP paper [E. Monfroy, F. Saubion and T. Lambert, “On hybridization of local search and constraint propagation”, Lect. Notes Comput. Sci. 3132, 299–313 (2004; Zbl 1104.68722)]. Our purpose is not to solve efficiently the Balanced Academic Curriculum Problem (BACP) [C. Castro and S. Manzano, “Variable and value ordering when solving balanced academic curriculum problems”, in: Proc. 6th Workshop of the ERCIM WG on Constraints, 12 p. (2001), available at] but to combine a genetic algorithm with constraint programming techniques and to propose a general modelling framework to precisely design such hybrid resolution process and highlight their characteristics and properties.

References in zbMATH (referenced in 6 articles , 1 standard article )

Showing results 1 to 6 of 6.
Sorted by year (citations)

  1. Ceschia, Sara; Di Gaspero, Luca; Schaerf, Andrea: The generalized balanced academic curriculum problem with heterogeneous classes (2014)
  2. Ünal, Yusuf Ziya; Uysal, Özgür: A new mixed integer programming model for curriculum balancing: application to a Turkish university (2014)
  3. Rubio, José-Miguel; Palma, Wenceslao; Rodriguez, Nibaldo; Soto, Ricardo; Crawford, Broderick; Paredes, Fernando; Cabrera, Guillermo: Solving the balanced academic curriculum problem using the ACO metaheuristic (2013) ioport
  4. Chiarandini, Marco; Di Gaspero, Luca; Gualandi, Stefano; Schaerf, Andrea: The balanced academic curriculum problem revisited (2012)
  5. Lambert, T.; Castro, C.; Monfroy, E.; Saubion, F.: Solving the balanced academic curriculum problem with an hybridization of genetic algorithm and constraint propagation (2006) ioport
  6. Lambert, Tony; Castro, Carlos; Monfroy, Eric; Riff, María Cristina; Saubion, Frédéric: Hybridization of genetic algorithms and constraint propagation for the BACP (2005)