In this paper, codes for the solution of two network equilibrium assignment problem formulations (Frank-Wolfe algorithm for the single-class user equilibrium problem and the diagonalization algorithm for multiple user classes with asymmetric interactions) are vectorized and tested on a CRAY X-MP/24 supercomputer. Only local vectorization by limited recoding of existing programs is performed. Guidelines are given for this purpose, and their application to the assignment codes is illustrated. The computational tests performed indicate an improvement in execution time of about 70 to 80 percent of the modified code relative to its unvectorized performance on the CRAY supercomputer. Execution of the vectorized code on the CRAY is about 22 times faster than the execution of the unmodified code on a mainframe computer. The significance of the results for research and practice is also discussed.
|Original language||English (US)|
|Number of pages||7|
|Journal||Transportation Research Record|
|State||Published - Jan 1 1989|
ASJC Scopus subject areas
- Civil and Structural Engineering
- Mechanical Engineering