Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Tytuł pozycji:

Intellectual logistic system for passenger railway transportations in town

Tytuł:
Intellectual logistic system for passenger railway transportations in town
Autorzy:
Gavrilovs, P.
Ribickis, L.
Balckars, P.
Levchenkov, A.
Data publikacji:
2009
Słowa kluczowe:
purpose of value
algorithm of decision
Język:
angielski
Dostawca treści:
BazTech
Artykuł
  Przejdź do źródła  Link otwiera się w nowym oknie
For a passenger most comfortably, when a transport provides delivery "from a door to the door". On small distances this problem successfully decides through the use of motor transport. But growth of amount of cars resulted in supersaturating of motorways a transport and especially streets of cities. Corks appear, the rate of movement goes down as a result, muddiness of environment is increased. Development of network infrastructure of claotype transport is offered on the followings directions: - integration of claotype transport in the single system with other types of transport; - development of the system of city reports on a type a "streetcar - bus - trolleybus - train", which foresees the use of all of types of transport in a city environment. Use of conception a "streetcar - bus - trolleybus - train" is given by possibility to decide many problems of intercity transportations of the capital. Passing from the line of one system to the area other is accomplished in strictly certain clamp points on connecting ways; - improvement of terms of transplantation between the kinds of transport with the concordance of time-tables, by creation of the single stations - lining-out knots, will allow to reduce loading on knots and shorten moving of passengers, both at times and is, in "corks", in the clock of lances; For the decision of this task an algorithm which determines minimum time on the way between tops in simple with non-negative scales is examined. To such many types of counts are taken. If a count is not simple, he can be done such, casting aside all of loops and, replacing every great number of parallel ribs the shortest rib (by a rib with the least weight) from this great number; every undirected edge is replaced the pair of the directed edges. If a count is not self-weighted, it is possible to consider that all of ribs have one weight. The result of calculation are saved in the destination file of Short.out with the following structure: tops of way, time on the way.

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies