| Attributes | Values |
|---|
| rdf:type
| |
| rdfs:seeAlso
| |
| Description
| - With the increasing values of vehicles are becoming increasingly frequent lack of infrastructure capacity that is used by vehicles. This phenomenon is most evident in urban transport infrastructure, where vehicles concentrations are highest. Typical examples are light-controlled intersections, which are often heavily loaded, which is reflected in the congested area in front of intersections. Solving of this problem is very difficult but very necessary, because the elimination of this undesirable phenomenon in traffic has resulted in reducing of economic losses by congestion, more efficient using of transport and last but not least improving the quality of life in the city. In the past has been shown that using linear programming methods can be designed signal plans, which can effectively control the intersections. But it was at intersections which are not congested. This paper deals the possibilities of designing of signal plans using linear programming in a situation where the intersections are congested. Congestion is reflected by the fact that is not ensured that all vehicles that came to the intersection in one cycle, it leaves during the same cycle. In the beginning of this article are described the possible ways of solving depending on the requirements of traffic flows, followed by a description of mathematical models which can solve this problem. The theoretical description is supported by experiments carried out and in conclusion are summarized the advantages and disadvantages of the approach.
- With the increasing values of vehicles are becoming increasingly frequent lack of infrastructure capacity that is used by vehicles. This phenomenon is most evident in urban transport infrastructure, where vehicles concentrations are highest. Typical examples are light-controlled intersections, which are often heavily loaded, which is reflected in the congested area in front of intersections. Solving of this problem is very difficult but very necessary, because the elimination of this undesirable phenomenon in traffic has resulted in reducing of economic losses by congestion, more efficient using of transport and last but not least improving the quality of life in the city. In the past has been shown that using linear programming methods can be designed signal plans, which can effectively control the intersections. But it was at intersections which are not congested. This paper deals the possibilities of designing of signal plans using linear programming in a situation where the intersections are congested. Congestion is reflected by the fact that is not ensured that all vehicles that came to the intersection in one cycle, it leaves during the same cycle. In the beginning of this article are described the possible ways of solving depending on the requirements of traffic flows, followed by a description of mathematical models which can solve this problem. The theoretical description is supported by experiments carried out and in conclusion are summarized the advantages and disadvantages of the approach. (en)
|
| Title
| - Possibilities of Control Congested Intersections Controlled by Traffic Lights
- Possibilities of Control Congested Intersections Controlled by Traffic Lights (en)
|
| skos:prefLabel
| - Possibilities of Control Congested Intersections Controlled by Traffic Lights
- Possibilities of Control Congested Intersections Controlled by Traffic Lights (en)
|
| skos:notation
| - RIV/61989100:27230/12:86083483!RIV13-MSM-27230___
|
| http://linked.open...avai/predkladatel
| |
| http://linked.open...avai/riv/aktivita
| |
| http://linked.open...avai/riv/aktivity
| |
| 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
| |
| http://linked.open...ai/riv/idVysledku
| - RIV/61989100:27230/12:86083483
|
| http://linked.open...riv/jazykVysledku
| |
| http://linked.open.../riv/klicovaSlova
| - intersection signal plan, traffic flows, congestions, linear programming (en)
|
| http://linked.open.../riv/klicoveSlovo
| |
| http://linked.open...ontrolniKodProRIV
| |
| http://linked.open...v/mistoKonaniAkce
| |
| http://linked.open...i/riv/mistoVydani
| |
| http://linked.open...i/riv/nazevZdroje
| - Proceedings of 30th International Conference Mathematical Methods in Economics : 11-13 September 2012, Karviná, Czech Republic
|
| http://linked.open...in/vavai/riv/obor
| |
| http://linked.open...ichTvurcuVysledku
| |
| http://linked.open...cetTvurcuVysledku
| |
| http://linked.open...UplatneniVysledku
| |
| http://linked.open...iv/tvurceVysledku
| |
| http://linked.open...vavai/riv/typAkce
| |
| http://linked.open.../riv/zahajeniAkce
| |
| number of pages
| |
| http://purl.org/ne...btex#hasPublisher
| - Slezská univerzita v Opavě
|
| https://schema.org/isbn
| |
| http://localhost/t...ganizacniJednotka
| |
| is http://linked.open...avai/riv/vysledek
of | |
![[RDF Data]](/fct/images/sw-rdf-blue.png)
![[cxml]](/fct/images/cxml_doc.png)
![[csv]](/fct/images/csv_doc.png)
![[text]](/fct/images/ntriples_doc.png)
![[turtle]](/fct/images/n3turtle_doc.png)
![[ld+json]](/fct/images/jsonld_doc.png)
![[rdf+json]](/fct/images/json_doc.png)
![[rdf+xml]](/fct/images/xml_doc.png)
![[atom+xml]](/fct/images/atom_doc.png)
![[html]](/fct/images/html_doc.png)