A new BranchandPrice Algorithm for the Traveling Tournament Problem (TTP) Column Generation 2008, Aussois, France


 Margaret Kelley
 6 years ago
 Views:
Transcription
1 A new BranchandPrice Algorithm for the Traveling Tournament Problem (TTP) Column Generation 2008, Aussois, France Stefan Irnich 1 RWTH Aachen University Deutsche Post Endowed Chair of Optimization of Distribution Networks June 18th, joint work with Ulrich Schrempp 1 / 33
2 Round Robin Sports League Scheduling Sports League Scheduling: in many sports leagues the teams play a double round robin tournament: even number n of teams every team plays against each other team twice; once home and once away each team has n := n 1 opponent teams, i.e., each team plays 2 n games schedule is tight: 2 n time slots, n 2 games in each slot 2 / 33
3 Round Robin Sports League Scheduling Sports League Scheduling: in many sports leagues the teams play a double round robin tournament: even number n of teams every team plays against each other team twice; once home and once away each team has n := n 1 opponent teams, i.e., each team plays 2 n games schedule is tight: 2 n time slots, n 2 games in each slot 2 / 33
4 Round Robin Sports League Scheduling Sports League Scheduling: in many sports leagues the teams play a double round robin tournament: even number n of teams every team plays against each other team twice; once home and once away each team has n := n 1 opponent teams, i.e., each team plays 2 n games schedule is tight: 2 n time slots, n 2 games in each slot 2 / 33
5 Round Robin Sports League Scheduling Sports League Scheduling: in many sports leagues the teams play a double round robin tournament: even number n of teams every team plays against each other team twice; once home and once away each team has n := n 1 opponent teams, i.e., each team plays 2 n games schedule is tight: 2 n time slots, n 2 games in each slot 2 / 33
6 Round Robin Sports League Scheduling Sports League Scheduling: in many sports leagues the teams play a double round robin tournament: even number n of teams every team plays against each other team twice; once home and once away each team has n := n 1 opponent teams, i.e., each team plays 2 n games schedule is tight: 2 n time slots, n 2 games in each slot 2 / 33
7 Round Robin Sports League Scheduling Example: n = 4 teams n = 3 opponents 2 n = 6 time slots, each with n 2 = 2 games A feasible solution: time slot team 1: team 2: team 3: team 4: home (H) away (A) 3 / 33
8 Round Robin Sports League Scheduling Example: n = 4 teams n = 3 opponents 2 n = 6 time slots, each with n 2 = 2 games A feasible solution: time slot team 1: team 2: team 3: team 4: home (H) away (A) 3 / 33
9 Round Robin Sports League Scheduling In some sports leagues teams travel directly from one away game to the next away game! In NorthAmerica: baseball, Basketball, IceHockey etc. Example (Cont.): Teams always start at home and return home at the end! Distances traveled: team 1 : d 12 + d 23 + d 34 + d 41 team 2 : d 21 + d 13 + d 32 + d 24 + d 42 team 3 : d 31 + d 13 + d 34 + d 43 + d 32 + d 23 team 4 : d 42 + d 23 + d 31 + d 14 4 / 33
10 Round Robin Sports League Scheduling In some sports leagues teams travel directly from one away game to the next away game! In NorthAmerica: baseball, Basketball, IceHockey etc. Example (Cont.): Teams always start at home and return home at the end! Distances traveled: team 1 : d 12 + d 23 + d 34 + d 41 team 2 : d 21 + d 13 + d 32 + d 24 + d 42 team 3 : d 31 + d 13 + d 34 + d 43 + d 32 + d 23 team 4 : d 42 + d 23 + d 31 + d 14 4 / 33
11 Round Robin Sports League Scheduling In some sports leagues teams travel directly from one away game to the next away game! In NorthAmerica: baseball, Basketball, IceHockey etc. Example (Cont.): time slot team 1: team 2: team 3: team 4: home (H) away (A) Teams always start at home and return home at the end! Distances traveled: team 1 : d 12 + d 23 + d 34 + d 41 team 2 : d 21 + d 13 + d 32 + d 24 + d 42 team 3 : d 31 + d 13 + d 34 + d 43 + d 32 + d 23 team 4 : d 42 + d 23 + d 31 + d 14 4 / 33
12 Round Robin Sports League Scheduling In some sports leagues teams travel directly from one away game to the next away game! In NorthAmerica: baseball, Basketball, IceHockey etc. Example (Cont.): time slot team 1: H H H team 2: H 1 3 H 4 H team 3: 1 H H 4 H 2 team 4: H H H + home (H) away (A) Teams always start at home and return home at the end! Distances traveled: team 1 : d 12 + d 23 + d 34 + d 41 team 2 : d 21 + d 13 + d 32 + d 24 + d 42 team 3 : d 31 + d 13 + d 34 + d 43 + d 32 + d 23 team 4 : d 42 + d 23 + d 31 + d 14 4 / 33
13 Round Robin Sports League Scheduling In some sports leagues teams travel directly from one away game to the next away game! In NorthAmerica: baseball, Basketball, IceHockey etc. Example (Cont.): time slot team 1: H H H team 2: H 1 3 H 4 H team 3: 1 H H 4 H 2 team 4: H H H + home (H) away (A) Teams always start at home and return home at the end! Distances traveled: team 1 : d 12 + d 23 + d 34 + d 41 team 2 : d 21 + d 13 + d 32 + d 24 + d 42 team 3 : d 31 + d 13 + d 34 + d 43 + d 32 + d 23 team 4 : d 42 + d 23 + d 31 + d 14 4 / 33
14 Round Robin Sports League Scheduling In some sports leagues teams travel directly from one away game to the next away game! In NorthAmerica: baseball, Basketball, IceHockey etc. Example (Cont.): time slot team 1: H H H team 2: H 1 3 H 4 H team 3: 1 H H 4 H 2 team 4: H H H + home (H) away (A) Teams always start at home and return home at the end! Distances traveled: team 1 : d 12 + d 23 + d 34 + d 41 team 2 : d 21 + d 13 + d 32 + d 24 + d 42 team 3 : d 31 + d 13 + d 34 + d 43 + d 32 + d 23 team 4 : d 42 + d 23 + d 31 + d 14 4 / 33
15 Round Robin Sports League Scheduling In some sports leagues teams travel directly from one away game to the next away game! In NorthAmerica: baseball, Basketball, IceHockey etc. Example (Cont.): time slot team 1: H H H team 2: H 1 3 H 4 H team 3: 1 H H 4 H 2 team 4: H H H + home (H) away (A) Teams always start at home and return home at the end! Distances traveled: team 1 : d 12 + d 23 + d 34 + d 41 team 2 : d 21 + d 13 + d 32 + d 24 + d 42 team 3 : d 31 + d 13 + d 34 + d 43 + d 32 + d 23 team 4 : d 42 + d 23 + d 31 + d 14 4 / 33
16 Round Robin Sports League Scheduling In some sports leagues teams travel directly from one away game to the next away game! In NorthAmerica: baseball, Basketball, IceHockey etc. Example (Cont.): time slot team 1: H H H team 2: H 1 3 H 4 H team 3: 1 H H 4 H 2 team 4: H H H + home (H) away (A) Teams always start at home and return home at the end! Distances traveled: team 1 : d 12 + d 23 + d 34 + d 41 team 2 : d 21 + d 13 + d 32 + d 24 + d 42 team 3 : d 31 + d 13 + d 34 + d 43 + d 32 + d 23 team 4 : d 42 + d 23 + d 31 + d 14 4 / 33
17 Round Robin Sports League Scheduling If an away game is followed by another away game or a home game is followed by another home game, this is called a break. In an attractive schedules, the number of breaks is small. Break minimization no additional constraints: constructive methods timetables with n 2 breaks (SRR), 3n 6 (MDRR) etc. in general: minimization of breaks, s.t. additional constraints approaches: heuristics, IP or combined IP/CP (Nemhauser and Trick, 1998; Henz, 2001) Distance minimization objective: minimize distance, i.e., function separable by teams constraints: number of (consecutive) breaks approaches: heuristics, combined IP and CP (Easton et al., 2003) 5 / 33
18 Round Robin Sports League Scheduling If an away game is followed by another away game or a home game is followed by another home game, this is called a break. In an attractive schedules, the number of breaks is small. Break minimization no additional constraints: constructive methods timetables with n 2 breaks (SRR), 3n 6 (MDRR) etc. in general: minimization of breaks, s.t. additional constraints approaches: heuristics, IP or combined IP/CP (Nemhauser and Trick, 1998; Henz, 2001) Distance minimization objective: minimize distance, i.e., function separable by teams constraints: number of (consecutive) breaks approaches: heuristics, combined IP and CP (Easton et al., 2003) 5 / 33
19 Round Robin Sports League Scheduling If an away game is followed by another away game or a home game is followed by another home game, this is called a break. In an attractive schedules, the number of breaks is small. Break minimization no additional constraints: constructive methods timetables with n 2 breaks (SRR), 3n 6 (MDRR) etc. in general: minimization of breaks, s.t. additional constraints approaches: heuristics, IP or combined IP/CP (Nemhauser and Trick, 1998; Henz, 2001) Distance minimization objective: minimize distance, i.e., function separable by teams constraints: number of (consecutive) breaks approaches: heuristics, combined IP and CP (Easton et al., 2003) 5 / 33
20 Round Robin Sports League Scheduling If an away game is followed by another away game or a home game is followed by another home game, this is called a break. In an attractive schedules, the number of breaks is small. Break minimization no additional constraints: constructive methods timetables with n 2 breaks (SRR), 3n 6 (MDRR) etc. in general: minimization of breaks, s.t. additional constraints approaches: heuristics, IP or combined IP/CP (Nemhauser and Trick, 1998; Henz, 2001) Distance minimization objective: minimize distance, i.e., function separable by teams constraints: number of (consecutive) breaks approaches: heuristics, combined IP and CP (Easton et al., 2003) 5 / 33
21 What is the TTP? References The Traveling Tournament Problem (TTP) is as follows: Input: n the number of teams D = (d ij ) an n n integer distance matrix L and U integer parameters Output: A double round robin tournament on the n teams such that the number of consecutive home games and consecutive away games are between L and U inclusive (typically L = 1 nonrestrictive), and the total distance travelled by the teams is minimized (optional) norepeater constraints: game AB not followed by game BA 6 / 33
22 What is the TTP? References The Traveling Tournament Problem (TTP) is as follows: Input: n the number of teams D = (d ij ) an n n integer distance matrix L and U integer parameters Output: A double round robin tournament on the n teams such that the number of consecutive home games and consecutive away games are between L and U inclusive (typically L = 1 nonrestrictive), and the total distance travelled by the teams is minimized (optional) norepeater constraints: game AB not followed by game BA 6 / 33
23 What is the TTP? References The Traveling Tournament Problem (TTP) is as follows: Input: n the number of teams D = (d ij ) an n n integer distance matrix L and U integer parameters Output: A double round robin tournament on the n teams such that the number of consecutive home games and consecutive away games are between L and U inclusive (typically L = 1 nonrestrictive), and the total distance travelled by the teams is minimized (optional) norepeater constraints: game AB not followed by game BA 6 / 33
24 What is the TTP? References The Traveling Tournament Problem (TTP) is as follows: Input: n the number of teams D = (d ij ) an n n integer distance matrix L and U integer parameters Output: A double round robin tournament on the n teams such that the number of consecutive home games and consecutive away games are between L and U inclusive (typically L = 1 nonrestrictive), and the total distance travelled by the teams is minimized (optional) norepeater constraints: game AB not followed by game BA 6 / 33
25 What is the TTP? References The Traveling Tournament Problem (TTP) is as follows: Input: n the number of teams D = (d ij ) an n n integer distance matrix L and U integer parameters Output: A double round robin tournament on the n teams such that the number of consecutive home games and consecutive away games are between L and U inclusive (typically L = 1 nonrestrictive), and the total distance travelled by the teams is minimized (optional) norepeater constraints: game AB not followed by game BA 6 / 33
26 Extensive Formulation Easton et al. (2003) proposed the following extensive (CG) formulation based on the tour variables λ t p: P t set of tours for team t tour p P t has cost c p A t s,t = {tour of team t with away game against t in slot s} min s.t. t T c pλ t p p P t + t p λ p P t : t :p A t s,t } {{ } team t plays away t T : t t p P t : p A t st λ t p } {{ } team t t plays away against t = 1 t T s {1,..., 2 n} p P t λ t p = 1 t T (2) λ t p {0, 1} t T, p P t (3) (1) 7 / 33
27 Extensive Formulation Easton et al. (2003) proposed the following extensive (CG) formulation based on the tour variables λ t p: P t set of tours for team t tour p P t has cost c p A t s,t = {tour of team t with away game against t in slot s} min s.t. t T c pλ t p p P t + t p λ p P t : t :p A t s,t } {{ } team t plays away t T : t t p P t : p A t st λ t p } {{ } team t t plays away against t = 1 t T s {1,..., 2 n} p P t λ t p = 1 t T (2) λ t p {0, 1} t T, p P t (3) (1) 7 / 33
28 Hardness of the TTP References Empirically, a problem very hard to solve! (Easton et al., 2003): NL4: Instance with n = 4 teams Solved to optimality in 30 seconds. NL6: Instance with n = 6 teams Solved to optimality in seconds. NL8: Instance with n = 8 teams (relaxed) Solved to optimality in > 20 4 days. using 20 workstations in parallel No (theoretical) complexity results, but suspected to be N P hard! Design of good heuristic methods is a nontrivial task, see, e.g., (Van Hentenryck and Vergados, 2006) 8 / 33
29 Hardness of the TTP References Empirically, a problem very hard to solve! (Easton et al., 2003): NL4: Instance with n = 4 teams Solved to optimality in 30 seconds. NL6: Instance with n = 6 teams Solved to optimality in seconds. NL8: Instance with n = 8 teams (relaxed) Solved to optimality in > 20 4 days. using 20 workstations in parallel No (theoretical) complexity results, but suspected to be N P hard! Design of good heuristic methods is a nontrivial task, see, e.g., (Van Hentenryck and Vergados, 2006) 8 / 33
30 Hardness of the TTP References Empirically, a problem very hard to solve! (Easton et al., 2003): NL4: Instance with n = 4 teams Solved to optimality in 30 seconds. NL6: Instance with n = 6 teams Solved to optimality in seconds. NL8: Instance with n = 8 teams (relaxed) Solved to optimality in > 20 4 days. using 20 workstations in parallel No (theoretical) complexity results, but suspected to be N P hard! Design of good heuristic methods is a nontrivial task, see, e.g., (Van Hentenryck and Vergados, 2006) 8 / 33
31 Compact Formulation References Easton et al. (2003) did not provide a compact formulation Compact formulation with binary variables x t ijs, where x t = (xijs t ) represents the movement of team t xijs t = 1 if team t moves at time slot s from the venue of team i to the venue of team j (playing there at time slot s + 1) Remarks: teams are numbered by t T := {1, 2,..., n} venues are numbered as their corresponding teams, i.e., i, j T = {1, 2,..., n} time slots are numbered s {1, 2,..., 2 n} with two artificial time slots 0 and 2 n / 33
32 Compact Formulation References Easton et al. (2003) did not provide a compact formulation Compact formulation with binary variables x t ijs, where x t = (xijs t ) represents the movement of team t xijs t = 1 if team t moves at time slot s from the venue of team i to the venue of team j (playing there at time slot s + 1) Remarks: teams are numbered by t T := {1, 2,..., n} venues are numbered as their corresponding teams, i.e., i, j T = {1, 2,..., n} time slots are numbered s {1, 2,..., 2 n} with two artificial time slots 0 and 2 n / 33
33 Compact Formulation References Easton et al. (2003) did not provide a compact formulation Compact formulation with binary variables x t ijs, where x t = (xijs t ) represents the movement of team t xijs t = 1 if team t moves at time slot s from the venue of team i to the venue of team j (playing there at time slot s + 1) Remarks: teams are numbered by t T := {1, 2,..., n} venues are numbered as their corresponding teams, i.e., i, j T = {1, 2,..., n} time slots are numbered s {1, 2,..., 2 n} with two artificial time slots 0 and 2 n / 33
34 Compact Formulation References Easton et al. (2003) did not provide a compact formulation Compact formulation with binary variables x t ijs, where x t = (xijs t ) represents the movement of team t xijs t = 1 if team t moves at time slot s from the venue of team i to the venue of team j (playing there at time slot s + 1) Remarks: teams are numbered by t T := {1, 2,..., n} venues are numbered as their corresponding teams, i.e., i, j T = {1, 2,..., n} time slots are numbered s {1, 2,..., 2 n} with two artificial time slots 0 and 2 n / 33
35 Compact Formulation References Easton et al. (2003) did not provide a compact formulation Compact formulation with binary variables x t ijs, where x t = (xijs t ) represents the movement of team t xijs t = 1 if team t moves at time slot s from the venue of team i to the venue of team j (playing there at time slot s + 1) Remarks: teams are numbered by t T := {1, 2,..., n} venues are numbered as their corresponding teams, i.e., i, j T = {1, 2,..., n} time slots are numbered s {1, 2,..., 2 n} with two artificial time slots 0 and 2 n / 33
36 Compact Formulation References Easton et al. (2003) did not provide a compact formulation Compact formulation with binary variables x t ijs, where x t = (xijs t ) represents the movement of team t xijs t = 1 if team t moves at time slot s from the venue of team i to the venue of team j (playing there at time slot s + 1) Remarks: teams are numbered by t T := {1, 2,..., n} venues are numbered as their corresponding teams, i.e., i, j T = {1, 2,..., n} time slots are numbered s {1, 2,..., 2 n} with two artificial time slots 0 and 2 n / 33
37 Compact Formulation References Easton et al. (2003) did not provide a compact formulation Compact formulation with binary variables x t ijs, where x t = (xijs t ) represents the movement of team t xijs t = 1 if team t moves at time slot s from the venue of team i to the venue of team j (playing there at time slot s + 1) Remarks: teams are numbered by t T := {1, 2,..., n} venues are numbered as their corresponding teams, i.e., i, j T = {1, 2,..., n} time slots are numbered s {1, 2,..., 2 n} with two artificial time slots 0 and 2 n / 33
38 Compact Formulation References Easton et al. (2003) did not provide a compact formulation Compact formulation with binary variables x t ijs, where x t = (xijs t ) represents the movement of team t xijs t = 1 if team t moves at time slot s from the venue of team i to the venue of team j (playing there at time slot s + 1) Remarks: teams are numbered by t T := {1, 2,..., n} venues are numbered as their corresponding teams, i.e., i, j T = {1, 2,..., n} time slots are numbered s {1, 2,..., 2 n} with two artificial time slots 0 and 2 n / 33
39 Compact Formulation References Interpretation of decision variables as arcs of a layered network (V, A) nodes vis t V team t is at venue i at time s is artificial node vh0 t ( source ) and vh,2 n+1 t ( sink ) arcs (vis, t vj,s+1) t A corresponding to decision variables xijs t Network for team t = 4: 10 / 33
40 min s.t. Explanation: 2 n t T i T j T s=0 2 n s=1 j T d ij x t ijs xijs t = 1 t, i T : i t (1) xijs t xji,s+1 t = 0 t, j T, s {0,.., 2 n 1} (2) i T i T U 1 xtt,s+u t U 1 u=0 i T : j T i t x t ijs } {{ } team t plays away + and t T : j T t t U 1 xij,s+u t U 1 u=0 i t j t t T, s {1,.., 2 n U} (3) t T xtjs t = 1 s {1,.., 2 n} (4) } {{ } team t t plays away against t x t ijs {0, 1} t, i, j T, s {0,.., 2 n} (5) (1) each team t must play once at every opponent s venue 11 / 33
41 min s.t. Explanation: 2 n t T i T j T s=0 2 n s=1 j T d ij x t ijs xijs t = 1 t, i T : i t (1) xijs t xji,s+1 t = 0 t, j T, s {0,.., 2 n 1} (2) i T i T U 1 xtt,s+u t U 1 u=0 i T : j T i t x t ijs } {{ } team t plays away (2) flow conservation + and t T : j T t t U 1 xij,s+u t U 1 u=0 i t j t t T, s {1,.., 2 n U} (3) t T xtjs t = 1 s {1,.., 2 n} (4) } {{ } team t t plays away against t x t ijs {0, 1} t, i, j T, s {0,.., 2 n} (5) 11 / 33
42 min s.t. Explanation: 2 n t T i T j T s=0 2 n s=1 j T d ij x t ijs xijs t = 1 t, i T : i t (1) xijs t xji,s+1 t = 0 t, j T, s {0,.., 2 n 1} (2) i T i T U 1 xtt,s+u t U 1 u=0 i T : j T i t x t ijs } {{ } team t plays away + and t T : j T t t U 1 xij,s+u t U 1 u=0 i t j t t T, s {1,.., 2 n U} (3) t T xtjs t = 1 s {1,.., 2 n} (4) } {{ } team t t plays away against t x t ijs {0, 1} t, i, j T, s {0,.., 2 n} (5) (3) upper bound on number of consecutive home/away games 11 / 33
43 min s.t. Explanation: 2 n t T i T j T s=0 2 n s=1 j T d ij x t ijs xijs t = 1 t, i T : i t (1) xijs t xji,s+1 t = 0 t, j T, s {0,.., 2 n 1} (2) i T i T U 1 xtt,s+u t U 1 u=0 i T : j T i t x t ijs } {{ } team t plays away + and t T : j T t t U 1 xij,s+u t U 1 u=0 i t j t t T, s {1,.., 2 n U} (3) t T xtjs t = 1 s {1,.., 2 n} (4) } {{ } team t t plays away against t x t ijs {0, 1} t, i, j T, s {0,.., 2 n} (5) (4) coupling constraints: each team t must play in every time slot s 11 / 33
44 Compact Formulation References DantzigWolfe Decomposition: decomposition by teams t constraints (1), (2), and (3) are separable by team constraints of the CG pricing problem constraints (4) are coupling constraints between different teams constraints of the CG master Result is identical to CG formulation given by Easton et al. (2003). Compact formulation is useful to show that branching rules are (in)complete to derive new branching rules to derive valid inequalties compatible with pricing ( robust cuts) 12 / 33
45 Compact Formulation References DantzigWolfe Decomposition: decomposition by teams t constraints (1), (2), and (3) are separable by team constraints of the CG pricing problem constraints (4) are coupling constraints between different teams constraints of the CG master Result is identical to CG formulation given by Easton et al. (2003). Compact formulation is useful to show that branching rules are (in)complete to derive new branching rules to derive valid inequalties compatible with pricing ( robust cuts) 12 / 33
46 Compact Formulation References Optional NoRepeater Constraints (NRC) can be easily added: x t tt s + x t tt s 1 t, t T, t t, s {1,.., 2 n 1} first variable: t plays away against t in slot s + 1 second variable: t plays away against t in slot s Remarks: this is a cubic number of constraints: n(n 1)(2 n 1) NRC mix variables of different teams t t NRC cannot be modelled in the pricing problem; must remain in the CG master program dynamic constraint generation implemented! 13 / 33
47 Compact Formulation References Optional NoRepeater Constraints (NRC) can be easily added: x t tt s + x t tt s 1 t, t T, t t, s {1,.., 2 n 1} first variable: t plays away against t in slot s + 1 second variable: t plays away against t in slot s Remarks: this is a cubic number of constraints: n(n 1)(2 n 1) NRC mix variables of different teams t t NRC cannot be modelled in the pricing problem; must remain in the CG master program dynamic constraint generation implemented! 13 / 33
48 Solution of the Pricing Problem Easton et al. (2003) suggest solving the pricing problem by constraint programming (CP): Advantages: easy to implement; easy to extend to cope with additional constraints Drawback: CP does not exploit the structure of the network The Pricing Problem of each team t is a ShortestPath Problem with Resource Constraints (SPPRC): 1 one resource α {0, 1,..., U 1} for counting the number of consecutive home/way games 2 paths must be (task)elementary visit every opponent s venue at most (=exactly) once visit home venue at most (=exactly) n times 14 / 33
49 Solution of the Pricing Problem Easton et al. (2003) suggest solving the pricing problem by constraint programming (CP): Advantages: easy to implement; easy to extend to cope with additional constraints Drawback: CP does not exploit the structure of the network The Pricing Problem of each team t is a ShortestPath Problem with Resource Constraints (SPPRC): 1 one resource α {0, 1,..., U 1} for counting the number of consecutive home/way games 2 paths must be (task)elementary visit every opponent s venue at most (=exactly) once visit home venue at most (=exactly) n times 14 / 33
50 Solution of the Pricing Problem Easton et al. (2003) suggest solving the pricing problem by constraint programming (CP): Advantages: easy to implement; easy to extend to cope with additional constraints Drawback: CP does not exploit the structure of the network The Pricing Problem of each team t is a ShortestPath Problem with Resource Constraints (SPPRC): 1 one resource α {0, 1,..., U 1} for counting the number of consecutive home/way games 2 paths must be (task)elementary visit every opponent s venue at most (=exactly) once visit home venue at most (=exactly) n times 14 / 33
51 Solution of the Pricing Problem Standard labeling approach in network for team t: use labels (i, S, α, c), where i is the last node (venue) S T \ {t, i} is the set of previously visited opponent venues α is the number of consecutive home/away games c is the minimum (reduced) cost to reach state (i, S, α) Example with n = 4 teams, U = 3: Tour (3, H, H, H, 1, 2) of team t = 4 = H creates the following sequence of labels (cost c omitted): 1 (s,, 0) (initial source node s) 2 (3,, 0) 3 (H, {3}, 0) 4 (H, {3}, 1) 5 (H, {3}, 2) next game must be away 6 (1, {3}, 0) 7 (2, {1, 3}, 1) 8 (d, {1, 2, 3}, 0) (destination node d) 15 / 33
52 Solution of the Pricing Problem Standard labeling approach in network for team t: use labels (i, S, α, c), where i is the last node (venue) S T \ {t, i} is the set of previously visited opponent venues α is the number of consecutive home/away games c is the minimum (reduced) cost to reach state (i, S, α) Example with n = 4 teams, U = 3: Tour (3, H, H, H, 1, 2) of team t = 4 = H creates the following sequence of labels (cost c omitted): 1 (s,, 0) (initial source node s) 2 (3,, 0) 3 (H, {3}, 0) 4 (H, {3}, 1) 5 (H, {3}, 2) next game must be away 6 (1, {3}, 0) 7 (2, {1, 3}, 1) 8 (d, {1, 2, 3}, 0) (destination node d) 15 / 33
53 Solution of the Pricing Problem Standard labeling approach in network for team t: use labels (i, S, α, c), where i is the last node (venue) S T \ {t, i} is the set of previously visited opponent venues α is the number of consecutive home/away games c is the minimum (reduced) cost to reach state (i, S, α) Example with n = 4 teams, U = 3: Tour (3, H, H, H, 1, 2) of team t = 4 = H creates the following sequence of labels (cost c omitted): 1 (s,, 0) (initial source node s) 2 (3,, 0) 3 (H, {3}, 0) 4 (H, {3}, 1) 5 (H, {3}, 2) next game must be away 6 (1, {3}, 0) 7 (2, {1, 3}, 1) 8 (d, {1, 2, 3}, 0) (destination node d) 15 / 33
54 Solution of the Pricing Problem Standard labeling approach in network for team t: use labels (i, S, α, c), where i is the last node (venue) S T \ {t, i} is the set of previously visited opponent venues α is the number of consecutive home/away games c is the minimum (reduced) cost to reach state (i, S, α) Example with n = 4 teams, U = 3: Tour (3, H, H, H, 1, 2) of team t = 4 = H creates the following sequence of labels (cost c omitted): 1 (s,, 0) (initial source node s) 2 (3,, 0) 3 (H, {3}, 0) 4 (H, {3}, 1) 5 (H, {3}, 2) next game must be away 6 (1, {3}, 0) 7 (2, {1, 3}, 1) 8 (d, {1, 2, 3}, 0) (destination node d) 15 / 33
55 Solution of the Pricing Problem Standard labeling approach in network for team t: use labels (i, S, α, c), where i is the last node (venue) S T \ {t, i} is the set of previously visited opponent venues α is the number of consecutive home/away games c is the minimum (reduced) cost to reach state (i, S, α) Example with n = 4 teams, U = 3: Tour (3, H, H, H, 1, 2) of team t = 4 = H creates the following sequence of labels (cost c omitted): 1 (s,, 0) (initial source node s) 2 (3,, 0) 3 (H, {3}, 0) 4 (H, {3}, 1) 5 (H, {3}, 2) next game must be away 6 (1, {3}, 0) 7 (2, {1, 3}, 1) 8 (d, {1, 2, 3}, 0) (destination node d) 15 / 33
56 Solution of the Pricing Problem Standard labeling approach in network for team t: use labels (i, S, α, c), where i is the last node (venue) S T \ {t, i} is the set of previously visited opponent venues α is the number of consecutive home/away games c is the minimum (reduced) cost to reach state (i, S, α) Example with n = 4 teams, U = 3: Tour (3, H, H, H, 1, 2) of team t = 4 = H creates the following sequence of labels (cost c omitted): 1 (s,, 0) (initial source node s) 2 (3,, 0) 3 (H, {3}, 0) 4 (H, {3}, 1) 5 (H, {3}, 2) next game must be away 6 (1, {3}, 0) 7 (2, {1, 3}, 1) 8 (d, {1, 2, 3}, 0) (destination node d) 15 / 33
57 Solution of the Pricing Problem Standard labeling approach in network for team t: use labels (i, S, α, c), where i is the last node (venue) S T \ {t, i} is the set of previously visited opponent venues α is the number of consecutive home/away games c is the minimum (reduced) cost to reach state (i, S, α) Example with n = 4 teams, U = 3: Tour (3, H, H, H, 1, 2) of team t = 4 = H creates the following sequence of labels (cost c omitted): 1 (s,, 0) (initial source node s) 2 (3,, 0) 3 (H, {3}, 0) 4 (H, {3}, 1) 5 (H, {3}, 2) next game must be away 6 (1, {3}, 0) 7 (2, {1, 3}, 1) 8 (d, {1, 2, 3}, 0) (destination node d) 15 / 33
58 Solution of the Pricing Problem Standard labeling approach in network for team t: use labels (i, S, α, c), where i is the last node (venue) S T \ {t, i} is the set of previously visited opponent venues α is the number of consecutive home/away games c is the minimum (reduced) cost to reach state (i, S, α) Example with n = 4 teams, U = 3: Tour (3, H, H, H, 1, 2) of team t = 4 = H creates the following sequence of labels (cost c omitted): 1 (s,, 0) (initial source node s) 2 (3,, 0) 3 (H, {3}, 0) 4 (H, {3}, 1) 5 (H, {3}, 2) next game must be away 6 (1, {3}, 0) 7 (2, {1, 3}, 1) 8 (d, {1, 2, 3}, 0) (destination node d) 15 / 33
59 Solution of the Pricing Problem Standard labeling approach in network for team t: use labels (i, S, α, c), where i is the last node (venue) S T \ {t, i} is the set of previously visited opponent venues α is the number of consecutive home/away games c is the minimum (reduced) cost to reach state (i, S, α) Example with n = 4 teams, U = 3: Tour (3, H, H, H, 1, 2) of team t = 4 = H creates the following sequence of labels (cost c omitted): 1 (s,, 0) (initial source node s) 2 (3,, 0) 3 (H, {3}, 0) 4 (H, {3}, 1) 5 (H, {3}, 2) next game must be away 6 (1, {3}, 0) 7 (2, {1, 3}, 1) 8 (d, {1, 2, 3}, 0) (destination node d) 15 / 33
60 Solution of the Pricing Problem Standard labeling approach in network for team t: use labels (i, S, α, c), where i is the last node (venue) S T \ {t, i} is the set of previously visited opponent venues α is the number of consecutive home/away games c is the minimum (reduced) cost to reach state (i, S, α) Example with n = 4 teams, U = 3: Tour (3, H, H, H, 1, 2) of team t = 4 = H creates the following sequence of labels (cost c omitted): 1 (s,, 0) (initial source node s) 2 (3,, 0) 3 (H, {3}, 0) 4 (H, {3}, 1) 5 (H, {3}, 2) next game must be away 6 (1, {3}, 0) 7 (2, {1, 3}, 1) 8 (d, {1, 2, 3}, 0) (destination node d) 15 / 33
61 Solution of the Pricing Problem Standard labeling approach in network for team t: use labels (i, S, α, c), where i is the last node (venue) S T \ {t, i} is the set of previously visited opponent venues α is the number of consecutive home/away games c is the minimum (reduced) cost to reach state (i, S, α) Example with n = 4 teams, U = 3: Tour (3, H, H, H, 1, 2) of team t = 4 = H creates the following sequence of labels (cost c omitted): 1 (s,, 0) (initial source node s) 2 (3,, 0) 3 (H, {3}, 0) 4 (H, {3}, 1) 5 (H, {3}, 2) next game must be away 6 (1, {3}, 0) 7 (2, {1, 3}, 1) 8 (d, {1, 2, 3}, 0) (destination node d) 15 / 33
62 Solution of the Pricing Problem Standard labeling approach in network for team t: use labels (i, S, α, c), where i is the last node (venue) S T \ {t, i} is the set of previously visited opponent venues α is the number of consecutive home/away games c is the minimum (reduced) cost to reach state (i, S, α) Example with n = 4 teams, U = 3: Tour (3, H, H, H, 1, 2) of team t = 4 = H creates the following sequence of labels (cost c omitted): 1 (s,, 0) (initial source node s) 2 (3,, 0) 3 (H, {3}, 0) 4 (H, {3}, 1) 5 (H, {3}, 2) next game must be away 6 (1, {3}, 0) 7 (2, {1, 3}, 1) 8 (d, {1, 2, 3}, 0) (destination node d) 15 / 33
63 Solution of the Pricing Problem Standard labeling approach in network for team t: use labels (i, S, α, c), where i is the last node (venue) S T \ {t, i} is the set of previously visited opponent venues α is the number of consecutive home/away games c is the minimum (reduced) cost to reach state (i, S, α) Example with n = 4 teams, U = 3: Tour (3, H, H, H, 1, 2) of team t = 4 = H creates the following sequence of labels (cost c omitted): 1 (s,, 0) (initial source node s) 2 (3,, 0) 3 (H, {3}, 0) 4 (H, {3}, 1) 5 (H, {3}, 2) next game must be away 6 (1, {3}, 0) 7 (2, {1, 3}, 1) 8 (d, {1, 2, 3}, 0) (destination node d) 15 / 33
64 Solution of the Pricing Problem Standard labeling approach in network for team t: use labels (i, S, α, c), where i is the last node (venue) S T \ {t, i} is the set of previously visited opponent venues α is the number of consecutive home/away games c is the minimum (reduced) cost to reach state (i, S, α) Example with n = 4 teams, U = 3: Tour (3, H, H, H, 1, 2) of team t = 4 = H creates the following sequence of labels (cost c omitted): 1 (s,, 0) (initial source node s) 2 (3,, 0) 3 (H, {3}, 0) 4 (H, {3}, 1) 5 (H, {3}, 2) next game must be away 6 (1, {3}, 0) 7 (2, {1, 3}, 1) 8 (d, {1, 2, 3}, 0) (destination node d) 15 / 33
65 Solution of the Pricing Problem Nonstandard approach to cope with this kind of SPPRC required! Observations: 1 there is dominance only between labels with identical last node i and subset S 2 in case of a lower bound L > 1 on consecutive home/away games, there is no dominance (at all) between different labels 3 if L = 1 (i.e. no lower bound), a label with α = 0 can only dominate U 1 labels with α = 1, 2,..., U 1 Consequences: we ignore dominance between labels with different α ( factor U 1 is small, typically U = 3) we use an expanded network where nodes are states (i, S, α) no dominance check required; solution with pulling algorithm for ordinary SPP 16 / 33
66 Solution of the Pricing Problem Nonstandard approach to cope with this kind of SPPRC required! Observations: 1 there is dominance only between labels with identical last node i and subset S 2 in case of a lower bound L > 1 on consecutive home/away games, there is no dominance (at all) between different labels 3 if L = 1 (i.e. no lower bound), a label with α = 0 can only dominate U 1 labels with α = 1, 2,..., U 1 Consequences: we ignore dominance between labels with different α ( factor U 1 is small, typically U = 3) we use an expanded network where nodes are states (i, S, α) no dominance check required; solution with pulling algorithm for ordinary SPP 16 / 33
67 Solution of the Pricing Problem Nonstandard approach to cope with this kind of SPPRC required! Observations: 1 there is dominance only between labels with identical last node i and subset S 2 in case of a lower bound L > 1 on consecutive home/away games, there is no dominance (at all) between different labels 3 if L = 1 (i.e. no lower bound), a label with α = 0 can only dominate U 1 labels with α = 1, 2,..., U 1 Consequences: we ignore dominance between labels with different α ( factor U 1 is small, typically U = 3) we use an expanded network where nodes are states (i, S, α) no dominance check required; solution with pulling algorithm for ordinary SPP 16 / 33
68 Solution of the Pricing Problem Nonstandard approach to cope with this kind of SPPRC required! Observations: 1 there is dominance only between labels with identical last node i and subset S 2 in case of a lower bound L > 1 on consecutive home/away games, there is no dominance (at all) between different labels 3 if L = 1 (i.e. no lower bound), a label with α = 0 can only dominate U 1 labels with α = 1, 2,..., U 1 Consequences: we ignore dominance between labels with different α ( factor U 1 is small, typically U = 3) we use an expanded network where nodes are states (i, S, α) no dominance check required; solution with pulling algorithm for ordinary SPP 16 / 33
69 Solution of the Pricing Problem Nonstandard approach to cope with this kind of SPPRC required! Observations: 1 there is dominance only between labels with identical last node i and subset S 2 in case of a lower bound L > 1 on consecutive home/away games, there is no dominance (at all) between different labels 3 if L = 1 (i.e. no lower bound), a label with α = 0 can only dominate U 1 labels with α = 1, 2,..., U 1 Consequences: we ignore dominance between labels with different α ( factor U 1 is small, typically U = 3) we use an expanded network where nodes are states (i, S, α) no dominance check required; solution with pulling algorithm for ordinary SPP 16 / 33
70 Solution of the Pricing Problem Nonstandard approach to cope with this kind of SPPRC required! Observations: 1 there is dominance only between labels with identical last node i and subset S 2 in case of a lower bound L > 1 on consecutive home/away games, there is no dominance (at all) between different labels 3 if L = 1 (i.e. no lower bound), a label with α = 0 can only dominate U 1 labels with α = 1, 2,..., U 1 Consequences: we ignore dominance between labels with different α ( factor U 1 is small, typically U = 3) we use an expanded network where nodes are states (i, S, α) no dominance check required; solution with pulling algorithm for ordinary SPP 16 / 33
71 Solution of the Pricing Problem Nonstandard approach to cope with this kind of SPPRC required! Observations: 1 there is dominance only between labels with identical last node i and subset S 2 in case of a lower bound L > 1 on consecutive home/away games, there is no dominance (at all) between different labels 3 if L = 1 (i.e. no lower bound), a label with α = 0 can only dominate U 1 labels with α = 1, 2,..., U 1 Consequences: we ignore dominance between labels with different α ( factor U 1 is small, typically U = 3) we use an expanded network where nodes are states (i, S, α) no dominance check required; solution with pulling algorithm for ordinary SPP 16 / 33
72 Solution of the Pricing Problem Expanded Network for n = 4: 17 / 33
73 Solution of the Pricing Problem Size of the expanded network (V ex, A ex ): Here for U = 3! #teams #nodes #arcs #tours Factor n V ex A ex #tours/#arcs , ,300,000 Note: Pulling algorithm for SPP has time complexity O ( A ex ) Factor #tours/#arcs shows combinatorial leverage effect (Glover and Punnen, 1994; Ahuja et al., 1999) 18 / 33
74 Solution of the Pricing Problem Size of the expanded network (V ex, A ex ): Here for U = 3! #teams #nodes #arcs #tours Factor n V ex A ex #tours/#arcs , ,300,000 Note: Pulling algorithm for SPP has time complexity O ( A ex ) Factor #tours/#arcs shows combinatorial leverage effect (Glover and Punnen, 1994; Ahuja et al., 1999) 18 / 33
75 Solution of the Pricing Problem Size of the expanded network (V ex, A ex ): Here for U = 3! #teams #nodes #arcs #tours Factor n V ex A ex #tours/#arcs , ,300,000 Note: Pulling algorithm for SPP has time complexity O ( A ex ) Factor #tours/#arcs shows combinatorial leverage effect (Glover and Punnen, 1994; Ahuja et al., 1999) 18 / 33
76 Solution of the Pricing Problem Observations: networks are symmetric: slots 1,..., n are mirror images of slots n + 1,..., 2 n only rdc on arcs differ Consequences: build and store only the first half of the expanded network corresponding to slots 1,..., n solve SPP bidirectionally: 1 SPP forward to create rdc labels at slots 1,..., n 2 SPP backward to create rdc labels at slot 2 n,..., n merge step: combine fw and bw labels from slots n and n + 1 i.e. l fw = (i, S, α) and l bw = (i, S, α ) with S S {i, i } = T \ {t} and α + α < U 1 19 / 33
77 Solution of the Pricing Problem Observations: networks are symmetric: slots 1,..., n are mirror images of slots n + 1,..., 2 n only rdc on arcs differ Consequences: build and store only the first half of the expanded network corresponding to slots 1,..., n solve SPP bidirectionally: 1 SPP forward to create rdc labels at slots 1,..., n 2 SPP backward to create rdc labels at slot 2 n,..., n merge step: combine fw and bw labels from slots n and n + 1 i.e. l fw = (i, S, α) and l bw = (i, S, α ) with S S {i, i } = T \ {t} and α + α < U 1 19 / 33
78 Solution of the Pricing Problem Observations: networks are symmetric: slots 1,..., n are mirror images of slots n + 1,..., 2 n only rdc on arcs differ Consequences: build and store only the first half of the expanded network corresponding to slots 1,..., n solve SPP bidirectionally: 1 SPP forward to create rdc labels at slots 1,..., n 2 SPP backward to create rdc labels at slot 2 n,..., n merge step: combine fw and bw labels from slots n and n + 1 i.e. l fw = (i, S, α) and l bw = (i, S, α ) with S S {i, i } = T \ {t} and α + α < U 1 19 / 33
79 Solution of the Pricing Problem Observations: networks are symmetric: slots 1,..., n are mirror images of slots n + 1,..., 2 n only rdc on arcs differ Consequences: build and store only the first half of the expanded network corresponding to slots 1,..., n solve SPP bidirectionally: 1 SPP forward to create rdc labels at slots 1,..., n 2 SPP backward to create rdc labels at slot 2 n,..., n merge step: combine fw and bw labels from slots n and n + 1 i.e. l fw = (i, S, α) and l bw = (i, S, α ) with S S {i, i } = T \ {t} and α + α < U 1 19 / 33
80 Solution of the Pricing Problem Observations: networks are symmetric: slots 1,..., n are mirror images of slots n + 1,..., 2 n only rdc on arcs differ Consequences: build and store only the first half of the expanded network corresponding to slots 1,..., n solve SPP bidirectionally: 1 SPP forward to create rdc labels at slots 1,..., n 2 SPP backward to create rdc labels at slot 2 n,..., n merge step: combine fw and bw labels from slots n and n + 1 i.e. l fw = (i, S, α) and l bw = (i, S, α ) with S S {i, i } = T \ {t} and α + α < U 1 19 / 33
81 Solution of the Pricing Problem Observations: networks are symmetric: slots 1,..., n are mirror images of slots n + 1,..., 2 n only rdc on arcs differ Consequences: build and store only the first half of the expanded network corresponding to slots 1,..., n solve SPP bidirectionally: 1 SPP forward to create rdc labels at slots 1,..., n 2 SPP backward to create rdc labels at slot 2 n,..., n merge step: combine fw and bw labels from slots n and n + 1 i.e. l fw = (i, S, α) and l bw = (i, S, α ) with S S {i, i } = T \ {t} and α + α < U 1 19 / 33
82 Solution of the Pricing Problem Observations: networks are symmetric: slots 1,..., n are mirror images of slots n + 1,..., 2 n only rdc on arcs differ Consequences: build and store only the first half of the expanded network corresponding to slots 1,..., n solve SPP bidirectionally: 1 SPP forward to create rdc labels at slots 1,..., n 2 SPP backward to create rdc labels at slot 2 n,..., n merge step: combine fw and bw labels from slots n and n + 1 i.e. l fw = (i, S, α) and l bw = (i, S, α ) with S S {i, i } = T \ {t} and α + α < U 1 19 / 33
83 Solution of the Pricing Problem Variable Elimination ( Network Reduction): Results of (Irnich et al., 2007) can be used to eliminate arcs from the (individual!) expanded networks of each team. Given 1 a dual feasible solution π to the LPrelaxation of the CG master program 2 corresponding lower bound z LB = 1 π for TTP 3 and an upper bound UB on TTP Proposition A: If the rdc c t p(π) of a tour variable λ t p exceeds the optimality gap UB z LB, then λ t p = 0 in any optimal solution. Proposition B: If a A t ex is an arc of the expanded network of team t and every tour through a has rdc greater than UB z LB, then no optimal tour p P t contains a. 20 / 33
84 Solution of the Pricing Problem Variable Elimination ( Network Reduction): Results of (Irnich et al., 2007) can be used to eliminate arcs from the (individual!) expanded networks of each team. Given 1 a dual feasible solution π to the LPrelaxation of the CG master program 2 corresponding lower bound z LB = 1 π for TTP 3 and an upper bound UB on TTP Proposition A: If the rdc c t p(π) of a tour variable λ t p exceeds the optimality gap UB z LB, then λ t p = 0 in any optimal solution. Proposition B: If a A t ex is an arc of the expanded network of team t and every tour through a has rdc greater than UB z LB, then no optimal tour p P t contains a. 20 / 33
85 Solution of the Pricing Problem Variable Elimination ( Network Reduction): Results of (Irnich et al., 2007) can be used to eliminate arcs from the (individual!) expanded networks of each team. Given 1 a dual feasible solution π to the LPrelaxation of the CG master program 2 corresponding lower bound z LB = 1 π for TTP 3 and an upper bound UB on TTP Proposition A: If the rdc c t p(π) of a tour variable λ t p exceeds the optimality gap UB z LB, then λ t p = 0 in any optimal solution. Proposition B: If a A t ex is an arc of the expanded network of team t and every tour through a has rdc greater than UB z LB, then no optimal tour p P t contains a. 20 / 33
86 Solution of the Pricing Problem Variable Elimination ( Network Reduction): Results of (Irnich et al., 2007) can be used to eliminate arcs from the (individual!) expanded networks of each team. Given 1 a dual feasible solution π to the LPrelaxation of the CG master program 2 corresponding lower bound z LB = 1 π for TTP 3 and an upper bound UB on TTP Proposition A: If the rdc c t p(π) of a tour variable λ t p exceeds the optimality gap UB z LB, then λ t p = 0 in any optimal solution. Proposition B: If a A t ex is an arc of the expanded network of team t and every tour through a has rdc greater than UB z LB, then no optimal tour p P t contains a. 20 / 33
87 Solution of the Pricing Problem Variable Elimination ( Network Reduction): Results of (Irnich et al., 2007) can be used to eliminate arcs from the (individual!) expanded networks of each team. Given 1 a dual feasible solution π to the LPrelaxation of the CG master program 2 corresponding lower bound z LB = 1 π for TTP 3 and an upper bound UB on TTP Proposition A: If the rdc c t p(π) of a tour variable λ t p exceeds the optimality gap UB z LB, then λ t p = 0 in any optimal solution. Proposition B: If a A t ex is an arc of the expanded network of team t and every tour through a has rdc greater than UB z LB, then no optimal tour p P t contains a. 20 / 33
88 Solution of the Pricing Problem Variable Elimination ( Network Reduction): Results of (Irnich et al., 2007) can be used to eliminate arcs from the (individual!) expanded networks of each team. Given 1 a dual feasible solution π to the LPrelaxation of the CG master program 2 corresponding lower bound z LB = 1 π for TTP 3 and an upper bound UB on TTP Proposition A: If the rdc c t p(π) of a tour variable λ t p exceeds the optimality gap UB z LB, then λ t p = 0 in any optimal solution. Proposition B: If a A t ex is an arc of the expanded network of team t and every tour through a has rdc greater than UB z LB, then no optimal tour p P t contains a. 20 / 33
89 Solution of the Pricing Problem Variable Elimination ( Network Reduction) (Cont.): Smallest rdc of tours through an arbitrary arc a = (v, w) A t ex can be computed with a bidirectional SPP approach: 1 solve full fw SPP; cost labels c fw (v) at nodes v 2 solve full bw SPP; cost labels c bw (v) at nodes v 3 value rdc(v, w) := c fw (v) + c vw + c bw (w) is minimum rdc of paths through a = (v, w) 4 Rule: Eliminate a = (v, w) if rdc(v, w) > UB z LB Effort: O (3 A t ex ), i.e., same as pricing 21 / 33
90 Solution of the Pricing Problem Variable Elimination ( Network Reduction) (Cont.): Smallest rdc of tours through an arbitrary arc a = (v, w) A t ex can be computed with a bidirectional SPP approach: 1 solve full fw SPP; cost labels c fw (v) at nodes v 2 solve full bw SPP; cost labels c bw (v) at nodes v 3 value rdc(v, w) := c fw (v) + c vw + c bw (w) is minimum rdc of paths through a = (v, w) 4 Rule: Eliminate a = (v, w) if rdc(v, w) > UB z LB Effort: O (3 A t ex ), i.e., same as pricing 21 / 33
91 Solution of the Pricing Problem Variable Elimination ( Network Reduction) (Cont.): Smallest rdc of tours through an arbitrary arc a = (v, w) A t ex can be computed with a bidirectional SPP approach: 1 solve full fw SPP; cost labels c fw (v) at nodes v 2 solve full bw SPP; cost labels c bw (v) at nodes v 3 value rdc(v, w) := c fw (v) + c vw + c bw (w) is minimum rdc of paths through a = (v, w) 4 Rule: Eliminate a = (v, w) if rdc(v, w) > UB z LB Effort: O (3 A t ex ), i.e., same as pricing 21 / 33
92 Solution of the Pricing Problem Variable Elimination ( Network Reduction) (Cont.): Smallest rdc of tours through an arbitrary arc a = (v, w) A t ex can be computed with a bidirectional SPP approach: 1 solve full fw SPP; cost labels c fw (v) at nodes v 2 solve full bw SPP; cost labels c bw (v) at nodes v 3 value rdc(v, w) := c fw (v) + c vw + c bw (w) is minimum rdc of paths through a = (v, w) 4 Rule: Eliminate a = (v, w) if rdc(v, w) > UB z LB Effort: O (3 A t ex ), i.e., same as pricing 21 / 33
93 Solution of the Pricing Problem Variable Elimination ( Network Reduction) (Cont.): Smallest rdc of tours through an arbitrary arc a = (v, w) A t ex can be computed with a bidirectional SPP approach: 1 solve full fw SPP; cost labels c fw (v) at nodes v 2 solve full bw SPP; cost labels c bw (v) at nodes v 3 value rdc(v, w) := c fw (v) + c vw + c bw (w) is minimum rdc of paths through a = (v, w) 4 Rule: Eliminate a = (v, w) if rdc(v, w) > UB z LB Effort: O (3 A t ex ), i.e., same as pricing 21 / 33
Sport Timetabling. Outline DM87 SCHEDULING, TIMETABLING AND ROUTING. Outline. Lecture 15. 1. Problem Definitions
Outline DM87 SCHEDULING, TIMETABLING AND ROUTING Lecture 15 Sport Timetabling 1. Problem Definitions Marco Chiarandini DM87 Scheduling, Timetabling and Routing 2 Problems we treat: single and double roundrobin
More informationAn Approximation Algorithm for the Unconstrained Traveling Tournament Problem
An Approximation Algorithm for the Unconstrained Traveling Tournament Problem Shinji Imahori 1, Tomomi Matsui 2, and Ryuhei Miyashiro 3 1 Graduate School of Engineering, Nagoya University, Furocho, Chikusaku,
More informationDynamic programming. Doctoral course Optimization on graphs  Lecture 4.1. Giovanni Righini. January 17 th, 2013
Dynamic programming Doctoral course Optimization on graphs  Lecture.1 Giovanni Righini January 1 th, 201 Implicit enumeration Combinatorial optimization problems are in general NPhard and we usually
More informationMATHEMATICAL ENGINEERING TECHNICAL REPORTS. An Improved Approximation Algorithm for the Traveling Tournament Problem
MATHEMATICAL ENGINEERING TECHNICAL REPORTS An Improved Approximation Algorithm for the Traveling Tournament Problem Daisuke YAMAGUCHI, Shinji IMAHORI, Ryuhei MIYASHIRO, Tomomi MATSUI METR 2009 42 September
More informationScheduling the German Basketball League
Scheduling the German Basketball League Stephan Westphal Institute for Numerical and Applied Mathematics, University of Göttingen, Germany Daniel H. Wagner Prize for Excellence in Operations Research Practice,
More informationBranchandPrice Approach to the Vehicle Routing Problem with Time Windows
TECHNISCHE UNIVERSITEIT EINDHOVEN BranchandPrice Approach to the Vehicle Routing Problem with Time Windows Lloyd A. Fasting May 2014 Supervisors: dr. M. Firat dr.ir. M.A.A. Boon J. van Twist MSc. Contents
More informationDantzigWolfe bound and DantzigWolfe cookbook
DantzigWolfe bound and DantzigWolfe cookbook thst@man.dtu.dk DTUManagement Technical University of Denmark 1 Outline LP strength of the DantzigWolfe The exercise from last week... The DantzigWolfe
More informationA Sports Tournament Scheduling Problem: Exploiting Constraintbased Algorithm and Neighborhood Search for the Solution
, July 46, 2012, London, U.K. A Sports Tournament Scheduling Problem: Exploiting Constraintbased Algorithm and Neighborhood Search for the Solution Razamin Ramli, CaiJuan Soong, and Haslinda Ibrahim
More informationA Constraint Programming based Column Generation Approach to Nurse Rostering Problems
Abstract A Constraint Programming based Column Generation Approach to Nurse Rostering Problems Fang He and Rong Qu The Automated Scheduling, Optimisation and Planning (ASAP) Group School of Computer Science,
More informationBranch and Cut for TSP
Branch and Cut for TSP jla,jc@imm.dtu.dk Informatics and Mathematical Modelling Technical University of Denmark 1 BranchandCut for TSP BranchandCut is a general technique applicable e.g. to solve symmetric
More informationScheduling Home Health Care with Separating Benders Cuts in Decision Diagrams
Scheduling Home Health Care with Separating Benders Cuts in Decision Diagrams André Ciré University of Toronto John Hooker Carnegie Mellon University INFORMS 2014 Home Health Care Home health care delivery
More informationApproximation Algorithms
Approximation Algorithms or: How I Learned to Stop Worrying and Deal with NPCompleteness Ong Jit Sheng, Jonathan (A0073924B) March, 2012 Overview Key Results (I) General techniques: Greedy algorithms
More information! Solve problem to optimality. ! Solve problem in polytime. ! Solve arbitrary instances of the problem. !approximation algorithm.
Approximation Algorithms Chapter Approximation Algorithms Q Suppose I need to solve an NPhard problem What should I do? A Theory says you're unlikely to find a polytime algorithm Must sacrifice one of
More informationChapter 11. 11.1 Load Balancing. Approximation Algorithms. Load Balancing. Load Balancing on 2 Machines. Load Balancing: Greedy Scheduling
Approximation Algorithms Chapter Approximation Algorithms Q. Suppose I need to solve an NPhard problem. What should I do? A. Theory says you're unlikely to find a polytime algorithm. Must sacrifice one
More informationQoS optimization for an. ondemand transportation system via a fractional linear objective function
QoS optimization for an Load charge ratio ondemand transportation system via a fractional linear objective function Thierry Garaix, University of Avignon (France) Column Generation 2008 QoS optimization
More informationDiscrete Optimization
Discrete Optimization [Chen, Batson, Dang: Applied integer Programming] Chapter 3 and 4.14.3 by Johan Högdahl and Victoria Svedberg Seminar 2, 20150331 Todays presentation Chapter 3 Transforms using
More informationModeling and Solving the Capacitated Vehicle Routing Problem on Trees
in The Vehicle Routing Problem: Latest Advances and New Challenges Modeling and Solving the Capacitated Vehicle Routing Problem on Trees Bala Chandran 1 and S. Raghavan 2 1 Department of Industrial Engineering
More information5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1
5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1 General Integer Linear Program: (ILP) min c T x Ax b x 0 integer Assumption: A, b integer The integrality condition
More informationAN INTRODUCTION TO DIAMOND SCHEDULER
AN INTRODUCTION TO DIAMOND SCHEDULER Draft 11/26/2014 Note: Please send suggestions to jhall@cactusware.com Cactusware, LLC AN INTRODUCTION TO DIAMOND SCHEDULER WELCOME Welcome to Diamond Scheduler Sports
More informationINTEGER PROGRAMMING. Integer Programming. Prototype example. BIP model. BIP models
Integer Programming INTEGER PROGRAMMING In many problems the decision variables must have integer values. Example: assign people, machines, and vehicles to activities in integer quantities. If this is
More information! Solve problem to optimality. ! Solve problem in polytime. ! Solve arbitrary instances of the problem. #approximation algorithm.
Approximation Algorithms 11 Approximation Algorithms Q Suppose I need to solve an NPhard problem What should I do? A Theory says you're unlikely to find a polytime algorithm Must sacrifice one of three
More informationScheduling Shop Scheduling. Tim Nieberg
Scheduling Shop Scheduling Tim Nieberg Shop models: General Introduction Remark: Consider non preemptive problems with regular objectives Notation Shop Problems: m machines, n jobs 1,..., n operations
More informationAn Expressive Auction Design for Online Display Advertising. AUTHORS: Sébastien Lahaie, David C. Parkes, David M. Pennock
An Expressive Auction Design for Online Display Advertising AUTHORS: Sébastien Lahaie, David C. Parkes, David M. Pennock Li PU & Tong ZHANG Motivation Online advertisement allow advertisers to specify
More informationA ColumnGeneration and BranchandCut Approach to the BandwidthPacking Problem
[J. Res. Natl. Inst. Stand. Technol. 111, 161185 (2006)] A ColumnGeneration and BranchandCut Approach to the BandwidthPacking Problem Volume 111 Number 2 MarchApril 2006 Christine Villa and Karla
More informationOptimization Modeling for Mining Engineers
Optimization Modeling for Mining Engineers Alexandra M. Newman Division of Economics and Business Slide 1 Colorado School of Mines Seminar Outline Linear Programming Integer Linear Programming Slide 2
More informationJUSTINTIME SCHEDULING WITH PERIODIC TIME SLOTS. Received December May 12, 2003; revised February 5, 2004
Scientiae Mathematicae Japonicae Online, Vol. 10, (2004), 431 437 431 JUSTINTIME SCHEDULING WITH PERIODIC TIME SLOTS Ondřej Čepeka and Shao Chin Sung b Received December May 12, 2003; revised February
More informationA Column Generation Model for Truck Routing in the Chilean Forest Industry
A Column Generation Model for Truck Routing in the Chilean Forest Industry Pablo A. Rey Escuela de Ingeniería Industrial, Facultad de Ingeniería, Universidad Diego Portales, Santiago, Chile, email: pablo.rey@udp.cl
More informationDynamic programming formulation
1.24 Lecture 14 Dynamic programming: Job scheduling Dynamic programming formulation To formulate a problem as a dynamic program: Sort by a criterion that will allow infeasible combinations to be eli minated
More informationIncremental Network Design with Shortest Paths
Incremental Network Design with Shortest Paths Tarek Elgindy, Andreas T. Ernst, Matthew Baxter CSIRO Mathematics Informatics and Statistics, Australia Martin W.P. Savelsbergh University of Newcastle, Australia
More informationAlgorithm Design and Analysis
Algorithm Design and Analysis LECTURE 27 Approximation Algorithms Load Balancing Weighted Vertex Cover Reminder: Fill out SRTEs online Don t forget to click submit Sofya Raskhodnikova 12/6/2011 S. Raskhodnikova;
More informationApplied Algorithm Design Lecture 5
Applied Algorithm Design Lecture 5 Pietro Michiardi Eurecom Pietro Michiardi (Eurecom) Applied Algorithm Design Lecture 5 1 / 86 Approximation Algorithms Pietro Michiardi (Eurecom) Applied Algorithm Design
More informationRouting in Line Planning for Public Transport
KonradZuseZentrum für Informationstechnik Berlin Takustraße 7 D14195 BerlinDahlem Germany MARC E. PFETSCH RALF BORNDÖRFER Routing in Line Planning for Public Transport Supported by the DFG Research
More informationLiner Shipping Revenue Management with Respositioning of Empty Containers
Liner Shipping Revenue Management with Respositioning of Empty Containers Berit Løfstedt David Pisinger Simon Spoorendonk Technical Report no. 0815 ISSN: 01078283 Dept. of Computer Science University
More informationCHAPTER 9. Integer Programming
CHAPTER 9 Integer Programming An integer linear program (ILP) is, by definition, a linear program with the additional constraint that all variables take integer values: (9.1) max c T x s t Ax b and x integral
More information6.852: Distributed Algorithms Fall, 2009. Class 2
.8: Distributed Algorithms Fall, 009 Class Today s plan Leader election in a synchronous ring: Lower bound for comparisonbased algorithms. Basic computation in general synchronous networks: Leader election
More informationComplexity of the Traveling Tournament Problem
Complexity of the Traveling Tournament Problem Clemens Thielen and Stephan Westphal Department of Mathematics, University of Kaiserslautern, PaulEhrlichStr 14, D67663 Kaiserslautern, Germany {thielen,westphal}@mathematikuniklde
More informationAn optimization model for aircraft maintenance scheduling and reassignment
Transportation Research Part A 37 (2003) 29 48 www.elsevier.com/locate/tra An optimization model for aircraft maintenance scheduling and reassignment Chellappan Sriram 1, Ali Haghani * Department of Civil
More informationA Labeling Algorithm for the MaximumFlow Network Problem
A Labeling Algorithm for the MaximumFlow Network Problem Appendix C Networkflow problems can be solved by several methods. In Chapter 8 we introduced this topic by exploring the special structure of
More informationOffline sorting buffers on Line
Offline sorting buffers on Line Rohit Khandekar 1 and Vinayaka Pandit 2 1 University of Waterloo, ON, Canada. email: rkhandekar@gmail.com 2 IBM India Research Lab, New Delhi. email: pvinayak@in.ibm.com
More informationResource Optimization of Spatial TDMA in Ad Hoc Radio Networks: A Column Generation Approach
Resource Optimization of Spatial TDMA in Ad Hoc Radio Networks: A Column Generation Approach Patrik Björklund, Peter Värbrand and Di Yuan Department of Science and Technology, Linköping University SE601
More informationMotivated by a problem faced by a large manufacturer of a consumer product, we
A Coordinated Production Planning Model with Capacity Expansion and Inventory Management Sampath Rajagopalan Jayashankar M. Swaminathan Marshall School of Business, University of Southern California, Los
More informationA SAT Based Scheduler for Tournament Schedules
A SAT Based Scheduler for Tournament Schedules Hantao Zhang, Dapeng Li, and Haiou Shen Department of Computer Science The University of Iowa Iowa City, IA 522421419, USA {dapli, hshen, hzhang}@cs.uiowa.edu
More informationMultiple Spanning Tree Protocol (MSTP), Multi Spreading And Network Optimization Model
Load Balancing of Telecommunication Networks based on Multiple Spanning Trees Dorabella Santos Amaro de Sousa Filipe Alvelos Instituto de Telecomunicações 3810193 Aveiro, Portugal dorabella@av.it.pt Instituto
More informationEfficient and Robust Allocation Algorithms in Clouds under Memory Constraints
Efficient and Robust Allocation Algorithms in Clouds under Memory Constraints Olivier Beaumont,, Paul RenaudGoud Inria & University of Bordeaux Bordeaux, France 9th Scheduling for Large Scale Systems
More informationSingle machine models: Maximum Lateness 12 Approximation ratio for EDD for problem 1 r j,d j < 0 L max. structure of a schedule Q...
Lecture 4 Scheduling 1 Single machine models: Maximum Lateness 12 Approximation ratio for EDD for problem 1 r j,d j < 0 L max structure of a schedule 0 Q 1100 11 00 11 000 111 0 0 1 1 00 11 00 11 00
More informationCost Models for Vehicle Routing Problems. 8850 Stanford Boulevard, Suite 260 R. H. Smith School of Business
0769514359/02 $17.00 (c) 2002 IEEE 1 Cost Models for Vehicle Routing Problems John Sniezek Lawerence Bodin RouteSmart Technologies Decision and Information Technologies 8850 Stanford Boulevard, Suite
More informationEquilibrium computation: Part 1
Equilibrium computation: Part 1 Nicola Gatti 1 Troels Bjerre Sorensen 2 1 Politecnico di Milano, Italy 2 Duke University, USA Nicola Gatti and Troels Bjerre Sørensen ( Politecnico di Milano, Italy, Equilibrium
More informationA Numerical Study on the Wiretap Network with a Simple Network Topology
A Numerical Study on the Wiretap Network with a Simple Network Topology Fan Cheng and Vincent Tan Department of Electrical and Computer Engineering National University of Singapore Mathematical Tools of
More informationA Branch and Bound Algorithm for Solving the Binary Bilevel Linear Programming Problem
A Branch and Bound Algorithm for Solving the Binary Bilevel Linear Programming Problem John Karlof and Peter Hocking Mathematics and Statistics Department University of North Carolina Wilmington Wilmington,
More informationReoptimization of Rolling Stock Rotations
KonradZuseZentrum für Informationstechnik Berlin Takustraße 7 D14195 BerlinDahlem Germany RALF BORNDÖRFER 1, JULIKA MEHRGARDT 1, MARKUS REUTHER 1, THOMAS SCHLECHTE 1, KERSTIN WAAS 2 Reoptimization
More informationLecture 10 Scheduling 1
Lecture 10 Scheduling 1 Transportation Models 1 large variety of models due to the many modes of transportation roads railroad shipping airlines as a consequence different type of equipment and resources
More informationNEW MODELS FOR THE MIRRORED TRAVELING TOURNAMENT PROBLEM
NEW MODELS FOR THE MIRRORED TRAVELING TOURNAMENT PROBLEM Marco Antonio Moreira de Carvalho Instituto Tecnológico de Aeronáutica ITA Praça Marechal Eduardo Gomes, 50, São José dos Campos SP, Brasil mamc@ita.br
More informationCharles Fleurent Director  Optimization algorithms
Software Tools for Transit Scheduling and Routing at GIRO Charles Fleurent Director  Optimization algorithms Objectives Provide an overview of software tools and optimization algorithms offered by GIRO
More informationRandomization Approaches for Network Revenue Management with Customer Choice Behavior
Randomization Approaches for Network Revenue Management with Customer Choice Behavior Sumit Kunnumkal Indian School of Business, Gachibowli, Hyderabad, 500032, India sumit kunnumkal@isb.edu March 9, 2011
More informationA BranchCutandPrice Approach to the Bus Evacuation Problem with Integrated Collection Point and Shelter Decisions
A BranchCutandPrice Approach to the Bus Evacuation Problem with Integrated Collection Point and Shelter Decisions Marc Goerigk, Bob Grün, and Philipp Heßler Fachbereich Mathematik, Technische Universität
More informationRecovery of primal solutions from dual subgradient methods for mixed binary linear programming; a branchandbound approach
MASTER S THESIS Recovery of primal solutions from dual subgradient methods for mixed binary linear programming; a branchandbound approach PAULINE ALDENVIK MIRJAM SCHIERSCHER Department of Mathematical
More informationRailway rolling stock is one of the most significant cost components for operators of passenger trains. The
TRANSPORTATION SCIENCE Vol. 0, No., August 2006, pp. 78 91 issn 0011655 eissn 152657 06 00 078 informs doi 10.1287/trsc.1060.0155 2006 INFORMS Efficient Circulation of Railway Rolling Stock Arianna Alfieri
More informationComplexity Theory. IE 661: Scheduling Theory Fall 2003 Satyaki Ghosh Dastidar
Complexity Theory IE 661: Scheduling Theory Fall 2003 Satyaki Ghosh Dastidar Outline Goals Computation of Problems Concepts and Definitions Complexity Classes and Problems Polynomial Time Reductions Examples
More informationarxiv:1112.0829v1 [math.pr] 5 Dec 2011
How Not to Win a Million Dollars: A Counterexample to a Conjecture of L. Breiman Thomas P. Hayes arxiv:1112.0829v1 [math.pr] 5 Dec 2011 Abstract Consider a gambling game in which we are allowed to repeatedly
More informationInternet (IPv4) Topology Mapping. Department of Computer Science The University of Texas at Dallas
Internet (IPv4) Topology Mapping Kamil Sarac (ksarac@utdallas.edu) Department of Computer Science The University of Texas at Dallas Internet topology measurement/mapping Need for Internet topology measurement
More informationHow To Solve A Minimum Set Covering Problem (Mcp)
Measuring Rationality with the Minimum Cost of Revealed Preference Violations Mark Dean and Daniel Martin Online Appendices  Not for Publication 1 1 Algorithm for Solving the MASP In this online appendix
More informationOptimization Theory for Large Systems
Optimization Theory for Large Systems LEON S. LASDON CASE WESTERN RESERVE UNIVERSITY THE MACMILLAN COMPANY COLLIERMACMILLAN LIMITED, LONDON Contents 1. Linear and Nonlinear Programming 1 1.1 Unconstrained
More informationHighperformance local search for planning maintenance of EDF nuclear park
Highperformance local search for planning maintenance of EDF nuclear park Frédéric Gardi Karim Nouioua Bouygues elab, Paris fgardi@bouygues.com Laboratoire d'informatique Fondamentale  CNRS UMR 6166,
More informationThe Binary Blocking Flow Algorithm. Andrew V. Goldberg Microsoft Research Silicon Valley www.research.microsoft.com/ goldberg/
The Binary Blocking Flow Algorithm Andrew V. Goldberg Microsoft Research Silicon Valley www.research.microsoft.com/ goldberg/ Theory vs. Practice In theory, there is no difference between theory and practice.
More informationNoncommercial Software for MixedInteger Linear Programming
Noncommercial Software for MixedInteger Linear Programming J. T. Linderoth T. K. Ralphs December, 2004. Revised: January, 2005. Abstract We present an overview of noncommercial software tools for the
More informationLine Planning with Minimal Traveling Time
Line Planning with Minimal Traveling Time Anita Schöbel and Susanne Scholl Institut für Numerische und Angewandte Mathematik, GeorgAugustUniversität Göttingen Lotzestrasse 1618, 37083 Göttingen, Germany
More informationStrategic planning in LTL logistics increasing the capacity utilization of trucks
Strategic planning in LTL logistics increasing the capacity utilization of trucks J. Fabian Meier 1,2 Institute of Transport Logistics TU Dortmund, Germany Uwe Clausen 3 Fraunhofer Institute for Material
More information2004 Networks UK Publishers. Reprinted with permission.
Riikka Susitaival and Samuli Aalto. Adaptive load balancing with OSPF. In Proceedings of the Second International Working Conference on Performance Modelling and Evaluation of Heterogeneous Networks (HET
More informationCOORDINATION PRODUCTION AND TRANSPORTATION SCHEDULING IN THE SUPPLY CHAIN ABSTRACT
Technical Report #98T010, Department of Industrial & Mfg. Systems Egnieering, Lehigh Univerisity (1998) COORDINATION PRODUCTION AND TRANSPORTATION SCHEDULING IN THE SUPPLY CHAIN Kadir Ertogral, S. David
More informationEfficient Scheduling of Internet Banner Advertisements
Efficient Scheduling of Internet Banner Advertisements ALI AMIRI Oklahoma State University and SYAM MENON University of Texas at Dallas Despite the slowdown in the economy, advertisement revenue remains
More informationModels in Transportation. Tim Nieberg
Models in Transportation Tim Nieberg Transportation Models large variety of models due to the many modes of transportation roads railroad shipping airlines as a consequence different type of equipment
More informationMultilayer MPLS Network Design: the Impact of Statistical Multiplexing
Multilayer MPLS Network Design: the Impact of Statistical Multiplexing Pietro Belotti, Antonio Capone, Giuliana Carello, Federico Malucelli Tepper School of Business, Carnegie Mellon University, Pittsburgh
More informationSpecial Session on Integrating Constraint Programming and Operations Research ISAIM 2016
Titles Special Session on Integrating Constraint Programming and Operations Research ISAIM 2016 1. GrammarBased Integer Programming Models and Methods for Employee Scheduling Problems 2. Detecting and
More informationClassification  Examples
Lecture 2 Scheduling 1 Classification  Examples 1 r j C max given: n jobs with processing times p 1,...,p n and release dates r 1,...,r n jobs have to be scheduled without preemption on one machine taking
More informationOptimal Core Edge Storage Area Network Design
Optimal Core Edge Storage Area Network Design Timothy David Thompson Supervised by Dr. M. O Sullivan and Dr. C. Walker Department of Engineering Science University of Auckland, New Zealand ttho035@ec.auckland.ac.nz
More information6.231 Dynamic Programming and Stochastic Control Fall 2008
MIT OpenCourseWare http://ocw.mit.edu 6.231 Dynamic Programming and Stochastic Control Fall 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 6.231
More information11. APPROXIMATION ALGORITHMS
11. APPROXIMATION ALGORITHMS load balancing center selection pricing method: vertex cover LP rounding: vertex cover generalized load balancing knapsack problem Lecture slides by Kevin Wayne Copyright 2005
More informationProximal mapping via network optimization
L. Vandenberghe EE236C (Spring 234) Proximal mapping via network optimization minimum cut and maximum flow problems parametric minimum cut problem application to proximal mapping Introduction this lecture:
More informationAn Optimization Approach for Cooperative Communication in Ad Hoc Networks
An Optimization Approach for Cooperative Communication in Ad Hoc Networks Carlos A.S. Oliveira and Panos M. Pardalos University of Florida Abstract. Mobile ad hoc networks (MANETs) are a useful organizational
More informationColumn Generation for the Pickup and Delivery Problem with Time Windows
Column Generation for the Pickup and Delivery Problem with Time Windows Kombinatorisk optimering 1. april 2005 Stefan Røpke Joint work with JeanFrançois Cordeau Work in progress! Literature, homework
More informationHYBRID GENETIC ALGORITHMS FOR SCHEDULING ADVERTISEMENTS ON A WEB PAGE
HYBRID GENETIC ALGORITHMS FOR SCHEDULING ADVERTISEMENTS ON A WEB PAGE Subodha Kumar University of Washington subodha@u.washington.edu Varghese S. Jacob University of Texas at Dallas vjacob@utdallas.edu
More informationVEHICLE ROUTING PROBLEM
VEHICLE ROUTING PROBLEM Readings: E&M 0 Topics: versus TSP Solution methods Decision support systems for Relationship between TSP and Vehicle routing problem () is similar to the Traveling salesman problem
More informationScheduling Single Machine Scheduling. Tim Nieberg
Scheduling Single Machine Scheduling Tim Nieberg Single machine models Observation: for nonpreemptive problems and regular objectives, a sequence in which the jobs are processed is sufficient to describe
More informationBranchandPrice for the Truck and Trailer Routing Problem with Time Windows
BranchandPrice for the Truck and Trailer Routing Problem with Time Windows Sophie N. Parragh JeanFrançois Cordeau October 2015 BranchandPrice for the Truck and Trailer Routing Problem with Time Windows
More informationNew Exact Solution Approaches for the Split Delivery Vehicle Routing Problem
New Exact Solution Approaches for the Split Delivery Vehicle Routing Problem Gizem Ozbaygin, Oya Karasan and Hande Yaman Department of Industrial Engineering, Bilkent University, Ankara, Turkey ozbaygin,
More informationChapter 13: Binary and MixedInteger Programming
Chapter 3: Binary and MixedInteger Programming The general branch and bound approach described in the previous chapter can be customized for special situations. This chapter addresses two special situations:
More informationTSP in Spreadsheets a Guided Tour
TSP in Spreadsheets a Guided Tour Rasmus Rasmussen Abstract The travelling salesman problem (TSP) is a well known business problem, and variants like the maximum benefit TSP or the price collecting TSP
More informationCollaboration for Truckload Carriers
Submitted to Transportation Science manuscript (Please, provide the mansucript number!) Collaboration for Truckload Carriers Okan Örsan Özener H. Milton Stewart School of Industrial and Systems Engineering,
More informationBicolored Shortest Paths in Graphs with Applications to Network Overlay Design
Bicolored Shortest Paths in Graphs with Applications to Network Overlay Design Hongsik Choi and HyeongAh Choi Department of Electrical Engineering and Computer Science George Washington University Washington,
More informationTwo objective functions for a real life Split Delivery Vehicle Routing Problem
International Conference on Industrial Engineering and Systems Management IESM 2011 May 25  May 27 METZ  FRANCE Two objective functions for a real life Split Delivery Vehicle Routing Problem Marc Uldry
More informationOPRE 6201 : 2. Simplex Method
OPRE 6201 : 2. Simplex Method 1 The Graphical Method: An Example Consider the following linear program: Max 4x 1 +3x 2 Subject to: 2x 1 +3x 2 6 (1) 3x 1 +2x 2 3 (2) 2x 2 5 (3) 2x 1 +x 2 4 (4) x 1, x 2
More informationModeling and solving vehicle routing problems with many available vehicle types
MASTER S THESIS Modeling and solving vehicle routing problems with many available vehicle types SANDRA ERIKSSON BARMAN Department of Mathematical Sciences Division of Mathematics CHALMERS UNIVERSITY OF
More informationStochastic Ship Fleet Routing with Inventory Limits YU YU
Stochastic Ship Fleet Routing with Inventory Limits YU YU Doctor of Philosophy University of Edinburgh 2009 Declaration I declare that this thesis was composed by myself and that the work contained therein
More informationPlanning and Scheduling in the Digital Factory
Institute for Computer Science and Control Hungarian Academy of Sciences Berlin, May 7, 2014 1 Why "digital"? 2 Some Planning and Scheduling problems 3 Planning for "oneofakind" products 4 Scheduling
More informationThe Rolling Stock Recovery Problem. Literature review. Julie Jespersen Groth *α, Jesper Larsen β and Jens Clausen *γ
The Rolling Stock Recovery Problem Julie Jespersen Groth *α, Jesper Larsen β and Jens Clausen *γ DTU Management Engineering, The Technical University of Denmark, Produktionstorvet, DTU Building 424, 2800
More informationOptimized Scheduling in RealTime Environments with Column Generation
JG U JOHANNES GUTENBERG UNIVERSITAT 1^2 Optimized Scheduling in RealTime Environments with Column Generation Dissertation zur Erlangung des Grades,.Doktor der Naturwissenschaften" am Fachbereich Physik,
More informationMinimizing costs for transport buyers using integer programming and column generation. Eser Esirgen
MASTER STHESIS Minimizing costs for transport buyers using integer programming and column generation Eser Esirgen DepartmentofMathematicalSciences CHALMERS UNIVERSITY OF TECHNOLOGY UNIVERSITY OF GOTHENBURG
More informationIE 680 Special Topics in Production Systems: Networks, Routing and Logistics*
IE 680 Special Topics in Production Systems: Networks, Routing and Logistics* Rakesh Nagi Department of Industrial Engineering University at Buffalo (SUNY) *Lecture notes from Network Flows by Ahuja, Magnanti
More informationPRODUCTION PLANNING AND SCHEDULING Part 1
PRODUCTION PLANNING AND SCHEDULING Part Andrew Kusiak 9 Seamans Center Iowa City, Iowa  7 Tel: 99 Fax: 9669 andrewkusiak@uiowa.edu http://www.icaen.uiowa.edu/~ankusiak Forecasting Planning Hierarchy
More informationRouting and Scheduling in Tramp Shipping  Integrating Bunker Optimization Technical report
Downloaded from orbit.dtu.dk on: Jul 04, 2016 Routing and Scheduling in Tramp Shipping  Integrating Bunker Optimization Technical report Vilhelmsen, Charlotte; Lusby, Richard Martin ; Larsen, Jesper Publication
More information