The combined distribution/assignment problemin transportation network planning: a parallel approach on hypercube architecture

Risultato della ricerca: Chapter

Abstract

The joint distribution/assignment problem plays a central role in urban transportnetwork planning. In this problem, according to the mathematical model proposed by S. P. Evans, the trips are iteratively calculated and assigned to the network in such a way that the resulting traffic flows pattern satisfies the selfish equilibrium condition.Unfortunately the number of variables and constraints increase hardly with the greatness of the networks causing long computational time for the equilibriumsolution. In this paper an nCUBE 2 parallel computing architecture is employed tosolve the combined problem and to asses the potential of MIMD machines to handle large scale transportation network problems.
Lingua originaleEnglish
Titolo della pubblicazione ospiteApplications of high performance computing in engineering IV
Pagine279-287
Numero di pagine9
Stato di pubblicazionePublished - 1995

Serie di pubblicazioni

NomeWIT TRANSACTIONS ON INFORMATION AND COMMUNICATION TECHNOLOGIES

Fingerprint Entra nei temi di ricerca di 'The combined distribution/assignment problemin transportation network planning: a parallel approach on hypercube architecture'. Insieme formano una fingerprint unica.

Cita questo