Transportation network reduction

Publications

Share / Export Citation / Email / Print / Text size:

Transport Problems

Silesian University of Technology

Subject: Economics, Transportation, Transportation Science & Technology

GET ALERTS

eISSN: 2300-861X

DESCRIPTION

6
Reader(s)
24
Visit(s)
0
Comment(s)
0
Share(s)

SEARCH WITHIN CONTENT

FIND ARTICLE

Volume / Issue / page

Related articles

VOLUME 10 , ISSUE 2 (June 2015) > List of articles

Transportation network reduction

Stanislav PALÚCH / Štefan PEŠKO / Tomáš MAJER / Jan ČERNÝ

Keywords : network reduction, OD matrix, k-shortest paths

Citation Information : Transport Problems. Volume 10, Issue 2, Pages 69-74, DOI: https://doi.org/10.21307/tp-2015-021

License : (CC BY-SA 4.0)

Published Online: 21-April-2017

ARTICLE

ABSTRACT

Network reduction problem is formulated as follows: We are given a transportation network T, a set of important origin – destination relations R and a number q greater than 1. The goal is to find a subnetwork S of the given network T such that all shortest paths between all origin – destination pairs from R using only subnetwork S are not longer than q-multiple of the corresponding distance in original network T. A mathematical model and an exact algorithm of just mentioned task is presented.

Content not available PDF Share

FIGURES & TABLES

REFERENCES

EXTRA FILES

COMMENTS