Supernetwork Approach for Multimodal and Multiactivity Travel Planning

Abstract

Multimodal and multiactivity travel planning is a practical but thorny problem in transportation research. This paper develops an improved supernetwork model to address this problem. The supernetwork is constructed mainly in three steps: a personalized network is first split into two types of networks with all links mode-specified; these are then assigned to all possible activity-vehicle states by means of state spreading from the beginning activity state. Finally, these discrete networks are connected into a supernetwork by state-labeled transition links. The proposed supernetwork is easier to construct than previous proposals and reduces the size needed to embody all combinations of choice facets explicitly. It can be proved for any activity program that any tour is a feasible solution in this representation. Consequently, every transport and transition link can be defined mode and activity-state dependent; thus standard shortest path algorithms can be used to find the most desirable tour. A case study is presented to show that the supernetwork model can be applied in a real-time manner for practical travel planning.

Get full access to this article

View all access options for this article.

References

Fiorenzo-Catalano

Choice Set Generation in Multi-Modal Transportation Networks. PhD dissertation. Delft University Press, Delft, Netherlands, 2007.

Sheffi

Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods. Prentice Hall, New Jersey, 1985.

van Nes

Design of Multimodal Transport Networks: A Hierarchical Approach. PhD dissertation. Delft University Press, Delft, Netherlands, 2002.

Carlier

, Fiorenzo-Catalano

, Lindveld

, and Bovy

A Supernetwork Approach Towards Multimodal Travel Modeling. Presented at 82nd Annual Meeting of the Transportation Research Board, Washington, D.C., 2002.

Nagurney

, and Smith

Supernetworks: Paradoxes, Challenges and New Opportunities. Proc. 1st International Conference on the Economic and Social Implications of Information Technology, Washington, D.C., 2003, pp. 229–254.

Nagurney

, Dong

, and Moktharian

P. L.

Teleshopping Versus Shopping: A Multi-Criteria Equilibrium Framework.

Mathematical and Computer Modeling, Vol. 34, 2001, pp. 738–798.

Nagurney

, Dong

, and Moktharian

P. L.

Multicriteria Network Equilibrium Modeling with Variable Weights for Decision Making in the Information Age with Application to Tele-Communicating and Teleshopping.

Journal of Economic Dynamics and Control, Vol. 26, 2002, pp. 1629–1650.

Arentze

T. A.

, and Timmermans

H. J. P.

A Multi-State Supernetwork Approach to Modeling Multi-Activity, Multi-Modal Trip Chains.

International Journal of Geographical Information Science, Vol. 18, 2004, pp. 631–651.

Arentze

, and Timmermans

H. J. P.

Robust Approach to Modeling Choice of Locations in Daily Activity Sequences. In Transportation Research Record: Journal of the Transportation Research Board, No. 2003, Transportation Research Board of the National Academies, Washington, D.C., 2007, pp. 59–63.

10.

Ahuja

, Magnanti

, and Orlin

Network Flows: Theory, Algorithms, and Applications. Prentice Hall, New Jersey, 1993.

11.

Dean

Algorithms for Minimum-Cost Paths in Time-Dependent Networks with Waiting Policies.

Networks, Vol. 44, No. 1, 2004, pp. 41–46.

12.

Luo

, and Han

Study on Non-FIFO Arc in Time-Dependent Networks.

Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing-Copyright, IEEE Computer Society Press, Vol. 2, Washington, D.C., 2007, pp. 305–310.