Skip to main content
SpringerLink
Log in

Problems of Minimizing Transportation Time in Networks with Variable Flow Intensity

  • SYSTEMS ANALYSIS AND OPERATIONS RESEARCH
  • Published:
Journal of Computer and Systems Sciences International Aims and scope

Abstract

The formulations of problems of analysis and synthesis in multipolar communication networks with variable flow rates on the arcs of the network are considered. In contrast to traditional formulations, the concepts of flow density, flow rate, and flow intensity are introduced, and the temporal characteristics of the movement of the given volumes through the network are analyzed. Similar problems arise in various spheres of human activity, for example, when studying traffic flows in models of evacuation of large cities or in problems of planning and managing transportation in problems of urban logistics. Mathematical formulations and algorithms for solving problems of transportation in a multipole network with variable flow rates are presented, which, under certain conditions, make it possible to avoid solving complex nonlinear problems of mathematical programming of large dimensions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1.
Fig. 2.

Similar content being viewed by others

REFERENCES

  1. E. G. Davydov, Games, Graphs, Resources (Radio Svyaz’, Moscow, 1981) [in Russian].

    MATH  Google Scholar 

  2. A. A. Mironov and V. I. Tsurkov, “Network models with fixed parameters on communication nodes. I,” Izv. Ross. Akad. Nauk, Tekh. Kibern., No. 4 (1993).

  3. A. A. Mironov and V. I. Tsurkov, “Network models with fixed parameters on communication nodes. II,” Izv. Ross. Akad. Nauk, Tekh. Kibern., No. 6 (1993).

  4. A. A. Mironov and V. I. Tsurkov, “Transportation problems with a minimax criterion,” Dokl. Akad. Nauk 346, 168–171 (1996).

    MathSciNet  MATH  Google Scholar 

  5. A. A. Mironov and V. I. Tsurkov, “Hereditarily minimax matrices in models of transportation type,” J. Comput. Syst. Sci. Int. 37, 927 (1998).

    MATH  Google Scholar 

  6. A. A. Mironov and V. I. Tsurkov, “Minimax under nonlinear transportation constraints,” Dokl. Math. 64, 351 (2001).

    MATH  Google Scholar 

  7. A. A. Mironov and V. I. Tsurkov, “Open transportation models with a minimax criterion,” Dokl. Math. 64, 374 (2001).

    MATH  Google Scholar 

  8. A. A. Mironov, V. V. Fedorchuk, and V. I. Tsurkov, “Minimax in transportation models with integral constraints: II,” J. Comput. Syst. Sci. Int. 44, 732 (2005).

    MATH  Google Scholar 

  9. F. Haight, Mathematical Theories of Traffic Flow (Academic, New York, 1963).

    MATH  Google Scholar 

  10. O. A. Kosorukov, Network. Risks. Resources (Kazan. Gos. Univ., Kazan, 2006) [in Russian].

    Google Scholar 

  11. O. A. Kosorukov, “Optimization problems of transportation in communication networks with variable capacities,” J. Comput. Syst. Sci. Int. 55, 1010 (2016).

    Article  MathSciNet  Google Scholar 

  12. L. R. Ford, Jr. and D. R. Fulkerson, Flows in Networks (Princeton Univ. Press, NJ, 1962).

    Book  Google Scholar 

  13. H. Frank and I. T. Frisch, Communication, Transmission, and Transportation Networks (Addision-Wesley, Reading, MA, 1971).

    MATH  Google Scholar 

  14. P. Jensen and W. J. Barnes, Network Flow Programming (Wiley, New York, 1980).

    MATH  Google Scholar 

  15. H. A. Taha, Operations Research: An Introduction, 10th ed. (Pearson Education, New York, 2017).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National Research University Higher School of Economics, Moscow State University, Moscow, Russia

    O. A. Kosorukov

  2. Federal Research Center “Informatics and Control,” Russian Academy of Sciences, Moscow, Russia

    V. I. Tsurkov

Authors
  1. O. A. Kosorukov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. I. Tsurkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to O. A. Kosorukov or V. I. Tsurkov.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kosorukov, O.A., Tsurkov, V.I. Problems of Minimizing Transportation Time in Networks with Variable Flow Intensity. J. Comput. Syst. Sci. Int. 60, 409–421 (2021). https://doi.org/10.1134/S1064230721030084

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1064230721030084

Search

Navigation