About: Hybrid Algorithm for Wait-and-see Network Design Problem     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
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. (en)
Title
  • Hybrid Algorithm for Wait-and-see Network Design Problem
  • Hybrid Algorithm for Wait-and-see Network Design Problem (en)
skos:prefLabel
  • Hybrid Algorithm for Wait-and-see Network Design Problem
  • Hybrid Algorithm for Wait-and-see Network Design Problem (en)
skos:notation
  • RIV/00216305:26210/14:PU109554!RIV15-MSM-26210___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • S
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 20034
http://linked.open...ai/riv/idVysledku
  • RIV/00216305:26210/14:PU109554
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • transportation model, network-design problem, stochastic programming, wait-and-see approach, genetic algorithm, hybrid algorithm (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [A36D72E30708]
http://linked.open...v/mistoKonaniAkce
  • Brno University of Technology
http://linked.open...i/riv/mistoVydani
  • Brno
http://linked.open...i/riv/nazevZdroje
  • 20th International Conference of Soft Computing, MENDEL 2014
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Novotný, Jan
  • Popela, Pavel
  • Roupec, Jan
  • Haugen, Kjetil Kare
  • Hrabec, Dušan
  • Olstad, Asmund
  • Jindra, Petr
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
number of pages
http://purl.org/ne...btex#hasPublisher
  • Neuveden
https://schema.org/isbn
  • 978-80-214-4984-8
http://localhost/t...ganizacniJednotka
  • 26210
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 59 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software