Skip to main content

Projection Approach Versus Gradient Descent for Network’s Flows Assignment Problem

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 10556)

Abstract

The paper is devoted to comparison of two methodologically different types of mathematical techniques for coping with network’s flows assignment problem. Gradient descent and projection approach are implemented to the simple network of parallel routes (there are no common arcs for any pair of routes). Gradient descent demonstrates zig-zagging behavior in some cases, while projection algorithm converge quadratically in the same conditions. Methodological interpretation of such phenomena is given.

Keywords

  • Network’s flows assignment problem
  • Projection operator
  • Gradient descent

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-319-69404-7_29
  • Chapter length: 6 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   59.99
Price excludes VAT (USA)
  • ISBN: 978-3-319-69404-7
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   79.99
Price excludes VAT (USA)
Fig. 1.

References

  1. Dafermos, S.C., Sparrow, F.T.: The traffic assignment problem for a general network. J. Res. Nat. Bur. Stan. 73B, 91–118 (1969)

    CrossRef  MATH  MathSciNet  Google Scholar 

  2. Dafermos, S.-S.C.: Traffic assignment and resource allocation in transportation networks. PhD thesis. Johns Hopkins University, Baltimore, MD (1968)

    Google Scholar 

  3. Holloway, C.A.: An extension of the Frank and Wolfe method of feasible directions. Math. Program. 6, 14–27 (1973)

    CrossRef  MATH  MathSciNet  Google Scholar 

  4. Krylatov, A.Y.: Network flow assignment as a fixed point problem. J. Appl. Ind. Math. 10(2), 243–256 (2016)

    Google Scholar 

  5. Meyer, G.G.L.: Accelerated Frank-Wolfe algorithms. SIAM J. Control 12, 655–663 (1974)

    CrossRef  MATH  MathSciNet  Google Scholar 

  6. Patriksson, M.: The Traffic Assignment Problem: Models and Methods. Dover Publications, Inc., Mineola (2015)

    Google Scholar 

  7. Popov, I., Krylatov, A., Zakharov, V., Ivanov, D.: Competitive energy consumption under transmission constraints in a multi-supplier power grid system. Int. J. Syst. Sci. 48(5), 994–1001 (2017)

    CrossRef  MATH  MathSciNet  Google Scholar 

  8. Sheffi, Y.: Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods. Prentice-Hall, Inc., Englewood Cliffs (1985)

    Google Scholar 

Download references

Acknowledgement

The first author was jointly supported by a grant from the Russian Science Foundation (Project No. 17-71-10069).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alexander Yu. Krylatov .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Krylatov, A.Y., Shirokolobova, A.P. (2017). Projection Approach Versus Gradient Descent for Network’s Flows Assignment Problem. In: Battiti, R., Kvasov, D., Sergeyev, Y. (eds) Learning and Intelligent Optimization. LION 2017. Lecture Notes in Computer Science(), vol 10556. Springer, Cham. https://doi.org/10.1007/978-3-319-69404-7_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-69404-7_29

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-69403-0

  • Online ISBN: 978-3-319-69404-7

  • eBook Packages: Computer ScienceComputer Science (R0)