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

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F15%3APU114628" target="_blank" >RIV/00216305:26210/15:PU114628 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

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

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

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

Popis výsledku anglicky

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.

Druh

J_SC - Článek v periodiku v databázi SCOPUS

CEP obor

—

OECD FORD obor

10103 - Statistics and probability

Projekt

<a href="/cs/project/LO1202" target="_blank" >LO1202: NETME CENTRE PLUS</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2015

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Mendel Journal series

ISSN

1803-3814

e-ISSN

—

Svazek periodika

2015

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

CZ - Česká republika

Počet stran výsledku

6

Strana od-do

183-188

Kód UT WoS článku

—

EID výsledku v databázi Scopus

2-s2.0-84938827477