Suitability of a genetic algorithm for road traffic network division

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F11%3A43897687" target="_blank" >RIV/49777513:23520/11:43897687 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Suitability of a genetic algorithm for road traffic network division

Original language description

In this paper, the suitability of a genetic algorithm as a part of a method for division of road traffic network is discussed. The division of traffic network is necessary during the adaptation of the road traffic simulation for distributed computing environment. This environment enables to perform detailed simulation of large traffic networks (e.g. entire cities and larger) in a reasonable time. Genetic algorithms are considered, since they are often employed in both graph partitioning and multi-objective optimization problems. These problems are closely associated with the problem of road traffic network division.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

JC - Computer hardware and software

OECD FORD branch

—

Project

—

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2011

Confidentiality

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

Article name in the collection

KDIR 2011

ISBN

978-989-8425-79-9

ISSN

—

e-ISSN

—

Number of pages

4

Pages from-to

448-451

Publisher name

SciTePress

Place of publication

Setúbal

Event location

Paris, France

Event date

Oct 26, 2011

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—