Modelling a Permutation Problem.pdfVIP

Dual Mo dels of Permutation Problems Barbara M Smith Scho ol of Computing Mathematics University of Hudderseld Hudderseld HD DH UK bmsmithhudacuk Abstract A constraint satisfaction problem is a p ermutation problem if it has the same numb er of values as variables all variables have the same domain and any solution assigns a p ermutation of the values to the variables The dual CSP interchanges the variables and values the eects of combining b oth sets of variables in a single CSP are discussed Intro duction A constraint satisfaction problem is a p ermutation problem if it has the same numb er of values as variables all variables have the same domain and any so lution assigns a p ermutation of the values to the variables Other constraints in the problem determine the acceptable p ermutations Many rostering routing and sequencing problems can b e mo delled in this way Each p ossible value is assigned to exactly one variable and each variable is assigned exactly one value The dual CSP also a p ermutation problem inter changes the variables and values For instance if there are n p eople to do n tasks we can either assign tasks to p eople or p eople to tasks We can include b oth sets of variables linked by channel ling constraints in a single CSP If the primal variables are p i  i  n and the dual variables are d  j  n the required channelling constraints are p j i d i for j i j all pairs  i j  n ILOG Solver provides an inverse constrain