A FULL ANALYTICAL IMPLEMENTATION OF THE PARTAN/FRANK-WOLFE ALGORITHM FOR EQUILIBRIUM ASSIGNMENT

The Frank-Wolfe algorithm is the most commonly used algorithm to solve the traffic assignment problem. PARTAN (short for parallel tangent) is a variation on Frank-Wolfe that tries to speed up the convergence by introducing an extra line search in the algorithm. This paper shows that an essential step in the PARTAN variant of the Frank-Wolfe algorithm for equilibrium assignment, the calculation of a minimal step length for maintaining feasibility, can be accomplished using either analytical formulas or simple rules.

• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/oclc/1767714
• Corporate Authors:

  Operations Research Society of America

  Mount Royal and Guilford Avenue
  Baltimore, MD  United States  21202
• Authors:
  • AREZKI, Y
  • Van Vliet, D
• Publication Date: 1990-2

Media Info

• Features: Appendices; Figures; References;
• Pagination: p. 58-62
• Serial:
  • Transportation Science
  • Volume: 24
  • Issue Number: 1
  • Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
  • ISSN: 0041-1655
  • Serial URL: http://transci.journal.informs.org/

Subject/Index Terms

• TRT Terms: Algorithms; Equilibrium (Systems); Traffic assignment; Traffic equilibrium
• Subject Areas: Highways; Planning and Forecasting; I72: Traffic and Transport Planning;

Filing Info

• Accession Number: 00491742
• Record Type: Publication
• Files: TRIS, ATRI
• Created Date: Mar 31 1990 12:00AM