|
|
Stochastic processes in the combination of life insurance and mortgage
Kalendovský, Jan ; Rotkovský, Martin (advisor) ; Hurt, Jan (referee)
The goal of the diploma thesis is to describe stochastic processes in the combination of mortgage loan and fund-linked life insurance, and to construct and analyze suitable mathematical models related to them. The idea of the combination of mortgage loan and fund-linked life insurance consists in serving the debt via paying up the interest only and investing the rest of the instalment within a fund-linked life insurance, instead of amortizing the debt gradually. At the maturity time, the principal sum will be amortized at once, using assets which have been invested within a fund-linked life insurance.
|
|
| |
|
|
Stochastic processes in the combination of life insurance and mortgage
Kalendovský, Jan ; Rotkovský, Martin (advisor) ; Hurt, Jan (referee)
The goal of the diploma thesis is to describe stochastic processes in the combination of mortgage loan and fund-linked life insurance, and to construct and analyze suitable mathematical models related to them. The idea of the combination of mortgage loan and fund-linked life insurance consists in serving the debt via paying up the interest only and investing the rest of the instalment within a fund-linked life insurance, instead of amortizing the debt gradually. At the maturity time, the principal sum will be amortized at once, using assets which have been invested within a fund-linked life insurance.
|
|
| |
|
|
Heuristic Methods for Solving Generalized Vehicle Routing Problems
Kalendovský, Jan ; Fábry, Jan (advisor) ; Pelikán, Jan (referee)
The goal of the diploma thesis is to introduce and describe a heuristic method for finding a sub-optimal system of circuits in a generalized vehicle routing problem with time windows and time-dependent unit costs. Proposed method was built up on Clarke and Wright's savings method for the standard vehicle routing problem. Additionally, there has been described an algorithm for improving current solution via finding an optimal time harmonogram for a journey on each circuit within the found sub-optimal system of circuits.
|
guest ::
