Constructing personalized transportation networks in multi-state supernetworks: a heuristic approach.

International Journal of Geographical Information Science 01/2011; 25:1885-1903. DOI: 10.1080/13658816.2011.556119
Source: DBLP

ABSTRACT An integrated view encompassing the networks for public and private transport modes as well as the activity programs of travelers is essential for accessibility analysis. In earlier research, the multi-state supernetwork has been put forward by the authors as a suitable technique to model the system in such an integrated fashion. An essential part of a supernetwork involving multi-modal and multi-activity is the personalized transportation network, which is an under-researched topic in the academic community. This article attempts to develop a heuristic approach to construct personalized transportation networks for an individual's activity program. In this approach, the personalized network consists of two types of network extractions from the original transportation system: public transport network and private vehicle network. Three examples are presented to illustrate that the public transport network and private vehicle network can represent an individual's attributes and be applied in large-scale applications for analyzing the synchronization of land-use and transportation systems.

  • [Show abstract] [Hide abstract]
    ABSTRACT: Most travel behavior studies on route and mode choice focus only on an individual level. This paper adopts the concept of multi-state supernetworks to model the two-person joint travel problem (JTP). Travel is differentiated in terms of activity-vehicle-joint states, i.e. travel separately or jointly with which transport mode and with which activities conducted. In each state, route choice can be addressed given the state information and travel preference parameters. The joint travel pattern space is represented as a multi-state supernetwork, which is constructed by assigning the individual and joint networks to all possible states and connecting them via transfer links at joints where individuals can meet or depart. Besides route choice, the choices of where and when to meet, and which transport mode(s) to use can all be explicitly represented in a consistent fashion. A joint path through the supernetwork corresponds to a specific joint travel pattern. Then, JTP is reduced to an optimization problem to find the joint path with the minimum disutility. Three standard shortest path algorithm variants are proposed to find the optimal under different scenarios. The proposed framework further indicates the feasibility of multi-state supernetworks for addressing high dimensional problems and contributes to the design of a next generation of joint routing systems.
    Transportation 40(4). · 1.66 Impact Factor

Full-text (2 Sources)

Available from
Jun 11, 2014