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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in: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
1. Verfasser: Florian, Michael
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.12.1977
Schlagworte:
Acceleration
Approximation algorithms
Communication switching
Convergence
Cost function
Linear approximation
Packet switching
Routing
Telecommunication traffic
Transportation
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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