This HTML5 document contains 51 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n15http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n20http://localhost/temp/predkladatel/
n19http://purl.org/net/nknouf/ns/bibtex#
n10http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n18http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216305%3A26210%2F14%3APU109554%21RIV15-MSM-26210___/
n16http://linked.opendata.cz/ontology/domain/vavai/
n13https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n9http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n7http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n12http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216305%3A26210%2F14%3APU109554%21RIV15-MSM-26210___
rdf:type
skos:Concept n16:Vysledek
dcterms:description
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. 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.
dcterms:title
Hybrid Algorithm for Wait-and-see Network Design Problem Hybrid Algorithm for Wait-and-see Network Design Problem
skos:prefLabel
Hybrid Algorithm for Wait-and-see Network Design Problem Hybrid Algorithm for Wait-and-see Network Design Problem
skos:notation
RIV/00216305:26210/14:PU109554!RIV15-MSM-26210___
n3:aktivita
n4:S
n3:aktivity
S
n3:dodaniDat
n12:2015
n3:domaciTvurceVysledku
n10:4375408 n10:1286943 n10:5519608 n10:6841074 n10:6171265
n3:druhVysledku
n11:D
n3:duvernostUdaju
n17:S
n3:entitaPredkladatele
n18:predkladatel
n3:idSjednocenehoVysledku
20034
n3:idVysledku
RIV/00216305:26210/14:PU109554
n3:jazykVysledku
n7:eng
n3:klicovaSlova
transportation model, network-design problem, stochastic programming, wait-and-see approach, genetic algorithm, hybrid algorithm
n3:klicoveSlovo
n9:stochastic%20programming n9:transportation%20model n9:network-design%20problem n9:genetic%20algorithm n9:wait-and-see%20approach n9:hybrid%20algorithm
n3:kontrolniKodProRIV
[A36D72E30708]
n3:mistoKonaniAkce
Brno University of Technology
n3:mistoVydani
Brno
n3:nazevZdroje
20th International Conference of Soft Computing, MENDEL 2014
n3:obor
n5:BB
n3:pocetDomacichTvurcuVysledku
5
n3:pocetTvurcuVysledku
7
n3:rokUplatneniVysledku
n12:2014
n3:tvurceVysledku
Hrabec, Dušan Olstad, Asmund Jindra, Petr Popela, Pavel Novotný, Jan Roupec, Jan Haugen, Kjetil Kare
n3:typAkce
n15:WRD
n3:zahajeniAkce
2014-06-25+02:00
s:numberOfPages
8
n19:hasPublisher
Neuveden
n13:isbn
978-80-214-4984-8
n20:organizacniJednotka
26210