An improved linear approximation algorithm for the network equilibrium (packet switching) problem

We present a method for accelerating the convergence of the algorithm based on the Frank and Wolfe linear approximation method for the convex cost multicommodity flow problem known as the "equilibrium traffic assignment problem" in transportation networks and as the "optimal routing o...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:1977 IEEE Conference on Decision and Control including the 16th Symposium on Adaptive Processes and A Special Symposium on Fuzzy Set Theory and Applications s. 812 - 818
Hlavní autor: Florian, Michael
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.12.1977
Témata:
Acceleration
Approximation algorithms
Communication switching
Convergence
Cost function
Linear approximation
Packet switching
Routing
Telecommunication traffic
Transportation
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We present a method for accelerating the convergence of the algorithm based on the Frank and Wolfe linear approximation method for the convex cost multicommodity flow problem known as the "equilibrium traffic assignment problem" in transportation networks and as the "optimal routing of packet switched messages" in communication networks. The acceleration of the convergence of this algorithm is achieved with a non trivial adaptation of Wolfe's suggestion of an "away" step in the linear approximation method and a variant of this adaptation based on restriction.
DOI:10.1109/CDC.1977.271681