Sökning: "Bender’s decomposition"
Hittade 5 uppsatser innehållade orden Bender’s decomposition.
1. Using maximal feasible subset of constraints to accelerate a logic-based Benders decomposition scheme for a multiprocessor scheduling problem
Master-uppsats, Linköpings universitet/Tillämpad matematik; Linköpings universitet/Tekniska fakultetenSammanfattning : Logic-based Benders decomposition (LBBD) is a strategy for solving discrete optimisation problems. In LBBD, the optimisation problem is divided into a master problem and a subproblem and each part is solved separately. LÄS MER
2. Scheduling of an underground mine by combining logic based Benders decomposition and a constructive heuristic
Master-uppsats, Linköpings universitet/Tillämpad matematik; Linköpings universitet/Tekniska fakultetenSammanfattning : Underground mining is a complex operation that requires careful planning. The short-term scheduling, which is the scheduling of the tasks involved in the excavation process, is an important part of the planning process. LÄS MER
3. Stochastic Investment in Power System Flexibility:A Benders Decomposition Approach
Master-uppsats, KTH/Skolan för elektro- och systemteknik (EES)Sammanfattning : The e_cient use of the available assets is the goal of the liberalized electricity market. Nowadays, the development of new technologies of renewable production results in a signi_cant increase in the total installed capacity of this type of generation in the power system. LÄS MER
4. Reliability-Constrained Microgrid Design
Master-uppsats, KTH/Skolan för elektro- och systemteknik (EES)Sammanfattning : Microgrids are new challenging power systems under development. This report presents a feasibility study of microgrid development. This is an essential task before implementing microgrid systems. LÄS MER
5. Modeling and solving vehicle routing problems with many available vehicle types
Master-uppsats, Göteborgs universitet/Institutionen för matematiska vetenskaperSammanfattning : Abstract In this thesis, models have been formulated and mathematical optimization methods developed for the heterogeneous vehicle routing problem with a very large set of available vehicle types, called many-hVRP. This is an extension of the standard heterogeneous vehicle routing problem (hVRP), in which typically fairly small sets of vehicle types are considered. LÄS MER