A contribution to shortest path algorithms in transport networks with capacity limitations of edges
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21260%2F17%3A00319267" target="_blank" >RIV/68407700:21260/17:00319267 - isvavai.cz</a>
Result on the web
<a href="http://evlm.stuba.sk/APLIMAT/indexe.htm" target="_blank" >http://evlm.stuba.sk/APLIMAT/indexe.htm</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
A contribution to shortest path algorithms in transport networks with capacity limitations of edges
Original language description
The article presents modifications of two well-known pathfinding algorithms-Ford algorithm and Floyd algorithm. The presented modifications enable to find a shortest path which satisfies pre-defined capacity limitations-for example the limitations resulting from known measures and weight of a shipment we want to transport.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
20104 - Transport engineering
Result continuities
Project
—
Continuities
V - Vyzkumna aktivita podporovana z jinych verejnych zdroju
Others
Publication year
2017
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
16th Conference on Applied Mathematics
ISBN
9788022746502
ISSN
—
e-ISSN
—
Number of pages
10
Pages from-to
1494-1503
Publisher name
VYDAVATEĽSTVO SPEKTRUM STU
Place of publication
Bratislava
Event location
Bratislava
Event date
Jan 31, 2017
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—