All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Circular Colouring for Emission Minimalization

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60460709%3A41310%2F13%3A62333" target="_blank" >RIV/60460709:41310/13:62333 - isvavai.cz</a>

  • Result on the web

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    čeština

  • Original language name

    Circular Colouring for Emission Minimalization

  • Original language description

    The standard time allocation of classic road junctions in major towns and cities are often the main indicators of the government policy and management strategy in reducing traffic jams with its associated emission production from the traffic flow. In this paper, we apply the circular colouring method of Graph Theory (Vince, 1988; Zhu, 2001),to the emission reduction problem at a traffic road junction. The result of this paper is addressing this problem by optimizing the waiting time interval for two selected models. A traffic road junction is modelled as a finite graph G = (V, E). Each vertex v of G represents a given traffic light. Two vertices v and u are connected with an edge if their corresponding represented traffic flows collide and each time insuch case they are given an overlapping green light time interval.

  • Czech name

    Circular Colouring for Emission Minimalization

  • Czech description

    The standard time allocation of classic road junctions in major towns and cities are often the main indicators of the government policy and management strategy in reducing traffic jams with its associated emission production from the traffic flow. In this paper, we apply the circular colouring method of Graph Theory (Vince, 1988; Zhu, 2001),to the emission reduction problem at a traffic road junction. The result of this paper is addressing this problem by optimizing the waiting time interval for two selected models. A traffic road junction is modelled as a finite graph G = (V, E). Each vertex v of G represents a given traffic light. Two vertices v and u are connected with an edge if their corresponding represented traffic flows collide and each time insuch case they are given an overlapping green light time interval.

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    JO - Land transport systems and equipment

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/LD11049" target="_blank" >LD11049: The transport energy consumption in urban and suburban areas</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

  • Name of the periodical

    Transactions on Transport Sciences

  • ISSN

    1802-971X

  • e-ISSN

  • Volume of the periodical

    6

  • Issue of the periodical within the volume

    4

  • Country of publishing house

    CZ - CZECH REPUBLIC

  • Number of pages

    10

  • Pages from-to

    159-168

  • UT code for WoS article

  • EID of the result in the Scopus database