A simplicial decomposition method for the transit equilibrium assignment problem

A simplicial decomposition method for the transit equilibrium assignment problem

0.00 Avg rating0 Votes
Article ID: iaor19941094
Country: Switzerland
Volume: 44
Issue: 1/4
Start Page Number: 245
End Page Number: 260
Publication Date: Oct 1993
Journal: Annals of Operations Research
Authors: ,
Abstract:

A transit equilibrium assignment problem assigns the passenger flows on to a congested transit (public transportation) network with asymmetric cost functions and a fixed origin-destination matrix. This problem which may be formulated in the space of hyperpath flows, is transformed into an equivalent problem in the space of total arc flows and an auxiliary variable. A simplicial decomposition algorithm is developed and its convergence is proved under the usual assumptions on the cost functions. The algorithm requires relatively little memory and its efficiency is demonstrated with computational results.

Reviews

Required fields are marked *. Your email address will not be published.