About: Disruption in Congested Networks     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 purpose of the paper is to introduce and discuss a special problem related to congested traffic networks. In 1968, Braess presented an example of careless network changes, which led in congested networks to higher density of traffic. Since then, various versions of network design problems have been studied and clarified. We focus on phenomena accompanying many network design applications, specifically, the reconstruction of a network and its partial closure. A bilevel structure of the studied problem is tackled by the use of Karush-Kuhn-Tucker conditions. The obtained nonlinear integer program can be solved by the use of modelling optimization software as, e.g., GAMS. However, only small instances can be successfully solved within the acceptable time limits. For the large model instances, as the considered modification of the known Sioux Falls test case, the hybrid algorithmic framework combining the use of deterministic solvers encapsulated in GAMS with the genetic algorithm has been designed
  • The purpose of the paper is to introduce and discuss a special problem related to congested traffic networks. In 1968, Braess presented an example of careless network changes, which led in congested networks to higher density of traffic. Since then, various versions of network design problems have been studied and clarified. We focus on phenomena accompanying many network design applications, specifically, the reconstruction of a network and its partial closure. A bilevel structure of the studied problem is tackled by the use of Karush-Kuhn-Tucker conditions. The obtained nonlinear integer program can be solved by the use of modelling optimization software as, e.g., GAMS. However, only small instances can be successfully solved within the acceptable time limits. For the large model instances, as the considered modification of the known Sioux Falls test case, the hybrid algorithmic framework combining the use of deterministic solvers encapsulated in GAMS with the genetic algorithm has been designed (en)
Title
  • Disruption in Congested Networks
  • Disruption in Congested Networks (en)
skos:prefLabel
  • Disruption in Congested Networks
  • Disruption in Congested Networks (en)
skos:notation
  • RIV/00216305:26210/13:PU104668!RIV15-MSM-26210___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(ED0002/01/01), 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
  • 69922
http://linked.open...ai/riv/idVysledku
  • RIV/00216305:26210/13:PU104668
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • multicommodity network flow, traffic assignment problem, network design, congested network, nonlinnear integer programming, noncooperative equilibrium, Karush-Kuhn-Tucker condditions, genetic algorithms. (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [1AE04C371BA3]
http://linked.open...v/mistoKonaniAkce
  • Brno University of Technology
http://linked.open...i/riv/mistoVydani
  • Brno
http://linked.open...i/riv/nazevZdroje
  • Proceedings of 19th International Conference on Soft Computing MENDEL 2013
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Popela, Pavel
  • Roupec, Jan
  • Holešovský, Jan
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
number of pages
http://purl.org/ne...btex#hasPublisher
  • Vysoké učení technické v Brně
https://schema.org/isbn
  • 978-80-214-4755-4
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, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software