A Recourse Approach for the Capacitated Vehicle Routing Problem with Evidential Demands
|
|
- Georgia Edwards
- 5 years ago
- Views:
Transcription
1 A Recourse Approach for the Capacitated Vehicle Routing Problem with Evidential Demands Nathalie Helal 1, Frédéric Pichon 1, Daniel Porumbel 2, David Mercier 1 and Éric Lefèvre1 1 Université d Artois, LGI2A, F Béthune, France 2 Conservatoire National des Arts et Métiers, EA 4629 CEDRIC, Paris, France Helal et al. A Recourse Approach for the CVRP with Evidential Demands 1 / 24
2 Background - CVRP / CVRPSD The Capacitated Vehicle Routing Problem (CVRP) Finding the least cost routes to serve customers deterministic demands while respecting problem constraints, in particular vehicles capacity constraints. The CVRP with Stochastic Demands (CVRPSD) Customers have stochastic demands. Helal et al. A Recourse Approach for the CVRP with Evidential Demands 2 / 24
3 The CVRPSD may be addressed by two main approaches: Chance Constrained Programming (CCP). Stochastic Programming with Recourse (SPR). Alternative uncertainty framework In a previous work [1], the CVRP with Evidential Demands () modelled by a belief function based extension of CCP. In this paper, we model the by a belief function based extension of the SPR and solve it using a metaheuristic algorithm. The first papers that handle discrete NP-hard problem involving uncertainty represented by belief functions. Helal et al. A Recourse Approach for the CVRP with Evidential Demands 3 / 24
4 The CVRPSD may be addressed by two main approaches: Chance Constrained Programming (CCP). Stochastic Programming with Recourse (SPR). Alternative uncertainty framework In a previous work [1], the CVRP with Evidential Demands () modelled by a belief function based extension of CCP. In this paper, we model the by a belief function based extension of the SPR and solve it using a metaheuristic algorithm. The first papers that handle discrete NP-hard problem involving uncertainty represented by belief functions. Helal et al. A Recourse Approach for the CVRP with Evidential Demands 3 / 24
5 Outline 1 CVRP with Stochastic Demands The CVRP The CVRPSD modelled by SPR 2 CVRP with Evidential Demands Belief function theory Formalisation Uncertainty on recourses (failure situations) Interval Demands Experiments 3 Conclusions & perspectives Helal et al. A Recourse Approach for the CVRP with Evidential Demands 4 / 24
6 CVRPSD 1 CVRP with Stochastic Demands The CVRP The CVRPSD modelled by SPR 2 CVRP with Evidential Demands Belief function theory Formalisation Uncertainty on recourses (failure situations) Interval Demands Experiments 3 Conclusions & perspectives Helal et al. A Recourse Approach for the CVRP with Evidential Demands 5 / 24
7 The CVRP CVRPSD The CVRP Given: n = number of customers including the depot, m = number of vehicles, Q = vehicle capacity, d i = (known) demand of client i, c i,j = cost { of travelling from client } i to client j, w i,j,k = 1 if k travels from i to j, 0 otherwise., R k = the route associated to vehicle k. Objective function: min m C(R k ), k=1 where: C(R k ) = n n c i,j w i,j,k, the travel cost of route R k. i=0 j=0 Helal et al. A Recourse Approach for the CVRP with Evidential Demands 6 / 24
8 CVRPSD The CVRPSD modelled by SPR The CVRPSD d i represents the stochastic demand of i (cannot exceed Q). Need to verify the capacity constraints of the CVRPSD for all realizations of d i unrealistic. A SPR approach for the CVRPSD Clients demands are collected until remaining vehicle capacity is not sufficient to pick up entire customer demand failure. If failure recourse (a return trip to the depot). Failure can happen at multiple customers except the first one. Helal et al. A Recourse Approach for the CVRP with Evidential Demands 7 / 24
9 CVRPSD The CVRPSD modelled by SPR The CVRPSD d i represents the stochastic demand of i (cannot exceed Q). Need to verify the capacity constraints of the CVRPSD for all realizations of d i unrealistic. A SPR approach for the CVRPSD Clients demands are collected until remaining vehicle capacity is not sufficient to pick up entire customer demand failure. If failure recourse (a return trip to the depot). Failure can happen at multiple customers except the first one. Helal et al. A Recourse Approach for the CVRP with Evidential Demands 7 / 24
10 CVRPSD The CVRPSD modelled by SPR The CVRPSD d i represents the stochastic demand of i (cannot exceed Q). Need to verify the capacity constraints of the CVRPSD for all realizations of d i unrealistic. A SPR approach for the CVRPSD Clients demands are collected until remaining vehicle capacity is not sufficient to pick up entire customer demand failure. If failure recourse (a return trip to the depot). Failure can happen at multiple customers except the first one. Helal et al. A Recourse Approach for the CVRP with Evidential Demands 7 / 24
11 CVRPSD The CVRPSD modelled by SPR The CVRPSD modelled by SPR The objective function becomes: m min Ce(R k ), k=1 where Ce(R k ) is the expected cost of R k defined by with Ce(R k ) = C(R k ) + Cp(R k ), C(R k ) the travel cost on R k when no recourse action is performed; Cp(R k ) the expected penalty cost on R k induced by failures. Helal et al. A Recourse Approach for the CVRP with Evidential Demands 8 / 24
12 Belief function theory 1 CVRP with Stochastic Demands The CVRP The CVRPSD modelled by SPR 2 CVRP with Evidential Demands Belief function theory Formalisation Uncertainty on recourses (failure situations) Interval Demands Experiments 3 Conclusions & perspectives Helal et al. A Recourse Approach for the CVRP with Evidential Demands 9 / 24
13 Belief function theory Needed concepts A variable x taking values in a finite domain X. A MF m X : 2 X [0, 1] s.t. m X (A) = 1. A X A variable whose true value is known in the form of a MF is called an evidential variable. Given a MF m X and a function h: X R +, then the upper expected value of h relative to m X is : E (h, m X ) = A X m X (A) max x A h(x). Helal et al. A Recourse Approach for the CVRP with Evidential Demands 10 / 24
14 1 CVRP with Stochastic Demands The CVRP The CVRPSD modelled by SPR 2 CVRP with Evidential Demands Belief function theory Formalisation Uncertainty on recourses (failure situations) Interval Demands Experiments 3 Conclusions & perspectives Helal et al. A Recourse Approach for the CVRP with Evidential Demands 11 / 24
15 The d i represents the evidential demand of i (cannot exceed Q). The recourse approach: failure situations Suppose a route R having N customers. r i = { } 1 if failure occurs at the i-th client on R and r1 = 0. 0 otherwise Possible failure situations on R represented by vectors (r 2, r 3,..., r N ) Ω s.t. Ω = {0, 1} N 1. Cost and uncertainty of each failure situation ω Ω Cost of each ω Ω determined by g : Ω R +. The penalty cost upon failure on i is 2c 0,i g(ω) = N r i 2c 0,i. A MF m Ω representing uncertainty on failure situations on R. i=2 Helal et al. A Recourse Approach for the CVRP with Evidential Demands 12 / 24
16 The d i represents the evidential demand of i (cannot exceed Q). The recourse approach: failure situations Suppose a route R having N customers. r i = { } 1 if failure occurs at the i-th client on R and r1 = 0. 0 otherwise Possible failure situations on R represented by vectors (r 2, r 3,..., r N ) Ω s.t. Ω = {0, 1} N 1. Cost and uncertainty of each failure situation ω Ω Cost of each ω Ω determined by g : Ω R +. The penalty cost upon failure on i is 2c 0,i g(ω) = N r i 2c 0,i. A MF m Ω representing uncertainty on failure situations on R. i=2 Helal et al. A Recourse Approach for the CVRP with Evidential Demands 12 / 24
17 The d i represents the evidential demand of i (cannot exceed Q). The recourse approach: failure situations Suppose a route R having N customers. r i = { } 1 if failure occurs at the i-th client on R and r1 = 0. 0 otherwise Possible failure situations on R represented by vectors (r 2, r 3,..., r N ) Ω s.t. Ω = {0, 1} N 1. Cost and uncertainty of each failure situation ω Ω Cost of each ω Ω determined by g : Ω R +. The penalty cost upon failure on i is 2c 0,i g(ω) = N r i 2c 0,i. A MF m Ω representing uncertainty on failure situations on R. i=2 Helal et al. A Recourse Approach for the CVRP with Evidential Demands 12 / 24
18 The d i represents the evidential demand of i (cannot exceed Q). The recourse approach: failure situations Suppose a route R having N customers. r i = { } 1 if failure occurs at the i-th client on R and r1 = 0. 0 otherwise Possible failure situations on R represented by vectors (r 2, r 3,..., r N ) Ω s.t. Ω = {0, 1} N 1. Cost and uncertainty of each failure situation ω Ω Cost of each ω Ω determined by g : Ω R +. The penalty cost upon failure on i is 2c 0,i g(ω) = N r i 2c 0,i. A MF m Ω representing uncertainty on failure situations on R. i=2 Helal et al. A Recourse Approach for the CVRP with Evidential Demands 12 / 24
19 A pessimistic attitude: penalty cost and upper expected cost The upper expected penalty cost of R is Cp (R) = E (g, m Ω ). The Objective of the : min m Ce (R k), with C e (R k) = C(R k ) + C p (R k). k=1 Similarities with robust optimisation. Bayesian evidential demands CVRPSD via SPR. Helal et al. A Recourse Approach for the CVRP with Evidential Demands 13 / 24
20 A pessimistic attitude: penalty cost and upper expected cost The upper expected penalty cost of R is Cp (R) = E (g, m Ω ). The Objective of the : min m Ce (R k), with C e (R k) = C(R k ) + C p (R k). k=1 Similarities with robust optimisation. Bayesian evidential demands CVRPSD via SPR. Helal et al. A Recourse Approach for the CVRP with Evidential Demands 13 / 24
21 1 CVRP with Stochastic Demands The CVRP The CVRPSD modelled by SPR 2 CVRP with Evidential Demands Belief function theory Formalisation Uncertainty on recourses (failure situations) Interval Demands Experiments 3 Conclusions & perspectives Helal et al. A Recourse Approach for the CVRP with Evidential Demands 14 / 24
22 Example: no uncertainty on clients demands A route R with N = 3 clients; θ 1 = 3 and m 1 (θ 1 ) = 1; θ 2 = 3 and m 2 (θ 2 ) = 1; θ 3 = 5 and m 3 (θ 3 ) = 1; Capacity limit Q = 5; q i, i = 1,..., N, the vehicle load after serving i-th client: r 1 = 0 and q 1 = θ 1 = 3. r 2 = 1 since q 1 +θ 2 > Q, and q 2 = q 1 +θ 2 Q = 1. r 3 = 1 since q 2 +θ 3 > Q, and q 3 = q 2 +θ 3 Q = 1. f (θ 1, θ 2, θ 3 ) = ω and ω (r 2 = 1, r 3 = 1) Helal et al. A Recourse Approach for the CVRP with Evidential Demands 15 / 24
23 Example: no uncertainty on clients demands A route R with N = 3 clients; θ 1 = 3 and m 1 (θ 1 ) = 1; θ 2 = 3 and m 2 (θ 2 ) = 1; θ 3 = 5 and m 3 (θ 3 ) = 1; Capacity limit Q = 5; q i, i = 1,..., N, the vehicle load after serving i-th client: r 1 = 0 and q 1 = θ 1 = 3. r 2 = 1 since q 1 +θ 2 > Q, and q 2 = q 1 +θ 2 Q = 1. r 3 = 1 since q 2 +θ 3 > Q, and q 3 = q 2 +θ 3 Q = 1. f (θ 1, θ 2, θ 3 ) = ω and ω (r 2 = 1, r 3 = 1) Helal et al. A Recourse Approach for the CVRP with Evidential Demands 15 / 24
24 Example: no uncertainty on clients demands A route R with N = 3 clients; θ 1 = 3 and m 1 (θ 1 ) = 1; θ 2 = 3 and m 2 (θ 2 ) = 1; θ 3 = 5 and m 3 (θ 3 ) = 1; Capacity limit Q = 5; q i, i = 1,..., N, the vehicle load after serving i-th client: r 1 = 0 and q 1 = θ 1 = 3. r 2 = 1 since q 1 +θ 2 > Q, and q 2 = q 1 +θ 2 Q = 1. r 3 = 1 since q 2 +θ 3 > Q, and q 3 = q 2 +θ 3 Q = 1. f (θ 1, θ 2, θ 3 ) = ω and ω (r 2 = 1, r 3 = 1) Helal et al. A Recourse Approach for the CVRP with Evidential Demands 15 / 24
25 Example: no uncertainty on clients demands A route R with N = 3 clients; θ 1 = 3 and m 1 (θ 1 ) = 1; θ 2 = 3 and m 2 (θ 2 ) = 1; θ 3 = 5 and m 3 (θ 3 ) = 1; Capacity limit Q = 5; q i, i = 1,..., N, the vehicle load after serving i-th client: r 1 = 0 and q 1 = θ 1 = 3. r 2 = 1 since q 1 +θ 2 > Q, and q 2 = q 1 +θ 2 Q = 1. r 3 = 1 since q 2 +θ 3 > Q, and q 3 = q 2 +θ 3 Q = 1. f (θ 1, θ 2, θ 3 ) = ω and ω (r 2 = 1, r 3 = 1) Helal et al. A Recourse Approach for the CVRP with Evidential Demands 15 / 24
26 Precise clients demands f (θ 1,..., θ N ) = (r 2, r 3,..., r N ). Imprecise clients demands MF mi Θ, i = 1,..., N, on R, s.t mi Θ (A i ) = 1, A i Θ. Then failure situation on R belongs to B Ω B = f (A 1,..., A N ) = f (θ 1,..., θ N ). (θ 1,...,θ N ) A 1 A N m Θ i, i = 1,..., N have arbitrary number of focal sets The joint probability that θ i A i Θ, i = 1,..., N is N mi Θ (A i ) m Ω (B) = i=1 f (A 1,...,A N )=B i=1 N mi Θ (A i ). Computing m Ω : evaluating f (A 1,..., A N ) for all combinations of focal sets of mi Θ worst-case complexity O(Q N ) (intractable). Helal et al. A Recourse Approach for the CVRP with Evidential Demands 16 / 24
27 Precise clients demands f (θ 1,..., θ N ) = (r 2, r 3,..., r N ). Imprecise clients demands MF mi Θ, i = 1,..., N, on R, s.t mi Θ (A i ) = 1, A i Θ. Then failure situation on R belongs to B Ω B = f (A 1,..., A N ) = f (θ 1,..., θ N ). (θ 1,...,θ N ) A 1 A N m Θ i, i = 1,..., N have arbitrary number of focal sets The joint probability that θ i A i Θ, i = 1,..., N is N mi Θ (A i ) m Ω (B) = i=1 f (A 1,...,A N )=B i=1 N mi Θ (A i ). Computing m Ω : evaluating f (A 1,..., A N ) for all combinations of focal sets of mi Θ worst-case complexity O(Q N ) (intractable). Helal et al. A Recourse Approach for the CVRP with Evidential Demands 16 / 24
28 Precise clients demands f (θ 1,..., θ N ) = (r 2, r 3,..., r N ). Imprecise clients demands MF mi Θ, i = 1,..., N, on R, s.t mi Θ (A i ) = 1, A i Θ. Then failure situation on R belongs to B Ω B = f (A 1,..., A N ) = f (θ 1,..., θ N ). (θ 1,...,θ N ) A 1 A N m Θ i, i = 1,..., N have arbitrary number of focal sets The joint probability that θ i A i Θ, i = 1,..., N is N mi Θ (A i ) m Ω (B) = i=1 f (A 1,...,A N )=B i=1 N mi Θ (A i ). Computing m Ω : evaluating f (A 1,..., A N ) for all combinations of focal sets of mi Θ worst-case complexity O(Q N ) (intractable). Helal et al. A Recourse Approach for the CVRP with Evidential Demands 16 / 24
29 Precise clients demands f (θ 1,..., θ N ) = (r 2, r 3,..., r N ). Imprecise clients demands MF mi Θ, i = 1,..., N, on R, s.t mi Θ (A i ) = 1, A i Θ. Then failure situation on R belongs to B Ω B = f (A 1,..., A N ) = f (θ 1,..., θ N ). (θ 1,...,θ N ) A 1 A N m Θ i, i = 1,..., N have arbitrary number of focal sets The joint probability that θ i A i Θ, i = 1,..., N is N mi Θ (A i ) m Ω (B) = i=1 f (A 1,...,A N )=B i=1 N mi Θ (A i ). Computing m Ω : evaluating f (A 1,..., A N ) for all combinations of focal sets of mi Θ worst-case complexity O(Q N ) (intractable). Helal et al. A Recourse Approach for the CVRP with Evidential Demands 16 / 24
30 1 CVRP with Stochastic Demands The CVRP The CVRPSD modelled by SPR 2 CVRP with Evidential Demands Belief function theory Formalisation Uncertainty on recourses (failure situations) Interval Demands Experiments 3 Conclusions & perspectives Helal et al. A Recourse Approach for the CVRP with Evidential Demands 17 / 24
31 Binary recourse tree example: route R with N = 3 clients θ 1 4; 8 and m 1 ( 4; 8 ) = 1; θ 2 5; 7 and m 2 ( 5; 7 ) = 1; θ 3 7; 9 and m 3 ( 7; 9 ) = 1; Capacity limit Q = 10; q i, i = 1,..., N, the vehicle load after visiting i-th client: ( 4; 8, 0) 1 st level ( 9; 10, 0) ( 6; 9, 1) ( 1; 5, 1) ( 8; 10, 0) ( 1; 4, 1) 2 nd level 3 rd level Helal et al. A Recourse Approach for the CVRP with Evidential Demands 18 / 24
32 Binary recourse tree example: route R with N = 3 clients θ 1 4; 8 and m 1 ( 4; 8 ) = 1; θ 2 5; 7 and m 2 ( 5; 7 ) = 1; θ 3 7; 9 and m 3 ( 7; 9 ) = 1; Capacity limit Q = 10; q i, i = 1,..., N, the vehicle load after visiting i-th client: 4; 8 no failure and q 1 4; 8. Helal et al. A Recourse Approach for the CVRP with Evidential Demands 18 / 24
33 Binary recourse tree example: route R with N = 3 clients θ 1 4; 8 and m 1 ( 4; 8 ) = 1; θ 2 5; 7 and m 2 ( 5; 7 ) = 1; θ 3 7; 9 and m 3 ( 7; 9 ) = 1; Capacity limit Q = 10; q i, i = 1,..., N, the vehicle load after visiting i-th client: 4; 8 no failure and q 1 4; 8. ( 4; 8, 0) 1 st level Helal et al. A Recourse Approach for the CVRP with Evidential Demands 18 / 24
34 Binary recourse tree example: route R with N = 3 clients θ 1 4; 8 and m 1 ( 4; 8 ) = 1; θ 2 5; 7 and m 2 ( 5; 7 ) = 1; θ 3 7; 9 and m 3 ( 7; 9 ) = 1; Capacity limit Q = 10; q i, i = 1,..., N, the vehicle load after visiting i-th client: { } no failure q2 9;10 4; 8 + 5; 7 = 9; 15. a failure q ;15 10 ( 4; 8, 0) 1 st level Helal et al. A Recourse Approach for the CVRP with Evidential Demands 18 / 24
35 Binary recourse tree example: route R with N = 3 clients θ 1 4; 8 and m 1 ( 4; 8 ) = 1; θ 2 5; 7 and m 2 ( 5; 7 ) = 1; θ 3 7; 9 and m 3 ( 7; 9 ) = 1; Capacity limit Q = 10; q i, i = 1,..., N, the vehicle load after visiting i-th client: { } no failure q2 9;10 4; 8 + 5; 7 = 9; 15. a failure q ;15 10 ( 4; 8, 0) ( 9; 10, 0) ( 1; 5, 1) 1 st level 2 nd level Helal et al. A Recourse Approach for the CVRP with Evidential Demands 18 / 24
36 Binary recourse tree example: route R with N = 3 clients θ 1 4; 8 and m 1 ( 4; 8 ) = 1; θ 2 5; 7 and m 2 ( 5; 7 ) = 1; θ 3 7; 9 and m 3 ( 7; 9 ) = 1; Capacity limit Q = 10; q i, i = 1,..., N, the vehicle load after visiting i-th client: If 9; ; 9 = 16; 19 a failure, q ; 19 10, ( 4; 8, 0) ( 9; 10, 0) ( 1; 5, 1) 1 st level 2 nd level Helal et al. A Recourse Approach for the CVRP with Evidential Demands 18 / 24
37 Binary recourse tree example: route R with N = 3 clients θ 1 4; 8 and m 1 ( 4; 8 ) = 1; θ 2 5; 7 and m 2 ( 5; 7 ) = 1; θ 3 7; 9 and m 3 ( 7; 9 ) = 1; Capacity limit Q = 10; q i, i = 1,..., N, the vehicle load after visiting i-th client: If 9; ; 9 = 16; 19 a failure, q ; 19 10, ( 4; 8, 0) 1 st level ( 9; 10, 0) ( 6; 9, 1) ( 1; 5, 1) 2 nd level 3 rd level Helal et al. A Recourse Approach for the CVRP with Evidential Demands 18 / 24
38 Binary recourse tree example: route R with N = 3 clients θ 1 4; 8 and m 1 ( 4; 8 ) = 1; θ 2 5; 7 and m 2 ( 5; 7 ) = 1; θ 3 7; 9 and m 3 ( 7; 9 ) = 1; Capacity limit Q = 10; q i, i = 1,..., N, the vehicle load after visiting i-th client: { } no failure q3 8;10 else 1; 5 + 7; 9 = 8; 14. a failure q ;14 10 ( 4; 8, 0) 1 st level ( 9; 10, 0) ( 6; 9, 1) ( 1; 5, 1) 2 nd level 3 rd level Helal et al. A Recourse Approach for the CVRP with Evidential Demands 18 / 24
39 Binary recourse tree example: route R with N = 3 clients θ 1 4; 8 and m 1 ( 4; 8 ) = 1; θ 2 5; 7 and m 2 ( 5; 7 ) = 1; θ 3 7; 9 and m 3 ( 7; 9 ) = 1; Capacity limit Q = 10; q i, i = 1,..., N, the vehicle load after visiting i-th client: { } no failure q3 8;10 else 1; 5 + 7; 9 = 8; 14. a failure q ;14 10 ( 4; 8, 0) 1 st level ( 9; 10, 0) ( 6; 9, 1) ( 1; 5, 1) ( 8; 10, 0) ( 1; 4, 1) 2 nd level 3 rd level Helal et al. A Recourse Approach for the CVRP with Evidential Demands 18 / 24
40 Binary recourse tree example: route R with N = 3 clients θ 1 4; 8 and m 1 ( 4; 8 ) = 1; θ 2 5; 7 and m 2 ( 5; 7 ) = 1; θ 3 7; 9 and m 3 ( 7; 9 ) = 1; Capacity limit Q = 10; q i, i = 1,..., N, the vehicle load after visiting i-th client: Worst case complexity is O(2 N 1 ). ( 4; 8, 0) 1 st level ( 9; 10, 0) ( 6; 9, 1) ( 1; 5, 1) ( 8; 10, 0) ( 1; 4, 1) 2 nd level 3 rd level Helal et al. A Recourse Approach for the CVRP with Evidential Demands 18 / 24
41 Experiments 1 CVRP with Stochastic Demands The CVRP The CVRPSD modelled by SPR 2 CVRP with Evidential Demands Belief function theory Formalisation Uncertainty on recourses (failure situations) Interval Demands Experiments 3 Conclusions & perspectives Helal et al. A Recourse Approach for the CVRP with Evidential Demands 19 / 24
42 Experiments Metaheuristic Simulated annealing to solve the via recourse. Benchmarks Transformed each deterministic demand d det in CVRP data sets, into an evidential demand with associated MF m Θ ({d det }) = α, m Θ ( d det γ d det ; d det + γ d det ) = 1 α with α (0, 1) and γ [0, 1]. Proposition The optimal solution upper expected cost is non decreasing in γ a lower bound on the optimal solution upper expected cost γ = 0. Helal et al. A Recourse Approach for the CVRP with Evidential Demands 20 / 24
43 Experiments Metaheuristic Simulated annealing to solve the via recourse. Benchmarks Transformed each deterministic demand d det in CVRP data sets, into an evidential demand with associated MF m Θ ({d det }) = α, m Θ ( d det γ d det ; d det + γ d det ) = 1 α with α (0, 1) and γ [0, 1]. Proposition The optimal solution upper expected cost is non decreasing in γ a lower bound on the optimal solution upper expected cost γ = 0. Helal et al. A Recourse Approach for the CVRP with Evidential Demands 20 / 24
44 Experiments Table: Simulated annealing results when α = 0.8 and γ = 0.1 Best Penalty Avg Stand. Avg Best cost Instance cost cost cost dev. runtime γ = 0 A-n32-k5 843, % 874,18 9, s. 839,18 A-n33-k5 705, % 724,11 8, s. 697,12 A-n33-k6 773, % 793,07 10, s. 758,36 A-n34-k5 820, % 837,04 9, s. 812,16 A-n36-k5 884, % 914,85 13, s. 869,10 A-n37-k5 722,57 0% 753,51 12, s. 720,85 A-n37-k6 1044, % 1071,27 12, s. 995,07 A-n38-k5 781, % 816,67 18, s. 748,64 A-n39-k5 890, % 935, s. 885,04 A-n39-k6 896, % 916, s. 884,09 A-n44-k6 1051, % 1104,58 24, s. 1019,07 A-n45-k6 1091, % 1129,21 18, s. 1006,90 A-n45-k7 1296, % 1348,57 23, s. 1246,14 A-n46-k7 1060, % 1087, s. 1045,93 A-n48-k7 1241, % 1274,24 20, s. 1227,79 Helal et al. A Recourse Approach for the CVRP with Evidential Demands 21 / 24
45 Conclusions & perspectives 1 CVRP with Stochastic Demands The CVRP The CVRPSD modelled by SPR 2 CVRP with Evidential Demands Belief function theory Formalisation Uncertainty on recourses (failure situations) Interval Demands Experiments 3 Conclusions & perspectives Helal et al. A Recourse Approach for the CVRP with Evidential Demands 22 / 24
46 Conclusions & perspectives Conclusions The modelled by an evidential extension of the SPR. A technique making computations tractable in realistic cases. Experiments using a simulated annealing algorithm. Perspectives More recourse policies. Improving the solving algorithm. References N. Helal, F. Pichon, D. Porumbel, D. Mercier, and E. Lefèvre. The capacitated vehicle routing problem with evidential demands: a belief-constrained programming approach. In Belief Functions: Theory and Applications, volume 9861 of LNCS, pages Springer, Helal et al. A Recourse Approach for the CVRP with Evidential Demands 23 / 24
47 Conclusions & perspectives Conclusions The modelled by an evidential extension of the SPR. A technique making computations tractable in realistic cases. Experiments using a simulated annealing algorithm. Perspectives More recourse policies. Improving the solving algorithm. References N. Helal, F. Pichon, D. Porumbel, D. Mercier, and E. Lefèvre. The capacitated vehicle routing problem with evidential demands: a belief-constrained programming approach. In Belief Functions: Theory and Applications, volume 9861 of LNCS, pages Springer, Helal et al. A Recourse Approach for the CVRP with Evidential Demands 23 / 24
48 Conclusions & perspectives Conclusions The modelled by an evidential extension of the SPR. A technique making computations tractable in realistic cases. Experiments using a simulated annealing algorithm. Perspectives More recourse policies. Improving the solving algorithm. References N. Helal, F. Pichon, D. Porumbel, D. Mercier, and E. Lefèvre. The capacitated vehicle routing problem with evidential demands: a belief-constrained programming approach. In Belief Functions: Theory and Applications, volume 9861 of LNCS, pages Springer, Helal et al. A Recourse Approach for the CVRP with Evidential Demands 23 / 24
49 Conclusions & perspectives Thank you for your attention. Helal et al. A Recourse Approach for the CVRP with Evidential Demands 24 / 24
The Capacitated Vehicle Routing Problem with Evidential Demands
The Capacitated Vehicle Routing Problem with Evidential Demands Nathalie Helal a,, Frédéric Pichon a, Daniel Porumbel b, David Mercier a, Éric Lefèvre a a Univ. Artois, EA 3926, Laboratoire de Génie Informatique
More informationBranch-and-cut (and-price) for the chance constrained vehicle routing problem
Branch-and-cut (and-price) for the chance constrained vehicle routing problem Ricardo Fukasawa Department of Combinatorics & Optimization University of Waterloo May 25th, 2016 ColGen 2016 joint work with
More informationVehicle Routing and MIP
CORE, Université Catholique de Louvain 5th Porto Meeting on Mathematics for Industry, 11th April 2014 Contents: The Capacitated Vehicle Routing Problem Subproblems: Trees and the TSP CVRP Cutting Planes
More informationAlmost Robust Optimization with Binary Variables
Almost Robust Optimization with Binary Variables Opher Baron, Oded Berman, Mohammad M. Fazel-Zarandi Rotman School of Management, University of Toronto, Toronto, Ontario M5S 3E6, Canada, Opher.Baron@Rotman.utoronto.ca,
More informationVNS for the TSP and its variants
VNS for the TSP and its variants Nenad Mladenović, Dragan Urošević BALCOR 2011, Thessaloniki, Greece September 23, 2011 Mladenović N 1/37 Variable neighborhood search for the TSP and its variants Problem
More informationDistance Metrics and Fitness Distance Analysis for the Capacitated Vehicle Routing Problem
MIC2005. The 6th Metaheuristics International Conference 603 Metrics and Analysis for the Capacitated Vehicle Routing Problem Marek Kubiak Institute of Computing Science, Poznan University of Technology
More informationInternational ejournals
ISSN 0976 1411 Available online at www.internationalejournals.com International ejournals International ejournal of Mathematics and Engineering 2 (2017) Vol. 8, Issue 1, pp 11 21 Optimization of Transportation
More informationLecture 8: Column Generation
Lecture 8: Column Generation (3 units) Outline Cutting stock problem Classical IP formulation Set covering formulation Column generation A dual perspective Vehicle routing problem 1 / 33 Cutting stock
More informationThe Orienteering Problem under Uncertainty Stochastic Programming and Robust Optimization compared
The Orienteering Problem under Uncertainty Stochastic Programming and Robust Optimization compared Lanah Evers a,b,c,, Kristiaan Glorie c, Suzanne van der Ster d, Ana Barros a,b, Herman Monsuur b a TNO
More informationDesigning distribution networks of perishable products under stochastic demands and routs
Designing distribution networs of perishable products under stochastic demands and routs Azam Aghighi Department of Industrial and Systems Engineering Iran University of Science and Technology Tehran,
More informationA Robust Optimization Approach for the Capacitated Vehicle Routing Problem with Demand Uncertainty
A Robust Optimization Approach for the Capacitated Vehicle Routing Problem with Demand Uncertainty Abstract In this paper we introduce a robust optimization approach to solve the Vehicle Routing Problem
More informationRobust Optimization for the Vehicle Routing Problem with Multiple Deliverymen
Robust Optimization for the Vehicle Routing Problem with Multiple Deliverymen Jonathan De La Vega, Pedro Munari and Reinaldo Morabito Production Engineering Department, Federal University of São Carlos,
More informationInspection Route Optimization
Inspection Route Optimization Bernard Gendron Thibaut Vidal + August 11, 2017 CRM Industrial Problem Solving Workshop, Montréal, Canada CIRRELT and Département d informatique et de recherche opérationnelle,
More informationAn Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem
An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem Claudia Archetti (1) Martin W.P. Savelsbergh (2) M. Grazia Speranza (1) (1) University of Brescia, Department of Quantitative
More informationLogic, Optimization and Data Analytics
Logic, Optimization and Data Analytics John Hooker Carnegie Mellon University United Technologies Research Center, Cork, Ireland August 2015 Thesis Logic and optimization have an underlying unity. Ideas
More informationTraveling Salesman Problem
Traveling Salesman Problem Zdeněk Hanzálek hanzalek@fel.cvut.cz CTU in Prague April 17, 2017 Z. Hanzálek (CTU) Traveling Salesman Problem April 17, 2017 1 / 33 1 Content 2 Solved TSP instances in pictures
More informationAlgorithms and Complexity theory
Algorithms and Complexity theory Thibaut Barthelemy Some slides kindly provided by Fabien Tricoire University of Vienna WS 2014 Outline 1 Algorithms Overview How to write an algorithm 2 Complexity theory
More informationMaximum likelihood with coarse data. robust optimisation
based on robust optimisation Romain Guillaume, Inés Couso, Didier Dubois IRIT, Université Toulouse, France, Universidad de Oviedo, Gijon (Spain) July 10, 2017 Contents Introduction 1 Introduction 2 3 4
More informationThe Distributionally Robust Chance Constrained Vehicle Routing Problem
The Distributionally Robust Chance Constrained Vehicle Routing Problem Shubhechyya Ghosal and Wolfram Wiesemann Imperial College Business School, Imperial College London, United Kingdom August 3, 208 Abstract
More informationBayesian Congestion Control over a Markovian Network Bandwidth Process: A multiperiod Newsvendor Problem
Bayesian Congestion Control over a Markovian Network Bandwidth Process: A multiperiod Newsvendor Problem Parisa Mansourifard 1/37 Bayesian Congestion Control over a Markovian Network Bandwidth Process:
More informationStochastic Vehicle Routing: an Application of Stochastic Optimization Models
Stochastic Vehicle Routing: an Application of Stochastic Optimization Models Michel Gendreau CIRRELT and MAGI École Polytechnique de Montréal Summer School on Dynamic Discrete Choice Models: Econometric
More informationA novel k-nn approach for data with uncertain attribute values
A novel -NN approach for data with uncertain attribute values Asma Trabelsi 1,2, Zied Elouedi 1, and Eric Lefevre 2 1 Université de Tunis, Institut Supérieur de Gestion de Tunis, LARODEC, Tunisia trabelsyasma@gmail.com,zied.elouedi@gmx.fr
More informatione - c o m p a n i o n
OPERATIONS RESEARCH http://dx.doi.org/10.1287/opre.1120.1048ec e - c o m p a n i o n ONLY AVAILABLE IN ELECTRONIC FORM 2012 INFORMS Electronic Companion A Hybrid Genetic Algorithm for Multidepot and Periodic
More informationHertz, Krogh, Palmer: Introduction to the Theory of Neural Computation. Addison-Wesley Publishing Company (1991). (v ji (1 x i ) + (1 v ji )x i )
Symmetric Networks Hertz, Krogh, Palmer: Introduction to the Theory of Neural Computation. Addison-Wesley Publishing Company (1991). How can we model an associative memory? Let M = {v 1,..., v m } be a
More informationProper Security Criteria Determination in a Power System with High Penetration of Renewable Resources
Proper Security Criteria Determination in a Power System with High Penetration of Renewable Resources Mojgan Hedayati, Kory Hedman, and Junshan Zhang School of Electrical, Computer, and Energy Engineering
More informationInventory-routing problem with pickups and deliveries of RTI in closed-loop supply chain
Inventory-routing problem with pickups and deliveries of RTI in closed-loop supply chain Galina IASSINOVSKAIA, UCL-Mons, Belgium Sabine LIMBOURG, QuantOM, University of Liege, Belgium Fouad RIANE, CIGM,
More informationModels and Algorithms for Stochastic and Robust Vehicle Routing with Deadlines
Accepted in Transportation Science manuscript (Please, provide the mansucript number!) Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes
More informationR O B U S T E N E R G Y M AN AG E M E N T S Y S T E M F O R I S O L AT E D M I C R O G R I D S
ROBUST ENERGY MANAGEMENT SYSTEM FOR ISOLATED MICROGRIDS Jose Daniel La r a Claudio Cañizares Ka nka r Bhattacharya D e p a r t m e n t o f E l e c t r i c a l a n d C o m p u t e r E n g i n e e r i n
More informationRobust multi-sensor scheduling for multi-site surveillance
DOI 10.1007/s10878-009-9271-4 Robust multi-sensor scheduling for multi-site surveillance Nikita Boyko Timofey Turko Vladimir Boginski David E. Jeffcoat Stanislav Uryasev Grigoriy Zrazhevsky Panos M. Pardalos
More informationOptimization Tools in an Uncertain Environment
Optimization Tools in an Uncertain Environment Michael C. Ferris University of Wisconsin, Madison Uncertainty Workshop, Chicago: July 21, 2008 Michael Ferris (University of Wisconsin) Stochastic optimization
More informationA Priori Route Evaluation for the Lateral Transhipment Problem (ARELTP) with Piecewise Linear Profits
1 / 47 A Priori Route Evaluation for the Lateral Transhipment Problem (ARELTP) with Piecewise Linear Profits Martin Romauch 1 Richard Hartl 1 Thibaut Vidal 2 1 University of Vienna 2 PUC-Rio, Rio de Janeiro,
More informationChapter 3: Discrete Optimization Integer Programming
Chapter 3: Discrete Optimization Integer Programming Edoardo Amaldi DEIB Politecnico di Milano edoardo.amaldi@polimi.it Sito web: http://home.deib.polimi.it/amaldi/ott-13-14.shtml A.A. 2013-14 Edoardo
More informationInteger linear programming models for a cement delivery problem
Integer linear programming models for a cement delivery problem Alain Hertz Département de mathématiques et de génie industriel École Polytechnique de Montréal alain.hertz@gerad.ca Marc Uldry and Marino
More informationA Benders decomposition method for locating stations in a one-way electric car sharing system under demand uncertainty
A Benders decomposition method for locating stations in a one-way electric car sharing system under demand uncertainty Hatice Calik 1,2 and Bernard Fortz 1,3 1 Department of Computer Science, Université
More informationBayesian Congestion Control over a Markovian Network Bandwidth Process
Bayesian Congestion Control over a Markovian Network Bandwidth Process Parisa Mansourifard 1/30 Bayesian Congestion Control over a Markovian Network Bandwidth Process Parisa Mansourifard (USC) Joint work
More informationAnalysis of Algorithms. Unit 5 - Intractable Problems
Analysis of Algorithms Unit 5 - Intractable Problems 1 Intractable Problems Tractable Problems vs. Intractable Problems Polynomial Problems NP Problems NP Complete and NP Hard Problems 2 In this unit we
More informationA STUDY OF REALISTIC AND INNOVATIVE FEATURES OF THE SCHOOL BUS ROUTING PROBLEM
A STUDY OF REALISTIC AND INNOVATIVE FEATURES OF THE SCHOOL BUS ROUTING PROBLEM by Hernan Andres Caceres Venegas February 1, 2017 A dissertation submitted to the Faculty of the Graduate School of the University
More informationOn the Power of Robust Solutions in Two-Stage Stochastic and Adaptive Optimization Problems
MATHEMATICS OF OPERATIONS RESEARCH Vol. xx, No. x, Xxxxxxx 00x, pp. xxx xxx ISSN 0364-765X EISSN 156-5471 0x xx0x 0xxx informs DOI 10.187/moor.xxxx.xxxx c 00x INFORMS On the Power of Robust Solutions in
More informationStochastic programs with binary distributions: Structural properties of scenario trees and algorithms
INSTITUTT FOR FORETAKSØKONOMI DEPARTMENT OF BUSINESS AND MANAGEMENT SCIENCE FOR 12 2017 ISSN: 1500-4066 October 2017 Discussion paper Stochastic programs with binary distributions: Structural properties
More informationDistributionally Robust Discrete Optimization with Entropic Value-at-Risk
Distributionally Robust Discrete Optimization with Entropic Value-at-Risk Daniel Zhuoyu Long Department of SEEM, The Chinese University of Hong Kong, zylong@se.cuhk.edu.hk Jin Qi NUS Business School, National
More informationChapter 3: Discrete Optimization Integer Programming
Chapter 3: Discrete Optimization Integer Programming Edoardo Amaldi DEIB Politecnico di Milano edoardo.amaldi@polimi.it Website: http://home.deib.polimi.it/amaldi/opt-16-17.shtml Academic year 2016-17
More informationTracking and Identification of Multiple targets
Tracking and Identification of Multiple targets Samir Hachour, François Delmotte, Eric Lefèvre, David Mercier Laboratoire de Génie Informatique et d'automatique de l'artois, EA 3926 LGI2A first name.last
More informationNode Edge Arc Routing Problems (NEARP)
Node Edge Arc Routing Problems (NEARP) Nicolas Briot Coconut-LIRMM janvier 0 Nicolas Briot (Coconut-LIRMM) Node Edge Arc Routing Problems (NEARP) janvier 0 / What is NEARP? Arc and node routing problem
More informationVehicle Scheduling for Accessible. Transportation Systems
Beauchamp 1 2 Furkan Enderer 3 Mounira Groiez 1 Nadia Lahrichi 1 Mehdi Mahnam 1 Odile Marcotte 4 Sofiane Soualah 5 6 1 École Polytechnique 2 UQAM 3 Concordia University 4 CRM and UQAM 5 Université de Montréal
More informationA Geometric Characterization of the Power of Finite Adaptability in Multi-stage Stochastic and Adaptive Optimization
A Geometric Characterization of the Power of Finite Adaptability in Multi-stage Stochastic and Adaptive Optimization Dimitris Bertsimas Sloan School of Management and Operations Research Center, Massachusetts
More informationRuntime Reduction Techniques for the Probabilistic Traveling Salesman Problem with Deadlines
Runtime Reduction Techniques for the Probabilistic Traveling Salesman Problem with Deadlines Ann Melissa Campbell, Barrett W. Thomas Department of Management Sciences, University of Iowa 108 John Pappajohn
More informationClassification of Dantzig-Wolfe Reformulations for MIP s
Classification of Dantzig-Wolfe Reformulations for MIP s Raf Jans Rotterdam School of Management HEC Montreal Workshop on Column Generation Aussois, June 2008 Outline and Motivation Dantzig-Wolfe reformulation
More informationEncoding formulas with partially constrained weights in a possibilistic-like many-sorted propositional logic
Encoding formulas with partially constrained weights in a possibilistic-like many-sorted propositional logic Salem Benferhat CRIL-CNRS, Université d Artois rue Jean Souvraz 62307 Lens Cedex France benferhat@criluniv-artoisfr
More informationExact and Heuristic Algorithms for the Symmetric and Asymmetric Vehicle Routing Problem with Backhauls
Exact and Heuristic Algorithms for the Symmetric and Asymmetric Vehicle Routing Problem with Backhauls Paolo Toth, Daniele Vigo ECCO IX - Dublin 1996 Exact and Heuristic Algorithms for VRPB 1 Vehicle Routing
More informationA general framework for routing problems with stochastic demands. École Polytechnique Fédérale de Lausanne May 2017
A general framework for routing problems with stochastic demands Iliya Markov Michel Bierlaire Jean-François Cordeau Yousef Maknoon Sacha Varone École Polytechnique Fédérale de Lausanne May 2017 STRC 17th
More informationA Geometric Characterization of the Power of Finite Adaptability in Multistage Stochastic and Adaptive Optimization
MATHEMATICS OF OPERATIONS RESEARCH Vol. 36, No., February 20, pp. 24 54 issn 0364-765X eissn 526-547 360 0024 informs doi 0.287/moor.0.0482 20 INFORMS A Geometric Characterization of the Power of Finite
More informationA Local Branching Matheuristic for the Multi-Vehicle Routing Problem with Stochastic Demand
A Local Branching Matheuristic for the Multi-Vehicle Routing Problem with Stochastic Demand Florent Hernandez Michel Gendreau Ola Jabali Walter Rei December 2016 A Local Branching Matheuristic for the
More informationUnderstanding hard cases in the general class group algorithm
Understanding hard cases in the general class group algorithm Makoto Suwama Supervisor: Dr. Steve Donnelly The University of Sydney February 2014 1 Introduction This report has studied the general class
More information2. A Generic Formulation and the Single-Commodity Flow Formulation for the CVRP
On Time-Dependent Models for Unit Demand Veicle Routing Problems Maria Teresa Godino, CIO-Dep. de Matemática, Instituto Politécnico de Beja, mtgodino@estig.ipbeja.pt Luis Gouveia, CIO-DEIO, Faculdade de
More informationBranch-and-Price-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows
Branch-and-Price-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows Guy Desaulniers École Polytechnique de Montréal and GERAD Column Generation 2008 Aussois, France Outline Introduction
More informationAn Adaptive Memory Programming Framework for the Robust Capacitated Vehicle Routing Problem
Submitted to Transportation Science manuscript (Please, provide the mansucript number!) An Adaptive Memory Programming Framework for the Robust Capacitated Vehicle Routing Problem Chrysanthos E. Gounaris
More informationRobust Optimization in a Queueing Context
Robust Optimization in a Queueing Context W. van der Heide September 2015 - February 2016 Publishing date: April 18, 2016 Eindhoven University of Technology Department of Mathematics & Computer Science
More informationStochastic Generation Expansion Planning
Engineering Conferences International ECI Digital Archives Modeling, Simulation, And Optimization for the 21st Century Electric Power Grid Proceedings Fall 10-23-2012 Stochastic Generation Expansion Planning
More informationInventory optimization of distribution networks with discrete-event processes by vendor-managed policies
Inventory optimization of distribution networks with discrete-event processes by vendor-managed policies Simona Sacone and Silvia Siri Department of Communications, Computer and Systems Science University
More informationSemidefinite and Second Order Cone Programming Seminar Fall 2012 Project: Robust Optimization and its Application of Robust Portfolio Optimization
Semidefinite and Second Order Cone Programming Seminar Fall 2012 Project: Robust Optimization and its Application of Robust Portfolio Optimization Instructor: Farid Alizadeh Author: Ai Kagawa 12/12/2012
More informationMinmax regret 1-center problem on a network with a discrete set of scenarios
Minmax regret 1-center problem on a network with a discrete set of scenarios Mohamed Ali ALOULOU, Rim KALAÏ, Daniel VANDERPOOTEN Abstract We consider the minmax regret 1-center problem on a general network
More informationThe L-Shaped Method. Operations Research. Anthony Papavasiliou 1 / 38
1 / 38 The L-Shaped Method Operations Research Anthony Papavasiliou Contents 2 / 38 1 The L-Shaped Method 2 Example: Capacity Expansion Planning 3 Examples with Optimality Cuts [ 5.1a of BL] 4 Examples
More informationOn the Power of Robust Solutions in Two-Stage Stochastic and Adaptive Optimization Problems
MATHEMATICS OF OPERATIONS RESEARCH Vol. 35, No., May 010, pp. 84 305 issn 0364-765X eissn 156-5471 10 350 084 informs doi 10.187/moor.1090.0440 010 INFORMS On the Power of Robust Solutions in Two-Stage
More informationModels for the Probabilistic Traveling Salesman Problem with Deadlines
Models for the Probabilistic Traveling Salesman Problem with Deadlines Ann M. Campbell 1, Barrett W. Thomas Dept. of Management Sciences University of Iowa Iowa City, IA 52242-1994, USA 1 Corresponding
More informationarxiv: v1 [cs.cc] 7 Sep 2018
Complexity of mldp arxiv:1809.02656v1 [cs.cc] 7 Sep 2018 Nancy A. Arellano-Arriaga Julián Molina S. Elisa Schaeffer Ada M. Álvarez-Socarrás Iris A. Martínez-Salazar September 11, 2018 Abstract We carry
More informationEstimation and Optimization: Gaps and Bridges. MURI Meeting June 20, Laurent El Ghaoui. UC Berkeley EECS
MURI Meeting June 20, 2001 Estimation and Optimization: Gaps and Bridges Laurent El Ghaoui EECS UC Berkeley 1 goals currently, estimation (of model parameters) and optimization (of decision variables)
More informationEdge Elimination for the Hamiltonian Cycle problem
Edge Elimination for the Hamiltonian Cycle problem Elliot Catt Pablo Moscato and Luke Mathieson University of Newcastle February 27, 2017 1 Abstract The Hamilton cycle and travelling salesman problem are
More informationUnit 1A: Computational Complexity
Unit 1A: Computational Complexity Course contents: Computational complexity NP-completeness Algorithmic Paradigms Readings Chapters 3, 4, and 5 Unit 1A 1 O: Upper Bounding Function Def: f(n)= O(g(n)) if
More informationImprovements to Benders' decomposition: systematic classification and performance comparison in a Transmission Expansion Planning problem
Improvements to Benders' decomposition: systematic classification and performance comparison in a Transmission Expansion Planning problem Sara Lumbreras & Andrés Ramos July 2013 Agenda Motivation improvement
More informationECS122A Handout on NP-Completeness March 12, 2018
ECS122A Handout on NP-Completeness March 12, 2018 Contents: I. Introduction II. P and NP III. NP-complete IV. How to prove a problem is NP-complete V. How to solve a NP-complete problem: approximate algorithms
More informationApproximability of the Two-Stage Stochastic Knapsack problem with discretely distributed weights
Approximability of the Two-Stage Stochastic Knapsack problem with discretely distributed weights Stefanie Kosuch Institutionen för datavetenskap (IDA),Linköpings Universitet, SE-581 83 Linköping, Sweden
More informationCAPACITATED LOT-SIZING PROBLEM WITH SETUP TIMES, STOCK AND DEMAND SHORTAGES
CAPACITATED LOT-SIZING PROBLEM WITH SETUP TIMES, STOCK AND DEMAND SHORTAGES Nabil Absi,1 Safia Kedad-Sidhoum Laboratoire d Informatique d Avignon, 339 chemin des Meinajariès, 84911 Avignon Cedex 09, France
More informationProbabilistic Traveling Salesman Problem with Deadlines
Submitted to Transportation Science manuscript 0 Probabilistic Traveling Salesman Problem with Deadlines Ann M. Campbell, Barrett W. Thomas Department of Management Sciences, University of Iowa 108 John
More informationEagleUP: Solving Random 3-SAT using SLS with Unit Propagation
EagleUP: Solving Random 3-SAT using SLS with Unit Propagation Oliver Gableske 1 1 oliver.gableske@uni-ulm.de Institute of Theoretical Computer Science Ulm University Germany This is a joint work with Marijn
More information5 Integer Linear Programming (ILP) E. Amaldi Foundations of Operations Research Politecnico di Milano 1
5 Integer Linear Programming (ILP) E. Amaldi Foundations of Operations Research Politecnico di Milano 1 Definition: An Integer Linear Programming problem is an optimization problem of the form (ILP) min
More informationComplexity of Routing Problems with Release Dates and Deadlines
Complexity of Routing Problems with Release Dates and Deadlines Alan Erera, Damian Reyes, and Martin Savelsbergh H. Milton Stewart School of Industrial and Systems Engineering Georgia Institute of Technology
More informationA Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem
A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem Martin Schwengerer 1, Sandro Pirkwieser 2, and Günther R. Raidl 1 1 Institute of Computer Graphics and Algorithms Vienna
More informationON STOCHASTIC STRUCTURAL TOPOLOGY OPTIMIZATION
ON STOCHASTIC STRUCTURAL TOPOLOGY OPTIMIZATION A. EVGRAFOV and M. PATRIKSSON Department of Mathematics, Chalmers University of Technology, SE-4 96 Göteborg, Sweden J. PETERSSON Department of Mechanical
More informationMathematical Optimization Models and Applications
Mathematical Optimization Models and Applications Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. http://www.stanford.edu/ yyye Chapters 1, 2.1-2,
More informationControlling variability in power systems
Daniel APAM Nov 17 2017 A simple example: 100 100 A simple example: 100 100 Only one solution: 200 100 200 100 100 100 A simple example: 100 100 Only one solution: 200 100 200 100 100 100 But what if the
More informationThe Stochastic Vehicle Routing Problem
The Stochastic Vehicle Routing Problem Research Paper Vrije Universiteit Amsterdam Faculty of Sciences Study programme Business Analytics De Boelelaan 08a 08 HV Amsterdam Dimitry Erkin, email:dimitry.erkin@gmail.com
More informationCHAPTER 3 FUNDAMENTALS OF COMPUTATIONAL COMPLEXITY. E. Amaldi Foundations of Operations Research Politecnico di Milano 1
CHAPTER 3 FUNDAMENTALS OF COMPUTATIONAL COMPLEXITY E. Amaldi Foundations of Operations Research Politecnico di Milano 1 Goal: Evaluate the computational requirements (this course s focus: time) to solve
More informationRecoverable Robustness in Scheduling Problems
Master Thesis Computing Science Recoverable Robustness in Scheduling Problems Author: J.M.J. Stoef (3470997) J.M.J.Stoef@uu.nl Supervisors: dr. J.A. Hoogeveen J.A.Hoogeveen@uu.nl dr. ir. J.M. van den Akker
More informationComplexity of the min-max and min-max regret assignment problems
Complexity of the min-max and min-max regret assignment problems Hassene Aissi Cristina Bazgan Daniel Vanderpooten LAMSADE, Université Paris-Dauphine Place du Maréchal de Lattre de Tassigny, 75775 Paris
More informationComputer Science 385 Analysis of Algorithms Siena College Spring Topic Notes: Limitations of Algorithms
Computer Science 385 Analysis of Algorithms Siena College Spring 2011 Topic Notes: Limitations of Algorithms We conclude with a discussion of the limitations of the power of algorithms. That is, what kinds
More informationC Ahmed Samet 1,2, Eric Lefèvre 2, and Sadok Ben Yahia 1 1 Laboratory of research in Programming, Algorithmic and Heuristic Faculty of Science of Tunis, Tunisia {ahmed.samet, sadok.benyahia}@fst.rnu.tn
More informationModels and Cuts for the Two-Echelon Vehicle Routing Problem
Models and Cuts for the Two-Echelon Vehicle Routing Problem Guido Perboli Roberto Tadei Francesco Masoero Department of Control and Computer Engineering, Politecnico di Torino Corso Duca degli Abruzzi,
More informationTransportation Problem
Transportation Problem. Production costs at factories F, F, F and F 4 are Rs.,, and respectively. The production capacities are 0, 70, 40 and 0 units respectively. Four stores S, S, S and S 4 have requirements
More informationModeling, equilibria, power and risk
Modeling, equilibria, power and risk Michael C. Ferris Joint work with Andy Philpott and Roger Wets University of Wisconsin, Madison Workshop on Stochastic Optimization and Equilibrium University of Southern
More informationA robust approach to the chance-constrained knapsack problem
A robust approach to the chance-constrained knapsack problem Olivier Klopfenstein 1,2, Dritan Nace 2 1 France Télécom R&D, 38-40 rue du gl Leclerc, 92794 Issy-les-Moux cedex 9, France 2 Université de Technologie
More informationExact algorithms for the chanceconstrained
Exact algorithms for the chanceconstrained vehicle routing problem Thai Dinh, Ricardo Fukasawa & James Luedtke Mathematical Programming A Publication of the Mathematical Optimization Society ISSN 0025-5610
More informationBayesian Networks: Construction, Inference, Learning and Causal Interpretation. Volker Tresp Summer 2016
Bayesian Networks: Construction, Inference, Learning and Causal Interpretation Volker Tresp Summer 2016 1 Introduction So far we were mostly concerned with supervised learning: we predicted one or several
More informationInvestigating uncertainty in BPR formula parameters
Young Researchers Seminar 2013 Young Researchers Seminar 2011 Lyon, France, June 5-7 2013 DTU, Denmark, June 8-10, 2011 Investigating uncertainty in BPR formula parameters The Næstved model case study
More informationCompressed Sensing and Linear Codes over Real Numbers
Compressed Sensing and Linear Codes over Real Numbers Henry D. Pfister (joint with Fan Zhang) Texas A&M University College Station Information Theory and Applications Workshop UC San Diego January 31st,
More informationRobust Inventory Routing under Demand Uncertainty
TRANSPORTATION SCIENCE Vol. 00, No. 0, Xxxxx 0000, pp. 000 000 issn0041-1655 eissn1526-5447 00 0000 0001 INFORMS doi 10.1287/xxxx.0000.0000 c 0000 INFORMS Robust Inventory Routing under Demand Uncertainty
More informationHandling imprecise and uncertain class labels in classification and clustering
Handling imprecise and uncertain class labels in classification and clustering Thierry Denœux 1 1 Université de Technologie de Compiègne HEUDIASYC (UMR CNRS 6599) COST Action IC 0702 Working group C, Mallorca,
More informationA new robust approach for a production scheduling and delivery routing problem
A new robust approach for a production scheduling and delivery routing problem Azeddine Cheref, Christian Artigues, Jean-Charles Billaut To cite this version: Azeddine Cheref, Christian Artigues, Jean-Charles
More informationScenario-Free Stochastic Programming
Scenario-Free Stochastic Programming Wolfram Wiesemann, Angelos Georghiou, and Daniel Kuhn Department of Computing Imperial College London London SW7 2AZ, United Kingdom December 17, 2010 Outline 1 Deterministic
More informationBranch-and-Price for Routing with Probabilistic Customers
Branch-and-Price for Routing with Probabilistic Customers Felipe Lagos 1, Mathias A. Klapp 2, Alejandro Toriello 1 1 H. Milton Stewart School of Industrial and Systems Engineering Georgia Institute of
More informationDifferential Evolution: a stochastic nonlinear optimization algorithm by Storn and Price, 1996
Differential Evolution: a stochastic nonlinear optimization algorithm by Storn and Price, 1996 Presented by David Craft September 15, 2003 This presentation is based on: Storn, Rainer, and Kenneth Price
More information