Publication detail

Two-Stage Stochastic Programming for Transportation Network Design Problem

HRABEC, D. POPELA, P. ROUPEC, J. MAZAL, J. STODOLA, P.

Czech title

Dvojsutpňová stochastická optimalizace pro návrh dopravní sítě

English title

Two-Stage Stochastic Programming for Transportation Network Design Problem

Type

conference paper

Language

en

Original abstract

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.

Czech abstract

Text představuje dvojstupňový přístup stochastické optimalizace pro dopravní úlohy zahrnující 0-1 proměnné vztahující se k návrhu sítě. Sestavená úloha je řešena hybridním algoritmem a dosažené výsledky jsou vizualizovány.

English abstract

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.

Keywords in English

two-stage stochastic programming, scenario-based approach, transportation model, network design problem, genetic algorithm, hybrid algorithm

RIV year

2015

Released

08.07.2015

ISBN

978-3-319-19824-8

ISSN

2194-5357

Book

Mendel 2015: Recent Advances in Soft Computing

Volume

378

Number

1

Pages from–to

17–25

Pages count

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",
  volume="378",
  number="1",
  month="July",
  pages="17--25",
  isbn="978-3-319-19824-8",
  issn="2194-5357"
}