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 41 for “"Benders' Decomposition"”.
-
Accelerating Benders decomposition for network design.
Thesis. 1978. Ph.D.--Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
-
Decomposition algorithms for global solution of deterministic and stochastic pooling problems in natural gas value chains
In this thesis, a Benders decomposition algorithm is designed and implemented to solve both deterministic and stochastic pooling problems to global optimality. Convergence of the algorithm to a global optimum is proved and then it is implemented both in GAMS and C++ to get the best performance. A …
-
Decomposition techniques for large-scale optimization in the supply chain
… problem lends itself well to application of decomposition techniques intended to speed up solution time. Exact techniques, such as Benders decomposition, are explored as a baseline. Classical Benders decomposition is applied to the manufacturing plant model, and results indicate that Benders …
-
Robust Inventory Induction under Demand Uncertainty
… the local and daily level. We develop a Benders decomposition algorithm, iterating between a lower-bounding master problem and an upper-bounding subproblem. We accelerate the Quadratically Constrained Quadratic Problem (QCQP) subproblem with primal heuristics and dual-bounding …
-
Renewable energy in electric utility capacity planning: a decomposition approach with application to a Mexican utility
… two algorithms, based on a Lagrangian Dual decomposition and a Generalized Benders Decomposition, are developed. The Lagrangian Dual formulation results in a subproblem which can be separated into single-year plantmix problems that are easily solved using a breakeven analysis. The …
-
A mathematical programming based model and algorithm for a two stage production process
… algorithm is based on Lagrangian Relaxation and Benders' decomposition techniques, which exploit the inherent generalized assignment and travelling salesman problem substructures in the model. The algorithm is computationally intensive and generates (near) optimal solutions with a reasonable …
-
Structural analysis of combinatorial optimization problem characteristics and their resolution using hybrid approaches
… tools and Algorithm Portfolios and Logic Based Benders Decomposition as integration and hybridization frameworks.
-
Electric utility capacity expansion planning with the option of investing in solar energy
… are established which lead to an efficient decomposition process using a Newton-type search method. For the capacity expansion planning problem, a modification of Benders' Decomposition is applied, which breaks up the problem into a master program containing the solar decision variable, and …
-
A location-allocation model and algorithm for optimally locating shelters to minimize evacuation times
… enumeration algorithms based on the generalized Benders' decomposition method are presented. The algorithms are designed to exploit the inherent problem structure. Computational experience is provided against a set of realistic test problems formulated on the Virginia Beach network. Potential …
-
Integrated Scheduling and Material Handling: Theory and Applications in Manufacturing Systems
… an exact solution approach based on logic-based Benders decomposition. Third, it extends integrated models to a buffer-constrained flow shop setting with mobile buffering, introducing a decomposition-based algorithm that significantly improves scalability. Together, these contributions advance …
-
Applications of Optimization and Machine Learning in Assortment Optimization and Revenue Management
… programming formulation and an accelerated Benders decomposition method that substantially reduces computation times in large-scale problems. The second chapter develops a sales-aware product embedding model trained using publicly observable Amazon review dynamics. By focusing on relative …
-
Large-scale optimization for green logistics and stochastic resource allocation for food security
… four dimensions in food supply chains 1) Benders decomposition for the inventory vehicle routing problem with perishable products and environmental costs. We consider the problem of inventory routing in the context of perishable products and find near-optimal replenishment scheduling and …
-
Modeling and Analysis of a Feedstock Logistics Problem
… and we solve them either through the use of decomposition-based methods or directly through the use of CPLEX 12.1.0. The feedstock logistics problem that we address spans the entire system-from the growing of switchgrass to the transporting of bio-crude oil, a high energy density intermediate …
-
Enhancing network robustness via shielding
… the connectivity of the entire network, and use Benders decomposition to significantly reduce the running time by exploiting its partial separable structure. We extend the algorithms to guarantee partial network connectivity, and observe that significantly less shielding is required, especially …
-
Toward Microtransit: Design and Operations of Reservation-based Systems
… microtransit planning and operations. We develop decomposition algorithms to achieve insights at scale, and we evaluate new decision-making prototypes for transportation planners over case studies based on real-world data. We examine how these new microtransit technologies enable widespread …
-
Studies of Complex Routing Problems with Synchronization and Stochastic Information
… (HetPRP) outperforms our customized Benders decomposition approach, achieving average optimality gaps of 0.11%–0.97% on benchmark instances with up to 50 retailers and nine periods. We further quantify the value of stochastic solutions — up to 5.23% in non-urban settings — and show …
-
System Flexibility and AI Computational Enhancement for Day-Ahead Power System Operations
… technique is shown by utilizing benders decomposition by breaking a large SCUC model into master problem and sub-problems. The proposed approach is iteratively solved by effectively screening non-critical sub-problems to handle the computational complexity. Simulation results …
-
Risk Assessment and Optimal Response Strategies for Resilience of Electric Power Infrastructure to Extreme Weather
… three solution approaches based on L-shaped Benders decomposition. These approaches incorporate the network structure and power flow constraints to derive more effective Benders cuts. We evaluate the scalability of these approaches on benchmark networks, and show that they are useful in …
-
Large-scale analytics and optimization in urban transportation : improving public transit and its integration with vehicle-sharing services
… overall travel time over the integrated network. Benders decomposition is used to tackle large instances. While a tight formulation generally generates stronger Benders cuts, it requires a large number of variables and constraints, and hence, more computational effort. We propose new algorithms …
-
Modeling, Analysis, and Algorithms for Some Supply Chain Logistics Optimization Problems
… storage facilities. We develop an efficient Benders decomposition-based algorithm, and also, two heuristic methods that are capable of effectively solving large-scale instances. We also show the advantage of using mobile equipment.
Page 1 of 3