Design and development of interactive trip planning for web-based transit information systems

This article presents a Web-based transit information system design that uses Internet Geographic Information Systems (GIS) technologies to integrate Web serving, GIS processing, network analysis and database management. A path finding algorithm for transit network is proposed to handle the special characteristics of transit networks, e.g., time-dependent services, common bus lines on the same street, and non-symmetric routing with respect to an origin/destination pair. The algorithm takes into account the overall level of services and service schedule on a route to determine the shortest path and transfer points. A framework is created to categorize the development of transit information systems on the basis of content and functionality, from simple static schedule display to more sophisticated real time transit information systems. A unique feature of the reported Web-based transit information system is the Internet-GIS based system with an interactive map interface. This enables the user to interact with information on transit routes, schedules, and trip itinerary planning. Some map rendering, querying, and network analysis functions are also provided.     

Counting the different efficient paths for transportation networks and its applications

This paper deals with an interesting problem about how to efficiently compute the number of different efficient paths between an origin‐destination pair for a transportation network because these efficient paths are the possible paths used by drivers to some extent. Based on a novel triangle operation derived, it first presents a polynomial‐time combinatorial algorithm that can obtain the number of different simple paths between any two nodes for an acyclic network as well as the total travel cost of these paths. This paper proceeds to develop a combinatorial algorithm with polynomial‐time complexity for both counting the different efficient paths between an origin‐destination pair and calculating the total travel cost of these paths. As for applications, this paper shows that the preceding two algorithms can yield the lower and upper bounds for the number of different simple paths between an origin‐destination pair, while it has already be recognized that a polynomial‐time algorithm getting such a number does not exist for a general network. Furthermore, the latter algorithm can be applied for developing a heuristic method for the traffic counting location problem arising from the origin‐destination matrix estimation problems.     

Large-scale transit itinerary planning under uncertainty

In this paper, we study the transit itinerary planning problem with incorporation of randomness that arises in transit vehicle arrival/departure and passenger transfer. We investigate two approaches to address the uncertainty: a minmax robust approach and an expectation-based probabilistic approach. We adapt a two-phase framework to mitigate computational challenges in large-scale planning problems. In phase I, we compute candidate route connections offline and store them into a database. Although expensive computation is required in phase I, it is typically performed only once over a period of time (e.g., half a year). Phase II takes place whenever a request is received, for which we query candidate route connections from the database, build a stochastic shortest-path model based on either approach listed above, and solve the model in real time. With phase I, computational requirement in phase II is substantially reduced so as to ensure real-time itinerary planning. To demonstrate the practical feasibility of our two-phase approach, we conduct extensive case studies and sensitivity analyses based on a large real-world transit network.     

Modelling public transport on‐board congestion: comparing schedule‐based and agent‐based assignment approaches and their implications

Transit systems are subject to congestion that influences system performance and level of service. The evaluation of measures to relieve congestion requires models that can capture their network effects and passengers' adaptation. In particular, on‐board congestion leads to an increase of crowding discomfort and denied boarding and a decrease in service reliability. This study performs a systematic comparison of alternative approaches to modelling on‐board congestion in transit networks. In particular, the congestion‐related functionalities of a schedule‐based model and an agent‐based transit assignment model are investigated, by comparing VISUM and BusMezzo, respectively. The theoretical background, modelling principles and implementation details of the alternative models are examined and demonstrated by testing various operational scenarios for an example network. The results suggest that differences in modelling passenger arrival process, choice‐set generation and route choice model yield systematically different passenger loads. The schedule‐based model is insensitive to a uniform increase in demand or decrease in capacity when caused by either vehicle capacity or service frequency reduction. In contrast, nominal travel times increase in the agent‐based model as demand increases or capacity decreases. The marginal increase in travel time increases as the network becomes more saturated. Whilst none of the existing models capture the full range of congestion effects and related behavioural responses, existing models can support different planning decisions. Copyright © 2016 John Wiley & Sons, Ltd.     

Flexible feeder transit route design to enhance service accessibility in urban area

To improve the accessibility of transit system in urban areas, this paper presents a flexible feeder transit routing model that can serve irregular‐shaped networks. By integrating the cost efficiency of fixed‐route transit system and the flexibility of demand responsive transit system, the proposed model is capable of letting operating feeder busses temporarily deviate from their current route so as to serve the reported demand locations. With an objective of minimizing total bus travel time, a new operational mode is then proposed to allow busses to serve passengers on both street sides. In addition, when multiple feeder busses are operating in the target service area, the proposed model can provide an optimal plan to locate the nearest one to response to the demands. A three‐stage solution algorithm is also developed to yield meta‐optimal solutions to the problem in a reasonable amount of time by transforming the problem into a traveling salesman problem. Numerical studies have demonstrated the effectiveness of the proposed model as well as the heuristic solution approach. Copyright © 2015 John Wiley & Sons, Ltd.     

An integrated measure of accessibility and reliability of mass transit systems

The growth of a city or a metropolis requires well-functioning transit systems to accommodate the ensuing increase in travel demand. As a result, mass transit networks have to develop and expand from simple to complex topological systems over time to meet this demand. Such an evolution in the networks’ structure entails not only a change in network accessibility, but also a change in the level of network reliability on the part of stations and the entire system as well. Network accessibility and reliability are popular measures that have been widely applied to evaluate the resilience and vulnerability of a spatially networked system. However, the use of a single measure, either accessibility or reliability, provides different results, which demand an integrated measure to evaluate the network’s performance comprehensively. In this paper, we propose a set of integrated measures, named ACCREL (Integrated Accessibility and Reliability indicators) that considers both metrics in combination to evaluate a network’s performance and vulnerability. We apply the new measures for hypothetical mass transit system topologies, and a case study of the metro transit system in Seoul follows, highlighting the dynamics of network performance with four evolutionary stages. The main contribution of this study lies in the results from the experiments, which can be used to inform how transport network planning can be prepared to enhance the network functionality, thereby achieving a well-balanced, accessible, and reliable system. Insights on network vulnerability are also drawn for public transportation planners and spatial decision makers.     

The effect of crowding on public transit user travel behavior in a large-scale public transportation system through modeling daily variations

In this paper, the crowding effect in a transit vehicle is modeled in a time-expanded network that considers the daily variation in passenger flows. The study models the daily variation of in-vehicle crowding in a real large-scale transit system. A transit assignment for this real network is modeled and implemented by constructing a crowding cost function that follows the valuation of crowding and by using the reliable shortest path finding method. The direct application of the crowding model to a real network for the Utah Transit Authority indicates that crowd modeling with multi-user classes could influence public transportation system planning and affect the revenues of transit agencies. Moreover, the addition of the disutility factor, crowding, does not always appear to cause an increase in disutility for transit users.     

Short range transit planning in Cairo

This paper describes an approach to short‐range planning that was developed to analyze and suggest improvements to the existing transit system serving metropolitan Cairo. The methodology is based on a corridor‐by‐corridor analysis which not only brings the scale of analysis down to a level which is necessary to address operational issues, but also results in a technology transfer strategy which allows the local planners to apply and test planning techniques in one corridor while more advanced techniques are developed for another. Procedures using the results of a system‐wide on‐board transit survey are developed to allocate the bus fleet to the existing bus network, identify new express services, and identify new direct services. Because the effectiveness of procedures used in short‐range transit planning depends on the existence of accurate data, and given the resources required for a large‐scale survey, the development of planning procedures based on a continuing monitoring program is also recommended. This paper concludes that although techniques using on‐board surveys are limited in their applicability, the corridor‐based approach to planning is sound.

     

Network equilibrium for congested multi‐mode networks with elastic demand

This paper proposes an elastic demand network equilibrium model for networks with transit and walking modes. In Hong Kong, the multi‐mode transit system services over 90% of the total journeys and the demand on it is continuously increasing. Transit and walking modes are related to each other as transit passengers have to walk to and from transit stops. In this paper, the multi‐mode elastic‐demand network equilibrium problem is formulated as a variational inequality problem where the combined mode and route choices are modeled in a hierarchical logit structures and the total travel demand for each origin‐destination pair is explicitly given by an elastic demand function. In addition, the capacity constraint for transit vehicles and the effects of bi‐directional flows on walkways are considered in the proposed model. All these congestion effects are taken into account for modeling the travel choices. A solution algorithm is developed to solve the multi‐mode elastic‐demand network equilibrium model. It is based on a Block Gauss‐Seidel decomposition approach coupled with the method of successive averages. A numerical example is used to illustrate the application of the proposed model and solution algorithm.     

Performance indicators for public transit connectivity in multi-modal transportation networks

Connectivity plays a crucial role as agencies at the federal and state level focus on expanding the public transit system to meet the demands of a multimodal transportation system. Transit agencies have a need to explore mechanisms to improve connectivity by improving transit service. This requires a systemic approach to develop measures that can prioritize the allocation of funding to locations that provide greater connectivity, or in some cases direct funding towards underperforming areas. The concept of connectivity is well documented in social network literature and to some extent, transportation engineering literature. However, connectivity measures have limited capability to analyze multi-modal public transportation systems which are much more complex in nature than highway networks.In this paper, we propose measures to determine connectivity from a graph theoretical approach for all levels of transit service coverage integrating routes, schedules, socio-economic, demographic and spatial activity patterns. The objective of using connectivity as an indicator is to quantify and evaluate transit service in terms of prioritizing transit locations for funding; providing service delivery strategies, especially for areas with large multi-jurisdictional, multi-modal transit networks; providing an indicator of multi-level transit capacity for planning purposes; assessing the effectiveness and efficiency for node/stop prioritization; and making a user friendly tool to determine locations with highest connectivity while choosing transit as a mode of travel. An example problem shows how the graph theoretical approach can be used as a tool to incorporate transit specific variables in the indicator formulations and compares the advantage of the proposed approach compared to its previous counterparts. Then the proposed framework is applied to the comprehensive transit network in the Washington–Baltimore region. The proposed analysis offers reliable indicators that can be used as tools for determining the transit connectivity of a multimodal transportation network.     

Characterizing metro networks: state,form, and structure

The broad goal of this paper is to characterize the network feature of metro systems. By looking at 33 metro systems in the world, we adapt various concepts of graph theory to describe characteristics of State, Form and Structure; these three characteristics are defined using new or existing network indicators. State measures the complexity of a network; we identify three phases in the development of transit networks, with mature systems being 66% completely connected. Form investigates the link between metro systems and the built environment, distinguishing networks oriented towards regional accessibility, local coverage or regional coverage. Structure examines the intrinsic properties of current networks; indicators of connectivity and directness are formulated. The method presented is this paper should be taken as a supplement to traditional planning factors such as demand, demography, geography, costs, etc. It is particularly useful at the strategic planning phase as it offers information on current and planned systems, which can then be used towards setting a vision, defining new targets and making decision between various scenarios; it can also be used to compare existing systems. We also link the three characteristics to transit line type and land-use; overall the presence of tangential and/or (semi)-circumferential lines may be key. In addition, we have been able to identify paths of development, which should be strongly considered in future projects.     

Multimodal traveling and its impact on urban transit network design

Multimodal trip making, that is trips using a combination of several modes between origin and destination, is expected to be beneficial to society and might offer advantages to the traveler as well. This article looks at some of the implications of multi‐modality in trip making for the design of urban transit systems since these play an important role in multi‐modal transportation systems. In this respect, the article looks at the strategic design characteristics of urban transit networks, that is line density, stop density and service frequencies for the case of multimodal access to urban transit networks and for hierarchical network structures in urban transit systems. The analyses show that multimodal access does not require alternative network structures. For hierarchical network structures it is concluded that these are primarily determined by the hierarchy in demand densities and thus by hierarchy in urban structures.     

Long-term planning for ring-radial urban rail transit networks

Extensive work exists on regular rail network planning. However, few studies exist on the planning and design of ring-radial rail transit systems. With more ring transit lines being planned and built in Asia, Europe and the America's, a detailed study on ring transit lines is timely. An analytical model to find the optimal number of radial lines in a city for any demand distribution is first introduced. Secondly, passenger route choice for different rail networks is analyzed, for a many-to-many Origin-Destination (OD) demand distribution, based on a total travel time cost per passenger basis. The routes considered are: (1) radial lines only; (2) ring line only or radial lines and ring line combined; or (3) direct access to a destination without using the rail system. Mathematica and Matlab are used to code the route choice model. A cost-benefit optimization model to identify the feasibility and optimality of a ring line is proposed. Unlike simulations and agent-based models, this model is shown to be easily transferable to many ring-radial transit networks. The City of Calgary is used as an example to illustrate the applicability of each model. The existing urban rail network and trip distribution are major influencing factors in judging the feasibility and optimal location of the ring line. This study shows the potential net benefit of introducing a ring line by assessing changes in passengers’ costs. The changes in passenger cost parameters, such as ride cost and access cost, are shown to greatly influence the feasibility of a ring line.     

Transit-network design methodology for actual-size road networks

The main purpose of this study is to design a transit network of routes for handling actual-size road networks. This transit-network design problem is known to be complex and cumbersome. Thus, a heuristic methodology is proposed, taking into account the major concerns of transit authorities such as budget constraints, level-of-service standards and the attractiveness of the transit routes. In addition, this approach considers other important aspects of the problem including categorization of stops, multiclass of transit vehicles, hierarchy planning, system capacity (which has been largely ignored in past studies) and the integration between route-design and frequency-setting analyses. The process developed starts with the construction of a set of potential stops using a clustering concept. Then, by the use of Newton gravity theory and a special shortest-path procedure, a set of candidate routes is formed, categorized by hierarchy (mass, feeder, local routes). In the last step of the process a metaheuristic search engine is launched over the candidate routes, incorporating budgetary constraints, until a good solution is found. The algorithm was tested on the actual-size transit network of the city of Winnipeg; the results show that under the same conditions (budget and constraints) the proposed set of routes resulted in a reduction of 14% of total travel time compared to the existing transit network. In addition the methodology developed is compared favorably with other studies using the transit network of Mandl benchmark. The generality of the methodology was tested on the recent real dataset (pertaining to the year 2010) of the larger city of Chicago, in which a more efficient and optimized scheme was proposed for the existing rail system.     

Walking infrastructure design assessment by continuous space dynamic assignment modeling

For the planning and design of walking infrastructure, characterized by the fact that the pedestrians can choose their paths freely in two‐dimensional space, applicability of traditional discrete network models is limited. This contribution puts forward an approach for user‐optimal dynamic assignment in continuous time and space for analyzing for instance walking infrastructure in a two‐dimensional space. Contrary to network‐based approaches, the theory allows the traffic units to choose from an infinite non‐countable set of paths through the considered space. The approach first determines the continuous paths using a path choice model. Then, origin‐destination flows are assigned and traffic conditions are calculated. The approach to determine a user‐optimal assignment is heuristic and consists of a sequence of all‐or‐nothing assignments. An application example is presented, showing dynamic user equilibrium traffic flows through a realistic transfer station. The example is aimed at illustrating the dynamic aspects of the modeling approach, such as anticipation on expected flow conditions, and predicted behavior upon catching or missing a connection.     

Validation of a schedule‐based capacity restraint transit assignment model for a large‐scale network

This paper describes the application of a capacity restraint trip assignment algorithm to a real, large‐scale transit network and the validation of the results. Unlike the conventional frequency‐based approach, the network formulation of the proposed model is dynamic and schedule‐based. Transit vehicles are assumed to operate to a set of pre‐determined schedules. Passengers are assumed to select paths based on a generalized cost function including in‐vehicle and out‐of‐vehicle time and line change penalty. The time‐varying passenger demand is loaded onto the network by a time increment simulation method, which ensures that the capacity restraint of each vehicle during passenger boarding is strictly observed. The optimal‐path and path‐loading algorithms are applied iteratively by the method of successive averages until the network converges to the predictive dynamic user equilibrium. The Hong Kong Mass Transit Railway network is used to validate the model results. The potential applications of the model are also discussed.     

Pick‐up locations and bus allocation for transit‐based evacuation planning with demand uncertainty

This paper develops a decision‐support model for transit‐based evacuation planning under demand uncertainty. Demand uncertainty refers to the uncertainty associated with the number of transit‐dependent evacuees. A robust optimization model is proposed to determine the optimal pick‐up points for evacuees to assemble, and allocate available buses to transport the assembled evacuees between the pick‐up locations and different public shelters. The model is formulated as a mixed‐integer linear program and is solved via a cutting plane scheme. The numerical example based on the Sioux Falls network demonstrates that the robust plan yields lower total evacuation time and is reliable in serving the realized evacuee demand. Copyright © 2012 John Wiley & Sons, Ltd.     

Efficient solution algorithm for finding spatially dependent reliable shortest path in road networks

Travel times are generally stochastic and spatially correlated in congested road networks. However, very few existing route guidance systems (RGS) can provide reliable guidance services to aid travellers planning their trips with taking account explicitly travel time reliability constraint. This study aims to develop such a RGS with particular consideration of travellers' concern on travel time reliability in congested road networks with uncertainty. In this study, the spatially dependent reliable shortest path problem (SD‐RSPP) is formulated as a multi‐criteria shortest path‐finding problem in road networks with correlated link travel times. Three effective dominance conditions are established for links with different levels of travel time correlations. An efficient algorithm is proposed to solve SD‐RSPP by adaptively using three established dominance conditions. The complexities of road networks in reality are also explicitly considered. To demonstrate the applicability of proposed algorithm, a comprehensive case study is carried out in Hong Kong. The results of case study show that the proposed solution algorithm is robust to take account of travellers' multiple routing criteria. Computational results demonstrate that the proposed solution algorithm can determine the reliable shortest path on real‐time basis for large‐scale road networks. Copyright © 2016 John Wiley & Sons, Ltd.     

A computer model for finding the time-dependent minimum path in a transit system with fixed schedules

This paper describes the development of a computer model and algorithms for finding the time-dependent minimum path between two stations in a multi-route, multi-mode transit system running to fixed schedules. Selection of the minimum path can be based either on journey time or on weighted time. A worked example using a simple transit network is given to illustrate how the model works. The model has several applications in transport planning: it can be used for generating route schedule information to guide transit users, for assisting in route schedule coordination, and for analyzing transit system accessibility.     

Solving the Median Shortest Path Problem in the Planning and Design of Urban Transportation Networks Using a Vector Labeling Algorithm

This paper proposes an alternative algorithm to solve the median shortest path problem (MSPP) in the planning and design of urban transportation networks. The proposed vector labeling algorithm is based on the labeling of each node in terms of a multiple and conflicting vector of objectives which deletes cyclic, infeasible and extreme-dominated paths in the criteria space imposing cyclic break (CB), path cost constraint (PCC) and access cost parameter (ACP) respectively. The output of the algorithm is a set of Pareto optimal paths (POP) with an objective vector from predetermined origin to destination nodes. Thus, this paper formulates an algorithm to identify a non-inferior solution set of POP based on a non-dominated set of objective vectors that leaves the ultimate decision to decision-makers. A numerical experiment is conducted using an artificial transportation network in order to validate and compare results. Sensitivity analysis has shown that the proposed algorithm is more efficient and advantageous over existing solutions in terms of computing execution time and memory space used.