A Traffic Assignment Algorithm to Obtain Path Flow Information Based on Link Analysis

Abstract

This paper proposes a traffic assignment algorithm which can obtain exact path flow information efficiently. Based on Frank-Wolfe traffic assignment algorithm, that algorithm integrates shortest path analysis, traffic assignment calculation and network topology design, then analyzes link and path mix data based on link analysis method. The equilibrium assignment method based on FW algorithm runs based on links. With thorough analysis, the author denies the well-known idea, that path flow can not be obtained from link based analysis method. The algorithm is revised by taking out intermediate result from bottom calculation and designing an analyzing algorithm which uses mix data on paths and links. The main part of the revised algorithm still uses link-based analysis method, while path information in computing process is stored and revised synchronously. That algorithm takes the advantages of high calculation efficiency in link-based analyzing method, and also obtains path selection information and corresponding traffic flow data. So the research has practical value in application. Key word: traffic assignment, path flow, link analysis