104 research outputs found
A New Dantzig-Wolfe Reformulation And Branch-And-Price Algorithm For The Capacitated Lot Sizing Problem With Set Up Times
The textbook Dantzig-Wolfe decomposition for the Capacitated LotSizing Problem (CLSP),as already proposed by Manne in 1958, has animportant structural deficiency. Imposingintegrality constraints onthe variables in the full blown master will not necessarily givetheoptimal IP solution as only production plans which satisfy theWagner-Whitin condition canbe selected. It is well known that theoptimal solution to a capacitated lot sizing problem willnotnecessarily have this Wagner-Whitin property. The columns of thetraditionaldecomposition model include both the integer set up andcontinuous production quantitydecisions. Choosing a specific set upschedule implies also taking the associated Wagner-Whitin productionquantities. We propose the correct Dantzig-Wolfedecompositionreformulation separating the set up and productiondecisions. This formulation gives the samelower bound as Manne'sreformulation and allows for branch-and-price. We use theCapacitatedLot Sizing Problem with Set Up Times to illustrate our approach.Computationalexperiments are presented on data sets available from theliterature. Column generation isspeeded up by a combination of simplexand subgradient optimization for finding the dualprices. The resultsshow that branch-and-price is computationally tractable andcompetitivewith other approaches. Finally, we briefly discuss how thisnew Dantzig-Wolfe reformulationcan be generalized to other mixedinteger programming problems, whereas in theliterature,branch-and-price algorithms are almost exclusivelydeveloped for pure integer programmingproblems.branch-and-price;Lagrange relaxation;Dantzig-Wolfe decomposition;lot sizing;mixed-integer programming
Improved Lower Bounds For The Capacitated Lot Sizing Problem With Set Up Times
We present new lower bounds for the Capacitated Lot Sizing Problem with Set Up Times. We improve the lower bound obtained by the textbook Dantzig-Wolfe decomposition where the capacity constraints are the linking constraints. In our approach, Dantzig-Wolfe decomposition is applied to the network reformulation of the problem. The demand constraints are the linking constraints and the problem decomposes into subproblems per period containing the capacity and set up constraints. We propose a customized branch-and-bound algorithm for solving the subproblem based on its similarities with the Linear Multiple Choice Knapsack Problem. Further we present a Lagrange Relaxation algorithm for finding this lower bound. To the best of our knowledge, this is the first time that computational results are presented for this decomposition and a comparison of our lower bound to other lower bounds proposed in the literature indicates its high quality.Lagrange relaxation;Dantzig-Wolfe decomposition;capacitated lot sizing;lower bounds
A New Dantzig-Wolfe Reformulation And Branch-And-Price Algorithm For The Capacitated Lot Sizing Problem With Set Up Times
The textbook Dantzig-Wolfe decomposition for the Capacitated Lot
Sizing Problem (CLSP),as already proposed by Manne in 1958, has an
important structural deficiency. Imposingintegrality constraints on
the variables in the full blown master will not necessarily give
theoptimal IP solution as only production plans which satisfy the
Wagner-Whitin condition canbe selected. It is well known that the
optimal solution to a capacitated lot sizing problem willnot
necessarily have this Wagner-Whitin property. The columns of the
traditionaldecomposition model include both the integer set up and
continuous production quantitydecisions. Choosing a specific set up
schedule implies also taking the associated Wagner-Whitin production
quantities. We propose the correct Dantzig-Wolfe
decompositionreformulation separating the set up and production
decisions. This formulation gives the samelower bound as Manne's
reformulation and allows for branch-and-price. We use theCapacitated
Lot Sizing Problem with Set Up Times to illustrate our approach.
Computationalexperiments are presented on data sets available from the
literature. Column generation isspeeded up by a combination of simplex
and subgradient optimization for finding the dualprices. The results
show that branch-and-price is computationally tractable and
competitivewith other approaches. Finally, we briefly discuss how this
new Dantzig-Wolfe reformulationcan be generalized to other mixed
integer programming problems, whereas in the
literature,branch-and-price algorithms are almost exclusively
developed for pure integer programmingproblems
Meta-Heuristics for Dynamic Lot Sizing: a review and comparison of solution approaches
Proofs from complexity theory as well as computational experiments indicate that most lot sizing problems are hard to solve. Because these problems are so difficult, various solution techniques have been proposed to solve them. In the past decade, meta-heuristics such as tabu search, genetic algorithms and simulated annealing, have become popular and efficient tools for solving hard combinational optimization problems. We review the various meta-heuristics that have been specifically developed to solve lot sizing problems, discussing their main components such as representation, evaluation neighborhood definition and genetic operators. Further, we briefly review other solution approaches, such as dynamic programming, cutting planes, Dantzig-Wolfe decomposition, Lagrange relaxation and dedicated heuristics. This allows us to compare these techniques. Understanding their respective advantages and disadvantages gives insight into how we can integrate elements from several solution approaches into more powerful hybrid algorithms. Finally, we discuss general guidelines for computational experiments and illustrate these with several examples
Multi-item capacitated lot-sizing problems with setup times and pricing decisions
We study a multi-item capacitated lot-sizing problem with setup times and pricing (CLSTP) over a finite and discrete planning horizon. In this class of problems, the demand for each independent item in each time period is affected by pricing decisions. The corresponding demands are then satisfied through production in a single capacitated facility or from inventory, and the goal is to set prices and determine a production plan that maximizes total profit. In contrast with many traditional lot-sizing problems with fixed demands, we cannot, without loss of generality, restrict ourselves to instances without initial inventories, which greatly complicates the analysis of the CLSTP. We develop two alternative Dantzig–Wolfe decomposition formulations of the problem, and propose to solve their relaxations using column generation and the overall problem using branch-and-price. The associated pricing problem is studied under both dynamic and static pricing strategies. Through a computational study, we analyze both the efficacy of our algorithms and the benefits of allowing item prices to vary over time. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/65027/1/20394_ftp.pd
Improved Lower Bounds For The Capacitated Lot Sizing Problem With Set Up Times
We present new lower bounds for the Capacitated Lot Sizing Problem with Set Up Times. We improve the lower bound obtained by the textbook Dantzig-Wolfe decomposition where the capacity constraints are the linking constraints. In our approach, Dantzig-Wolfe decomposition is applied to the network reformulation of the problem. The demand constraints are the linking constraints and the problem decomposes into subproblems per period containing the capacity and set up constraints. We propose a customized branch-and-bound algorithm for solving the subproblem based on its similarities with the Linear Multiple Choice Knapsack Problem. Further we present a Lagrange Relaxation algorithm for finding this lower bound. To the best of our knowledge, this is the first time that computational results are presented for this decomposition and a comparison of our lower bound to other lower bounds proposed in the literature indicates its high quality
Improvement to an existing multi-level capacitated lot sizing problem considering setup carryover, backlogging, and emission control
This paper presents a multi-level, multi-item, multi-period capacitated lot-sizing problem. The lot-sizing problem studies can obtain production quantities, setup decisions and inventory levels in each period fulfilling the demand requirements with limited capacity resources, considering the Bill of Material (BOM) structure while simultaneously minimizing the production, inventory, and machine setup costs. The paper proposes an exact solution to Chowdhury et al. (2018)\u27s[1] developed model, which considers the backlogging cost, setup carryover & greenhouse gas emission control to its model complexity. The problem contemplates the Dantzig-Wolfe (D.W.) decomposition to decompose the multi-level capacitated problem into a single-item uncapacitated lot-sizing sub-problem. To avoid the infeasibilities of the weighted problem (WP), an artificial variable is introduced, and the Big-M method is employed in the D.W. decomposition to produce an always feasible master problem. In addition, Wagner & Whitin\u27s[2] forward recursion algorithm is also incorporated in the solution approach for both end and component items to provide the minimum cost production plan. Introducing artificial variables in the D.W. decomposition method is a novel approach to solving the MLCLSP model. A better performance was achieved regarding reduced computational time (reduced by 50%) and optimality gap (reduced by 97.3%) in comparison to Chowdhury et al. (2018)\u27s[1] developed model
Combining Column Generation and Lagrangian Relaxation
Although the possibility to combine column generation and Lagrangian relaxation has been known for quite some time, it has only recently been exploited in algorithms. In this paper, we discuss ways of combining these techniques. We focus on solving the LP relaxation of the Dantzig-Wolfe master problem. In a first approach we apply Lagrangian relaxation directly to this extended formulation, i.e. no simplex method is used. In a second one, we use Lagrangian relaxation to generate new columns, that is Lagrangian relaxation is applied to the compact for-mulation. We will illustrate the ideas behind these algorithms with an application in Lot-sizing. To show the wide applicability of these techniques, we also discuss applications in integrated vehicle and crew scheduling, plant location and cutting stock problems.column generation;Lagrangean relaxation;cutting stock problem;lotsizing;vehicle and crew scheduling
Combining Column Generation and Lagrangian Relaxation
Although the possibility to combine column generation and Lagrangian relaxation has been known for quite some time, it has only recently been exploited in algorithms. In this paper, we discuss ways of combining these techniques. We focus on solving the LP relaxation of the Dantzig-Wolfe master problem. In a first approach we apply Lagrangian relaxation directly to this extended formulation, i.e. no simplex method is used. In a second one, we use Lagrangian relaxation to generate new columns, that is Lagrangian relaxation is applied to the compact for-mulation. We will illustrate the ideas behind these algorithms with an application in Lot-sizing. To show the wide applicability of these techniques, we also discuss applications in integrated vehicle and crew scheduling, plant location and cutting stock problems
Large-Scale Optimisation in Operations Management: Algorithms and Applications
The main contributions of this dissertation are the design, development and application of optimisation methodology, models and algorithms for large-scale problems arising in Operations Management. The first chapter introduces constraint transformations and valid inequalities that enhance the performance of column generation and Lagrange relaxation. I establish theoretical connections with dual-space reduction techniques and develop a novel algorithm that combines Lagrange relaxation and column generation. This algorithm is embedded in a branch-and-price scheme, which combines large neighbourhood and local search to generate upper bounds. Computational experiments on capacitated lot sizing show significant improvements over existing methodologies. The second chapter introduces a Horizon-Decomposition approach that partitions the problem horizon in contiguous intervals. In this way, subproblems identical to the original problem but of smaller size are created. The size of the master problem and the subproblems are regulated via two scalar parameters, giving rise to a family of reformulations. I investigate the efficiency of alternative parameter configurations empirically. Computational experiments on capacitated lot sizing demonstrate superior performance against commercial solvers. Finally, extensions to generic mathematical programs are presented. The final chapter shows how large-scale optimisation methods can be applied to complex operational problems, and presents a modelling framework for scheduling the transhipment operations of the Noble Group, a global supply chain manager of energy products. I focus on coal operations, where coal is transported from mines to vessels using barges and floating cranes. Noble pay millions of dollars in penalties for delays, and for additional resources hired to minimize the impact of delays. A combination of column generation and dedicated heuristics reduces the cost of penalties and additional resources, and improves the efficiency of the operations. Noble currently use the developed framework, and report significant savings attributed to it
- …