Detail publikace

Hybrid Algorithm for Wait-and-See Transportation Network Design Problem with Linear Pricing

HRABEC, D. POPELA, P. ROUPEC, J. JINDRA, P. NOVOTNÝ, J.

Originální název

Hybrid Algorithm for Wait-and-See Transportation Network Design Problem with Linear Pricing

Typ

článek v časopise ve Scopus, Jsc

Jazyk

angličtina

Originální abstrakt

The aim of the paper is to introduce a modified hybrid algorithm to solve a wait-and-see reformulation of transportation optimization model including linear pricing with random demand parameters and 0-1 network design variables. We model the linearly price-dependent stochastic demand and the uncertain demand parameters are introduced and modeled by random variables. Our formulated scenario-based model can be repeatedly solved as a finite set of mixed integer linear programs by means of integer programming techniques or some heuristics. However, the authors combine a traditional optimization algorithm and a suitable genetic algorithm to obtain a hybrid algorithm that is modified for the WS case. Its implementation and test results are illustrated by network and function graphs, which are also discussed and concluded in the paper.

Klíčová slova

transportation network-design problem, pricing, stochastic programming, wait-and-see approach, genetic algorithm, hybrid algorithm

Autoři

HRABEC, D.; POPELA, P.; ROUPEC, J.; JINDRA, P.; NOVOTNÝ, J.

Rok RIV

2015

Vydáno

8. 7. 2015

Nakladatel

VUT

Místo

Brno

ISBN

978-3-319-19823-1

Kniha

21st International Conference of Soft Computing, MENDEL 2015

ISSN

1803-3814

Periodikum

Mendel Journal series

Ročník

2015

Číslo

1

Stát

Česká republika

Strany od

183

Strany do

188

Strany počet

6

BibTex

@article{BUT115227,
  author="Dušan {Hrabec} and Pavel {Popela} and Jan {Roupec} and Petr {Jindra} and Jan {Novotný}",
  title="Hybrid Algorithm for Wait-and-See Transportation Network Design Problem with Linear Pricing",
  journal="Mendel Journal series",
  year="2015",
  volume="2015",
  number="1",
  pages="183--188",
  issn="1803-3814"
}