Detail publikace

Hybridní algoritmus pro wait-and-see úlohu návrhu sítě

HRABEC, D. POPELA, P. ROUPEC, J. JINDRA, P. HAUGEN, K. NOVOTNÝ, J. OLSTAD, A.

Český název

Hybridní algoritmus pro wait-and-see úlohu návrhu sítě

Anglický název

Hybrid Algorithm for Wait-and-see Network Design Problem

Typ

článek v časopise ve Scopus, Jsc

Jazyk

en

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 with random demand parameters and 0-1 network design variables. Firstly, the deterministic linear transportation model with network design variables is reviewed. Then, uncertain demand parameters are introduced and modeled by random variables. The following deterministic reformulation is based on the wait-and-see (WS) approach. Finite discrete probability distributions are assumed for all random variables, and hence, the obtained separable scenario-based model can be repeatedly solved as a finite set of mixed integer linear programs (MILPs) 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 illustrated by figures are also discussed in the paper.

Český abstrakt

Cílem textu je uvést upravený hybridní algoritmus k řešení wait-and-see reformulace dopravního optimalizačního modelu s náhodnými parametry a 0-1 návrhovými proměnými.

Anglický abstrakt

The aim of the paper is to introduce a modified hybrid algorithm to solve a wait-and-see reformulation of transportation optimization model with random demand parameters and 0-1 network design variables. Firstly, the deterministic linear transportation model with network design variables is reviewed. Then, uncertain demand parameters are introduced and modeled by random variables. The following deterministic reformulation is based on the wait-and-see (WS) approach. Finite discrete probability distributions are assumed for all random variables, and hence, the obtained separable scenario-based model can be repeatedly solved as a finite set of mixed integer linear programs (MILPs) 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 illustrated by figures are also discussed in the paper.

Klíčová slova česky

dopravní model, návrh sítě, stochastické programování, wait-and-see přístup, genetický algoritmus, hybridní algoritmus

Klíčová slova anglicky

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

Rok RIV

2014

Vydáno

01.07.2014

Místo

Brno

ISBN

978-80-214-4984-8

ISSN

1803-3814

Kniha

20th International Conference of Soft Computing, MENDEL 2014

Ročník

2014

Číslo

1

Strany od–do

97–104

Počet stran

8

BIBTEX


@article{BUT108247,
  author="Dušan {Hrabec} and Pavel {Popela} and Jan {Roupec} and Petr {Jindra} and Kjetil Kare {Haugen} and Jan {Novotný} and Asmund {Olstad},
  title="Hybrid Algorithm for Wait-and-see Network Design Problem",
  booktitle="20th International Conference of Soft Computing, MENDEL 2014",
  year="2014",
  volume="2014",
  number="1",
  month="July",
  pages="97--104",
  address="Brno",
  isbn="978-80-214-4984-8",
  issn="1803-3814"
}