|
|
Multiple Marginalization and its Impact on Supply Chains' Efficiency
Zouhar, Jan ; Fiala, Petr (advisor) ; Cahlík, Tomáš (referee) ; Ivaničová, Zlatica (referee)
Double (or multiple) marginalization is often identified as the main source of a decentralized supply chain's (SC's) inefficiency. In its core lies the fact that if the agents constituting the SC choose their output prices according to the golden rule of profit maximization (that normally applies to a single firm that produces independently and sells directly to the end consumer), the prices in the SC tend to spiral up to an inefficient (equilibrium) level where both the consumer surplus and the SC's total profit are diminished. The aim of this paper is to analyze and quantify the impact of multiple marginalization on the behaviour of SC's that vary with respect to their structure (i.e. the number of agents and the links between them) and the shape of their cost and demand functions. The main gauge of this impact is the efficiency of a SC, defined as the ratio of the profit of a SC whose agents behave according to the model of multiple marginalization, and the potential profit of the SC (i.e. the maximum profit attainable under the conditions of complete coordination of prices within the chain). Besides efficiency, some other properties of a SC are studied, e.g. the distribution of the SC's profit among the individual agents or cost externalities within the SC. Three different models of multiple marginalization are studied in the paper. The first one is a linear model of multiple marginalization (i.e. a model with linear demand and cost functions); in this simplified setting we derived explicit formulae for values of the studied indicators. The second model is analogous to the first one only that it allows for non-linear demand and cost functions; in this case, the analysis is carried out using computer experiments with numeric algorithms. The last one is a dynamic model of multiple marginalization which studies the abovementioned price spiral through multi-agent simulation.
|
|
|
Heuristic and metaheuristic methods for travelling salesman problem
Burdová, Jana ; Kalčevová, Jana (advisor) ; Zouhar, Jan (referee)
Minimal length of a travelling salesman's problem had been studied in this diploma these. Travelling salesman must come trough each place just once and then go back to the starting place. This problem can be illustrated as a problem of graph theory, such that places are the vertices, roads are the edges, distances of roads are the lengths of edges. The optimal travelling salesman's problem tour is the shortest Hamiltionian cycle in the graph. It is a classical NP-complete problem. There is no algorithm that solves this problem in polynomial time. This problem can be solved by using various approximation algorithms, they offer less time consumption and lowest quality than optimization. This diploma these had been dedicated to approximation algorithms, for example: nearest neighbor method, minimal spanning tree method, Christofide's method, 2-opt., genetic algorithm, etc.
|
|
|
Application of optimization methods in e-shopping
Hollayová, Nela ; Zouhar, Jan (advisor) ; Fábry, Jan (referee)
The subject of the thesis is the optimization of one the key processes in a book e-shop, namely delivery of goods from suppliers. In particular, we focus on the problems of selection of suppliers and the subsequent route optimization in daily pick-ups of orders. The proposed solution uses a combination of two mixed integer programming models. The model for supplier selection was designed so as to reflect the empiric approaches that are currently employed in the e-shop; the model for route optimization is a modified version of the canonical travelling salesman problem. On the basis of achieved results, we presented effective procedures for solving both of the aforementioned problems and suggested their implementation into the e-shop's enterprise resource planning system.
|
|
|
Analysis of labor in the shop building materials
Valná, Hana ; Kalčevová, Jana (advisor) ; Zouhar, Jan (referee)
The present thesis shows the manner of distributing workers on shifts with regular work load but uneven work schedules. It is generally known as the covering or set-covering problem. The present paper describes a way to solve it with mathematical modelling and programs for possible planning of workers on shifts. The issue is documented on a case of an existing company.
|
|
|
Scoring Models in Finance (Skóringové modely ve financích)
Rychnovský, Michal ; Zouhar, Jan (advisor) ; Kalčevová, Jana (referee)
The aim of the present work is to describe the application of the logistic regression model to the field of probability of default modeling, and provide a brief introduction to the scoring development process used in financial practice. We start by introducing the theoretical background of the logistic regression model; followed by a consequent derivation of three most common scoring models. Then we present a formal definition of the Gini coefficient as a diversification power measure and derive the Somers-type formulas for its estimation. Finally, the key part of this work gives an overview of the whole scoring development process illustrated on the examples of real business data.
|
|
|
Scheduling in systems with multiple machines
Černý, Jan ; Pelikán, Jan (advisor) ; Zouhar, Jan (referee)
This paper focuses on characterization of scheduling in systems with one or multiple machines. There are different types of tasks given, with which we can encounter in scheduling. At the beginning, introduce basic concepts of production scheduling. The second chapter is a flowshop problem with its history and projections for the flowshop problem. In the next chapter is a modification of flowshop problem called hybrid flowshop, which is divided according flexibility to hybrid flowshop with processing flexibility and hybrid flowshop with routing flexibility. Another chapter is open shop problem, which have some differences compare with the above mentioned types. The last chapter is a job shop, stating in a graphical solution for two machines and a brief description of the algorithm Shifting bottleneck.
|
|
|
The Management Of Stocks Of Spare Parts Logistics Chains
Vávriková, Lucia ; Kuncová, Martina (advisor) ; Zouhar, Jan (referee)
Thesis on the theme "The Management Of Stock Of Spare Parts Logistics Chains" deals with the specification of logistic chains, spare parts inventory management and functioning of these chains. The theoretical part focuses on the definition of the theoretical background needed to understand the functioning of these chains. It ranges from the definition of the logistics chain, through ABC analysis to the detailed characteristics of the chain of spare parts. Besides a general overview the thesis includes example from real practice. In the practical section, through simulation models thesis presents the operation and management of the spare parts logistics chains. The practical section shows the simulation model of the current situation and compares it with the model after the introduction of stock management in the company.
|
|
|
Modelling of Projects with Stochastic Cyclical Structure
Sládková, Ivana ; Zouhar, Jan (advisor) ; Kuncová, Martina (referee)
The Presented Thesis is focused on exploitation of stochastic cyclical networks in project management during project planning. Particularly, it is focused on the GERT method, which enables to carry out both the probability analysis and the time analysis of projects with stochastic structure. We deal primarily with analysis of such networks where cyclical activities occur. As an integral part of the Thesis, derivation of simplified computing procedures for cyclical activities is included. We extend the possibilities of the GERT method with stochastic evaluation of time duration of activities using the fuzzy GERT method. This fuzzy GERT method is applied on the real project and its results are compared to results of Monte Carlo simulation.
|
|
|
Application of Linear Programming on Project Management
Hrnčířová, Michala ; Zouhar, Jan (advisor) ; Fábry, Jan (referee)
There are two approaches to solving project management tasks. The first method is using specialized algorithms that do not always give optimal results. The second way is to use linear programming which includes designing mathematical models that are then solved by optimization systems. In my thesis I am dealing with three types of optimization tasks, two of which are basic linear programming tasks: basic project time scheduling and time scheduling of a project with variable action lengths. The focal point of the thesis is to assemble a mathematical model to solve the time scheduling of a project with limited resources. My goal is to design general mathematical models and to compare the results gained by the use of linear programming with those of specialized algorithms.
|
|
|
Using of AIMMS at solving of optimization models
Lacinová, Věra ; Jablonský, Josef (advisor) ; Zouhar, Jan (referee)
The bachelor's thesis is about AIMMS -- a system for mathematical modeling. The aim of the thesis is to create a simple user's guide for interested individuals that want to use this system on the basic level. Practical part is about making models of selected distribution problems. Thesis is organized into three main chapters. The first chapter is about linear programming and selected distribution problems of linear programming. There is outlined development of linear programming and its place in mathematical modeling. In this chapter, mathematical models of selected distribution problems as transportation problem, container-transportation problem, allocation problem, covering problem and assignment problem are formulated. The second chapter is about AIMMS and describes how to work with this system. It contains basic information about the system and its author J. Bisschop. The next part informs how to work with system AIMMS. There is a way of declaration of individual sections and procedures in Model Explorer discussed. The AIMMS Page Manager, a tool for creating end-user's pages, is described. By this tool the end-user can change data sets and obtain results of analyzed problems. The third chapter is practical part. It contains the description of selected distribution problems with the emphasis on their implementation in AIMMS. Appendix contains end-pages of selected distribution problems and the list of solvers supported by AIMMS.
|
guest ::
