A LAGRANGEAN DECOMPOSITION ALGORITHM FOR MULTI-ITEM LOT-SIZING PROBLEMS WITH JOINT PURCHASING AND TRANSPORTATION DISCOUNTS 1. Alain Martel.
|
|
- Spencer Strickland
- 6 years ago
- Views:
Transcription
1 A LAGRANGEAN DECOMPOSITION ALGORITHM FOR MULTI-ITEM LOT-SIZING PROBLEMS WITH JOINT PURCHASING AND TRANSPORTATION DISCOUNTS 1 Alain Martel Nafee Rizk Amar Ramudhin Network Enterprise Technology Research Center, Faculté des sciences de l'administration, Université Laval, Québec, Canada. Septembre This research was supported by the Natural Sciences and Engineering Council of Canada and CAPS LOGISTICS, inc.
2 1. INTRODUCTION In the consumer goods wholesaling and retailing industry, a large number of stock keeping units must be managed on a regular basis. The items are typically purchased in families, each family being associated to a specific external vendor, and usually they are shipped together. The transportation costs thus incurred account for a significant part of the items price, and their structure may incorporate economies of scale, as well as constraints on the total load which can be carried. In some cases, the transportation costs are included in the item prices and they are not paid directly by the buyer. In such cases, however, the vendor often offers discounts on the total amount of the order and imposes constraints on its size. In either cases, this give rise to the class of dynamic multi-item lot sizing problems with oint shipping and/or purchasing cost discounts studied in this paper. This problem is a generalization of several of the dynamic lot-sizing problems that have been treated in the literature. Much work has been done to find exact and heuristic methods to solve the numerous versions of the dynamic lot-sizing problem. The complexity of the problem depends largely on whether it deals with a single item or several items, on the resource constraints imposed on the lot sizes (unconstrained or oint lower bounds and/or oint upper bounds) and on the type of cost structure which applies. A dynamic programming algorithm to solve the basic single-item case was published by Wagner and Whitin [1958]. Comparisons of the numerous heuristics that have been developed to solve the single-item problem can be found in Zoller and Robrade [1988]. Bitran and Yanasse [1982] provide a review and analysis of the problem under capacity constraints. When several items are involved, additional complexity is introduced by cost interactions and/or by resource interactions. The simplest multi-item case is the one where the interaction is due only to a oint setup (or order) cost. Dynamic programming algorithms to solve this problem were proposed by
3 2 Zangwill [1966], Veinott [1969], Kao [1979], Silver [1979] and Haseborg [1982]. Atkins and Iyogun [1988] developed a heuristic procedure. Maes and Van Wassenhove [1986] reviewed the case where the interaction is due only to capacity constraints and where costs are stationary. They also provide a comparison of three "simple" heuristics. An integer programming cutting plane algorithm was proposed by Barany, Van Roy and Wolsey [1984] and Lagrangean relaxation procedures were developed by Thizy and Van Wassenhove [1985], Gelder, Maes and VanWassenhove [1986], Trigeiro, Thomas and McClain [1989] and Diaby, Bahl, Karwan and Zionts [1992]. A number of set partitioning and column generation heuristics are also proposed by Cattrysse, Maes and VanWassenhove [1990]. To the best of our knowledge, little work was done on the case where the interaction is caused by oint order cost functions as well as by restrictions on the amount of resources used/available. Such situations are very common in the consumer goods wholesaling and retailing industry and occur when shipment costs depend on the total amount of transportation resources used by all the items, and/or when all unit or incremental discounts are offered by vendors on the total invoice value, instead of on the quantity ordered for individual items, as is usually assumed in the literature. In practice, shipping costs depend on several factors. Pricing mechanisms are not the same for private fleets and for public carriers. In the former case, for our purposes, only variable costs related to specific shipments are relevant. In the latter case, freight-rate structures depend on the mode used, the shipping distance and weight, the type of shipment (TL or LTL), and the commodity class of the item shipped. For this reason, few studies have attempted to model freight-rate structures explicitly. Buffa and Munn [1989] provide a review of the work done in this area. Most of the currently available models that incorporate a realistic representation of freight-rate structures deal only with the single-item, constant-demand case.
4 3 Little work has been done on the modeling of oint discounts based on total invoice value. Some aspects of the problem are studied by Chakravarty [1984] and by Silver and Peterson [1985] for the unconstrained constant-demand case. To the best of our knowledge, however, no previous work is available on oint discounts for the multi-item dynamic-demand problem treated in this paper. The paper is organized as follows. In section 2 the problem is defined and formulated as a mixed-integer program. In section 3 Lagrangean relaxation is used to decompose it in a set of simple sub-problems. A heuristic method based on subgradient optimization is then proposed, and a branch-and-bound algorithm is designed to solve the original model. Finally, section 4 presents the experiments performed to assess solution methods and it discusses computational results. 2. PROBLEM DEFINITION AND FORMULATION For most practical situations, oint shipping cost structures, or oint price discount structures, can be represented by a general (i.e., not necessarily concave, nor continuous) piecewise-linear function z(s) of the amount S [0, S max ] of a critical resource (measured in cwt, cube, $,...) associated to an order. S max is an upper bound on the availability of this resource in a given time period. This complex structure for the shipment and purchasing costs is required to model the various types of discounts offered by public carriers in practice. It also accounts for the situation where one switches from one mode of transportation to another based on volumes, and for the constraints imposed by carriers to qualify for certain types of discounts. It can also adequately model the costs incurred when a private fleet is used, as well as incremental or all units cost discount structures. The situations that are encountered the more often in practice are illustrated in Figure 1.
5 4 z(s) A fixed cost available capacity z(s) large artificial cost A 2 = A 1 fixed cost fixed cost - A 1 Smax a) Fixed cost with capacity constraint S min b) Fixed cost with bounds on load S max z(s) A = cost of a truck trip z(s) A A truck capacity S 2S c) Private fleet TL costing Smax =3S S 1 S 2 S 3 S 4 d) Public carrier / all units discount Smax z(s) z 3 (s 3, λ 3 ) v 3 A 3 s 3 A 1 v 1 =0 v 2 minimum order quantity technological constraint S b 1 b 2 b 3 b 4 e) General case (not continuous nor concave) b 5 S max Figure 1: Shipping/Purchasing Costs Discount Functions
6 Let b, = 1,...,γ, denote the length of the th interval defined on the S-axis by the linear segments of z(s) and define new linear functions, 5 z (s, λ ) = A λ + v s, λ {0, 1}, s [0, b ], = 1,..., γ, over each of these intervals as illustrated in Figure 1e). Then, assuming that when there is a discontinuity the lowest point is preferred, the shipment size is given by S = γ = 1 the amount procured at rate v, and the shipment/purchasing cost by s, where s is γ z(s) = =1 z (s, ) λ = ( A λ + v s ), provided that, γ = 1 i) if A 0 a) λ = 1 and s = b if S k = 1 b k b) λ = 1 and 0 < s b if 1 k= 1b < S k = 1 b k k c) λ = 0 and s = 0 if S 1 k= 1b k ii) if A < 0 a) λ = 1 and s = b if S k = 1 b k b) λ = 1 and 0 s b if 1 k= 1b S k = 1 b k k c) λ = 0 and s = 0 if S 1 k= 1b k Since our obective is to minimize costs, condition i-b) will be satisfied even if the < is replaced by a and hence the required conditions can be stated as b λ +1 s b λ, λ {0, 1}, = 1,..., γ, λ γ+1 = 0,
7 To simplify the notation, we assume without loss of generality that the intervals on the S-axis of the shipment/purchasing costs function do not change from period to period. 6 i : an item type, i F, F = {1,, m} t : a planning period, t H, H = {τ+1,..., T} τ d it : procurement lead-time (in planning periods) for the family of items : effective demand for item i during period t r it : resource absorption rate for item i in period t (in cwt, cube, $,...) A t v t : fixed cost/saving associated to the th interval on the oint shipment/purchasing cost function in period t : th shipment/purchasing cost per unit of resource for period t b : maximum amount which can be procured at a rate v t, for all t (in cwt, cube, $,...) c it h it R it I it : procurement cost of an item i received at the beginning of period t : inventory holding cost for item i in period t : quantity of item i received for the beginning of period t : inventory of item i on hand at the end of period t S t : resources absorbed by the items procured for period t (in cwt, cube, $,...) s t : amount procured at rate v t for period t (in cwt, cube, $,...) λ t : binary variable associated with the th interval on the shipment/purchasing cost function for period t Figure 2: Basic Notation Using the notation defined in Figure 2, the dynamic lot-sizing problem with purchasing and/or transportation cost discounts can be formulated as follows: (P) min T t = τ + 1 { γ m = 1 ( A λ + v s ) + i = 1 [c it R it + h it I it ] } t t t t subect to (1) R it + I i,t-1 - I it = d it, i, t = τ+1,..., T γ (2) = 1 s it - = m i 1 r it R it = 0, t = τ+1,..., T (3) s t - b λ t 0,, t = τ+1,..., T
8 7 (4) -s t + b λ t,+1 0,, t = τ+1,..., T (λ t,γ+1 = 0) (5) R it, I it, s t 0, λ t {0, 1} i,, t = τ+1,..., T (6) I iτ = I it = 0 i The obective function of (P) simply says that we want to minimize total shipment, purchasing and inventory costs. Constraints (1) are the inventory balance equations. They insure that all demands are met. Constraints (2) establish the relationship between the receptions R it and the variables s t defined over the intervals of the shipment/purchasing cost functions. Constraint sets (3) and (4) enforce the piecewise-linear nature of the shipment/purchasing costs. Finally, constraints (6) reflect our assumption that the inventory levels at the beginning and at the end of the planning horizon are zero. 3. SOLUTION METHOD 3.1. Lagrangean Decomposition If we multiply the constraints (2) in (P) by Lagrange multipliers υ t, and add the resulting expressions to the obective function of (P), the following two primal Lagrangean sub-problems are obtained: T m (SP1) min t= τ + 1 i= 1 [c it R it + υ t r it R it + h it I it ] subect to R it + I i,t-1 - I it = d it, i, t = τ+1,..., T R it, I it 0 i, t = τ+1,..., T I iτ = I iτ = 0 i.
9 8 and (SP2) min T = + γ t τ 1 = 1 [A t λ t + (v t -υ t )s t ] subect to s t - b λ t 0,, t = τ+1,..., T -s t + b λ t,+1 0,, t = τ+1,..., T (λ t,γ+1 = 0) s t 0, λ t {0, 1}, t = τ+1,..., T. problems: Clearly, (SP1) decomposes into the following m unconstrained single-item lot-sizing (SP1-i) L1 i (υ) = min T t = τ + 1 [(c it + υ t r it )R t + h it I t ] subect to (7) R t + I t-1 - I t = d it, t = τ+1,..., T (8) R t, I t 0 t = τ+1,..., T (9) I τ = I T = 0. and (SP2) decomposes into the (T-τ) independent sub-problems: γ (SP2-t) L2 t (υ) = min = [A t λ + (v t -υ t )s ] 1 subect to (10) s - b λ 0, (11) -s + b λ +1 0, ( λ γ+1 = 0)
10 9 (12) s 0, λ {0, 1}. Problem (SP1-i) is a linear network flow model and it can be solved efficiently with the transportation algorithm or with Wagner-Whitin's dynamic programming algorithm (Wagner and Whitin [1958]). Problem (SP2-t) can be solved efficiently with the O(γ) time algorithm proposed by Diaby and Martel [1993]. From Lagrangean decomposition theory (Guignard [1987]), we know that m (13) L D (υ) = i= 1 L1 i (υ) + T t = τ + 1 L2 t (υ) is a lower bound to the cost of the optimal solution of (P). We also know that the greatest lower bound attainable with our Lagrangean decomposition is provided by the multipliers obtained by solving the Lagrangean dual problem (LD) L D = max υ L D (υ) Problem (LD) is solved efficiently by subgradient optimization. If, for a given υ, the solution provided by the primal sub-problems is a feasible solution of (P) with value V*, then we know that it is within ([V* - L D (υ)]/v*)100% of the optimum. This provides the basis for the elaboration of a good heuristic procedure, as well as a branch-and-bound algorithm, for the solution of (P). 3.2 Branch-and-Bound Algorithm The branch-and-bound (B&B) algorithm developed involves a branching strategy based on feasibility considerations, a bounding scheme based on Lagrangian relaxation, and a heuristic procedure to generate upper bounds at each node examined. We discuss these three issues in the following sections.
11 Branching Strategy A depth-first strategy is used in our B&B procedure. Each level of the branching tree corresponds to a period t T, and each node of this level generates γ+1 new candidate subproblems with each candidate corresponding to one of the following vectors: (14) (λ t1 = λ t2 =...= λ tγ = 0) (λ t1 =1, λ t2 =...= λ tγ = 0) (λ t1 = λ t2 = 1, λ t2 =...= λ tγ = 0)... (λ t1 = λ t2 =...= λ tγ = 1). The general B&B scheme is as follows. A candidate sub-problem is examined only if the set of all feasible solutions to (P), given the restrictions imposed at its parent nodes and at its node in the branching tree, is not empty and its lower bound is less than the best upper bound. When a node cannot be eliminated it generates (γ+1) new candidate sub-problems as mentioned above. Recall that levels of the tree correspond to periods. The period to branch on is the one that has the greatest violation of constraint (2) according to the Lagrangean relaxation solution of the candidate sub-problem associated to the node examined Lower Bounds Lower bounds are obtained by optimizing L D using a sub-gradient optimization approach (see Bazarra and Goode 1979 or Fisher 1981). Initial values for the multipliers are obtained heuristically by setting υ 0 = max t ( v ) t t = τ+1,, T At iteration k, those multipliers are changed according to the formula: υ k t = υ k-1 m t + β k-1 [( 1 r it R k-1* it - i= γ = 1 s t k-1* )]
12 where (R k-1*, s k-1* ) is the solution to the Lagrangean sub-problem at iteration k-1, and β k-1 is a scalar given by: 11 β k-1 = k-1 ( L - D * k D -1 T m L ) / [ τ 1 ( 1 r it R k-1* it - t = + i = γ = 1 s t k-1* ) 2 ], where k-1 (0, 2]; L D is an upper bound on the value of the Lagrangean dual problem, and * k D -1 L is the value of the Lagrangean sub-problem at iteration k-1. We start with 0 = 1 and multiply k-1 by 0.45 if the improvement in the Lagrangean bound is not more than 0.25% in two consecutive trials. We stop the procedure if the improvement in the Lagrangean bound is not more than 0.25% in 35 consecutive trials, or if the total number of iterations reaches Upper Bounds An upper bound at a given node of the B&B tree is obtained by perturbing the optimal solutions of SP1. Recall that the solutions of SP1 may not be feasible in (P) as the total quantity of transportation resources absorbed in period t (S t = m i= 1 r it R it ) may not fall within the shipment size range specified by the λ-values associated to the B&B tree node. The perturbation procedure involves a backward and a forward pass that either reduces shipment sizes to avoid capacity shortages or increases shipment sizes to avoid excess capacity. At each iteration the surplus or missing capacity is calculated for each period. Based on procurement and inventory cost considerations, the surplus or shortage is eliminated by shifting shipment quantities among periods. The result is a feasible solution that constitutes an upper bound for (P). This feasible solution is further improved by a heuristic procedure that seeks higher gains through additional period shifting adustments. A detailed description of the backward procedure is presented in Figure 3 where for a given node the following notations are used:
13 for t = T downto (τ+2) do begin step 1. gap t = S t U t ; if gap t > 0 then {reduce shipment size} repeat step 2. ϕ = {θ < t S θ < U θ }; if (ϕ φ) then begin step 3. Choose a product i 0 in F and a period t 0 < t in ϕ based on the following cost criterion: t (c i0t0 + 1 t θ = t h 0 i0θ - c i0t ) = min { min ((c α + 1 θ= α h θ - c t ))}; α ϕ F step 4. Compute the shipment quantity of product i 0 to shift from period t to period t 0 as follows: = min (R i0t, gap t /r i0t, (U t0 S t0)/r i0t0 ); step 5. Update R i0t, R i0t0, and gap t : R i0t = R i0t -, R i0t0 = R i0t0 +, gap t = gap t (r i0t * ) endif until (gap t 0 or ϕ = φ) else {S t U t 0} begin step 6. gap t = L t S t ; Rt> 0 if gap t > 0 then repeat step 7. ϕ = {θ < t L θ < S θ, and i such that R iθ > 0, step 8. step {increase shipment size} min I iδ >0} θ δ <t if ϕ φ then begin Choose a product i 0 and a period t 0 in ϕ based on the following t c i0t - c i0t0-1 t θ = t 0 h i0θ = min min ( c it - c iα - 1 θ = α h iθ ); α ρ i I(α) where I(α) = {i R iα > 0, min I iθ >0} α θ <t Compute the shipment quantity of product i 0 to shift from period t 0 to period t as follows: = min(r i0t0, gap t/r i0t, (S t0 L t0)/r i0t0, min I iδ ); t 0 δ <t step 10. Update R i0t, R i0t0, and gap t; R i0t = R i0t +, R i0t0 = R i0t0 -, gap t = gap t - r i0t * endif until (gap t 0 or ϕ = φ) endelse endfor Figure 3: Backward Pass Procedure
14 13 Γ = set of periods for which the λ-values have been fixed according to the branching strategy f(t) max 1 γ γ = { λt = 1} if t Γ if t (H - Γ) At a given node of the B&B tree, a feasible solution to the sub-problem represented by the node must be such that the total quantity of resources absorbed in each period t (S t ) is within the shipment size range [L t, U t ] where L t and U t are given by L t = 0 f(t) = 1 1 b if t Γ if not and f(t) U t = = 1 b The backward pass procedure, starting from period T and ending at period (τ+2), verifies for each period t whether the quantity of transportation resources (S t ) is greater than the maximum capacity allowed (U t ), by computing gap t = S t U t (step 1). An iterative procedure is then used to eliminate the capacity shortage by shifting the reception of a certain quantity of a product i 0 from period t to a period t 0 < t. The product i 0 and the period t 0, if any, are chosen in step 3 so as to have the smallest net increase of the procurement and holding costs (c i0t0 + t 1 θ = t 0 h i0θ - c i0t), and the quantity is determined in step 4 in a way not to generate unfeasibility at period t 0 ( (U t0 S t0)/r i0t0 ) and not to be larger than the needed ( gap t /r i0t ). This process is repeated until the shortage capacity is eliminated (gap t 0) or no product i 0 can be moved from the period t to any period t 0 < t so as to reduce capacity shortage without violating the (P) problem constraints. The second part of the backward pass procedure verifies whether the quantity of transportation resources absorbed (S t ) is less than the minimum capacity required (L t ) by computing gap t = L t S t (step 6). If gap t > 0 (S t < L t ), a step by step procedure is used to
15 14 eliminate the shortage of the quantity transported by shifting the reception of certain quantity of product i 0 from a period t 0 < t to the period t. The product i 0 and the period t 0 < t are chosen according to a cost criterion given in step 8, and the quantity is determined in step 9. This process is repeated until the excess capacity is eliminated (gap t 0) or no product i 0 can be moved from any period t 0 < t to period t without violating the problem constraints. Starting from period τ+1 and ending at period T-1, the forward pass procedure follows the same logic as the backward procedure, but this time, the surplus (missing) quantity in period t is shifted to (from) a period t 0 > t. To improve the quality of the feasible solution found by the perturbation procedure, a backward-forward improvement algorithm is then used. A description of this algorithm is given in Figure 4. Starting from period T and ending at period (τ+2), the backward pass of the improvement algorithm verifies for each period t whether the quantity of transportation resources adsorbed (S t ) is greater than the minimum capacity allowed (L t ) (step 1). If S t > L t, for each period t e and for each product i, the quantity of product i that can be shifted from the period t to the period t e without violating the solution feasibility is calculated in step 2. The net increase in the obective function if the quantity of product i is shifted from period t to period t e is calculated in step 3. If the net increase is below 0, the reception quantities of product i in the period t (R it ) and in the period t e (R ite) are respectively decreased and increased by the quantity. Starting from period τ+1 and ending at period T-1, the forward pass of the improvement algorithm procedure follows the same logic, but this time, the shift, if advantageous, is done from period t to a period t e > t.
16 for t = T downto (τ+2) do begin step 1. step 2. if S t > L t then begin for t e = t-1 downto (τ+1) do begin if U te > S te then begin for i =1 to m do begin compute the shipment quantity of product i to shift from period t to period t e as follows: = min ( R it, (S t - L t ) / r it, (U te S te) / r ite ); if > 0 then begin step 3. compute the net increase on the obective function if the quantity of product i is shifted from the period t to the period t e as follows : ao = CT CT, {where CT: is the obective function value of the current solution. CT : is the obective function value of the solution obtained from the current solution by shifting a quantity of product i from the period t to the period t e } if ao < 0 then begin step 4. R it = R it -, R ite = R ite +, endif endif endfor endif endfor endif endfor Figure 4: Backward Pass of Improvement Procedure 15 Lastly, it is important to note that the sub-problems obtained when all the binary variables are fixed (i.e. for the nodes at the bottom of the B&B tree) are linear programs. We use a linear programming library (CPLEX) to solve these sub-problems. Since the B&B procedure usually finds the optimal solution before these lowest level nodes are explored, a powerful heuristic is
17 16 obtained by stopping the exploration as soon as the difference between the lower and upper bounds does not exceed ε% of the upper bound value. This heuristic procedure thus guarantees an ε%-optimal solution for any ε TESTS RESULTS Testing was done to compare the computational times and the quality of the solutions obtained for different values of ε (0%, 1%, and 3%) as well as to evaluate the efficiency of our perturbation procedure. We programmed the algorithm in Pascal in a Delphi 2.0 environment and implemented it on a Pentium 90 computer. The tests were done on 560 problems of different sizes and with different characteristics. For each ε-value, five problems of each type were solved. The experimental design is based on the following factors. The structure of the cost function: The transportation/purchasing cost function considered are those presented in Figure 5. The number of products: Two groups of problems were studied. The first group has a number of products that is uniformly distributed between 50 and 100 (m U[50, 100]). The number of products in the second group is uniformly distributed between 250 and 300 (m U[250, 300]). The number of periods: Planning horizons of 13 and 26 periods were tested. The variation of demands: Product demands are generated from a Normal distribution (d i N(µ i U[10, 100]), σ i = µ i / CV) where the coefficient of variation CV is equal to either 0.25 or 0.6 in order to evaluate the impact of demand variation amplitudes. The importance of the inventory holding cost relative to the item cost. Test problems with small inventory costs (h i U[0.1% c i, 0.2% c i ]) and large inventory costs (h i U[0.5% c i,
18 0.6% c i ]) relative to a time invariant purchasing cost c i (c i U[10, 40]) are considered in our experiments 17 z(s) z(s) 1) Private fleet 2) Public fleet with 3 intervals z(s) z(s) 3) Public fleet with 2 intervals and a lower bound 4) Public fleet with 1 interval z(s) z(s) 5) Public fleet with 1 interval and an upper bound 6) Public fleet with 2 intervals and lower and upper bounds z(s) 7) Public fleet with 3 intervals and an upper bound Figure 5: Structure of the cost functions used Overall we considered 7 different transportation/procurement cost functions, 2 different ranges for the number of products, 2 different planning horizon lengths, 2 different demand variations, and 2 different inventory costs scenarios. Thus, we have 112 ( ) different problem instances. Since we generated five problems for each instance, 560 problems (5 112) were solved for each ε-value. All together, the problems solved can be classified in the 15 problem types described in Table1.
19 Notation Description Nbr. Pbs P1**** Private fleet 16 P2**** Public fleet with 3 intervals (continuous) 16 P3**** Public fleet with 2 intervals and a lower bound (not continuous) 16 P4**** Public fleet with 1 interval 16 P5**** Public fleet with 1 interval and an upper bound 16 P6**** Public fleet with 2 intervals and a lower bound and an upper bound (non continuous) 16 P7**** Public fleet with 3 intervals and an upper bound (continuous) 16 P*1*** Family of 50 to 100 products 56 P*2*** Family of 250 to 300 products 56 P**1** 13 periods horizon 56 P**2** 26 periods horizon 56 P***1* Demands generated with CV = P***2* Demands generated with CV = P****1 Inventory costs generated within [(0.1%)ci, (0.2%)c i ] 56 P****2 Inventory costs generated within [(0.5%)ci, (0.6%)ci] 56 Table 1: Classification of Problems Solved 18 The computational results for each ε-value are presented in Table 2. The table gives computational times and % deviations from the optimal solution cost, for the various types of problems solved. Times are not given for the perturbation procedure used to obtain the initial solution because they were negligible. The results indicate that our Lagrangean decomposition heuristic yields high quality solutions. When ε is set to 1%, instead of 0%, the computational time reduces by 59% on average, but the deviation from the optimum is only of 0.16%. When ε is set to 3%, a 95% reduction in computation time is observed but the average deviation from the optimum is only of 0.32%. The perturbation procedure used to get a first feasible solution is also a very good heuristic. Even if the CPU time required to compute these solutions is negligible, for the test problems the perturbation procedure gave the optimal solution four times out of six. A more detailed look at the results reveal that some problems are much harder than others. The main discriminating criteria is the presence of a tight upper bound on the cost function. All the problems with an upper bound (cost functions 1, 5, 6 and 7) were solved optimally by the initial perturbation procedure, independently of the shape of the cost function. The time required to solve the problems with unbounded cost functions is much higher and the quality of the
20 19 solution given by the heuristics is not as high. This is due to the fact that since the perturbation algorithm does not perform as well in those cases, the upper bounds obtained during the branch and bound procedure are not as good. The quality of the solution obtained with the heuristics, in terms of deviation from the optimum, does not seem to be affected very much by the other experimental factors considered. Problem type ε = 0 % ε = 1% ε = 3% Initial solution Aver. time (sec) Aver. time (sec) % Devi./opt.sol Aver. time (sec) % Devi./opt.sol % Devi./opt.sol P1**** 2,30 2,30 0,00 2,30 0,00 0,00 P2**** 102,60 36,96 0,16 33,66 0,47 5,98 P3**** 337,49 42,24 0,21 9,99 0,62 0,24 P4**** 824,34 433,90 0,83 2,29 1,25 1,28 P5**** 2,46 2,38 0,00 2,31 0,00 0,00 P6**** 5,34 4,78 0,00 4,23 0,00 0,00 P7**** 4,14 3,75 0,00 3,30 0,00 0,00 P*1*** 74,90 22,35 0,18 4,60 0,32 0,73 P*2*** 290,43 128,02 0,14 12,00 0,31 1,22 P**1** 21,99 10,65 0,15 3,82 0,27 0,96 P**2** 343,34 139,72 0,18 12,78 0,37 1,00 P***1* 188,68 65,46 0,18 8,60 0,30 0,99 P***2* 176,66 84,92 0,15 8,00 0,34 0,97 P****1 152,68 49,17 0,16 8,20 0,23 1,00 P****2 212,66 101,20 0,16 8,40 0,40 0,94 All problems 182,67 75,19 0,17 8,30 0,32 0,98 Table 2 : Computational Results As could be expected, however, the time required to solve the problems depends on the number of products and on the length of the planning horizon. The planning horizon effect is much more pronounced. The computation time is almost directly proportional to the number of products: on average, when the number of products is multiplied by 3.6 the time required to solve the problems to optimality is multiplied by 3.8. On the other end, doubling the number of planning periods multiplies the time required to obtain the optimal solution by 15. Problems with high holding costs are a bit longer to solve, but the impact of this factor is not as marked as the previous ones. Finally, the variability of the demand does not seem to influence computation times.
21 20 5. CONCLUSION We have formulated a mixed-integer linear programming model to plan the procurement of a family of items under piecewise linear economies of scale. The model accommodates switches between transportation modes based on volumes, and various types of discounts that may be offered in practice on transportation and/or purchasing prices. Mathematical properties of a Lagrangean relaxation of the model were developed and a branch-and-bound procedure that exploits these properties was presented. The latter includes a powerful heuristic for generating upper bounds. The B&B procedure appears to be efficient for solving moderate size problems, and the heuristic method can be used to obtain near-optimal solutions for large real-life supply planning problems. 6. REFERENCES - ATKINS, D. AND P. IYOGUN, "A Heuristic with Lower Bound Performance Guarantee for the Multi-Product Dynamic Lot-Size Problem", IIE Trans., 20 (1988), BARANY, I., T. Van ROY AND L. WOLSEY, "Strong Formulations for Multi-Item Capacitated Lot Sizing", Man. Sci., 30 (1984), BITRAN, G. AND H. YANASSE, "Computational Complexity of the Capacitated Lot Size Problem", Man. Sci., 28 (1982), BUFFA, F. AND J. MUNN, "A Recursive Algorithm for Order Cycle-time that Minimizes Logistics Cost", J. Opl Res. Soc., 40 (1989), CATTRYSSE, D., J.MAES AND L.N. VANWASSENHOVE, "Set Partitioning and Column Generation Heuristics for Capacitated Dynamic Lot Sizing", E.J.O.R., 46 (1990), CHAKRAVARTY, A., "Joint Inventory Replenishments with Group Discounts Based on Invoice Value", Man. Sci., 30 (1984),
22 21 - DIABY, M., H. BAHL, M. KARWAN AND S. ZIONTS, "Capacitated Lot-Sizing and Scheduling by Lagrangean Relaxation", E.J.O.R., 59-3 (1992), DIABY, M., AND A. MARTEL, "Dynamic Lot-Sizing in Multi-Echelon Distribution Systems with Purchasing and Transportation Price Discounts", Ops. Res., vol 41-1 (1993), GELDERS, L., J. MAES AND L.N. VANWASSENHOVE, "A Branch and Bound Algorithm for the Multi-Item Single Level Capacitated Dynamic Lotsizing Problem", in Axsater, Schneeweiss and Silver (eds), Multi-Stage Production Planning and Inventory Control, Springer-Verlag, 1986, GUIGNARD, M. AND S. KIM, "Lagrangean Decomposition: A Model Yielding Stronger Lagrangean Bounds", Math. Prog., 39 (1987), HASEBORG, F., "On the Optimality of Joint Ordering Policies in a Multi-Product Dynamic Lot Size Model with Individual and Joint Set-up Costs", EJOR, 9 (1982), KAO, E., "A Multi-Product Dynamic Lot-Size Model with Individual and Join Set-up Costs", Ops. Res., 27 (1979), MAES, J. AND L. VAN WASSENHOVE, "Multi Item Single Level Capacitated Dynamic Lotsizing Heuristics: A Computational Comparison (Part I and II)", IIE Trans., 18 (1988), MARTEL, A., M. DIABY AND F. BOCTOR, Multiple Items Lot-sizing under Stochastic Nonstationary Demands, E.J.O.R., 87 (1995), SILVER, E., "Inventory Control Under a Probabilistic Time-Varying Demand Pattern", AIIE Trans., 10 (1978), SILVER, E., "Coordinated Replenishments of Items Under Time-varying Demand: Dynamic Programming Formulation", NRLQ, 26 (1979),
23 22 - SILVER, E. AND R. PETERSON, Decision Systems for Inventory Management and Production Planning, 2 nd ed., Wiley, THIZY, J. AND L. VAN WASSENHOVE, "Lagrangean Relaxation for the Multi-item Capacitated Lot-Sizing Problem: A Heuristic Implementation", IIE Trans., 17 (1985), TRIGEIRO, W., J. THOMAS AND J. MCCLAIN, "Capacitated Lot Sizing with Setup Times", Man. Sci., 35 (1989), VEINOTT, A. F., "Minimum Concave-Cost Solution of Leontief Substitution Models of Multifacility Inventory Systems", Ops. Res., 17 (1969), WAGNER, H. AND T.M. WHITIN, "Dynamic Version of the Economic Lot Size Model", Man. Sci., 5 (1958), ZANGWILL, W.I., "A Deterministic Multiproduct, Multifacility Production and Inventory Model", Ops. Res., 14 (1966), ZANGWILL, W.I., "A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System", Man. Sci., 15 (1969), ZOLLER, K. AND A. ROBRADE, "Efficient Heuristics for Dynamic Lot Sizing", Int. J. Prod. Res., 26 (1988),
CAPACITATED 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 informationReplenishment Planning for Stochastic Inventory System with Shortage Cost
Replenishment Planning for Stochastic Inventory System with Shortage Cost Roberto Rossi UCC, Ireland S. Armagan Tarim HU, Turkey Brahim Hnich IUE, Turkey Steven Prestwich UCC, Ireland Inventory Control
More informationPractical Tips for Modelling Lot-Sizing and Scheduling Problems. Waldemar Kaczmarczyk
Decision Making in Manufacturing and Services Vol. 3 2009 No. 1 2 pp. 37 48 Practical Tips for Modelling Lot-Sizing and Scheduling Problems Waldemar Kaczmarczyk Abstract. This paper presents some important
More informationWorst case analysis for a general class of on-line lot-sizing heuristics
Worst case analysis for a general class of on-line lot-sizing heuristics Wilco van den Heuvel a, Albert P.M. Wagelmans a a Econometric Institute and Erasmus Research Institute of Management, Erasmus University
More informationCapacitated Lot-Sizing with. Linked Production Quantities. Knut Haase. University of Kiel
Capacitated Lot-Sizing with Linked Production Quantities of Adjacent Periods Knut Haase University of Kiel Abstract: One of the most important tasks operations manager are confronted with is to determine
More informationA Duality-Based Relaxation and Decomposition Approach for Inventory Distribution Systems
A Duality-Based Relaxation and Decomposition Approach for Inventory Distribution Systems Sumit Kunnumkal, 1 Huseyin Topaloglu 2 1 Indian School of Business, Gachibowli, Hyderabad 500032, India 2 School
More informationA column generation approach to the discrete lot sizing and scheduling problem on parallel machines
A column generation approach to the discrete lot sizing and scheduling problem on parallel machines António J.S.T. Duarte and J.M.V. Valério de Carvalho Abstract In this work, we study the discrete lot
More informationDiscrete lot sizing and scheduling on parallel machines: description of a column generation approach
126 IO 2013 XVI Congresso da Associação Portuguesa de Investigação Operacional Discrete lot sizing and scheduling on parallel machines: description of a column generation approach António J.S.T. Duarte,
More informationAdaptive Dynamic Cost Updating Procedure for Solving Fixed Charge Network Flow Problems.
Adaptive Dynamic Cost Updating Procedure for Solving Fixed Charge Network Flow Problems. Artyom Nahapetyan, Panos Pardalos Center for Applied Optimization Industrial and Systems Engineering Department
More informationBilinear Programming: Applications in the Supply Chain Management
Bilinear Programming: Applications in the Supply Chain Management Artyom G. Nahapetyan Center for Applied Optimization Industrial and Systems Engineering Department University of Florida Gainesville, Florida
More informationCoordinated Replenishments at a Single Stocking Point
Chapter 11 Coordinated Replenishments at a Single Stocking Point 11.1 Advantages and Disadvantages of Coordination Advantages of Coordination 1. Savings on unit purchase costs.. Savings on unit transportation
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 information3.10 Lagrangian relaxation
3.10 Lagrangian relaxation Consider a generic ILP problem min {c t x : Ax b, Dx d, x Z n } with integer coefficients. Suppose Dx d are the complicating constraints. Often the linear relaxation and the
More informationIn the original knapsack problem, the value of the contents of the knapsack is maximized subject to a single capacity constraint, for example weight.
In the original knapsack problem, the value of the contents of the knapsack is maximized subject to a single capacity constraint, for example weight. In the multi-dimensional knapsack problem, additional
More information1 Production Planning with Time-Varying Demand
IEOR 4000: Production Management Columbia University Professor Guillermo Gallego 28 September 1 Production Planning with Time-Varying Demand In this lecture we present a few key results in production planning
More informationColumn Generation for Extended Formulations
1 / 28 Column Generation for Extended Formulations Ruslan Sadykov 1 François Vanderbeck 2,1 1 INRIA Bordeaux Sud-Ouest, France 2 University Bordeaux I, France ISMP 2012 Berlin, August 23 2 / 28 Contents
More information2007/87. Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs. Ayse Akbalik and Yves Pochet
2007/87 Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs Ayse Akbalik and Yves Pochet CORE DISCUSSION PAPER 2007/87 Valid inequalities for the single-item capacitated
More informationA Primal-Dual Algorithm for Computing a Cost Allocation in the. Core of Economic Lot-Sizing Games
1 2 A Primal-Dual Algorithm for Computing a Cost Allocation in the Core of Economic Lot-Sizing Games 3 Mohan Gopaladesikan Nelson A. Uhan Jikai Zou 4 October 2011 5 6 7 8 9 10 11 12 Abstract We consider
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 informationDesigning the Distribution Network for an Integrated Supply Chain
Designing the Distribution Network for an Integrated Supply Chain Jia Shu and Jie Sun Abstract We consider an integrated distribution network design problem in which all the retailers face uncertain demand.
More informationOrdering Policies for Periodic-Review Inventory Systems with Quantity-Dependent Fixed Costs
OPERATIONS RESEARCH Vol. 60, No. 4, July August 2012, pp. 785 796 ISSN 0030-364X (print) ISSN 1526-5463 (online) http://dx.doi.org/10.1287/opre.1110.1033 2012 INFORMS Ordering Policies for Periodic-Review
More informationOn the Polyhedral Structure of a Multi Item Production Planning Model with Setup Times
CORE DISCUSSION PAPER 2000/52 On the Polyhedral Structure of a Multi Item Production Planning Model with Setup Times Andrew J. Miller 1, George L. Nemhauser 2, and Martin W.P. Savelsbergh 2 November 2000
More informationIntroduction to Bin Packing Problems
Introduction to Bin Packing Problems Fabio Furini March 13, 2015 Outline Origins and applications Applications: Definition: Bin Packing Problem (BPP) Solution techniques for the BPP Heuristic Algorithms
More informationJOINT PRICING AND NETWORK CAPACITY SETTING PROBLEM
Advanced OR and AI Methods in Transportation JOINT PRICING AND NETWORK CAPACITY SETTING PROBLEM Luce BROTCORNE, Patrice MARCOTTE, Gilles SAVARD, Mickael WIART Abstract. We consider the problem of jointly
More informationElectronic Companion to Initial Shipment Decisions for New Products at Zara
e-companion to Gallien et al: Initial Shipment Decisions for New Products at Zara ec1 Electronic Companion to Initial Shipment Decisions for New Products at Zara This document includes appendices to Initial
More informationMulti level inventory management decisions with transportation cost consideration in fuzzy environment. W. Ritha, S.
Annals of Fuzzy Mathematics and Informatics Volume 2, No. 2, October 2011, pp. 171-181 ISSN 2093 9310 http://www.afmi.or.kr @FMI c Kyung Moon Sa Co. http://www.kyungmoon.com Multi level inventory management
More informationExtended Job Shop Scheduling by Object-Oriented. Optimization Technology
Extended Job Shop Scheduling by Object-Oriented Optimization Technology Minoru Kobayashi, Kenji Muramatsu Tokai University Address: 1117 Kitakaname, Hiratsuka, Kanagawa, 259-1292, Japan Telephone: +81-463-58-1211
More informationEXTENSIONS TO THE ECONOMIC LOT SIZING PROBLEM
EXTENSIONS TO THE ECONOMIC LOT SIZING PROBLEM By MEHMET ÖNAL A DISSERTATION PRESENTED TO THE GRADUATE SCHOOL OF THE UNIVERSITY OF FLORIDA IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR
More informationIBM Research Report. Stochasic Unit Committment Problem. Julio Goez Lehigh University. James Luedtke University of Wisconsin
RC24713 (W0812-119) December 23, 2008 Mathematics IBM Research Report Stochasic Unit Committment Problem Julio Goez Lehigh University James Luedtke University of Wisconsin Deepak Rajan IBM Research Division
More informationA Decomposition Approach for a Class of Capacitated Serial Systems 1
A Decomposition Approach for a Class of Capacitated Serial Systems 1 Ganesh Janakiraman 2 IOMS-OM Group Stern School of Business New York University 44 W. 4th Street, Room 8-71 New York, NY 10012-1126.
More informationA Branch-and-Cut Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem
Yongpei Guan 1 Shabbir Ahmed 1 George L. Nemhauser 1 Andrew J. Miller 2 A Branch-and-Cut Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem December 12, 2004 Abstract. This paper addresses a
More informationSTRC. A Lagrangian relaxation technique for the demandbased benefit maximization problem
A Lagrangian relaxation technique for the demandbased benefit maximization problem Meritxell Pacheco Paneque Bernard Gendron Virginie Lurkin Shadi Sharif Azadeh Michel Bierlaire Transport and Mobility
More informationOn the Approximate Linear Programming Approach for Network Revenue Management Problems
On the Approximate Linear Programming Approach for Network Revenue Management Problems Chaoxu Tong School of Operations Research and Information Engineering, Cornell University, Ithaca, New York 14853,
More informationLagrangian Relaxation in MIP
Lagrangian Relaxation in MIP Bernard Gendron May 28, 2016 Master Class on Decomposition, CPAIOR2016, Banff, Canada CIRRELT and Département d informatique et de recherche opérationnelle, Université de Montréal,
More informationA Bilinear Reduction Based Algorithm for Solving Capacitated Multi-Item Dynamic Pricing Problems.
A Bilinear Reduction Based Algorithm for Solving Capacitated Multi-Item Dynamic Pricing Problems. Artyom G. Nahapetyan, Panos M. Pardalos Center for Applied Optimization Industrial and Systems Engineering
More informationProgressive Hedging-Based Meta- Heuristics for Stochastic Network Design
Progressive Hedging-Based Meta- Heuristics for Stochastic Network Design Teodor Gabriel Crainic Xiaorui Fu Michel Gendreau Walter Rei Stein W. Wallace January 2009 1. 2. 3. 4. 5. Progressive Hedging-Based
More informationInteger Programming ISE 418. Lecture 8. Dr. Ted Ralphs
Integer Programming ISE 418 Lecture 8 Dr. Ted Ralphs ISE 418 Lecture 8 1 Reading for This Lecture Wolsey Chapter 2 Nemhauser and Wolsey Sections II.3.1, II.3.6, II.4.1, II.4.2, II.5.4 Duality for Mixed-Integer
More informationHeuristic approach for the integrated inventorydistribution
Heuristic approach for the integrated inventorydistribution problem Abstract We study the integrated inventory distribution problem. We consider an environment in which the demand of each customer is relatively
More informationDistributed Optimization. Song Chong EE, KAIST
Distributed Optimization Song Chong EE, KAIST songchong@kaist.edu Dynamic Programming for Path Planning A path-planning problem consists of a weighted directed graph with a set of n nodes N, directed links
More informationNetwork Flows. 6. Lagrangian Relaxation. Programming. Fall 2010 Instructor: Dr. Masoud Yaghini
In the name of God Network Flows 6. Lagrangian Relaxation 6.3 Lagrangian Relaxation and Integer Programming Fall 2010 Instructor: Dr. Masoud Yaghini Integer Programming Outline Branch-and-Bound Technique
More informationKybernetika. Terms of use: Persistent URL: Institute of Information Theory and Automation AS CR, 2012
Kybernetika Kjetil K. Haugen; Guillaume Lanquepin-Chesnais; Asmund Olstad A fast Lagrangian heuristic for large-scale capacitated lot-size problems with restricted cost structures Kybernetika, Vol. 48
More informationLagrangean relaxation
Lagrangean relaxation Giovanni Righini Corso di Complementi di Ricerca Operativa Joseph Louis de la Grange (Torino 1736 - Paris 1813) Relaxations Given a problem P, such as: minimize z P (x) s.t. x X P
More informationAN EOQ MODEL FOR TWO-WAREHOUSE WITH DETERIORATING ITEMS, PERIODIC TIME DEPENDENT DEMAND AND SHORTAGES
IJMS, Vol., No. 3-4, (July-December 0), pp. 379-39 Serials Publications ISSN: 097-754X AN EOQ MODEL FOR TWO-WAREHOUSE WITH DETERIORATING ITEMS, PERIODIC TIME DEPENDENT DEMAND AND SHORTAGES Karabi Dutta
More information1 Production Planning with Time-Varying Demand
IEOR 4000: Production Management Columbia University Professor Guillermo Gallego 28 September 1 Production Planning with Time-Varying Demand In this lecture we present a few key results in production planning
More information7.1 INTRODUCTION. In this era of extreme competition, each subsystem in different
7.1 INTRODUCTION In this era of extreme competition, each subsystem in different echelons of integrated model thrives to improve their operations, reduce costs and increase profitability. Currently, the
More informationPolynomial time algorithms for some multi-level lot-sizing problems with production capacities
Polynomial time algorithms for some multi-level lot-sizing problems with production capacities Stan van Hoesel, H. Edwin Romeijn, Dolores Romero Morales, Albert P.M. Wagelmans ERIM REPORT SERIES RESEARCH
More informationFaster Primal-Dual Algorithms for the Economic Lot-Sizing Problem
Acknowledgment: Thomas Magnanti, Retsef Levi Faster Primal-Dual Algorithms for the Economic Lot-Sizing Problem Dan Stratila RUTCOR and Rutgers Business School Rutgers University Mihai Pătraşcu AT&T Research
More informationA Horizon Decomposition approach for the Capacitated Lot-Sizing Problem with Setup Times
Submitted to INFORMS Journal on Computing manuscript (Please, provide the mansucript number!) A Horizon Decomposition approach for the Capacitated Lot-Sizing Problem with Setup Times Fragkos Ioannis Rotterdam
More informationAn Uncertain Bilevel Newsboy Model with a Budget Constraint
Journal of Uncertain Systems Vol.12, No.2, pp.83-9, 218 Online at: www.jus.org.uk An Uncertain Bilevel Newsboy Model with a Budget Constraint Chunliu Zhu, Faquan Qi, Jinwu Gao School of Information, Renmin
More informationThermal Unit Commitment Problem
Thermal Unit Commitment Problem Moshe Potsane, Luyanda Ndlovu, Simphiwe Simelane Christiana Obagbuwa, Jesal Kika, Nadine Padayachi, Luke O. Joel Lady Kokela, Michael Olusanya, Martins Arasomwa, Sunday
More informationThe network maintenance problem
22nd International Congress on Modelling and Simulation, Hobart, Tasmania, Australia, 3 to 8 December 2017 mssanz.org.au/modsim2017 The network maintenance problem Parisa Charkhgard a, Thomas Kalinowski
More informationIntroduction to optimization and operations research
Introduction to optimization and operations research David Pisinger, Fall 2002 1 Smoked ham (Chvatal 1.6, adapted from Greene et al. (1957)) A meat packing plant produces 480 hams, 400 pork bellies, and
More informationOptimal and Heuristic Echelon ( r, nq, T ) Policies in Serial Inventory Systems with Fixed Costs
OPERATIONS RESEARCH Vol. 58, No. 2, March April 2010, pp. 414 427 issn 0030-364X eissn 1526-5463 10 5802 0414 informs doi 10.1287/opre.1090.0734 2010 INFORMS Optimal and Heuristic Echelon ( r, nq, T )
More informationStabilization in Column Generation: numerical study
1 / 26 Stabilization in Column Generation: numerical study Artur Pessoa 3 Ruslan Sadykov 1,2 Eduardo Uchoa 3 François Vanderbeck 2,1 1 INRIA Bordeaux, France 2 Univ. Bordeaux I, France 3 Universidade Federal
More informationIntroduction to integer programming II
Introduction to integer programming II Martin Branda Charles University in Prague Faculty of Mathematics and Physics Department of Probability and Mathematical Statistics Computational Aspects of Optimization
More informationResearch Article A Partial Backlogging Inventory Model for Deteriorating Items with Fluctuating Selling Price and Purchasing Cost
Advances in Operations Research Volume 2012, Article ID 385371, 15 pages doi:10.1155/2012/385371 Research Article A Partial Backlogging Inventory Model for Deteriorating Items with Fluctuating Selling
More informationInterior-Point versus Simplex methods for Integer Programming Branch-and-Bound
Interior-Point versus Simplex methods for Integer Programming Branch-and-Bound Samir Elhedhli elhedhli@uwaterloo.ca Department of Management Sciences, University of Waterloo, Canada Page of 4 McMaster
More informationOperations Research Letters. Joint pricing and inventory management with deterministic demand and costly price adjustment
Operations Research Letters 40 (2012) 385 389 Contents lists available at SciVerse ScienceDirect Operations Research Letters journal homepage: www.elsevier.com/locate/orl Joint pricing and inventory management
More informationFacility Location and Distribution System Planning. Thomas L. Magnanti
Facility Location and Distribution System Planning Thomas L. Magnanti Today s Agenda Why study facility location? Issues to be modeled Basic models Fixed charge problems Core uncapacitated and capacitated
More informationTechnical Note: Capacity Expansion and Cost Efficiency Improvement in the Warehouse Problem. Abstract
Page 1 of 14 Naval Research Logistics Technical Note: Capacity Expansion and Cost Efficiency Improvement in the Warehouse Problem Majid Al-Gwaiz, Xiuli Chao, and H. Edwin Romeijn Abstract The warehouse
More informationPrimal-Dual Algorithms for Deterministic Inventory Problems
Primal-Dual Algorithms for Deterministic Inventory Problems Retsef Levi Robin Roundy David B. Shmoys Abstract We consider several classical models in deterministic inventory theory: the single-item lot-sizing
More informationOutline. Relaxation. Outline DMP204 SCHEDULING, TIMETABLING AND ROUTING. 1. Lagrangian Relaxation. Lecture 12 Single Machine Models, Column Generation
Outline DMP204 SCHEDULING, TIMETABLING AND ROUTING 1. Lagrangian Relaxation Lecture 12 Single Machine Models, Column Generation 2. Dantzig-Wolfe Decomposition Dantzig-Wolfe Decomposition Delayed Column
More informationAn Optimization Framework for Solving Capacitated Multi-level Lot-sizing Problems with Backlogging
Submitted to manuscript (Please, provide the mansucript number!) An Optimization Framework for Solving Capacitated Multi-level Lot-sizing Problems with Backlogging Tao Wu, Leyuan Shi, Joseph Geunes, Kerem
More informationDYNAMIC LECTURE 5: DISCRETE TIME INTERTEMPORAL OPTIMIZATION
DYNAMIC LECTURE 5: DISCRETE TIME INTERTEMPORAL OPTIMIZATION UNIVERSITY OF MARYLAND: ECON 600. Alternative Methods of Discrete Time Intertemporal Optimization We will start by solving a discrete time intertemporal
More informationSolving Dual Problems
Lecture 20 Solving Dual Problems We consider a constrained problem where, in addition to the constraint set X, there are also inequality and linear equality constraints. Specifically the minimization problem
More informationA Shadow Simplex Method for Infinite Linear Programs
A Shadow Simplex Method for Infinite Linear Programs Archis Ghate The University of Washington Seattle, WA 98195 Dushyant Sharma The University of Michigan Ann Arbor, MI 48109 May 25, 2009 Robert L. Smith
More informationSection Notes 9. Midterm 2 Review. Applied Math / Engineering Sciences 121. Week of December 3, 2018
Section Notes 9 Midterm 2 Review Applied Math / Engineering Sciences 121 Week of December 3, 2018 The following list of topics is an overview of the material that was covered in the lectures and sections
More informationThe Dual Simplex Algorithm
p. 1 The Dual Simplex Algorithm Primal optimal (dual feasible) and primal feasible (dual optimal) bases The dual simplex tableau, dual optimality and the dual pivot rules Classical applications of linear
More informationOn service level measures in stochastic inventory control
On service level measures in stochastic inventory control Dr. Roberto Rossi The University of Edinburgh Business School, The University of Edinburgh, UK roberto.rossi@ed.ac.uk Friday, June the 21th, 2013
More informationThe Inventory-Routing Problem with Transshipment
The Inventory-Routing Problem with Transshipment Leandro Callegari Coelho Jean-François Cordeau Gilbert Laporte March 2011 CIRRELT-2011-21 Bureaux de Montréal : Bureaux de Québec : Université de Montréal
More information3.4 Relaxations and bounds
3.4 Relaxations and bounds Consider a generic Discrete Optimization problem z = min{c(x) : x X} with an optimal solution x X. In general, the algorithms generate not only a decreasing sequence of upper
More informationMulti-item lot-sizing with joint set-up costs
Math. Program., Ser. A (2009) 119:79 94 DOI 10.1007/s10107-007-0202-9 FULL LENGTH PAPER Multi-item lot-sizing with joint set-up costs Shoshana Anily Michal Tzur Laurence A. Wolsey Received: 1 May 2007
More informationA Capacity Scaling Procedure for the Multi-Commodity Capacitated Network Design Problem. Ryutsu Keizai University Naoto KATAYAMA
A Capacity Scaling Procedure for the Multi-Commodity Capacitated Network Design Problem Ryutsu Keizai University Naoto KATAYAMA Problems 2006 1 Multi-Commodity Network Design Problem The basic model for
More informationLecture 6: Discrete-Time Dynamic Optimization
Lecture 6: Discrete-Time Dynamic Optimization Yulei Luo Economics, HKU November 13, 2017 Luo, Y. (Economics, HKU) ECON0703: ME November 13, 2017 1 / 43 The Nature of Optimal Control In static optimization,
More informationBranch and Price for Hub Location Problems with Single Assignment
Branch and Price for Hub Location Problems with Single Assignment Ivan Contreras 1, Elena Fernández 2 1 Concordia University and CIRRELT, Montreal, Canada 2 Technical University of Catalonia, Barcelona,
More informationJOINT PRICING AND PRODUCTION PLANNING FOR FIXED PRICED MULTIPLE PRODUCTS WITH BACKORDERS. Lou Caccetta and Elham Mardaneh
JOURNAL OF INDUSTRIAL AND doi:10.3934/jimo.2010.6.123 MANAGEMENT OPTIMIZATION Volume 6, Number 1, February 2010 pp. 123 147 JOINT PRICING AND PRODUCTION PLANNING FOR FIXED PRICED MULTIPLE PRODUCTS WITH
More informationECON 582: Dynamic Programming (Chapter 6, Acemoglu) Instructor: Dmytro Hryshko
ECON 582: Dynamic Programming (Chapter 6, Acemoglu) Instructor: Dmytro Hryshko Indirect Utility Recall: static consumer theory; J goods, p j is the price of good j (j = 1; : : : ; J), c j is consumption
More informationResearch Article Dynamic Programming and Heuristic for Stochastic Uncapacitated Lot-Sizing Problems with Incremental Quantity Discount
Mathematical Problems in Engineering Volume 2012, Article ID 582323, 21 pages doi:10.1155/2012/582323 Research Article Dynamic Programming and Heuristic for Stochastic Uncapacitated Lot-Sizing Problems
More informationLagrange Relaxation: Introduction and Applications
1 / 23 Lagrange Relaxation: Introduction and Applications Operations Research Anthony Papavasiliou 2 / 23 Contents 1 Context 2 Applications Application in Stochastic Programming Unit Commitment 3 / 23
More informationPrimal-Dual Algorithms for Deterministic Inventory Problems
Primal-Dual Algorithms for Deterministic Inventory Problems Retsef Levi Robin Roundy David B. Shmoys Abstract We consider several classical models in deterministic inventory theory: the single-item lot-sizing
More informationAn Integrated Column Generation and Lagrangian Relaxation for Flowshop Scheduling Problems
Proceedings of the 2009 IEEE International Conference on Systems, Man, and Cybernetics San Antonio, TX, USA - October 2009 An Integrated Column Generation and Lagrangian Relaxation for Flowshop Scheduling
More informationOptimal stock allocation in single echelon inventory systems subject to a service constraint
Abstract number: 011-0137 Optimal stock allocation in single echelon inventory systems subject to a service constraint Annalisa Cesaro Dario Pacciarelli Dipartimento di Informatica e Automazione, Università
More informationA Note on Ending Inventory Valuation in Multiperiod. Production Scheduling
A Note on Ending Inventory Valuation in Multiperiod Production Scheduling Wilco van den Heuvel Albert P.M. Wagelmans 1 Econometric Institute Report EI 2002-25 Econometric Institute, Erasmus University
More informationMotivation. Lecture 2 Topics from Optimization and Duality. network utility maximization (NUM) problem:
CDS270 Maryam Fazel Lecture 2 Topics from Optimization and Duality Motivation network utility maximization (NUM) problem: consider a network with S sources (users), each sending one flow at rate x s, through
More informationPolynomial Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
Polynomial Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems Yongpei Guan School of Industrial Engineering, University of Oklahoma, Norman, OK 73019, U.S.A, yguan@ou.edu Andrew J. Miller
More informationA LAGRANGIAN RELAXATION FOR CAPACITATED SINGLE ALLOCATION P-HUB MEDIAN PROBLEM WITH MULTIPLE CAPACITY LEVELS
A LAGRANGIAN RELAXATION FOR CAPACITATED SINGLE ALLOCATION P-HUB MEDIAN PROBLEM WITH MULTIPLE CAPACITY LEVELS Ching-Jung Ting Department of Industrial Engineering and Management, Yuan Ze University Kuo-Rui
More informationSolving Multi-Item Capacitated Lot-Sizing Problems with Setup Times by Branch-and-Cut 1
Solving Multi-Item Capacitated Lot-Sizing Problems with Setup Times by Branch-and-Cut 1 Andrew J. Miller CORE Voie du Roman Pays, 34 B-1348 Louvain la Neuve Belgium George L. Nemhauser Martin W.P. Savelsbergh
More informationTime Aggregation for Network Design to Meet Time-Constrained Demand
20th International Congress on Modelling and Simulation, Adelaide, Australia, 1 6 December 2013 www.mssanz.org.au/modsim2013 Time Aggregation for Network Design to Meet Time-Constrained Demand N. Boland
More informationNew Bounds for the Joint Replenishment Problem: Tighter, but not always better
New Bounds for the Joint Replenishment Problem: ighter, but not always better Eric Porras, Rommert Dekker Econometric Institute, inbergen Institute, Erasmus University Rotterdam, P.O. Box 738, 3000 DR
More informationA Simplified Lagrangian Method for the Solution of Non-linear Programming Problem
Chapter 7 A Simplified Lagrangian Method for the Solution of Non-linear Programming Problem 7.1 Introduction The mathematical modelling for various real world problems are formulated as nonlinear programming
More informationABCβ A Heuristic for Dynamic Capacitated Lot Sizing with Random Demand under a Fillrate Constraint
ABCβ A Heuristic for Dynamic Capacitated Lot Sizing with Random Demand under a Fillrate Constraint Horst Tempelmeier, Sascha Herpers To cite this version: Horst Tempelmeier, Sascha Herpers. ABCβ A Heuristic
More informationNotes on Dantzig-Wolfe decomposition and column generation
Notes on Dantzig-Wolfe decomposition and column generation Mette Gamst November 11, 2010 1 Introduction This note introduces an exact solution method for mathematical programming problems. The method is
More informationThe L-Shaped Method. Operations Research. Anthony Papavasiliou 1 / 44
1 / 44 The L-Shaped Method Operations Research Anthony Papavasiliou Contents 2 / 44 1 The L-Shaped Method [ 5.1 of BL] 2 Optimality Cuts [ 5.1a of BL] 3 Feasibility Cuts [ 5.1b of BL] 4 Proof of Convergence
More informationA Class of Random Algorithms for Inventory Cycle Offsetting
A Class of Random Algorithms for Inventory Cycle Offsetting Ernest Croot Department of Mathematics Georgia Institute of Technology Atlanta, GA 30332, U.S.A. ecroot@math.gatech.edu Kai Huang School of Management
More informationCONSTRAINED OPTIMALITY CRITERIA
5 CONSTRAINED OPTIMALITY CRITERIA In Chapters 2 and 3, we discussed the necessary and sufficient optimality criteria for unconstrained optimization problems. But most engineering problems involve optimization
More informationKNAPSACK PROBLEMS WITH SETUPS
7 e Conférence Francophone de MOdélisation et SIMulation - MOSIM 08 - du 31 mars au 2 avril 2008 - Paris - France Modélisation, Optimisation et Simulation des Systèmes : Communication, Coopération et Coordination
More informationOn solving the multi-period location-assignment problem under uncertainty
On solving the multi-period location-assignment problem under uncertainty María Albareda-Sambola 2 Antonio Alonso-Ayuso Laureano Escudero Elena Fernández 2 Celeste Pizarro Romero. Departamento de Estadística
More informationThe Stochastic Economic Lot Sizing Problem for Continuous Multi-Grade Production
STOCHASTIC MODELS OF MANUFACTURING AND SERVICE OPERATIONS SMMSO 2009 The Stochastic Economic Lot Sizing Problem for Continuous Multi-Grade Production George Liberopoulos, Dimitrios Pandelis and Olympia
More informationApproximate Dynamic Programming Methods for an Inventory Allocation Problem under Uncertainty
Approximate Dynamic Programming Methods for an Inventory Allocation Problem under Uncertainty Huseyin Topaloglu, Sumit Kunnumkal September 7, 2005 Abstract In this paper, we propose two approximate dynamic
More informationDecomposition-based Methods for Large-scale Discrete Optimization p.1
Decomposition-based Methods for Large-scale Discrete Optimization Matthew V Galati Ted K Ralphs Department of Industrial and Systems Engineering Lehigh University, Bethlehem, PA, USA Départment de Mathématiques
More information