WIT Press


The Parallelization Level For Stochastic Assignment To The Transportation Network

Price

Free (open access)

Paper DOI

10.2495/HPC970321

Volume

18

Pages

9

Published

1997

Size

815 kb

Author(s)

Francesco Russo & Antonino Vitetta

Abstract

In this paper an analysis of parallel algorithm for transportation assignment model are developed. Algorithm for generating All or Nothing and Stochastic Network Loading are studied in relation to parallel process. A numerical application a multiprocessors computer for a real network is done. 1 Introduction In the planning of transportation systems, particular importance is attached to the study of the interaction between demand and supply, which is translated into the formulation of the assignment problem. Assignment models allow us to obtain link flows which are consistent with demand and supply models and with the link costs of the network. The level of demand that interacts with supply is formulated thr

Keywords