Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 40 for “"Dantzig-Wolfe decomposition"”.
-
Distributed optimization of linear programs using Dantzig-Wolfe decomposition
… computers. Our approach is based on the Dantzig-Wolfe decomposition algorithm. In a Dantzig-Wolfe decomposition, a block-angular linear program with R blocks is decomposed into R+1 semi-autonomous processes. One of them is the coordinating process which generates prices, and the remaining …
-
Documentation of decomp: A dantzig-wolfe decomposition code for linear programming
… of DECOMP, an implementation of the Dantzig-Wolfe decomposition algorithm for solving block angular linear programming problems based on the scheme of Ho and Loute (1981).</p> <p>We first present the specifications that must be met by any robust implementation of linear programming …
-
Algorithms for the Bi-objective Multi-commodity Minimum Cost Flow Problem
… algorithm for solving the problem by integrating Dantzig-Wolfe decomposition in the iterations of the bi-objective simplex algorithm. Our algorithm is the rst application of Dantzig-Wolfe decomposition to multi-objective network ow problems. The algorithm solves the problem by reformulating it as …
-
Decomposition Methods in Column Generation and Data-Driven Stochastic Optimization
… stochastic optimization and the related Dantzig-Wolfe decomposition. We start with a deterministic setting, where we consider linear programs with a block-structure, but data cannot be stored centrally due to privacy concerns or decentralized storage of large datasets. The larger portion …
-
A branch-and-price algorith, for a compressor scheduling problem
… a column generation approach based on the Dantzig-Wolfe decomposition, which achieves tighter lower bounds than the straightforward linear relaxation of the piecewise-linear formulation. The column generation was embedded in a branch-and-price algorithm and further compared with CPLEX, …
-
The vehicle routing problem with release and due dates: formulations, heuristics and lower bounds
… formulations, efficient heuristics, and a Dantzig-Wolfe decomposition and associated column generation algorithm. <br/><br/>The MIP formulations extend commodity flow formulations of the capacitated vehicle routing problem, and are generally related by aggregation or disaggregation of the …
-
Novel formulation and decomposition-based optimization for strategic supply chain management under uncertainty
… the decomposable structure of the formulation, Dantzig-Wolfe decomposition is studied in the thesis. Two approaches to implement Dantzig-Wolfe decomposition are developed, and both approaches involve the solution of a sequence of linear programming (LP) and mixed-integer linear programming …
-
DATA DRIVEN ALGORITHMS AND DISTRIBUTED COMPUTING FOR AUTOMATIC MIP DECOMPOSITIONS
… research question, that is how to exploit Dantzig-Wolfe decomposition methods for generic Mixed Integer Programs (MIP). In the first part of the thesis, we research how to obtain such decompositions in an automatic fashion. We investigate, with machine learning tools, the link between …
-
Capacitated scheduling in multistage production systems
… but highly structured linear program.</p> <p>A Dantzig-Wolfe decomposition algorithm is developed to solve the model. The capacity constraints of the model are used to define the master problem and the flow balance constraints are used to define one or more subproblems.</p> <p>The constraint …
-
Branch-and-price and multicommodity flows
… in reformulating an original model, using the Dantzig-Wolfe decomposition principle, and then combining column generation with branch-and-bound (branch-and-price) in order to obtain optimal solutions. The main issue when developing a branch-and-price algorithm is the branching scheme. The …
-
Revenue-based maintenance scheduling for wind turbines
… were studied. One of these, the so-called Dantzig–Wolfe decomposition, was formulated explicitly for both models and implemented for the in–house model. The result from a run time analysis showed that this method effectively reduces run time for a number of maintenance scheduling cases and …
-
Home therapist network modeling
… been developed that include two heuristics and a decomposition algorithm. The first approach is a parallel GRASP that assigns patients to multiple routes in a series of rounds. During the first round, the procedure optimizes the patient distribution among the available therapists, thus trying to …
-
Empirical Analysis of Algorithms for Block-Angular Linear Programs
… complexity and empirical performance of decomposition algorithms. We focus on linear programs with a block-angular structure. Decomposition algorithms used to be the only way to solve large-scale special structured problems, in terms of memory limit and CPU time. However, with the …
-
A Distributed Linear Programming Model in a Smart Grid
… and test a resource-allocation process through a decomposition principle in a Smart grid. I have implemented and tested the Dantzig-Wolfe decomposition process in standard IEEE 14-bus and 30-bus systems. The dissertation provides details about how to formulate, implement, and test such an LP-based …
-
A branch, price, and cut approach to solving the maximum weighted independent set problem
… I look at vertex- and edge-disjoint decompositions of the underlying graph. MWISPâÂÂs on the resulting subgraphs are less challenging, on average, to solve. I use the B&P framework to solve MWISP on the original graph G using these specially constructed subproblems to generate …
-
Distributed solution techniques to regulate the load consumption of a residential neighborhood
… approach, while the second utilizes a Dantzig-Wolfe decomposition technique to solve the problem in a distributed manner. Our research demonstrates the effectiveness of our distributed solution strategies in solving the formulated problem within a simulated environment, compared to a …
-
Optimal Design of Filterless Optical Networks
… a one step solution scheme, which combines tree decomposition and network provisioning, i.e.,routing and wavelength assignment within a single mathematical model, called CG_FOP. We propose a decomposition with two different sub-problems, which are solved alternately, in order to design an exact …
-
Integrated location and routing problems: Models, algorithms and applications
… the mixed-integer linear model using Dantzig-Wolfe decomposition. An extensive computational evaluation shows that our heuristic outperforms CPLEX on the most challenging instances, in both solution quality and required CPU time. In the second problem, we consider an application in …
-
New Rigorous Decomposition Methods for Mixed-integer Linear and Nonlinear Programming
… thesis proposes a new finitely convergent cross decomposition method (CD), where Benders decomposition (BD) and Dantzig-Wolfe decomposition (DWD) are combined in a unified framework to improve the solution of scenario based two-stage stochastic MILPs. This method alternates between DWD iterations …
-
Barge Prioritization, Assignment, and Scheduling During Inland Waterway Disruption Responses
… to solve the CPTAP. The first approach is a decomposition based sequential heuristic (DBSH) that reduces the time to obtain a response solution by decomposing the CPTAP into separate cargo prioritization, assignment, and scheduling subproblems. The DBSH integrates the Analytic Hierarchy …
Page 1 of 2