Download presentation

Presentation is loading. Please wait.

Published byAiden Sanders Modified over 4 years ago

1
Case study 7: Langfords problem Model due to Barbara Smith

2
Outline Introduction Introduction Langfords problem Langfords problem Modelling it as a CSP Modelling it as a CSP Basic model Basic model Refined model Refined model Experimental Results Experimental Results Conclusions Conclusions

3
Recipe Create a basic model Create a basic model Decide on the variables Introduce auxiliary variables Introduce auxiliary variables For messy/loose constraints Consider dual, combined or 0/1 models Consider dual, combined or 0/1 models Break symmetry Break symmetry Add implied constraints Add implied constraints Customize solver Customize solver Variable, value ordering

4
Langfords problem Prob024 @ www.csplib.org Prob024 @ www.csplib.org www.csplib.org Find a sequence of 8 numbers Find a sequence of 8 numbers Each number [1,4] occurs twice Each number [1,4] occurs twice Two occurrences of i are i numbers apart Two occurrences of i are i numbers apart Unique solution Unique solution 41312432 41312432

5
Langfords problem L(k,n) problem L(k,n) problem To find a sequence of k*n numbers [1,n] To find a sequence of k*n numbers [1,n] Each of the k successive occrrences of i are i apart Each of the k successive occrrences of i are i apart We just saw L(2,4) We just saw L(2,4) Due to the mathematician Dudley Langford Due to the mathematician Dudley Langford Watched his son build a tower which solved L(2,3) Watched his son build a tower which solved L(2,3)

6
Langfords problem L(2,3) and L(2,4) have unique solutions L(2,3) and L(2,4) have unique solutions L(2,4n) and L(2,4n-1) have solutions L(2,4n) and L(2,4n-1) have solutions L(2,4n-2) and L(2,4n-3) do not L(2,4n-2) and L(2,4n-3) do not Computing all solutions of L(2,19) took 2.5 years! Computing all solutions of L(2,19) took 2.5 years! L(3,n) L(3,n) No solutions: 0

7
Basic model What are the variables? What are the variables?

8
Basic model What are the variables? What are the variables? Variable for each occurrence of a number X11 is 1st occurrence of 1 X21 is 1st occurrence of 2.. X12 is 2nd occurrence of 1 X22 is 2nd occurrence of 2.. Value is position in the sequence Value is position in the sequence

9
Basic model What are the constraints? What are the constraints? Xij in [1,n*k] Xij in [1,n*k] Xij+1 = i+Xij Xij+1 = i+Xij Alldifferent([X11,..Xn1,X12,..Xn2,..,X1k,..Xnk]) Alldifferent([X11,..Xn1,X12,..Xn2,..,X1k,..Xnk])

10
Recipe Create a basic model Create a basic model Decide on the variables Introduce auxiliary variables Introduce auxiliary variables For messy/loose constraints Consider dual, combined or 0/1 models Consider dual, combined or 0/1 models Break symmetry Break symmetry Add implied constraints Add implied constraints Customize solver Customize solver Variable, value ordering

11
Break symmetry Does the problem have any symmetry? Does the problem have any symmetry?

12
Break symmetry Does the problem have any symmetry? Does the problem have any symmetry? Of course, we can invert any sequence! Of course, we can invert any sequence!

13
Break symmetry How do we break this symmetry? How do we break this symmetry?

14
Break symmetry How do we break this symmetry? How do we break this symmetry? Many possible ways Many possible ways For example, for L(3,9) For example, for L(3,9) Either X92 < 14 (2nd occurrence of 9 is in 1st half)Either X92 < 14 (2nd occurrence of 9 is in 1st half) Or X92=14 and X82<14 (2nd occurrence of 8 is in 1st half)Or X92=14 and X82<14 (2nd occurrence of 8 is in 1st half)

15
Recipe Create a basic model Create a basic model Decide on the variables Introduce auxiliary variables Introduce auxiliary variables For messy/loose constraints Consider dual, combined or 0/1 models Consider dual, combined or 0/1 models Break symmetry Break symmetry Add implied constraints Add implied constraints Customize solver Customize solver Variable, value ordering

16
What about dual model? Can we take a dual view? Can we take a dual view?

17
What about dual model? Can we take a dual view? Can we take a dual view? Of course we can, its a permutation! Of course we can, its a permutation!

18
Dual model What are the variables? What are the variables? Variable for each position i Variable for each position i What are the values? What are the values?

19
Dual model What are the variables? What are the variables? Variable for each position i Variable for each position i What are the values? What are the values? If use the number at that position, we cannot use an all-different constraint If use the number at that position, we cannot use an all-different constraint Each number occurs not once but k times Each number occurs not once but k times

20
Dual model What are the variables? What are the variables? Variable for each position i Variable for each position i What are the values? What are the values? Solution 1: use values from [1,n*k] with the value i*n+j standing for the ith occurrence of j Solution 1: use values from [1,n*k] with the value i*n+j standing for the ith occurrence of j Now want to find a permutation of these numbers subject to the distance constraint Now want to find a permutation of these numbers subject to the distance constraint

21
Dual model What are the variables? What are the variables? Variable for each position i Variable for each position i What are the values? What are the values? Solution 2: use as values the numbers [1,n] Solution 2: use as values the numbers [1,n] Each number occurs exactly k times Each number occurs exactly k times Fortunately, there is a generalization of all-different called the global cardinality constraint (gcc) for this Fortunately, there is a generalization of all-different called the global cardinality constraint (gcc) for this

22
Global cardinality constraint Gcc([X1,..Xn],l,u) enforces values used by Xi to occur between l and u times Gcc([X1,..Xn],l,u) enforces values used by Xi to occur between l and u times All-different([X1,..Xn]) = Gcc([X1,..Xn],1,1) All-different([X1,..Xn]) = Gcc([X1,..Xn],1,1) Regins algorithm enforces GAC on Gcc in O(n^2.d) Regins algorithm enforces GAC on Gcc in O(n^2.d) Regins papers are tough to follow but this seems to beat his algorithm for all-different!? Regins papers are tough to follow but this seems to beat his algorithm for all-different!?

23
Dual model What are the constraints? What are the constraints? Gcc([D1,…Dk*n],k,k) Gcc([D1,…Dk*n],k,k) Distance constraints? Distance constraints?

24
Dual model What are the constraints? What are the constraints? Gcc([D1,…Dk*n],k,k) Gcc([D1,…Dk*n],k,k) Distance constraints: Distance constraints: Di=j then Di+j+1=jDi=j then Di+j+1=j

25
Combined model Primal and dual variables Primal and dual variables Channelling to link them Channelling to link them What do the channelling constraints look like? What do the channelling constraints look like?

26
Combined model Primal and dual variables Primal and dual variables Channelling to link them Channelling to link them Xij=k implies Dk=i Xij=k implies Dk=i

27
Solving choices? Which variables to assign? Which variables to assign? Xij or Di Xij or Di

28
Solving choices? Which variables to assign? Which variables to assign? Xij or Di, doesnt seem to matter Xij or Di, doesnt seem to matter Which variable ordering heuristic? Which variable ordering heuristic? Fail First or Lex? Fail First or Lex?

29
Solving choices? Which variables to assign? Which variables to assign? Xij or Di, doesnt seem to matter Xij or Di, doesnt seem to matter Which variable ordering heuristic? Which variable ordering heuristic? Fail First very marginally better than Lex Fail First very marginally better than Lex How to deal with the permutation constraint? How to deal with the permutation constraint? GAC on the all-different GAC on the all-different AC on the channelling AC on the channelling AC on the decomposition AC on the decomposition

30
Solving choices? Which variables to assign? Which variables to assign? Xij or Di, doesnt seem to matter Xij or Di, doesnt seem to matter Which variable ordering heuristic? Which variable ordering heuristic? Fail First very marginally better than Lex Fail First very marginally better than Lex How to deal with the permutation constraint? How to deal with the permutation constraint? AC on the channelling is often best for time AC on the channelling is often best for time

31
Conclusions Modelling is an art but there are patterns Modelling is an art but there are patterns Develop basic model Develop basic model Decide on the variables and their valuesDecide on the variables and their values Use auxiliary variables to represent constraints compactly/efficiently Use auxiliary variables to represent constraints compactly/efficiently Consider dual, combined and 0/1 models Consider dual, combined and 0/1 models Break symmetry Break symmetry Add implied constraints Add implied constraints Customize solver for your model Customize solver for your model

32
Case study 8: social golfers problem Model again due to Barbara Smith

33
Outline Introduction Introduction Social golfers problem Social golfers problem Modelling it as a CSP Modelling it as a CSP Basic model Basic model Refined model Refined model Experimental Results Experimental Results Conclusions Conclusions

34
Social golfers problem Prob013 @ www.csplib.org Prob013 @ www.csplib.org www.csplib.org 32 golfers wish to play in 8 groups of 4 each week 32 golfers wish to play in 8 groups of 4 each week No two play in the same group more than once No two play in the same group more than once How many weeks can they play? How many weeks can they play?

35
Social golfers problem Prob013 @ www.csplib.org Prob013 @ www.csplib.org www.csplib.org 32 golfers wish to play in 8 groups of 4 each week 32 golfers wish to play in 8 groups of 4 each week No two play in the same group more than once No two play in the same group more than once How many weeks can they play? How many weeks can they play? 9 weeks and this is optimal 9 weeks and this is optimal

36
Social golfers problem Of course, generalize problem to g groups of s players over w weeks Of course, generalize problem to g groups of s players over w weeks Kirkmans schoolgirls problem [Ladys & Gentlemans Diary 1850] Kirkmans schoolgirls problem [Ladys & Gentlemans Diary 1850] … a schoolmistress was in the habit of taking her girls for a daily walk. The girls were 15 in number, and were arranged in 5 rows of 3 each, so that each girl might have 2 companions. The problem is to so dispose them so that for 7 consecutive days no girl will walk with any of her school-fellows in a triplet twice … This is equivalent to social golfers problem of 5 groups of 3 players over 7 weeks

37
Recipe Create a basic model Create a basic model Decide on the variables Introduce auxiliary variables Introduce auxiliary variables For messy/loose constraints Consider dual, combined or 0/1 models Consider dual, combined or 0/1 models Break symmetry Break symmetry Add implied constraints Add implied constraints Customize solver Customize solver Variable, value ordering

38
Basic model What are the variables? What are the variables?

39
Basic model What are the variables? What are the variables? Group_ij is the set of s golfers assigned to group i in period j Group_ij is the set of s golfers assigned to group i in period j But I havent shown you set variables before! But I havent shown you set variables before!

40
Set variables CSP variables can range over (finite) domains like integers CSP variables can range over (finite) domains like integers X1 is 1, 2, 3 or 4 X1 is 1, 2, 3 or 4 Or over sets of (finite) domains Or over sets of (finite) domains Y1 is {}, {1}, {2}, or {1,2} Y1 is {}, {1}, {2}, or {1,2}

41
Set variables CSP variables can range over (finite) domains like integers CSP variables can range over (finite) domains like integers X1 is 1, 2, 3 or 4 X1 is 1, 2, 3 or 4 Or over sets of (finite) domains Or over sets of (finite) domains Y1 is {}, {1}, {2}, or {1,2} Y1 is {}, {1}, {2}, or {1,2} Usually set operations can be posted as constraints on these set variables Usually set operations can be posted as constraints on these set variables Y1 subset Z1, Y1 intersect Z1 = {}, 1 in Y1, … Y1 subset Z1, Y1 intersect Z1 = {}, 1 in Y1, …

42
Set variables Set variables are potentially expensive to reason about Set variables are potentially expensive to reason about If X1 is a subset of Y1, then X1 has exponentially many possible values If X1 is a subset of Y1, then X1 has exponentially many possible values Compromise Compromise CSP solvers just maintain upper and lower bounds on set variable CSP solvers just maintain upper and lower bounds on set variable {} subseteq X1 subseteq {1,2} {} subseteq X1 subseteq {1,2}

43
Set variables Set variables are potentially expensive to reason about Set variables are potentially expensive to reason about If X1 is a subset of Y1, then X1 has exponentially many possible values If X1 is a subset of Y1, then X1 has exponentially many possible values Compromise Compromise CSP solvers just maintain upper and lower bounds on set variable CSP solvers just maintain upper and lower bounds on set variable {} subseteq X1 subseteq {1,2} {} subseteq X1 subseteq {1,2} We loose the ability to represent disjunction We loose the ability to represent disjunction E.g. X1= {1} or X1={2} but X1=/ {1,2}

44
Basic model What are the variables? What are the variables? Group_ij is the set of s golfers assigned to group i in period j Group_ij is the set of s golfers assigned to group i in period j What are constraints? What are constraints?

45
Basic model What are the variables? What are the variables? Group_ij is the set of s golfers assigned to group i in period j Group_ij is the set of s golfers assigned to group i in period j What are constraints? What are constraints? Size of group, |Group_ij|=s Size of group, |Group_ij|=s Groups do not overlap, Group_ij intersect Group_ij={} Groups do not overlap, Group_ij intersect Group_ij={} Never meet twice, Never meet twice, for j

46
Break symmetry What symmetry does the problem have? What symmetry does the problem have?

47
Break symmetry What symmetry does the problem have? What symmetry does the problem have? Lots! Lots! Players are symmetrical Players are symmetrical Groups are symmetrical Groups are symmetrical Weeks are symmetrical Weeks are symmetrical

48
Break symmetry What symmetry does the problem have? What symmetry does the problem have? Lots! Lots! Players are symmetrical Players are symmetrical Groups are symmetrical Groups are symmetrical Weeks are symmetrical Weeks are symmetrical Set variables saved us worrying about order within group Set variables saved us worrying about order within group

49
Break symmetry We can assign some values and break some of this symmetry We can assign some values and break some of this symmetry

50
Break symmetry We can assign some values and break some of this symmetry We can assign some values and break some of this symmetry Make first week: {1,2,..s}, {s+1,s+2,..2s},… Make first week: {1,2,..s}, {s+1,s+2,..2s},…

51
Break symmetry We can assign some values and break some of this symmetry We can assign some values and break some of this symmetry Make first week: {1,2,..s}, {s+1,s+2,..2s},… Make first week: {1,2,..s}, {s+1,s+2,..2s},… In second week: player j is in jth group In second week: player j is in jth group

52
Break symmetry Symmetry is still left Symmetry is still left Weeks 2 and onwards remain symmetric Weeks 2 and onwards remain symmetric Hard to post constraints to break this Hard to post constraints to break this E.g. smallest player in week k who plays in the same group as player n is smaller than smallest player in week k+1 who plays in the same group as player nE.g. smallest player in week k who plays in the same group as player n is smaller than smallest player in week k+1 who plays in the same group as player n

53
Recipe Create a basic model Create a basic model Decide on the variables Introduce auxiliary variables Introduce auxiliary variables For messy/loose constraints Consider dual, combined or 0/1 models Consider dual, combined or 0/1 models Break symmetry Break symmetry Add implied constraints Add implied constraints Customize solver Customize solver Variable, value ordering

54
Alternative model Focus on pairs of players that play together Focus on pairs of players that play together Less intrinsic symmetry Less intrinsic symmetry

55
Alternative model What are the variables? What are the variables?

56
Alternative model What are the variables? What are the variables? Number the pairs Number the pairs is 0 is 0 is 1 is 1.. is n-2 is n-2 is n-1 is n-1..

57
Alternative model What are the variables? What are the variables? Number the pairs Number the pairs Variable Week_k is the week that pair number k meet Variable Week_k is the week that pair number k meet

58
Alternative model What are the variables? What are the variables? Number the pairs Number the pairs Variable Week_k is the week that pair number k meet Variable Week_k is the week that pair number k meet If they never meet, it is 0If they never meet, it is 0

59
Symmetry in alternative model Less symmetry Less symmetry Again, no symmetry in order of players within group Again, no symmetry in order of players within group Now, no symmetry between groups in week Now, no symmetry between groups in week Indeed, groups are not explicitly named! Indeed, groups are not explicitly named!

60
Constraints in alternative model No pair meets twice No pair meets twice Implicit in assigning single value to Week_k Implicit in assigning single value to Week_k Groups are closed Groups are closed If i and j play together in week t, and j and k play together in week t then i and k play together If i and j play together in week t, and j and k play together in week t then i and k play together Lots of messy constraints Lots of messy constraints

61
Recipe Create a basic model Create a basic model Decide on the variables Introduce auxiliary variables Introduce auxiliary variables For messy/loose constraints Consider dual, combined or 0/1 models Consider dual, combined or 0/1 models Break symmetry Break symmetry Add implied constraints Add implied constraints Customize solver Customize solver Variable, value ordering

62
Introduce auxiliary variables Players_ik = set of players playing with i in week k Players_ik = set of players playing with i in week k

63
Introduce auxiliary variables Players_ik = set of players playing with i in week k Players_ik = set of players playing with i in week k i belongs to Players_ik i belongs to Players_ik NB still havent named groups NB still havent named groups

64
Introduce auxiliary variables Players_ik = set of players playing with i in week k Players_ik = set of players playing with i in week k i belongs to Players_k i belongs to Players_k Combine with initial model Combine with initial model

65
Combined model Express constraints in model where they are easiest! Express constraints in model where they are easiest! Channelling constraints to link models Channelling constraints to link models Week_k=t with k= implies Players_it=Players_jt Week_k=t with k= implies Players_it=Players_jt Week_k/=t with k= implies Players_it intersect Players_jt = {} Week_k/=t with k= implies Players_it intersect Players_jt = {}

66
Combined model Express constraints in model where they are easiest! Express constraints in model where they are easiest! Channelling constraints to link models Channelling constraints to link models Week_k=t with k= implies Players_it=Players_jt Week_k=t with k= implies Players_it=Players_jt Week_k/=t with k= implies Players_it intersect Players_jt = {} Week_k/=t with k= implies Players_it intersect Players_jt = {} NB build in knowledge about transitivity NB build in knowledge about transitivity

67
Recipe Create a basic model Create a basic model Decide on the variables Introduce auxiliary variables Introduce auxiliary variables For messy/loose constraints Consider dual, combined or 0/1 models Consider dual, combined or 0/1 models Break symmetry Break symmetry Add implied constraints Add implied constraints Customize solver Customize solver Variable, value ordering

68
Implied constraints Take a group from any week, {g1,..gs} Take a group from any week, {g1,..gs} In any other week, these players must be spread over exactly s groups In any other week, these players must be spread over exactly s groups Adds significant overhead but can be useful on certain problems Adds significant overhead but can be useful on certain problems

69
Week symmetry Excuse the pun (week/weak) Excuse the pun (week/weak) We devised a model without groups We devised a model without groups Eliminating group symmetry Eliminating group symmetry We still have lots of week symmetry We still have lots of week symmetry Can we model without weeks? Can we model without weeks?

70
Week symmetry Excuse the pun (week/weak) Excuse the pun (week/weak) We devised a model without groups We devised a model without groups Eliminating group symmetry Eliminating group symmetry We still have lots of week symmetry We still have lots of week symmetry Can we model without weeks? Can we model without weeks? Surprisingly, yes Surprisingly, yes Model is convoluted but gives good results Model is convoluted but gives good results First model to solve Kirkmans schoolgirls problel First model to solve Kirkmans schoolgirls problel

71
3rd Model What are the variables? What are the variables? AllPairs_k is the set of all pairs playing with pair k (k= ) AllPairs_k is the set of all pairs playing with pair k (k= )

72
3rd Model What are the variables? What are the variables? AllPairs_k is the set of all pairs playing with pair k (k= ) AllPairs_k is the set of all pairs playing with pair k (k= ) k belongs to AllPairs_kk belongs to AllPairs_k

73
3rd Model What are the variables? What are the variables? AllPairs_k is the set of all pairs playing with pair k (k= ) AllPairs_k is the set of all pairs playing with pair k (k= ) SameWeek_k is the set of all pairs playing in the same week as k SameWeek_k is the set of all pairs playing in the same week as k

74
3rd Model What are the variables? What are the variables? AllPairs_k is the set of all pairs playing with pair k (k= ) AllPairs_k is the set of all pairs playing with pair k (k= ) SameWeek_k is the set of all pairs playing in the same week as k SameWeek_k is the set of all pairs playing in the same week as k PlayersWithPair_k is the set of individual players playing with k PlayersWithPair_k is the set of individual players playing with k

75
3rd Model What are the variables? What are the variables? AllPairs_k is the set of all pairs playing with pair k (k= ) AllPairs_k is the set of all pairs playing with pair k (k= ) SameWeek_k is the set of all pairs playing in the same week as k SameWeek_k is the set of all pairs playing in the same week as k PlayersWithPair_k is the set of individual players playing with k PlayersWithPair_k is the set of individual players playing with k If k= then i and j belong to PlayersWithPair_kIf k= then i and j belong to PlayersWithPair_k

76
3rd Model What are the variables? What are the variables? AllPairs_k is the set of all pairs playing with pair k (k= ) AllPairs_k is the set of all pairs playing with pair k (k= ) PairsSameWeek_k is the set of all pairs playing in the same week as k PairsSameWeek_k is the set of all pairs playing in the same week as k PlayersWithPair_k is the set of individual players playing with k PlayersWithPair_k is the set of individual players playing with k PlaySameWeek_kk is 1 iff k and k play in same week and 0 otherwise PlaySameWeek_kk is 1 iff k and k play in same week and 0 otherwise

77
Channelling We can channel back to the 2nd model We can channel back to the 2nd model if Week_k=Week_k then if Week_k=Week_k then PairsSameWeek_k = PairsSameWeek_kPairsSameWeek_k = PairsSameWeek_k If Week_k/=Week_k then If Week_k/=Week_k then PairsSameWeek_k intersect PairsSameWeek_k = {}PairsSameWeek_k intersect PairsSameWeek_k = {}…

78
Symmetry remaining Players are still symmetrical Players are still symmetrical Can assign first week Can assign first week {1,2,..s},{s+1,..,2s},… {1,2,..s},{s+1,..,2s},…

79
Conclusions Constraints can improve your golf! Constraints can improve your golf! Set variables are useful for modelling Set variables are useful for modelling Eliminate symmetry Eliminate symmetry Alternatively, we can channel into a model with less symmetry Alternatively, we can channel into a model with less symmetry Even if it is cumbersome, it can help Even if it is cumbersome, it can help More about set variables and global (non- binary) constraints on set variables next week More about set variables and global (non- binary) constraints on set variables next week

Similar presentations

OK

Constraint Based Reasoning over Mutex Relations in Graphplan Algorithm Pavel Surynek Charles University, Prague Czech Republic.

Constraint Based Reasoning over Mutex Relations in Graphplan Algorithm Pavel Surynek Charles University, Prague Czech Republic.

© 2018 SlidePlayer.com Inc.

All rights reserved.

To ensure the functioning of the site, we use **cookies**. We share information about your activities on the site with our partners and Google partners: social networks and companies engaged in advertising and web analytics. For more information, see the Privacy Policy and Google Privacy & Terms.
Your consent to our cookies if you continue to use this website.

Ads by Google

Ppt on condition monitoring Ppt on birds and animals Ppt on index numbers formula Ppt on children's day in india Maths ppt on circles for class 10 download Ppt on smart card security Ppt on power line communication circuit Ppt on leverages synonym Ppt on the art of war author Ppt on college management system