Exploring the impact of walk–bike infrastructure,safety perception,and built-environment on active transportation mode choice: a random parameter model using New York City commuter data

This study estimates a random parameter (mixed) logit model for active transportation (walk and bicycle) choices for work trips in the New York City (using 2010–2011 Regional Household Travel Survey Data). We explored the effects of traffic safety, walk–bike network facilities, and land use attributes on walk and bicycle mode choice decision in the New York City for home-to-work commute. Applying the flexible econometric structure of random parameter models, we capture the heterogeneity in the decision making process and simulate scenarios considering improvement in walk–bike infrastructure such as sidewalk width and length of bike lane. Our results indicate that increasing sidewalk width, total length of bike lane, and proportion of protected bike lane will increase the likelihood of more people taking active transportation mode This suggests that the local authorities and planning agencies to invest more on building and maintaining the infrastructure for pedestrians. Further, improvement in traffic safety by reducing traffic crashes involving pedestrians and bicyclists, will increase the likelihood of taking active transportation modes. Our results also show positive correlation between number of non-motorized trips by the other family members and the likelihood to choose active transportation mode. The model would be an essential tool to estimate the impact of improving traffic safety and walk–bike infrastructure which will assist in investment decision making.     

Developing green fleet management strategies: Repair/retrofit/replacement decisions under environmental regulation

The considerable cost of maintaining large fleets has generated interest in cost minimization strategies. With many related decisions, numerous constraints, and significant sources of uncertainty (e.g. vehicle breakdowns), fleet managers face complex dynamic optimization problems. Existing methodologies frequently make simplifying assumptions or fail to converge quickly for large problems. This paper presents an approximate dynamic programming approach for making vehicle purchase, resale, and retrofit decisions in a fleet setting with stochastic vehicle breakdowns. Value iteration is informed by dual variables from linear programs, as well as other bounds on vehicle shadow prices. Sample problems are based on a government fleet seeking to comply with emissions regulation. The model predicts the expected cost of compliance, the rules the fleet manager will use in deciding how to comply, and the regulation’s impact on the value of vehicles in the fleet. Stricter regulation lowers the value of some vehicle categories while raising the value of others. Such insights can help guide regulators, as well as the fleet managers they oversee. The methodologies developed could be applied more broadly to general multi-asset replacement problems, many of which have similar structures.     

Incorporating Driver Behaviors in Network Design Problems: Challenges and Opportunities

The goal of a network design problem (NDP) is to make optimal decisions to achieve a certain objective such as minimizing total travel time or maximizing tolls collected in the network. A critical component to NDP is how travelers make their route choices. Researchers in transportation have adopted human decision theories to describe more accurate route choice behaviors. In this paper, we review the NDP with various route choice models: the random utility model (RUM), random regret-minimization (RRM) model, bounded rationality (BR), cumulative prospect theory (CPT), the fuzzy logic model (FLM) and dynamic learning models. Moreover, we identify challenges in applying behavioral route choice models to NDP and opportunities for future research.     

A bi‐level programming approach — Optimal transit fare under line capacity constraints

The fare of a transit line is one of the important decision variables for transit network design. It has been advocated as an efficient means of coordinating the transit passenger flows and of alleviating congestion in the transit network. This paper shows how transit fare can be optimized so as to balance the passenger flow on the transit network and to reduce the overload delays of passengers at transit stops. A bi‐level programming method is developed to optimize the transit fare under line capacity constraints. The upper‐level problem seeks to minimize the total network travel time, while the lower‐level problem is a stochastic user equilibrium transit assignment model with line capacity constraints. A heuristic solution algorithm based on sensitivity analysis is proposed. Numerical example is used to illustrate the application of the proposed model and solution algorithm.     

A capacity restraint transit assignment with elastic line frequency

This paper proposes a new formulation for the capacity restraint transit assignment problem with elastic line frequency, in which the line frequency is related to the passenger flows on transit lines. A stochastic user equilibrium transit assignment model with congestion and elastic line frequency is proposed and the equivalent mathematical programming problem is also formulated. Since the passenger waiting time and the line capacity are dependent on the line frequency, a fixed point problem with respect to the line frequency is devised accordingly. The existence of the fixed point problem has been proved. A solution algorithm for the proposed model is presented. Finally, a numerical example is used to illustrate the application of the proposed model and solution algorithm.     

Assessment of the volume of fluid method for free-surface wave flow

This study was concerned with the free-surface wave flow around a surface-piercing foil. The volume of fluid method implemented in a Navier–Stokes computational fluid dynamics code was employed. Three widely used discretization schemes for the volume of fluid method were assessed for a test case that involved general ship waves, spilling breaking waves in front of the leading edge, and bubbly free surfaces in separated regions. A single computational approach was selected for the comparison, and a grid-dependence study was carried out. The computational results were validated against existing experimental data, showing good agreement. The validation results suggest that all three discretization schemes perform well, but the best and most efficient results were obtained using the high-resolution interface capturing scheme.     

Genetics of traffic assignment models for strategic transport planning

This paper presents a review and classification of traffic assignment models for strategic transport planning purposes by using concepts analogous to genetics in biology. Traffic assignment models share the same theoretical framework (DNA), but differ in capability (genes). We argue that all traffic assignment models can be described by three genes. The first gene determines the spatial capability (unrestricted, capacity restrained, capacity constrained, and capacity and storage constrained) described by four spatial assumptions (shape of the fundamental diagram, capacity constraints, storage constraints, and turn flow restrictions). The second gene determines the temporal capability (static, semi-dynamic, and dynamic) described by three temporal assumptions (wave speeds, vehicle propagation speeds, and residual traffic transfer). The third gene determines the behavioural capability (all-or-nothing, one shot, and equilibrium) described by two behavioural assumptions (decision-making and travel time consideration). This classification provides a deeper understanding of the often implicit assumptions made in traffic assignment models described in the literature. It further allows for comparing different models in terms of functionality, and paves the way for developing novel traffic assignment models.     

Estimation of origin‐destination matrices for a multimodal public transit network

This paper presents a procedure for the estimation of origin‐destination (O‐D) matrices for a multimodal public transit network. The system consists of a number of favored public transit modes that are obtained from a modal split process in a traditional four‐step transportation model. The demand of each favored mode is assigned to the multimodal network, which is comprised of a set of connected links of different public transit modes. An entropy maximization procedure is proposed to simultaneously estimate the O‐D demand matrices of all favored modes, which are consistent with target data sets such as the boarding counts and line segment flows that are observed directly in the network. A case study of the Hong Kong multimodal transit network is used to demonstrate the effectiveness of the proposed methodology.     

Static and Dynamic Instabilities of Bogie Railway Vehicles with Linkage Steered Wheelsets

The root loci of a type of bogie railway vehicle with linkage steered wheelsets are discussed and contrasted with those of conventional configurations. Approximate solutions of the equations of motion are used to derive stability criteria associated with the various modes of static and dynamic instability that are identified. The physical origin of each form of instability is discussed. It is shown that, in addition to the more common forms of dynamic instability arising from the joint action of creep, conicity and inertia, other forms of static and oscillatory instability are the result of structural asymmetry and wheelset articulation.