Disruption in Congested Networks
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F13%3APU104668" target="_blank" >RIV/00216305:26210/13:PU104668 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Disruption in Congested Networks
Original language 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 b
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BB - Applied statistics, operational research
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/ED0002%2F01%2F01" target="_blank" >ED0002/01/01: NETME Centre (New Technologies for Mechanical Engineering)</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of 19th International Conference on Soft Computing MENDEL 2013
ISBN
978-80-214-4755-4
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
191-196
Publisher name
VUT v Brně
Place of publication
Brno
Event location
Brno University of Technology
Event date
Jun 26, 2013
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—