NETWORK EQUILIBRIUM WITH COMBINED MODES: MODELS AND SOLUTION ALGORITHMS

R Garcia
A Marin

Document Type

Journal Article

Publication Date

2005

Subject Area

operations - traffic, infrastructure - interchange/transfer, planning - route design, ridership - mode choice, ridership - commuting, place - urban

Keywords

Variational inequalities (Mathematics), Urban transportation, Transfer points, Traffic assignment, Route selection, Route choice, Networks, Network equilibrium, Multimodal transportation, Multimodal systems, Mode choice, Modal choice, Mathematical models, Intracity transportation, Equilibrium (Systems), Choice of transportation, Algorithms

Abstract

In this study, a new model is proposed for the multi-modal assignment problem with combined modes (MAPCM) to be used in the context of urban transport management models. A variational inequality problem is presented to formulate the MAPCM. The model explicitly takes into account the choices of route, mode and transfer node in a nested choice structure. The model is then solved by the disaggregate simplicial decomposition algorithm. Illustrations of the model and of the numerical approach are reported on two test networks with asymmetric cost functions. The formulation and algorithm are shown to be useful for reoptimization, which is important in solving submodels in network design problems. The algorithm also has excellent possibilities for parallel computation implementation and is a computational tractable way of solving large-scale multi-modal assignment problems.

Comments

Transportation Research Part B Home Page: http://www.sciencedirect.com/science/journal/01912615

Link to Full Text

Share

COinS