Two different approaches of modeling the teacher relocation problem in a constraint logic programming system and their comparison

Abstract

We propose two ways of modeling the teacher relocation problem in the (ECLPSe)-P-i constraint logic programming system, implement them and compare their performance through simulation. The first one relies on logic variables that take on boolean values. The second one involves the use of the built-in predicates element and occurrences. Simulations confirm that the approach that uses the built-in predicates performs better in general.