Abstract.
Two properties of a dynamic network flow model based on a slow process of structural adjustment inspired by principles used in models utilising a priori information is analysed. Initially it is proved that each time period is characterised by monotonically non-increasing transportation costs among flows. Secondly, we analyse the recursive sequence of connected periods. This dynamic sequence is shown to converge to the linear programming solution connected with cost minimisation. Evidently those properties have to be taken into consideration when this class of network flow models is used in forecasting of future transport flows in the process of infrastructure planning.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: November 1996 / Accepted: November 1997
Rights and permissions
About this article
Cite this article
Persson, H., Westin, L. Recursive transport flow dynamics with time dependent a priori informationRecursive transport flow dynamics with time dependent a priori information. Ann Reg Sci 33, 25–32 (1999). https://doi.org/10.1007/s001680050090
Issue Date:
DOI: https://doi.org/10.1007/s001680050090