|
|
Optimization in energy problems
Fürst, Matouš ; Kopa, Miloš (advisor) ; Lachout, Petr (referee)
Title: Optimization in energy problems Author: Matouš Fürst Department: Department of Probability and Mathematical Statistics Supervisor: doc. RNDr. Ing. Miloš Kopa, Ph.D., Department of Probability and Mathematical Statistics Abstract: In this thesis we present an optimization model of a semi-autonomous household, which aims to make energy management more efficient. The household is equipped with solar panels and an electric vehicle with a high-capacity battery. In the first part we summarize the basic properties of linear programming and two- stage stochastic linear programming. Subsequently, a two-stage stochastic linear program is formulated and solved in order to optimize the purchase, sale and storage of energy in the household during a single day. The program is formulated in two versions - with present and with departing vehicle. The final solution represents optimal decisions of the household and we discuss it with respect to the input data. In both versions the solution leads to a substantial reduction in costs compared to a household without a battery. Keywords: stochastic optimization, linear programming, domestic microgrid 1
|
|
|
Advanced Decomposition Methods in Stochastic Convex Optimization
Kůdela, Jakub ; Fabian, Csaba (referee) ; Šmíd,, Martin (referee) ; Popela, Pavel (advisor)
Při práci s úlohami stochastického programování se často setkáváme s optimalizačními problémy, které jsou příliš rozsáhlé na to, aby byly zpracovány pomocí rutinních metod matematického programování. Nicméně, v některých případech mají tyto problémy vhodnou strukturu, umožňující použití specializovaných dekompozičních metod, které lze použít při řešení rozsáhlých optimalizačních problémů. Tato práce se zabývá dvěma třídami úloh stochastického programování, které mají speciální strukturu, a to dvoustupňovými stochastickými úlohami a úlohami s pravděpodobnostním omezením, a pokročilými dekompozičními metodami, které lze použít k řešení problému v těchto dvou třídách. V práci popisujeme novou metodu pro tvorbu “warm-start” řezů pro metodu zvanou “Generalized Benders Decomposition”, která se používá při řešení dvoustupňových stochastických problémů. Pro třídu úloh s pravděpodobnostním omezením zde uvádíme originální dekompoziční metodu, kterou jsme nazvali “Pool & Discard algoritmus”. Užitečnost popsaných dekompozičních metod je ukázána na několika příkladech a inženýrských aplikacích.
|
|
|
Solving Canadian Traveller Problem
Pavlovič, Dávid ; Šoustek, Petr (referee) ; Dvořák, Jiří (advisor)
This thesis deals with Canadian traveller problem. Imagine a traveller that have a map on which every road is associated with time that is needed to get through this road. Hovewer, this map may not be totally reliable, and the time needed to pass through on some of the roads may be different due to bad road conditions, or the pass will be impossible. This thesis deals with type overview of this problem and the solutions. Further, the thesis deals with the description of two applications implemented in Python, which serves on verification of the strategies. The final part contains experiments and comparison of effectiveness of selected strategies.
|
|
|
Multivariate stochastic dominance and its application in portfolio optimization problems
Petrová, Barbora ; Kopa, Miloš (advisor) ; Ortobelli, Sergio (referee) ; Branda, Martin (referee)
Title: Multivariate stochastic dominance and its application in portfolio optimization Problems Author: Barbora Petrová Department: Department of Probability and Mathematical Statistics Supervisor: doc. RNDr. Ing. Miloš Kopa, Ph.D., Department of Probability and Mathematical Statistics Abstract: This thesis discusses the concept of multivariate stochastic dominance, which serves as a tool for ordering random vectors, and its possible usage in dynamic portfolio optimization problems. We strictly focus on different types of the first-order multivariate stochastic dominance for which we describe their generators in the sense of von Neumann-Morgenstern utility functions. The first one, called strong multivariate stochastic dominance, is generated by all nondecreasing multivariate utility functions. The second one, called weak multivariate stochastic dominance, is defined by relation between survival functions, and the last one, called the first-order linear multivariate stochastic dominance, applies the first-order univariate stochastic dominance notion to linear combinations of marginals. We focus on the main characteristics of these types of stochastic dominance, their relationships as well as their relation to the cumulative and marginal distribution functions of considered random vectors. Formulated...
|
|
|
Multicriteria and robust extension of news-boy problem
Šedina, Jaroslav ; Kopa, Miloš (advisor) ; Kaňková, Vlasta (referee)
This thesis studies a classic single-period stochastic optimization problem called the newsvendor problem. A news-boy must decide how many items to order un- der the random demand. The simple model is extended in the following ways: endogenous demand in the additive and multiplicative manner, objective func- tion composed of the expected value and Conditional Value at Risk (CVaR) of profit, multicriteria objective with price-dependent demand, multiproduct exten- sion under dependent and independent demands, distributional robustness. In most cases, the optimal solution is provided. The thesis concludes with the nu- merical study that compares results of two models after applying the Sample Average Approximation (SAA) method. This study is conducted on the real data. 1
|
|
|
Stochastic Optimization on Random Networks
Sigačevová, Jana ; Houda, Michal (advisor) ; Branda, Martin (referee)
The deterministic theory of graphs and networks is used successfully in cases where no random component is needed. However in practice, a number of decision-making and conflict situations require the inclusion of a stochastic element directly into the model. The objective of this thesis is the introduction of stochastic optimization and its application on random networks. The reader will become familiar with three approaches to stochastic optimization. Namely two-stage optimization, multi-stage optimization and chance constraint optimization. Finally, the studied issue is demonstrated on a real telecommunication network example.
|
|
|
Stochastic optimization model of effective hydro energy usage
Janíková, Veronika ; Lachout, Petr (advisor) ; Kopa, Miloš (referee)
This thesis deals with the stochastic optimization problem of hydro reservoir manage- ment. External inflows and market electricity price are both considered as random inputs to the model, which is designed as joint chance constrained programming. The main goal of the optimization problem is to maximize the profit from hydro energy usage together with minimizing the cost of used water. The random component is modelled by suitable stochastic processes based on historical data and then approximated via scenarios. Sea- sonal deterministic model is another model that is presented in this thesis. This model helps appraise water stored in every each reservoir's compartment. The estimates of water values are based on dual variables. Finally, in the practical part the hydro reservoir ma- nagement problem is applied to the real hydro valley located on the Vltava river. This part also deals with an option of increasing the number of pumping stations in this particular hydro valley.
|
|
|
Decision Problems and Empirical Data; Applications to New Types of Problems
Odintsov, Kirill ; Kaňková, Vlasta (advisor) ; Lachout, Petr (referee)
This thesis concentrates on different approaches of solving decision making problems with an aspect of randomness. The basic methodologies of converting stochastic optimization problems to deterministic optimization problems are described. The proximity of solution of a problem and its empirical counterpart is shown. The empirical counterpart is used when we don't know the distribution of the random elements of the former problem. The distribution with heavy tails, stable distribution and their relationship is described. The stochastic dominance and the possibility of defining problems with stochastic dominance is introduced. The proximity of solution of problem with second order stochastic dominance and the solution of its empirical counterpart is proven. A portfolio management problem with second order stochastic dominance is solved by solving the equivalent empirical problem. Powered by TCPDF (www.tcpdf.org)
|
|
|
Solving Canadian Traveller Problem
Filip, Sebastián ; Matoušek, Radomil (referee) ; Dvořák, Jiří (advisor)
This thesis deals with Canadian traveller problem (CTP), which can be defined as the shortest path problem in a stochastic environment. The overview of different CTP variants is presented in theoretical part of this thesis, as well as known solutions to these variants. In the next parts, the thesis focuses on the stochastic variation of CTP (SCTP). For this variant chosen solutions (strategies) are discussed more in depth. At the same time, the original strategies named UCTO and UCTP are presented. Further, the thesis deals with the description of a window application implemented in Java, which has been developed to validate and test the functionality of selected strategies. The final part contains experiments and comparison of selected strategies.
|
|
|
Stochastic activity networks
Sůva, Pavel ; Dupačová, Jitka (advisor) ; Kaňková, Vlasta (referee)
In the present work, stochastic network models representing a project as a set of activities are studied, as well as different approaches to these models. The critical path method, stochastic network models with probability constraints, finding a reference project duration, worst-case analysis in stochastic networks and optimization of the parameters of the probability distributions of the activity durations are studied. Use of stochastic network models in telecommunications networks is also briefly presented. In a numerical study, some of these models are implemented and the~related numerical results are analyzed.
|
guest ::
