Přístupnostní navigace
E-přihláška
Vyhledávání Vyhledat Zavřít
Detail publikace
HRABEC, D. POPELA, P. ROUPEC, J. MAZAL, J. STODOLA, P.
Originální název
Two-Stage Stochastic Programming for Transportation Network Design Problem
Typ
článek ve sborníku ve WoS nebo Scopus
Jazyk
angličtina
Originální abstrakt
The transportation network design problem is a well-known optimization problem with many practical applications. This paper deals with demand-based applications, where the operational as well as many other decisions are often made under uncertainty. Capturing the uncertain demand by using scenario-based approach, we formulate the two-stage stochastic mixed-integer linear problem, where the decision, which is made under uncertainty, of the first-stage program, is followed by the second-stage decision that reacts to the observed demand. Such a program may reach solvability limitations of algorithms for large scale real world data, so we refer to the so-called hybrid algorithm that combines a traditional optimization algorithm and a suitable genetic algorithm. The obtained results are presented in an explanatory form with the use of a sequence of figures.
Klíčová slova
two-stage stochastic programming, scenario-based approach, transportation model, network design problem, genetic algorithm, hybrid algorithm
Autoři
HRABEC, D.; POPELA, P.; ROUPEC, J.; MAZAL, J.; STODOLA, P.
Rok RIV
2015
Vydáno
8. 7. 2015
ISBN
978-3-319-19824-8
Kniha
Mendel 2015: Recent Advances in Soft Computing
ISSN
2194-5357
Periodikum
Advances in Intelligent Systems and Computing
Ročník
378
Číslo
1
Stát
Švýcarská konfederace
Strany od
17
Strany do
25
Strany počet
9
BibTex
@inproceedings{BUT115205, author="Dušan {Hrabec} and Pavel {Popela} and Jan {Roupec} and Jan {Mazal} and Petr {Stodola}", title="Two-Stage Stochastic Programming for Transportation Network Design Problem", booktitle="Mendel 2015: Recent Advances in Soft Computing", year="2015", journal="Advances in Intelligent Systems and Computing", volume="378", number="1", pages="17--25", doi="10.1007/978-3-319-19824-8\{_}2", isbn="978-3-319-19824-8", issn="2194-5357" }