Академический Документы
Профессиональный Документы
Культура Документы
Institute of Mathematical Sciences and Physics University of the Philippines Los Baos
Assignment Problems...
ICMA 2011
1 / 42
Introduction
Outline
1
Introduction The Assignment Problem Weighted Neighborhood Constraint Nonweighted Neighborhood Constraint Parameters and Decision Variables Weighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Nonweighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Illustrative Example Weighted and Nonweighted Neighborhood Constraint
Bosaing et al. (IMSP, UPLB) Assignment Problems... ICMA 2011 2 / 42
Introduction
Assignment Problem
ASSIGNMENT: elements of given nite sets should be assigned to the compartments of a nite tiling
regular tilings of regular polygons in Euclidean plane (36 , 44 and 63 )
CONSTRAINT: costs of having adjacent elements from different sets are minimized
two compartments are adjacent if they share a common edge we assign weights g and g to sets g and g, respectively cost of adjacency= g g
Assignment Problems...
ICMA 2011
3 / 42
Introduction
Assignment Problem
ASSIGNMENT: elements of given nite sets should be assigned to the compartments of a nite tiling
regular tilings of regular polygons in Euclidean plane (36 , 44 and 63 )
CONSTRAINT: costs of having adjacent elements from different sets are minimized
two compartments are adjacent if they share a common edge we assign weights g and g to sets g and g, respectively cost of adjacency= g g
Assignment Problems...
ICMA 2011
3 / 42
Introduction
Assignment Problem
ASSIGNMENT: elements of given nite sets should be assigned to the compartments of a nite tiling
regular tilings of regular polygons in Euclidean plane (36 , 44 and 63 )
CONSTRAINT: costs of having adjacent elements from different sets are minimized
two compartments are adjacent if they share a common edge we assign weights g and g to sets g and g, respectively cost of adjacency= g g
Assignment Problems...
ICMA 2011
3 / 42
Introduction
Assignment Problem
ASSIGNMENT: elements of given nite sets should be assigned to the compartments of a nite tiling
regular tilings of regular polygons in Euclidean plane (36 , 44 and 63 )
CONSTRAINT: costs of having adjacent elements from different sets are minimized
two compartments are adjacent if they share a common edge we assign weights g and g to sets g and g, respectively cost of adjacency= g g
Assignment Problems...
ICMA 2011
3 / 42
Introduction
Assignment Problem
ASSIGNMENT: elements of given nite sets should be assigned to the compartments of a nite tiling
regular tilings of regular polygons in Euclidean plane (36 , 44 and 63 )
CONSTRAINT: costs of having adjacent elements from different sets are minimized
two compartments are adjacent if they share a common edge we assign weights g and g to sets g and g, respectively cost of adjacency= g g
Assignment Problems...
ICMA 2011
3 / 42
Introduction
Assignment Problem
ASSIGNMENT: elements of given nite sets should be assigned to the compartments of a nite tiling
regular tilings of regular polygons in Euclidean plane (36 , 44 and 63 )
CONSTRAINT: costs of having adjacent elements from different sets are minimized
two compartments are adjacent if they share a common edge we assign weights g and g to sets g and g, respectively cost of adjacency= g g
Assignment Problems...
ICMA 2011
3 / 42
Introduction
Assignment Problem
Introduction
Outline
1
Introduction The Assignment Problem Weighted Neighborhood Constraint Nonweighted Neighborhood Constraint Parameters and Decision Variables Weighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Nonweighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Illustrative Example Weighted and Nonweighted Neighborhood Constraint
Bosaing et al. (IMSP, UPLB) Assignment Problems... ICMA 2011 5 / 42
Introduction
Introduction
Outline
1
Introduction The Assignment Problem Weighted Neighborhood Constraint Nonweighted Neighborhood Constraint Parameters and Decision Variables Weighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Nonweighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Illustrative Example Weighted and Nonweighted Neighborhood Constraint
Bosaing et al. (IMSP, UPLB) Assignment Problems... ICMA 2011 7 / 42
Introduction
Introduction
Assignment Problems...
ICMA 2011
9 / 42
Introduction
Outline
1
Introduction The Assignment Problem Weighted Neighborhood Constraint Nonweighted Neighborhood Constraint Parameters and Decision Variables Weighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Nonweighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Illustrative Example Weighted and Nonweighted Neighborhood Constraint
Bosaing et al. (IMSP, UPLB) Assignment Problems... ICMA 2011 10 / 42
Introduction
Let the binary-valued decision variables be 0, if an element from set g is not assigned to the compartment at the ith row and jth column xgij = 1, otherwise for i = 1, 2, . . . , r and j = 1, 2, . . . , c r is the number of rows c is the number of columns Let Ng be the number of elements in set g for g = 1, 2, . . . , k where k is the number of sets.
Assignment Problems...
ICMA 2011
11 / 42
36 Tiling
Outline
1
Introduction The Assignment Problem Weighted Neighborhood Constraint Nonweighted Neighborhood Constraint Parameters and Decision Variables Weighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Nonweighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Illustrative Example Weighted and Nonweighted Neighborhood Constraint
Bosaing et al. (IMSP, UPLB) Assignment Problems... ICMA 2011 12 / 42
36 Tiling
Figure: Starting with adjacent (column) compartment and starting with non-adjacent (column) compartment
Assignment Problems...
ICMA 2011
13 / 42
36 Tiling
Figure: Adjacencies
Bosaing et al. (IMSP, UPLB) Assignment Problems... ICMA 2011 14 / 42
36 Tiling
g xgij
i=1 j=1 g=1 g=1
g xgi(j+1)
(O1)
r /2 1 c/2
+
i=1 j=1 g=1
g xg(2i)(2j)
g=1
g xg(2i+1)(2j)
(O2)
r /2
c/2
+
i=1 j=1 g=1
g xg(2i1)(2j1)
g=1
Assignment Problems...
g xg(2i)(2j1)
(O3)
ICMA 2011
15 / 42
36 Tiling
xgij
g=1
Constraint 2: For g = 1, 2, . . . , k ,
r c
xgij = Ng
i=1 j=1
36 Tiling
ij +
i=1 j=1 i=1 j=1
(2i)(2j) +
i=1 j=1
(2i1)(2j1)
g xgij
g=1 g=1
g xgi(j+1) ij 0
Assignment Problems...
ICMA 2011
17 / 42
36 Tiling
g=1
g xgij +
g=1
g xgi(j+1) ij 0
g xg(2i)(2j)
g=1 g=1
g xg(2i+1)(2j) (2i)(2j) 0
g=1
g xg(2i)(2j) +
g=1
g xg(2i+1)(2j) (2i)(2j) 0
ICMA 2011 18 / 42
Assignment Problems...
36 Tiling
g xg(2i1)(2j1)
g=1 g=1
g xg(2i)(2j1) (2i1)(2j1) 0
g=1
g xg(2i1)(2j1) +
g=1
g xg(2i)(2j1) (2i1)(2j1) 0
Assignment Problems...
ICMA 2011
19 / 42
36 Tiling
g xgij
i=1 j=1 g=1 g=1
g xgi(j+1)
(O1)
r /2 1 c/2
+
i=1 j=1 g=1
g xg(2i)(2j1)
g=1
g xg(2i+1)(2j1)
(O2)
r /2
c/2
+
i=1 j=1 g=1
g xg(2i1)(2j)
g=1
Assignment Problems...
g xg(2i)(2j)
(O3)
ICMA 2011
20 / 42
44 Tiling
Outline
1
Introduction The Assignment Problem Weighted Neighborhood Constraint Nonweighted Neighborhood Constraint Parameters and Decision Variables Weighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Nonweighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Illustrative Example Weighted and Nonweighted Neighborhood Constraint
Bosaing et al. (IMSP, UPLB) Assignment Problems... ICMA 2011 21 / 42
44 Tiling
g xgij
i=1 j=1 g=1 g=1
g xgi(j+1) +
i=1 j=1 g=1
g xgij
g=1
g xg(i+1)j
63 Tiling
Outline
1
Introduction The Assignment Problem Weighted Neighborhood Constraint Nonweighted Neighborhood Constraint Parameters and Decision Variables Weighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Nonweighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Illustrative Example Weighted and Nonweighted Neighborhood Constraint
Bosaing et al. (IMSP, UPLB) Assignment Problems... ICMA 2011 23 / 42
63 Tiling
Assignment Problems...
ICMA 2011
24 / 42
63 Tiling
g xgij
i=1 j=1 g=1 g=1
g xgi(j+1)
(O1)
r 1
+
i=1 j=1 g=1
g xgij
g=1
g xg(i+1)j
(O2)
r 1
+
i=1 j=2 g=1
Bosaing et al. (IMSP, UPLB)
g xgij
g=1
g xg(i+1)(j1)
(O3)
Assignment Problems...
ICMA 2011
25 / 42
36 Tiling
Outline
1
Introduction The Assignment Problem Weighted Neighborhood Constraint Nonweighted Neighborhood Constraint Parameters and Decision Variables Weighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Nonweighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Illustrative Example Weighted and Nonweighted Neighborhood Constraint
Bosaing et al. (IMSP, UPLB) Assignment Problems... ICMA 2011 26 / 42
36 Tiling
36 Tiling
Assignment Problems...
ICMA 2011
28 / 42
36 Tiling
(O1)
g xgi(j+1) (O1)
g xgij
g=1 g=1
i=1 j=1
r /2 1 c/2
(O2)
g xg(2i+1)(2j) (O2)
+
i=1 j=1
g xg(2i)(2j)
g=1 g=1
r /2
c/2
(O3)
g xg(2i)(2j1) (O3)
+
i=1 j=1
g xg(2i1)(2j1)
g=1 g=1
Assignment Problems...
ICMA 2011
29 / 42
36 Tiling
hij +
i=1 j=1 h=1 i=1 j=1 h=1
h(2i)(2j) +
i=1 j=1 h=1
h(2i1)(2j1)
Assignment Problems...
ICMA 2011
30 / 42
36 Tiling
continuation... Constraint 2: For h = 1, 2, . . . , k , i = 1, 2, . . . , r and j = 1, 2, . . . , c 1, h(O1) hij 0 Constraint 3: For h = 1, 2, . . . , k , i = 1, 2, . . . , r /2 1 and j = 1, 2, . . . , c/2 , h(O2) h(2i)(2j) 0 Constraint 4: For h = 1, 2, . . . , k , i = 1, 2, . . . , r /2 1 and j = 1, 2, . . . , c/2 , h(O2) h(2i)(2j) 0
Assignment Problems...
ICMA 2011
31 / 42
36 Tiling
continuation... Constraint 5: For h = 1, 2, . . . , k , i = 1, 2, . . . , r /2 and j = 1, 2, . . . , c/2 , h(O3) h(2i1)(2j1) 0 Constraint 6: For h = 1, 2, . . . , k , i = 1, 2, . . . , r /2 and j = 1, 2, . . . , c/2 , h(O3) h(2i1)(2j1) 0
Assignment Problems...
ICMA 2011
32 / 42
36 Tiling
(O1)
g xgi(j+1) (O1)
g xgij
g=1 g=1
i=1 j=1
r /2 1 c/2
(O2)
g xg(2i+1)(2j1) (O2)
+
i=1 j=1
g xg(2i)(2j1)
g=1 g=1
r /2
c/2
(O3)
g xg(2i)(2j) (O3)
+
i=1 j=1
g xg(2i1)(2j)
g=1 g=1
Assignment Problems...
ICMA 2011
33 / 42
44 Tiling
Outline
1
Introduction The Assignment Problem Weighted Neighborhood Constraint Nonweighted Neighborhood Constraint Parameters and Decision Variables Weighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Nonweighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Illustrative Example Weighted and Nonweighted Neighborhood Constraint
Bosaing et al. (IMSP, UPLB) Assignment Problems... ICMA 2011 34 / 42
44 Tiling
(O1)
g xgi(j+1) (O1)
g xgij
g=1 g=1
i=1 j=1
r 1
(O2)
g xg(i+1)j (O2)
+
i=1 j=1
g xgij
g=1 g=1
Assignment Problems...
ICMA 2011
35 / 42
63 Tiling
Outline
1
Introduction The Assignment Problem Weighted Neighborhood Constraint Nonweighted Neighborhood Constraint Parameters and Decision Variables Weighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Nonweighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Illustrative Example Weighted and Nonweighted Neighborhood Constraint
Bosaing et al. (IMSP, UPLB) Assignment Problems... ICMA 2011 36 / 42
63 Tiling
(O1)
g xgi(j+1) (O1)
g xgij
g=1 g=1
i=1 j=1
r 1
(O2)
g xg(i+1)j (O2)
+
i=1 j=1
g xgij
g=1 g=1
r 1
(O3)
g xg(i+1)(j1) (O3)
+
i=1 j=2
g xgij
g=1 g=1
Assignment Problems...
ICMA 2011
37 / 42
Illustrative Example
Outline
1
Introduction The Assignment Problem Weighted Neighborhood Constraint Nonweighted Neighborhood Constraint Parameters and Decision Variables Weighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Nonweighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Illustrative Example Weighted and Nonweighted Neighborhood Constraint
Bosaing et al. (IMSP, UPLB) Assignment Problems... ICMA 2011 38 / 42
Illustrative Example
Illustrative Example
Table: Distribution of elements per group. Group Number of elements Group 1 3 Group 2 4 Group 3 5 Assume g = g
Assignment Problems...
ICMA 2011
39 / 42
Illustrative Example
Assignment Problems...
ICMA 2011
40 / 42
Illustrative Example
Assignment Problems...
ICMA 2011
41 / 42
Appendix
References
References
Taha, H.A. Operations Research: An Introduction. Prentice Hall, 2006. Diaby, M. Linear programming formulation of the vertex colouring problem. Int. J. Mathematics in Operational Research, 2(3):259289, 2010. Esteves, R.J.P., Villadelrey, M.C. and Rabajante, J.F. Determining the Optimal Distribution of Bee Colony Locations To Avoid Overpopulation Using Mixed Integer Programming. Journal of Nature Studies, 9(1):7982, 2010. Kaatz, F.H., Bultheel, A. and Egami, T. Order in mathematically ideal porous arrays: the regular tilings. http://nalag.cs.kuleuven.be/papers/ade/regulartiles/index.html De Lara, M.L.D. and Rabajante, J.F. Population assignments in grids with neighborhood constraint. International Industrial Engineering Conference: Research, Applications and Best Practices August 2010, Cebu, Philippines.
Assignment Problems...
ICMA 2011
42 / 42
Appendix
References
References
Taha, H.A. Operations Research: An Introduction. Prentice Hall, 2006. Diaby, M. Linear programming formulation of the vertex colouring problem. Int. J. Mathematics in Operational Research, 2(3):259289, 2010. Esteves, R.J.P., Villadelrey, M.C. and Rabajante, J.F. Determining the Optimal Distribution of Bee Colony Locations To Avoid Overpopulation Using Mixed Integer Programming. Journal of Nature Studies, 9(1):7982, 2010. Kaatz, F.H., Bultheel, A. and Egami, T. Order in mathematically ideal porous arrays: the regular tilings. http://nalag.cs.kuleuven.be/papers/ade/regulartiles/index.html De Lara, M.L.D. and Rabajante, J.F. Population assignments in grids with neighborhood constraint. International Industrial Engineering Conference: Research, Applications and Best Practices August 2010, Cebu, Philippines.
Assignment Problems...
ICMA 2011
42 / 42
Appendix
References
References
Taha, H.A. Operations Research: An Introduction. Prentice Hall, 2006. Diaby, M. Linear programming formulation of the vertex colouring problem. Int. J. Mathematics in Operational Research, 2(3):259289, 2010. Esteves, R.J.P., Villadelrey, M.C. and Rabajante, J.F. Determining the Optimal Distribution of Bee Colony Locations To Avoid Overpopulation Using Mixed Integer Programming. Journal of Nature Studies, 9(1):7982, 2010. Kaatz, F.H., Bultheel, A. and Egami, T. Order in mathematically ideal porous arrays: the regular tilings. http://nalag.cs.kuleuven.be/papers/ade/regulartiles/index.html De Lara, M.L.D. and Rabajante, J.F. Population assignments in grids with neighborhood constraint. International Industrial Engineering Conference: Research, Applications and Best Practices August 2010, Cebu, Philippines.
Assignment Problems...
ICMA 2011
42 / 42
Appendix
References
References
Taha, H.A. Operations Research: An Introduction. Prentice Hall, 2006. Diaby, M. Linear programming formulation of the vertex colouring problem. Int. J. Mathematics in Operational Research, 2(3):259289, 2010. Esteves, R.J.P., Villadelrey, M.C. and Rabajante, J.F. Determining the Optimal Distribution of Bee Colony Locations To Avoid Overpopulation Using Mixed Integer Programming. Journal of Nature Studies, 9(1):7982, 2010. Kaatz, F.H., Bultheel, A. and Egami, T. Order in mathematically ideal porous arrays: the regular tilings. http://nalag.cs.kuleuven.be/papers/ade/regulartiles/index.html De Lara, M.L.D. and Rabajante, J.F. Population assignments in grids with neighborhood constraint. International Industrial Engineering Conference: Research, Applications and Best Practices August 2010, Cebu, Philippines.
Assignment Problems...
ICMA 2011
42 / 42
Appendix
References
References
Taha, H.A. Operations Research: An Introduction. Prentice Hall, 2006. Diaby, M. Linear programming formulation of the vertex colouring problem. Int. J. Mathematics in Operational Research, 2(3):259289, 2010. Esteves, R.J.P., Villadelrey, M.C. and Rabajante, J.F. Determining the Optimal Distribution of Bee Colony Locations To Avoid Overpopulation Using Mixed Integer Programming. Journal of Nature Studies, 9(1):7982, 2010. Kaatz, F.H., Bultheel, A. and Egami, T. Order in mathematically ideal porous arrays: the regular tilings. http://nalag.cs.kuleuven.be/papers/ade/regulartiles/index.html De Lara, M.L.D. and Rabajante, J.F. Population assignments in grids with neighborhood constraint. International Industrial Engineering Conference: Research, Applications and Best Practices August 2010, Cebu, Philippines.
Assignment Problems...
ICMA 2011
42 / 42