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

Result code in 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>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Hybrid Algorithm for Wait-and-See Transportation Network Design Problem with Linear Pricing
Original language description
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.
Czech name
—
Czech description
—

Type
J<sub>SC</sub> - Article in a specialist periodical, which is included in the SCOPUS database
CEP classification
—
OECD FORD branch
10103 - Statistics and probability

Project
<a href="/en/project/LO1202" target="_blank" >LO1202: NETME CENTRE PLUS</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

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

Similar results(10)