IMPROVED LINEAR APPROXIMATION ALGORITHM FOR THE NETWORK EQUILIBRIUM (PACKET SWITCHING) PROBLEM

A method is presented 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 nontrivial adaptation of Wolfe's suggestion of an "away" step in the linear approximation method and a variant of this adaptation based on restriction.

• Supplemental Notes:
  • Proceedings of the 16th IEEE Conf Decis Control Incl Symp Adapt Processes and a Spec Symp on Fuzzy Set Theory and Appl, New Orleans, Louisiana, December 7-9, 1977.
• Corporate Authors:

  Institute of Electrical and Electronics Engineers (IEEE)

  3 Park Avenue, 17th Floor
  New York, NY  United States  10016-5997
• Authors:
  • Florian, M
• Conference:
  • Proceedings of the 16th IEEE Conf Decis Control Incl Symp Adapt Processes and a Spec Symp on Fuzzy Set Theory and Appl, New Orleans, Louisiana, December 7-9, 1977.
• Publication Date: 1977

Media Info

• Features: References;
• Pagination: p. 812-818

Subject/Index Terms

• TRT Terms: Linear programming; Mathematical models; Network analysis (Planning); Transportation planning
• Subject Areas: Data and Information Technology; Railroads;

Filing Info

• Accession Number: 00179068
• Record Type: Publication
• Source Agency: Engineering Index
• Report/Paper Numbers: n 77CH1269-OCS Conf Paper
• Files: TRIS
• Created Date: Jul 29 1978 12:00AM